0.00/0.09 YES 0.00/0.09 property Termination 0.00/0.09 has value True 0.00/0.09 for SRS ( [b, a, a] -> [c, b, b], [a, a, a] -> [a, c, c], [a, c, b] -> [a, a, b], [c, a, c] -> [c, c, c], [c, a, a] ->= [c, a, a], [c, c, a] ->= [c, b, b], [a, a, b] ->= [b, a, b]) 0.00/0.09 reason 0.00/0.09 remap for 7 rules 0.00/0.09 property Termination 0.00/0.09 has value True 0.00/0.09 for SRS ( [0, 1, 1] -> [2, 0, 0], [1, 1, 1] -> [1, 2, 2], [1, 2, 0] -> [1, 1, 0], [2, 1, 2] -> [2, 2, 2], [2, 1, 1] ->= [2, 1, 1], [2, 2, 1] ->= [2, 0, 0], [1, 1, 0] ->= [0, 1, 0]) 0.00/0.09 reason 0.00/0.09 weights 0.00/0.09 Map [(1, 1/4), (2, 1/4)] 0.00/0.09 0.00/0.09 property Termination 0.00/0.09 has value True 0.00/0.09 for SRS ( [1, 1, 1] -> [1, 2, 2], [1, 2, 0] -> [1, 1, 0], [2, 1, 2] -> [2, 2, 2], [2, 1, 1] ->= [2, 1, 1]) 0.00/0.09 reason 0.00/0.09 Tiling { method = Overlap, width = 3, state_type = Bit64, map_type = Enum, verbose = False, tracing = False} 0.00/0.09 using 21 tiles 0.00/0.09 [ [1, 0, >] , [1, 1, >] , [2, 0, >] , [2, 1, >] , [2, 2, >] , [1, 1, 0] , [2, 1, 0] , [2, 2, 0] , [<, <, 1] , [<, 1, 1] , [<, 2, 1] , [1, 1, 1] , [2, 1, 1] , [2, 2, 1] , [<, <, 2] , [<, 1, 2] , [<, 2, 2] , [1, 1, 2] , [1, 2, 2] , [2, 1, 2] , [2, 2, 2] ] 0.00/0.09 remove some unmatched rules 0.00/0.09 0.00/0.09 property Termination 0.00/0.09 has value True 0.00/0.09 for SRS ( [[1], [1], [1]] -> [[1], [2], [2]], [[2], [1], [2]] -> [[2], [2], [2]], [[2], [1], [1]] ->= [[2], [1], [1]]) 0.00/0.09 reason 0.00/0.09 remap for 3 rules 0.00/0.09 property Termination 0.00/0.09 has value True 0.00/0.09 for SRS ( [0, 0, 0] -> [0, 1, 1], [1, 0, 1] -> [1, 1, 1], [1, 0, 0] ->= [1, 0, 0]) 0.00/0.09 reason 0.00/0.09 weights 0.00/0.09 Map [(0, 2/1)] 0.00/0.09 0.00/0.09 property Termination 0.00/0.09 has value True 0.00/0.09 for SRS ( [1, 0, 0] ->= [1, 0, 0]) 0.00/0.09 reason 0.00/0.09 has no strict rules 0.00/0.09 0.00/0.09 ************************************************** 0.00/0.09 summary 0.00/0.09 ************************************************** 0.00/0.09 SRS with 7 rules on 3 letters Remap { tracing = False} 0.00/0.09 SRS with 7 rules on 3 letters weights 0.00/0.09 SRS with 4 rules on 3 letters remove some, by Tiling { method = Overlap, width = 3, state_type = Bit64, map_type = Enum, verbose = False, tracing = False} 0.00/0.09 SRS with 3 rules on 2 letters Remap { tracing = False} 0.00/0.09 SRS with 3 rules on 2 letters weights 0.00/0.09 SRS with 1 rules on 2 letters has no strict rules 0.00/0.09 0.00/0.09 ************************************************** 0.00/0.09 (7, 3)\Weight(4, 3)\TileRemoveROC{3}(3, 2)\Weight(1, 2)[] 0.00/0.09 ************************************************** 0.00/0.09 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.09 in Apply (Worker Remap) method 0.00/0.10 EOF