0.00/0.06	YES
0.00/0.06	property Termination
0.00/0.06	has value True
0.00/0.06	for SRS ( [b, q, b] -> [b, p, b], [0, p, 0] ->= [q], [1, p, 1] ->= [q], [0, q, 0] ->= [q], [1, q, 1] ->= [q], [p] ->= [1, p, 1, 0, 1])
0.00/0.06	reason
0.00/0.06	  remap for 6 rules
0.00/0.06	   property Termination
0.00/0.06	has value True
0.00/0.06	for SRS ( [0, 1, 0] -> [0, 2, 0], [3, 2, 3] ->= [1], [4, 2, 4] ->= [1], [3, 1, 3] ->= [1], [4, 1, 4] ->= [1], [2] ->= [4, 2, 4, 3, 4])
0.00/0.06	reason
0.00/0.06	  Tiling   { method = Overlap, width = 2, state_type = Bit64, map_type = Enum, verbose = False, tracing = False}
0.00/0.06	  using 24 tiles
0.00/0.06	    [ [0, >] , [1, >] , [4, >] , [<, 0] , [1, 0] , [2, 0] , [4, 0] , [<, 1] , [0, 1] , [1, 1] , [2, 1] , [3, 1] , [4, 1] , [0, 2] , [1, 2] , [4, 2] , [1, 3] , [4, 3] , [<, 4] , [0, 4] , [1, 4] , [2, 4] , [3, 4] , [4, 4] ]
0.00/0.06	  remove some unmatched rules
0.00/0.06	  
0.00/0.06	   property Termination
0.00/0.06	has value True
0.00/0.06	for SRS ( [[0], [1], [0]] -> [[0], [2], [0]], [[4], [2], [4]] ->= [[1]], [[3], [1], [3]] ->= [[1]], [[4], [1], [4]] ->= [[1]], [[2]] ->= [[4], [2], [4], [3], [4]])
0.00/0.06	reason
0.00/0.06	  remap for 5 rules
0.00/0.06	   property Termination
0.00/0.06	has value True
0.00/0.06	for SRS ( [0, 1, 0] -> [0, 2, 0], [3, 2, 3] ->= [1], [4, 1, 4] ->= [1], [3, 1, 3] ->= [1], [2] ->= [3, 2, 3, 4, 3])
0.00/0.06	reason
0.00/0.06	  Tiling   { method = Overlap, width = 3, state_type = Bit64, map_type = Enum, verbose = False, tracing = False}
0.00/0.06	  using 71 tiles
0.00/0.06	    [ [<, 1, >] , [0, 1, >] , [1, 0, >] , [1, 1, >] , [1, 3, >] , [2, 0, >] , [2, 1, >] , [3, 0, >] , [3, 1, >] , [4, 1, >] , [4, 3, >] , [<, <, 0] , [<, 1, 0] , [0, 2, 0] , [1, 3, 0] , [4, 3, 0] , [<, <, 1] , [<, 0, 1] , [<, 1, 1] , [<, 3, 1] , [0, 1, 1] , [0, 3, 1] , [1, 0, 1] , [1, 1, 1] , [1, 2, 1] , [1, 3, 1] , [1, 4, 1] , [2, 0, 1] , [2, 3, 1] , [3, 0, 1] , [3, 1, 1] , [3, 2, 1] , [3, 3, 1] , [3, 4, 1] , [4, 1, 1] , [4, 3, 1] , [<, 0, 2] , [<, 1, 2] , [<, 3, 2] , [0, 3, 2] , [1, 0, 2] , [1, 1, 2] , [1, 3, 2] , [2, 0, 2] , [3, 0, 2] , [3, 3, 2] , [4, 1, 2] , [<, <, 3] , [<, 0, 3] , [<, 1, 3] , [<, 3, 3] , [0, 3, 3] , [1, 0, 3] , [1, 1, 3] , [1, 2, 3] , [1, 3, 3] , [1, 4, 3] , [2, 0, 3] , [3, 0, 3] , [3, 2, 3] , [3, 3, 3] , [3, 4, 3] , [4, 1, 3] , [4, 3, 3] , [<, 1, 4] , [0, 1, 4] , [1, 1, 4] , [1, 3, 4] , [2, 3, 4] , [3, 1, 4] , [3, 3, 4] ]
0.00/0.06	  remove some unmatched rules
0.00/0.06	  
0.00/0.06	   property Termination
0.00/0.06	has value True
0.00/0.06	for SRS ( [[3], [2], [3]] ->= [[1]], [[2]] ->= [[3], [2], [3], [4], [3]])
0.00/0.06	reason
0.00/0.06	  remap for 2 rules
0.00/0.06	   property Termination
0.00/0.06	has value True
0.00/0.06	for SRS ( [0, 1, 0] ->= [2], [1] ->= [0, 1, 0, 3, 0])
0.00/0.06	reason
0.00/0.06	  has no strict rules
0.00/0.06	
0.00/0.06	**************************************************
0.00/0.06	          summary
0.00/0.06	**************************************************
0.00/0.06	SRS with 6 rules on 5 letters       Remap   { tracing = False}
0.00/0.06	SRS with 6 rules on 5 letters       remove some, by Tiling   { method = Overlap, width = 2, state_type = Bit64, map_type = Enum, verbose = False, tracing = False}
0.00/0.06	SRS with 5 rules on 5 letters       Remap   { tracing = False}
0.00/0.06	SRS with 5 rules on 5 letters       remove some, by Tiling   { method = Overlap, width = 3, state_type = Bit64, map_type = Enum, verbose = False, tracing = False}
0.00/0.06	SRS with 2 rules on 4 letters       Remap   { tracing = False}
0.00/0.06	SRS with 2 rules on 4 letters       has no strict rules
0.00/0.06	
0.00/0.06	**************************************************
0.00/0.06	(6, 5)\TileRemoveROC{2}(5, 5)\TileRemoveROC{3}(2, 4)[]
0.00/0.06	**************************************************
0.00/0.06	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.06	in Apply (Worker Remap) method
0.00/0.07	EOF