0.00/0.39	YES
0.00/0.39	property Termination
0.00/0.39	has value True
0.00/0.39	for SRS ( [a, a, b] -> [c], [a, c] -> [b, c, a, a], [b, c] -> [])
0.00/0.39	reason
0.00/0.39	  remap for 3 rules
0.00/0.39	   property Termination
0.00/0.39	has value True
0.00/0.39	for SRS ( [0, 0, 1] -> [2], [0, 2] -> [1, 2, 0, 0], [1, 2] -> [])
0.00/0.39	reason
0.00/0.39	  reverse each lhs and rhs
0.00/0.39	   property Termination
0.00/0.39	has value True
0.00/0.39	for SRS ( [1, 0, 0] -> [2], [2, 0] -> [0, 0, 2, 1], [2, 1] -> [])
0.00/0.39	reason
0.00/0.39	  DP transform
0.00/0.39	   property Termination
0.00/0.40	has value True
0.00/0.41	for SRS ( [1, 0, 0] ->= [2], [2, 0] ->= [0, 0, 2, 1], [2, 1] ->= [], [1#, 0, 0] |-> [2#], [2#, 0] |-> [2#, 1], [2#, 0] |-> [1#])
0.00/0.41	reason
0.00/0.41	  remap for 6 rules
0.00/0.41	   property Termination
0.00/0.41	has value True
0.00/0.41	for SRS ( [0, 1, 1] ->= [2], [2, 1] ->= [1, 1, 2, 0], [2, 0] ->= [], [3, 1, 1] |-> [4], [4, 1] |-> [4, 0], [4, 1] |-> [3])
0.00/0.41	reason
0.00/0.41	  EDG has 1 SCCs
0.00/0.41	   property Termination
0.00/0.41	has value True
0.00/0.41	for SRS ( [3, 1, 1] |-> [4], [4, 1] |-> [3], [4, 1] |-> [4, 0], [0, 1, 1] ->= [2], [2, 1] ->= [1, 1, 2, 0], [2, 0] ->= [])
0.00/0.41	reason
0.00/0.41	  Matrix   { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True}
0.00/0.41	    interpretation
0.00/0.41	      0  / 0A  0A  \
0.00/0.41	         \ -2A -2A /
0.00/0.41	      1  / 2A 2A \
0.00/0.41	         \ 2A 2A /
0.00/0.41	      2  / 0A 2A \
0.00/0.41	         \ 0A 2A /
0.00/0.41	      3  / 4A 4A \
0.00/0.41	         \ 4A 4A /
0.00/0.41	      4  / 3A 3A \
0.00/0.41	         \ 3A 3A /
0.00/0.41	    [3, 1, 1] |-> [4]
0.00/0.41	     lhs          rhs          ge     gt
0.00/0.41	        / 8A 8A \    / 3A 3A \   True   True
0.00/0.41	        \ 8A 8A /    \ 3A 3A /        
0.00/0.41	    [4, 1] |-> [3]
0.00/0.41	     lhs          rhs          ge     gt
0.00/0.41	        / 5A 5A \    / 4A 4A \   True   True
0.00/0.41	        \ 5A 5A /    \ 4A 4A /        
0.00/0.41	    [4, 1] |-> [4, 0]
0.00/0.41	     lhs          rhs          ge     gt
0.00/0.41	        / 5A 5A \    / 3A 3A \   True   True
0.00/0.41	        \ 5A 5A /    \ 3A 3A /        
0.00/0.41	    [0, 1, 1] ->= [2]
0.00/0.41	     lhs          rhs          ge     gt
0.00/0.41	        / 4A 4A \    / 0A 2A \   True   False
0.00/0.41	        \ 2A 2A /    \ 0A 2A /        
0.00/0.41	    [2, 1] ->= [1, 1, 2, 0]
0.00/0.41	     lhs          rhs          ge     gt
0.00/0.41	        / 4A 4A \    / 4A 4A \   True   False
0.00/0.41	        \ 4A 4A /    \ 4A 4A /        
0.00/0.41	    [2, 0] ->= []
0.00/0.41	     lhs          rhs          ge     gt
0.00/0.41	        / 0A 0A \    / 0A -  \   True   False
0.00/0.41	        \ 0A 0A /    \ -  0A /        
0.00/0.42	   property Termination
0.00/0.43	has value True
0.00/0.43	for SRS ( [0, 1, 1] ->= [2], [2, 1] ->= [1, 1, 2, 0], [2, 0] ->= [])
0.00/0.43	reason
0.00/0.43	  EDG has 0 SCCs
0.00/0.43	
0.00/0.43	**************************************************
0.00/0.43	          summary
0.00/0.43	**************************************************
0.00/0.43	SRS with 3 rules on 3 letters       Remap   { tracing = False}
0.00/0.43	SRS with 3 rules on 3 letters       reverse each lhs and rhs
0.00/0.43	SRS with 3 rules on 3 letters       DP transform
0.00/0.43	SRS with 6 rules on 5 letters       Remap   { tracing = False}
0.00/0.43	SRS with 6 rules on 5 letters       EDG
0.00/0.44	SRS with 6 rules on 5 letters       Matrix   { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True}
0.00/0.44	SRS with 3 rules on 3 letters       EDG
0.00/0.44	
0.00/0.44	**************************************************
0.00/0.44	(3, 3)\Deepee(6, 5)\Matrix{\Arctic}{2}(3, 3)\EDG[]
0.00/0.44	**************************************************
2.44/0.69	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]}
2.44/0.69	in Apply (Worker Remap) (First_Of ([ yeah] <> noh))
2.44/0.71	EOF