0.00/0.56	YES
0.00/0.56	property Termination
0.00/0.56	has value True
0.00/0.56	for SRS ( [a] -> [], [a] -> [b], [b] -> [], [b, a, c] -> [c, c, a, a, b])
0.00/0.56	reason
0.00/0.56	  remap for 4 rules
0.00/0.56	   property Termination
0.00/0.56	has value True
0.00/0.56	for SRS ( [0] -> [], [0] -> [1], [1] -> [], [1, 0, 2] -> [2, 2, 0, 0, 1])
0.00/0.56	reason
0.00/0.56	  reverse each lhs and rhs
0.00/0.56	   property Termination
0.00/0.56	has value True
0.00/0.56	for SRS ( [0] -> [], [0] -> [1], [1] -> [], [2, 0, 1] -> [1, 0, 0, 2, 2])
0.00/0.56	reason
0.00/0.56	  DP transform
0.00/0.56	   property Termination
0.00/0.56	has value True
0.00/0.56	for SRS ( [0] ->= [], [0] ->= [1], [1] ->= [], [2, 0, 1] ->= [1, 0, 0, 2, 2], [0#] |-> [1#], [2#, 0, 1] |-> [1#, 0, 0, 2, 2], [2#, 0, 1] |-> [0#, 0, 2, 2], [2#, 0, 1] |-> [0#, 2, 2], [2#, 0, 1] |-> [2#, 2], [2#, 0, 1] |-> [2#])
0.00/0.56	reason
0.00/0.56	  remap for 10 rules
0.00/0.56	   property Termination
0.00/0.56	has value True
0.00/0.56	for SRS ( [0] ->= [], [0] ->= [1], [1] ->= [], [2, 0, 1] ->= [1, 0, 0, 2, 2], [3] |-> [4], [5, 0, 1] |-> [4, 0, 0, 2, 2], [5, 0, 1] |-> [3, 0, 2, 2], [5, 0, 1] |-> [3, 2, 2], [5, 0, 1] |-> [5, 2], [5, 0, 1] |-> [5])
0.00/0.56	reason
0.00/0.56	  weights
0.00/0.56	    Map [(3, 1/1), (5, 2/1)]
0.00/0.56	  
0.00/0.56	   property Termination
0.00/0.57	has value True
0.00/0.57	for SRS ( [0] ->= [], [0] ->= [1], [1] ->= [], [2, 0, 1] ->= [1, 0, 0, 2, 2], [5, 0, 1] |-> [5, 2], [5, 0, 1] |-> [5])
0.00/0.57	reason
0.00/0.57	  EDG has 1 SCCs
0.00/0.58	   property Termination
0.00/0.58	has value True
0.00/0.58	for SRS ( [5, 0, 1] |-> [5, 2], [5, 0, 1] |-> [5], [0] ->= [], [0] ->= [1], [1] ->= [], [2, 0, 1] ->= [1, 0, 0, 2, 2])
0.00/0.58	reason
2.31/0.60	  Matrix   { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True}
2.31/0.60	    interpretation
2.31/0.60	      0  / 0A 2A \
2.31/0.60	         \ 0A 0A /
2.31/0.60	      1  / 0A 0A \
2.31/0.60	         \ 0A 0A /
2.31/0.60	      2  / 0A 0A \
2.31/0.60	         \ 0A 0A /
2.31/0.60	      5  / 19A 19A \
2.31/0.60	         \ 19A 19A /
2.31/0.60	    [5, 0, 1] |-> [5, 2]
2.31/0.60	     lhs            rhs            ge     gt
2.31/0.60	        / 21A 21A \    / 19A 19A \   True   True
2.31/0.60	        \ 21A 21A /    \ 19A 19A /        
2.31/0.60	    [5, 0, 1] |-> [5]
2.31/0.60	     lhs            rhs            ge     gt
2.31/0.60	        / 21A 21A \    / 19A 19A \   True   True
2.31/0.60	        \ 21A 21A /    \ 19A 19A /        
2.31/0.60	    [0] ->= []
2.31/0.60	     lhs          rhs          ge     gt
2.31/0.60	        / 0A 2A \    / 0A -  \   True   False
2.31/0.60	        \ 0A 0A /    \ -  0A /        
2.31/0.60	    [0] ->= [1]
2.31/0.60	     lhs          rhs          ge     gt
2.31/0.60	        / 0A 2A \    / 0A 0A \   True   False
2.31/0.60	        \ 0A 0A /    \ 0A 0A /        
2.31/0.60	    [1] ->= []
2.31/0.60	     lhs          rhs          ge     gt
2.31/0.60	        / 0A 0A \    / 0A -  \   True   False
2.31/0.60	        \ 0A 0A /    \ -  0A /        
2.31/0.60	    [2, 0, 1] ->= [1, 0, 0, 2, 2]
2.31/0.60	     lhs          rhs          ge     gt
2.31/0.60	        / 2A 2A \    / 2A 2A \   True   False
2.31/0.60	        \ 2A 2A /    \ 2A 2A /        
2.31/0.60	   property Termination
2.31/0.60	has value True
2.31/0.60	for SRS ( [0] ->= [], [0] ->= [1], [1] ->= [], [2, 0, 1] ->= [1, 0, 0, 2, 2])
2.31/0.60	reason
2.31/0.60	  EDG has 0 SCCs
2.31/0.60	
2.31/0.60	**************************************************
2.31/0.60	          summary
2.31/0.60	**************************************************
2.31/0.60	SRS with 4 rules on 3 letters       Remap   { tracing = False}
2.31/0.60	SRS with 4 rules on 3 letters       reverse each lhs and rhs
2.31/0.60	SRS with 4 rules on 3 letters       DP transform
2.34/0.60	SRS with 10 rules on 6 letters       Remap   { tracing = False}
2.34/0.60	SRS with 10 rules on 6 letters       weights
2.34/0.60	SRS with 6 rules on 4 letters       EDG
2.34/0.61	SRS with 6 rules on 4 letters       Matrix   { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True}
2.34/0.61	SRS with 4 rules on 3 letters       EDG
2.34/0.61	
2.34/0.61	**************************************************
2.34/0.61	(4, 3)\Deepee(10, 6)\Weight(6, 4)\Matrix{\Arctic}{2}(4, 3)\EDG[]
2.34/0.61	**************************************************
2.38/0.62	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.38/0.62	in Apply (Worker Remap) (First_Of ([ yeah] <> noh))
2.38/0.65	EOF