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