0.00/0.08	YES
0.00/0.08	property Termination
0.00/0.08	has value True
0.00/0.08	for SRS ( [b, b, a] -> [a, a, b], [a, a, a] -> [c, c, a], [a, a, a] -> [b, c, b], [b, a, c] -> [a, b, a], [c, c, b] ->= [a, c, b], [a, a, a] ->= [b, a, a])
0.00/0.08	reason
0.00/0.08	  remap for 6 rules
0.00/0.08	   property Termination
0.00/0.08	has value True
0.00/0.08	for SRS ( [0, 0, 1] -> [1, 1, 0], [1, 1, 1] -> [2, 2, 1], [1, 1, 1] -> [0, 2, 0], [0, 1, 2] -> [1, 0, 1], [2, 2, 0] ->= [1, 2, 0], [1, 1, 1] ->= [0, 1, 1])
0.00/0.08	reason
0.00/0.08	  Matrix   { monotone = Strict, domain = Natural, bits = 3, dim = 2, solver = Minisatapi, verbose = False, tracing = False}
0.00/0.08	    interpretation
0.00/0.08	      0  / 2 0 \
0.00/0.08	         \ 0 1 /
0.00/0.08	      1  / 2 1 \
0.00/0.08	         \ 0 1 /
0.00/0.08	      2  / 2 1 \
0.00/0.08	         \ 0 1 /
0.00/0.08	    [0, 0, 1] -> [1, 1, 0]
0.00/0.08	     lhs        rhs        ge     gt
0.00/0.08	        / 8 4 \    / 8 3 \   True   True
0.00/0.08	        \ 0 1 /    \ 0 1 /        
0.00/0.08	    [1, 1, 1] -> [2, 2, 1]
0.00/0.08	     lhs        rhs        ge     gt
0.00/0.08	        / 8 7 \    / 8 7 \   True   False
0.00/0.08	        \ 0 1 /    \ 0 1 /        
0.00/0.08	    [1, 1, 1] -> [0, 2, 0]
0.00/0.08	     lhs        rhs        ge     gt
0.00/0.08	        / 8 7 \    / 8 2 \   True   True
0.00/0.08	        \ 0 1 /    \ 0 1 /        
0.00/0.08	    [0, 1, 2] -> [1, 0, 1]
0.00/0.08	     lhs        rhs        ge     gt
0.00/0.08	        / 8 6 \    / 8 5 \   True   True
0.00/0.08	        \ 0 1 /    \ 0 1 /        
0.00/0.08	    [2, 2, 0] ->= [1, 2, 0]
0.00/0.08	     lhs        rhs        ge     gt
0.00/0.08	        / 8 3 \    / 8 3 \   True   False
0.00/0.08	        \ 0 1 /    \ 0 1 /        
0.00/0.08	    [1, 1, 1] ->= [0, 1, 1]
0.00/0.08	     lhs        rhs        ge     gt
0.00/0.08	        / 8 7 \    / 8 6 \   True   True
0.00/0.08	        \ 0 1 /    \ 0 1 /        
0.00/0.08	   property Termination
0.00/0.08	has value True
0.00/0.08	for SRS ( [1, 1, 1] -> [2, 2, 1], [2, 2, 0] ->= [1, 2, 0])
0.00/0.08	reason
0.00/0.08	  Tiling   { method = Overlap, width = 5, state_type = Bit64, map_type = Enum, verbose = False, tracing = False}
0.00/0.08	  using 17 tiles
0.00/0.08	    [ [<, 1, 2, 0, >] , [<, 2, 2, 1, >] , [2, 1, 2, 0, >] , [2, 2, 2, 1, >] , [<, <, 1, 2, 0] , [2, 2, 1, 2, 0] , [<, <, <, <, 1] , [<, <, 2, 2, 1] , [2, 2, 2, 2, 1] , [<, <, <, <, 2] , [<, <, <, 1, 2] , [<, <, <, 2, 2] , [<, <, 2, 2, 2] , [<, 2, 2, 1, 2] , [<, 2, 2, 2, 2] , [2, 2, 2, 1, 2] , [2, 2, 2, 2, 2] ]
0.00/0.08	  remove some unmatched rules
0.00/0.08	  
0.00/0.08	   property Termination
0.00/0.08	has value True
0.00/0.08	for SRS ( )
0.00/0.08	reason
0.00/0.08	  remap for 0 rules
0.00/0.08	   property Termination
0.00/0.08	has value True
0.00/0.08	for SRS ( )
0.00/0.08	reason
0.00/0.08	  has no strict rules
0.00/0.08	
0.00/0.08	**************************************************
0.00/0.08	          summary
0.00/0.08	**************************************************
0.00/0.08	SRS with 6 rules on 3 letters       Remap   { tracing = False}
0.00/0.08	SRS with 6 rules on 3 letters       Matrix   { monotone = Strict, domain = Natural, bits = 3, dim = 2, solver = Minisatapi, verbose = False, tracing = False}
0.00/0.08	SRS with 2 rules on 3 letters       remove some, by Tiling   { method = Overlap, width = 5, state_type = Bit64, map_type = Enum, verbose = False, tracing = False}
0.00/0.08	SRS with 0 rules on 0 letters       Remap   { tracing = False}
0.00/0.08	SRS with 0 rules on 0 letters       has no strict rules
0.00/0.08	
0.00/0.08	**************************************************
0.00/0.08	(6, 3)\Matrix{\Natural}{2}(2, 3)\TileRemoveROC{5}(0, 0)[]
0.00/0.08	**************************************************
0.00/0.08	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))))))}
0.00/0.08	in Apply (Worker Remap) method
0.00/0.09	EOF