8.26/2.15	YES
8.26/2.15	property Termination
8.26/2.15	has value True
8.26/2.15	for SRS ( [c, c, c] -> [a, b, c], [b, a, c] -> [b, c, b], [a, b, a] ->= [c, a, c], [b, b, c] ->= [a, b, b], [c, a, b] ->= [b, c, c], [a, b, c] ->= [b, b, b])
8.26/2.15	reason
8.26/2.15	  remap for 6 rules
8.26/2.15	   property Termination
8.26/2.15	has value True
8.26/2.15	for SRS ( [0, 0, 0] -> [1, 2, 0], [2, 1, 0] -> [2, 0, 2], [1, 2, 1] ->= [0, 1, 0], [2, 2, 0] ->= [1, 2, 2], [0, 1, 2] ->= [2, 0, 0], [1, 2, 0] ->= [2, 2, 2])
8.26/2.15	reason
8.26/2.15	  Matrix   { monotone = Strict, domain = Natural, bits = 3, dim = 3, solver = Minisatapi, verbose = False, tracing = False}
8.26/2.15	    interpretation
8.26/2.15	      0 St  / 1 1 1 \
8.26/2.15	            | 1 0 0 |
8.26/2.15	            \ 0 0 1 /
8.26/2.15	      1 St  / 1 1 2 \
8.26/2.15	            | 1 0 1 |
8.26/2.15	            \ 0 0 1 /
8.26/2.15	      2 St  / 1 1 0 \
8.26/2.15	            | 1 0 0 |
8.26/2.15	            \ 0 0 1 /
8.26/2.15	    [0, 0, 0] -> [1, 2, 0]
8.26/2.15	     lhs             rhs             ge     gt
8.26/2.15	       St  / 3 2 4 \   St  / 3 2 4 \   True   False
8.26/2.15	           | 2 1 2 |       | 2 1 2 |        
8.26/2.15	           \ 0 0 1 /       \ 0 0 1 /        
8.26/2.15	    [2, 1, 0] -> [2, 0, 2]
8.26/2.16	     lhs             rhs             ge     gt
8.26/2.16	       St  / 3 2 5 \   St  / 3 2 1 \   True   True
8.26/2.16	           | 2 1 3 |       | 2 1 1 |        
8.26/2.16	           \ 0 0 1 /       \ 0 0 1 /        
8.26/2.16	    [1, 2, 1] ->= [0, 1, 0]
8.26/2.16	     lhs             rhs             ge     gt
8.26/2.16	       St  / 3 2 7 \   St  / 3 2 6 \   True   True
8.26/2.16	           | 2 1 4 |       | 2 1 3 |        
8.26/2.16	           \ 0 0 1 /       \ 0 0 1 /        
8.26/2.16	    [2, 2, 0] ->= [1, 2, 2]
8.26/2.16	     lhs             rhs             ge     gt
8.26/2.16	       St  / 3 2 2 \   St  / 3 2 2 \   True   False
8.26/2.16	           | 2 1 1 |       | 2 1 1 |        
8.26/2.16	           \ 0 0 1 /       \ 0 0 1 /        
8.26/2.16	    [0, 1, 2] ->= [2, 0, 0]
8.26/2.16	     lhs             rhs             ge     gt
8.26/2.16	       St  / 3 2 4 \   St  / 3 2 3 \   True   True
8.26/2.16	           | 2 1 2 |       | 2 1 2 |        
8.26/2.16	           \ 0 0 1 /       \ 0 0 1 /        
8.26/2.16	    [1, 2, 0] ->= [2, 2, 2]
8.26/2.16	     lhs             rhs             ge     gt
8.26/2.16	       St  / 3 2 4 \   St  / 3 2 0 \   True   True
8.26/2.16	           | 2 1 2 |       | 2 1 0 |        
8.26/2.16	           \ 0 0 1 /       \ 0 0 1 /        
8.26/2.16	   property Termination
8.26/2.16	has value True
8.26/2.16	for SRS ( [0, 0, 0] -> [1, 2, 0], [2, 2, 0] ->= [1, 2, 2])
8.26/2.16	reason
8.26/2.16	  weights
8.26/2.16	    Map [(0, 2/1)]
8.26/2.16	  
8.26/2.16	   property Termination
8.26/2.16	has value True
8.26/2.16	for SRS ( )
8.26/2.16	reason
8.26/2.16	  has no strict rules
8.26/2.16	
8.26/2.16	**************************************************
8.26/2.16	          summary
8.26/2.16	**************************************************
8.26/2.16	SRS with 6 rules on 3 letters       Remap   { tracing = False}
8.26/2.16	SRS with 6 rules on 3 letters       Matrix   { monotone = Strict, domain = Natural, bits = 3, dim = 3, solver = Minisatapi, verbose = False, tracing = False}
8.26/2.16	SRS with 2 rules on 3 letters       weights
8.26/2.16	SRS with 0 rules on 0 letters       has no strict rules
8.26/2.16	
8.26/2.16	**************************************************
8.26/2.16	(6, 3)\Matrix{\Natural}{3}(2, 3)\Weight(0, 0)[]
8.26/2.16	**************************************************
8.26/2.16	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;when_small = \ m -> And_Then (Worker (SizeAtmost 100)) m;when_medium = \ m -> And_Then (Worker (SizeAtmost 10000)) m;tiling = \ m w -> weighted (And_Then (Worker (Tiling { method = m,width = w})) (Worker Remap));matrix = \ mo dom dim bits -> weighted (Worker (Matrix { monotone = mo,domain = dom,dim = dim,bits = bits}));kbo = \ b -> weighted (Worker (KBO { bits = b,solver = Minisatapi}));method = Apply wop (Tree_Search_Preemptive 0 done ([ ] <> ([ when_medium (kbo 1), when_medium (And_Then (Worker Mirror) (kbo 1))] <> ((for [ 3, 4] (\ d -> when_small (matrix Strict Natural d 3))) <> (for [ 2, 3, 5, 8] (\ w -> tiling Overlap w))))))}
8.26/2.16	in Apply (Worker Remap) method
8.52/2.20	EOF