4.20/1.13	YES
4.20/1.13	property Termination
4.20/1.13	has value True
4.20/1.13	for SRS ( [a] -> [], [a, b, b] -> [b, b, b, a, a, c], [c, b] -> [])
4.20/1.13	reason
4.20/1.13	  remap for 3 rules
4.20/1.13	   property Termination
4.20/1.13	has value True
4.20/1.13	for SRS ( [0] -> [], [0, 1, 1] -> [1, 1, 1, 0, 0, 2], [2, 1] -> [])
4.20/1.13	reason
4.20/1.13	  DP transform
4.20/1.13	   property Termination
4.20/1.13	has value True
4.20/1.13	for SRS ( [0] ->= [], [0, 1, 1] ->= [1, 1, 1, 0, 0, 2], [2, 1] ->= [], [0#, 1, 1] |-> [0#, 0, 2], [0#, 1, 1] |-> [0#, 2], [0#, 1, 1] |-> [2#])
4.20/1.13	reason
4.20/1.13	  remap for 6 rules
4.20/1.13	   property Termination
4.20/1.13	has value True
4.20/1.13	for SRS ( [0] ->= [], [0, 1, 1] ->= [1, 1, 1, 0, 0, 2], [2, 1] ->= [], [3, 1, 1] |-> [3, 0, 2], [3, 1, 1] |-> [3, 2], [3, 1, 1] |-> [4])
4.20/1.13	reason
4.20/1.13	  weights
4.20/1.13	    Map [(3, 1/1)]
4.20/1.13	  
4.20/1.13	   property Termination
4.20/1.13	has value True
4.20/1.13	for SRS ( [0] ->= [], [0, 1, 1] ->= [1, 1, 1, 0, 0, 2], [2, 1] ->= [], [3, 1, 1] |-> [3, 0, 2], [3, 1, 1] |-> [3, 2])
4.20/1.13	reason
4.20/1.13	  EDG has 1 SCCs
4.20/1.13	   property Termination
4.20/1.13	has value True
4.20/1.13	for SRS ( [3, 1, 1] |-> [3, 0, 2], [3, 1, 1] |-> [3, 2], [0] ->= [], [0, 1, 1] ->= [1, 1, 1, 0, 0, 2], [2, 1] ->= [])
4.20/1.13	reason
4.20/1.13	  Matrix   { monotone = Weak, domain = Arctic, bits = 4, dim = 3, solver = Minisatapi, verbose = False, tracing = True}
4.20/1.13	    interpretation
4.20/1.13	      0  / 0A  0A  3A \
4.20/1.13	         | -3A 0A  0A |
4.20/1.13	         \ -3A -3A 0A /
4.20/1.13	      1  / 0A  0A 3A \
4.20/1.13	         | 0A  0A 0A |
4.20/1.13	         \ -3A 0A 0A /
4.20/1.13	      2  / 0A  0A  0A  \
4.20/1.13	         | -3A -3A 0A  |
4.20/1.13	         \ -3A -3A -3A /
4.20/1.13	      3  / 9A 11A 12A \
4.20/1.13	         | 9A 11A 12A |
4.20/1.13	         \ 9A 11A 12A /
4.20/1.13	    [3, 1, 1] |-> [3, 0, 2]
4.20/1.13	     lhs                rhs              ge     gt
4.20/1.13	        / 12A 12A 14A \    / 9A 9A 11A \   True   True
4.20/1.13	        | 12A 12A 14A |    | 9A 9A 11A |        
4.20/1.13	        \ 12A 12A 14A /    \ 9A 9A 11A /        
4.20/1.13	    [3, 1, 1] |-> [3, 2]
4.20/1.13	     lhs                rhs              ge     gt
4.20/1.13	        / 12A 12A 14A \    / 9A 9A 11A \   True   True
4.20/1.13	        | 12A 12A 14A |    | 9A 9A 11A |        
4.20/1.13	        \ 12A 12A 14A /    \ 9A 9A 11A /        
4.20/1.13	    [0] ->= []
4.20/1.13	     lhs               rhs             ge     gt
4.20/1.13	        / 0A  0A  3A \    / 0A -  -  \   True   False
4.20/1.13	        | -3A 0A  0A |    | -  0A -  |        
4.20/1.13	        \ -3A -3A 0A /    \ -  -  0A /        
4.20/1.13	    [0, 1, 1] ->= [1, 1, 1, 0, 0, 2]
4.20/1.13	     lhs             rhs             ge     gt
4.20/1.13	        / 3A 3A 3A \    / 3A 3A 3A \   True   False
4.20/1.13	        | 0A 0A 3A |    | 0A 0A 3A |        
4.20/1.13	        \ 0A 0A 0A /    \ 0A 0A 0A /        
4.20/1.13	    [2, 1] ->= []
4.20/1.13	     lhs               rhs             ge     gt
4.20/1.13	        / 0A  0A  3A \    / 0A -  -  \   True   False
4.20/1.13	        | -3A 0A  0A |    | -  0A -  |        
4.20/1.13	        \ -3A -3A 0A /    \ -  -  0A /        
4.20/1.13	   property Termination
4.20/1.13	has value True
4.20/1.13	for SRS ( [0] ->= [], [0, 1, 1] ->= [1, 1, 1, 0, 0, 2], [2, 1] ->= [])
4.20/1.13	reason
4.20/1.13	  EDG has 0 SCCs
4.20/1.13	
4.20/1.13	**************************************************
4.20/1.13	          summary
4.20/1.13	**************************************************
4.20/1.13	SRS with 3 rules on 3 letters       Remap   { tracing = False}
4.20/1.13	SRS with 3 rules on 3 letters       DP transform
4.20/1.15	SRS with 6 rules on 5 letters       Remap   { tracing = False}
4.20/1.15	SRS with 6 rules on 5 letters       weights
4.20/1.15	SRS with 5 rules on 4 letters       EDG
4.20/1.15	SRS with 5 rules on 4 letters       Matrix   { monotone = Weak, domain = Arctic, bits = 4, dim = 3, solver = Minisatapi, verbose = False, tracing = True}
4.20/1.15	SRS with 3 rules on 3 letters       EDG
4.20/1.15	
4.20/1.15	**************************************************
4.20/1.15	(3, 3)\Deepee(6, 5)\Weight(5, 4)\Matrix{\Arctic}{3}(3, 3)\EDG[]
4.20/1.15	**************************************************
5.08/1.33	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.08/1.33	in Apply (Worker Remap) (First_Of ([ yeah] <> noh))
5.23/1.37	EOF