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