0.00/0.28	YES
0.00/0.29	property Termination
0.00/0.29	has value True
0.00/0.29	for SRS ( [a] -> [], [a] -> [b], [a, b, c] -> [c, c, a, b, a], [c] -> [])
0.00/0.29	reason
0.00/0.29	  remap for 4 rules
0.00/0.29	   property Termination
0.00/0.29	has value True
0.00/0.29	for SRS ( [0] -> [], [0] -> [1], [0, 1, 2] -> [2, 2, 0, 1, 0], [2] -> [])
0.00/0.29	reason
0.00/0.29	  reverse each lhs and rhs
0.00/0.29	   property Termination
0.00/0.29	has value True
0.00/0.29	for SRS ( [0] -> [], [0] -> [1], [2, 1, 0] -> [0, 1, 0, 2, 2], [2] -> [])
0.00/0.29	reason
0.00/0.29	  DP transform
0.00/0.29	   property Termination
0.00/0.29	has value True
0.00/0.29	for SRS ( [0] ->= [], [0] ->= [1], [2, 1, 0] ->= [0, 1, 0, 2, 2], [2] ->= [], [2#, 1, 0] |-> [0#, 1, 0, 2, 2], [2#, 1, 0] |-> [0#, 2, 2], [2#, 1, 0] |-> [2#, 2], [2#, 1, 0] |-> [2#])
0.00/0.29	reason
0.00/0.29	  remap for 8 rules
0.00/0.29	   property Termination
0.00/0.29	has value True
0.00/0.29	for SRS ( [0] ->= [], [0] ->= [1], [2, 1, 0] ->= [0, 1, 0, 2, 2], [2] ->= [], [3, 1, 0] |-> [4, 1, 0, 2, 2], [3, 1, 0] |-> [4, 2, 2], [3, 1, 0] |-> [3, 2], [3, 1, 0] |-> [3])
0.00/0.29	reason
0.00/0.29	  weights
0.00/0.29	    Map [(3, 2/1)]
0.00/0.29	  
0.00/0.29	   property Termination
0.00/0.29	has value True
0.00/0.29	for SRS ( [0] ->= [], [0] ->= [1], [2, 1, 0] ->= [0, 1, 0, 2, 2], [2] ->= [], [3, 1, 0] |-> [3, 2], [3, 1, 0] |-> [3])
0.00/0.29	reason
0.00/0.29	  EDG has 1 SCCs
0.00/0.29	   property Termination
0.00/0.29	has value True
0.00/0.29	for SRS ( [3, 1, 0] |-> [3, 2], [3, 1, 0] |-> [3], [0] ->= [], [0] ->= [1], [2, 1, 0] ->= [0, 1, 0, 2, 2], [2] ->= [])
0.00/0.29	reason
0.00/0.29	  Matrix   { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True}
0.00/0.29	    interpretation
0.00/0.29	      0  / 0A 2A \
0.00/0.29	         \ 0A 0A /
0.00/0.29	      1  / 0A 0A \
0.00/0.29	         \ 0A 0A /
0.00/0.29	      2  / 0A  2A \
0.00/0.29	         \ -2A 0A /
0.00/0.29	      3  / 25A 27A \
0.00/0.29	         \ 25A 27A /
0.00/0.29	    [3, 1, 0] |-> [3, 2]
0.00/0.29	     lhs            rhs            ge     gt
0.00/0.29	        / 27A 29A \    / 25A 27A \   True   True
0.00/0.29	        \ 27A 29A /    \ 25A 27A /        
0.00/0.29	    [3, 1, 0] |-> [3]
0.00/0.29	     lhs            rhs            ge     gt
0.00/0.29	        / 27A 29A \    / 25A 27A \   True   True
0.00/0.29	        \ 27A 29A /    \ 25A 27A /        
0.00/0.29	    [0] ->= []
0.00/0.29	     lhs          rhs          ge     gt
0.00/0.29	        / 0A 2A \    / 0A -  \   True   False
0.00/0.29	        \ 0A 0A /    \ -  0A /        
0.00/0.29	    [0] ->= [1]
0.00/0.29	     lhs          rhs          ge     gt
0.00/0.29	        / 0A 2A \    / 0A 0A \   True   False
0.00/0.29	        \ 0A 0A /    \ 0A 0A /        
0.00/0.29	    [2, 1, 0] ->= [0, 1, 0, 2, 2]
0.00/0.29	     lhs          rhs          ge     gt
0.00/0.29	        / 2A 4A \    / 2A 4A \   True   False
0.00/0.29	        \ 0A 2A /    \ 0A 2A /        
0.00/0.29	    [2] ->= []
0.00/0.29	     lhs           rhs          ge     gt
0.00/0.29	        / 0A  2A \    / 0A -  \   True   False
0.00/0.29	        \ -2A 0A /    \ -  0A /        
0.00/0.29	   property Termination
0.00/0.29	has value True
0.00/0.29	for SRS ( [0] ->= [], [0] ->= [1], [2, 1, 0] ->= [0, 1, 0, 2, 2], [2] ->= [])
0.00/0.29	reason
0.00/0.30	  EDG has 0 SCCs
0.00/0.30	
0.00/0.30	**************************************************
0.00/0.30	          summary
0.00/0.30	**************************************************
0.00/0.30	SRS with 4 rules on 3 letters       Remap   { tracing = False}
0.00/0.30	SRS with 4 rules on 3 letters       reverse each lhs and rhs
0.00/0.30	SRS with 4 rules on 3 letters       DP transform
0.00/0.31	SRS with 8 rules on 5 letters       Remap   { tracing = False}
0.00/0.31	SRS with 8 rules on 5 letters       weights
0.00/0.31	SRS with 6 rules on 4 letters       EDG
0.00/0.31	SRS with 6 rules on 4 letters       Matrix   { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True}
0.00/0.31	SRS with 4 rules on 3 letters       EDG
0.00/0.31	
0.00/0.31	**************************************************
0.00/0.31	(4, 3)\Deepee(8, 5)\Weight(6, 4)\Matrix{\Arctic}{2}(4, 3)\EDG[]
0.00/0.31	**************************************************
0.00/0.32	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.32	in Apply (Worker Remap) (First_Of ([ yeah] <> noh))
0.00/0.34	EOF