0.00/0.38	YES
0.00/0.38	property Termination
0.00/0.38	has value True
0.00/0.38	for SRS ( [a, a, a, b] -> [a, b, b, b], [a, a, b, b] -> [a, b, b, a], [a, b, a, b] -> [a, a, b, a])
0.00/0.38	reason
0.00/0.38	  remap for 3 rules
0.00/0.38	   property Termination
0.00/0.38	has value True
0.00/0.39	for SRS ( [0, 0, 0, 1] -> [0, 1, 1, 1], [0, 0, 1, 1] -> [0, 1, 1, 0], [0, 1, 0, 1] -> [0, 0, 1, 0])
0.00/0.39	reason
0.00/0.39	  DP transform
0.00/0.39	   property Termination
0.00/0.39	has value True
0.00/0.39	for SRS ( [0, 0, 0, 1] ->= [0, 1, 1, 1], [0, 0, 1, 1] ->= [0, 1, 1, 0], [0, 1, 0, 1] ->= [0, 0, 1, 0], [0#, 0, 0, 1] |-> [0#, 1, 1, 1], [0#, 0, 1, 1] |-> [0#, 1, 1, 0], [0#, 0, 1, 1] |-> [0#], [0#, 1, 0, 1] |-> [0#, 0, 1, 0], [0#, 1, 0, 1] |-> [0#, 1, 0], [0#, 1, 0, 1] |-> [0#])
0.00/0.39	reason
0.00/0.39	  remap for 9 rules
0.00/0.39	   property Termination
0.00/0.39	has value True
0.00/0.39	for SRS ( [0, 0, 0, 1] ->= [0, 1, 1, 1], [0, 0, 1, 1] ->= [0, 1, 1, 0], [0, 1, 0, 1] ->= [0, 0, 1, 0], [2, 0, 0, 1] |-> [2, 1, 1, 1], [2, 0, 1, 1] |-> [2, 1, 1, 0], [2, 0, 1, 1] |-> [2], [2, 1, 0, 1] |-> [2, 0, 1, 0], [2, 1, 0, 1] |-> [2, 1, 0], [2, 1, 0, 1] |-> [2])
0.00/0.39	reason
0.00/0.39	  weights
0.00/0.39	    Map [(0, 1/7), (1, 1/7)]
0.00/0.39	  
0.00/0.39	   property Termination
0.00/0.39	has value True
0.00/0.39	for SRS ( [0, 0, 0, 1] ->= [0, 1, 1, 1], [0, 0, 1, 1] ->= [0, 1, 1, 0], [0, 1, 0, 1] ->= [0, 0, 1, 0], [2, 0, 0, 1] |-> [2, 1, 1, 1], [2, 0, 1, 1] |-> [2, 1, 1, 0], [2, 1, 0, 1] |-> [2, 0, 1, 0])
0.00/0.39	reason
0.00/0.39	  EDG has 1 SCCs
0.00/0.39	   property Termination
0.00/0.39	has value True
0.00/0.39	for SRS ( [2, 1, 0, 1] |-> [2, 0, 1, 0], [0, 0, 0, 1] ->= [0, 1, 1, 1], [0, 0, 1, 1] ->= [0, 1, 1, 0], [0, 1, 0, 1] ->= [0, 0, 1, 0])
0.00/0.39	reason
0.00/0.39	  Matrix   { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True}
0.00/0.39	    interpretation
0.00/0.39	      0  / 4A 6A \
0.00/0.39	         \ 4A 6A /
0.00/0.39	      1  / 6A 8A \
0.00/0.39	         \ 4A 6A /
0.00/0.39	      2  / 2A 2A \
0.00/0.39	         \ 2A 2A /
0.00/0.39	    [2, 1, 0, 1] |-> [2, 0, 1, 0]
0.00/0.39	     lhs            rhs            ge     gt
0.00/0.39	        / 20A 22A \    / 18A 20A \   True   True
0.00/0.39	        \ 20A 22A /    \ 18A 20A /        
0.00/0.39	    [0, 0, 0, 1] ->= [0, 1, 1, 1]
0.00/0.39	     lhs            rhs            ge     gt
0.00/0.39	        / 22A 24A \    / 22A 24A \   True   False
0.00/0.39	        \ 22A 24A /    \ 22A 24A /        
0.00/0.39	    [0, 0, 1, 1] ->= [0, 1, 1, 0]
0.00/0.39	     lhs            rhs            ge     gt
0.00/0.39	        / 22A 24A \    / 22A 24A \   True   False
0.00/0.39	        \ 22A 24A /    \ 22A 24A /        
0.00/0.39	    [0, 1, 0, 1] ->= [0, 0, 1, 0]
0.00/0.39	     lhs            rhs            ge     gt
0.00/0.39	        / 22A 24A \    / 22A 24A \   True   False
0.00/0.39	        \ 22A 24A /    \ 22A 24A /        
0.00/0.39	   property Termination
0.00/0.39	has value True
0.00/0.39	for SRS ( [0, 0, 0, 1] ->= [0, 1, 1, 1], [0, 0, 1, 1] ->= [0, 1, 1, 0], [0, 1, 0, 1] ->= [0, 0, 1, 0])
0.00/0.39	reason
0.00/0.39	  EDG has 0 SCCs
0.00/0.39	
0.00/0.39	**************************************************
0.00/0.39	          summary
0.00/0.39	**************************************************
0.00/0.39	SRS with 3 rules on 2 letters       Remap   { tracing = False}
0.00/0.39	SRS with 3 rules on 2 letters       DP transform
0.00/0.39	SRS with 9 rules on 3 letters       Remap   { tracing = False}
0.00/0.39	SRS with 9 rules on 3 letters       weights
0.00/0.39	SRS with 6 rules on 3 letters       EDG
0.00/0.39	SRS with 4 rules on 3 letters       Matrix   { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True}
0.00/0.39	SRS with 3 rules on 2 letters       EDG
0.00/0.39	
0.00/0.39	**************************************************
0.00/0.39	(3, 2)\Deepee(9, 3)\Weight(6, 3)\EDG(4, 3)\Matrix{\Arctic}{2}(3, 2)\EDG[]
0.00/0.39	**************************************************
0.00/0.51	let { done = Worker No_Strict_Rules;mo = Pre (Or_Else Count (IfSizeLeq 10000 GLPK Fail));wop = Or_Else (Worker (Weight { modus = mo})) Pass;weighted = \ m -> And_Then m wop;tiling = \ m w -> weighted (And_Then (Worker (Tiling { method = m,width = w})) (Worker Remap));when_small = \ m -> And_Then (Worker (SizeAtmost 100)) m;when_medium = \ m -> And_Then (Worker (SizeAtmost 10000)) m;solver = Minisatapi;qpi = \ dim bits -> weighted (when_small (Worker (QPI { tracing = True,dim = dim,bits = bits,solver = solver})));matrix = \ dom dim bits -> weighted (when_small (Worker (Matrix { monotone = Weak,domain = dom,dim = dim,bits = bits,tracing = False,solver = solver})));kbo = \ b -> weighted (when_small (Worker (KBO { bits = b,solver = solver})));mb = Worker (Matchbound { method = RFC,max_size = 100000});remove = First_Of ([ Worker (Weight { modus = mo})] <> ([ Seq [ qpi 2 4, qpi 3 4, qpi 4 4], Seq [ qpi 5 4, qpi 6 3, qpi 7 3]] <> ([ matrix Arctic 4 3, matrix Natural 4 3] <> [ kbo 1, And_Then (Worker Mirror) (kbo 1)])));remove_tile = Seq [ remove, tiling Overlap 3];dp = As_Transformer (Apply (And_Then (Worker (DP { tracing = False})) (Worker Remap)) (Apply wop (Branch (Worker (EDG { tracing = False})) remove_tile)));noh = [ Timeout 10 (Worker (Enumerate { closure = Forward})), Timeout 10 (Worker (Enumerate { closure = Backward}))];yeah = Tree_Search_Preemptive 0 done [ Worker (Weight { modus = mo}), mb, And_Then (Worker Mirror) mb, dp, And_Then (Worker Mirror) dp]}
0.00/0.51	in Apply (Worker Remap) (First_Of ([ yeah] <> noh))
0.00/0.53	EOF