3.27/0.85	YES
3.27/0.85	property Termination
3.27/0.85	has value True
3.27/0.85	for SRS ( [a, a, a, b] -> [b, a, b, a, a, a], [a, b] -> [])
3.27/0.85	reason
3.27/0.85	  remap for 2 rules
3.27/0.85	   property Termination
3.27/0.85	has value True
3.27/0.85	for SRS ( [0, 0, 0, 1] -> [1, 0, 1, 0, 0, 0], [0, 1] -> [])
3.27/0.85	reason
3.27/0.85	  reverse each lhs and rhs
3.27/0.85	   property Termination
3.27/0.85	has value True
3.27/0.85	for SRS ( [1, 0, 0, 0] -> [0, 0, 0, 1, 0, 1], [1, 0] -> [])
3.27/0.85	reason
3.27/0.85	  DP transform
3.27/0.85	   property Termination
3.27/0.85	has value True
3.27/0.85	for SRS ( [1, 0, 0, 0] ->= [0, 0, 0, 1, 0, 1], [1, 0] ->= [], [1#, 0, 0, 0] |-> [1#, 0, 1], [1#, 0, 0, 0] |-> [1#])
3.27/0.85	reason
3.27/0.85	  remap for 4 rules
3.27/0.85	   property Termination
3.27/0.85	has value True
3.27/0.85	for SRS ( [0, 1, 1, 1] ->= [1, 1, 1, 0, 1, 0], [0, 1] ->= [], [2, 1, 1, 1] |-> [2, 1, 0], [2, 1, 1, 1] |-> [2])
3.27/0.85	reason
3.27/0.85	  EDG has 1 SCCs
3.27/0.85	   property Termination
3.27/0.85	has value True
3.27/0.85	for SRS ( [2, 1, 1, 1] |-> [2, 1, 0], [2, 1, 1, 1] |-> [2], [0, 1, 1, 1] ->= [1, 1, 1, 0, 1, 0], [0, 1] ->= [])
3.27/0.85	reason
3.27/0.85	  Matrix   { monotone = Weak, domain = Arctic, bits = 4, dim = 3, solver = Minisatapi, verbose = False, tracing = True}
3.27/0.85	    interpretation
3.27/0.85	      0  / 0A  0A  0A  \
3.27/0.85	         | -3A -3A -3A |
3.27/0.85	         \ -3A -3A -3A /
3.27/0.85	      1  / 0A 3A 3A \
3.27/0.85	         | 0A 0A 3A |
3.27/0.85	         \ 0A 0A 0A /
3.27/0.85	      2  / 39A 39A 40A \
3.27/0.85	         | 39A 39A 40A |
3.27/0.85	         \ 39A 39A 40A /
3.27/0.85	    [2, 1, 1, 1] |-> [2, 1, 0]
3.27/0.85	     lhs                rhs                ge     gt
3.27/0.85	        / 45A 45A 46A \    / 40A 40A 40A \   True   True
3.27/0.85	        | 45A 45A 46A |    | 40A 40A 40A |        
3.27/0.85	        \ 45A 45A 46A /    \ 40A 40A 40A /        
3.27/0.85	    [2, 1, 1, 1] |-> [2]
3.27/0.85	     lhs                rhs                ge     gt
3.27/0.85	        / 45A 45A 46A \    / 39A 39A 40A \   True   True
3.27/0.85	        | 45A 45A 46A |    | 39A 39A 40A |        
3.27/0.85	        \ 45A 45A 46A /    \ 39A 39A 40A /        
3.27/0.85	    [0, 1, 1, 1] ->= [1, 1, 1, 0, 1, 0]
3.27/0.85	     lhs             rhs             ge     gt
3.27/0.85	        / 6A 6A 6A \    / 6A 6A 6A \   True   False
3.27/0.85	        | 3A 3A 3A |    | 3A 3A 3A |        
3.27/0.86	        \ 3A 3A 3A /    \ 3A 3A 3A /        
3.27/0.86	    [0, 1] ->= []
3.27/0.86	     lhs              rhs             ge     gt
3.34/0.86	        / 0A  3A 3A \    / 0A -  -  \   True   False
3.34/0.86	        | -3A 0A 0A |    | -  0A -  |        
3.34/0.86	        \ -3A 0A 0A /    \ -  -  0A /        
3.34/0.86	   property Termination
3.34/0.87	has value True
3.34/0.87	for SRS ( [0, 1, 1, 1] ->= [1, 1, 1, 0, 1, 0], [0, 1] ->= [])
3.34/0.87	reason
3.34/0.87	  EDG has 0 SCCs
3.34/0.87	
3.34/0.87	**************************************************
3.34/0.87	          summary
3.34/0.87	**************************************************
3.34/0.87	SRS with 2 rules on 2 letters       Remap   { tracing = False}
3.34/0.87	SRS with 2 rules on 2 letters       reverse each lhs and rhs
3.34/0.87	SRS with 2 rules on 2 letters       DP transform
3.34/0.87	SRS with 4 rules on 3 letters       Remap   { tracing = False}
3.34/0.87	SRS with 4 rules on 3 letters       EDG
3.34/0.87	SRS with 4 rules on 3 letters       Matrix   { monotone = Weak, domain = Arctic, bits = 4, dim = 3, solver = Minisatapi, verbose = False, tracing = True}
3.34/0.87	SRS with 2 rules on 2 letters       EDG
3.34/0.87	
3.34/0.87	**************************************************
3.34/0.87	(2, 2)\Deepee(4, 3)\Matrix{\Arctic}{3}(2, 2)\EDG[]
3.34/0.87	**************************************************
5.24/1.40	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]}
5.24/1.40	in Apply (Worker Remap) (First_Of ([ yeah] <> noh))
5.24/1.42	EOF