41.70/10.54 YES 41.70/10.54 property Termination 41.70/10.55 has value True 41.70/10.55 for SRS ( [a] -> [], [a, b] -> [c, b, c, b, c, a], [c, c] -> [a]) 41.70/10.55 reason 41.70/10.55 remap for 3 rules 41.70/10.55 property Termination 41.70/10.55 has value True 41.70/10.55 for SRS ( [0] -> [], [0, 1] -> [2, 1, 2, 1, 2, 0], [2, 2] -> [0]) 41.70/10.55 reason 41.70/10.55 reverse each lhs and rhs 41.70/10.55 property Termination 41.70/10.55 has value True 41.70/10.55 for SRS ( [0] -> [], [1, 0] -> [0, 2, 1, 2, 1, 2], [2, 2] -> [0]) 41.70/10.55 reason 41.70/10.55 DP transform 41.70/10.55 property Termination 41.70/10.55 has value True 41.70/10.55 for SRS ( [0] ->= [], [1, 0] ->= [0, 2, 1, 2, 1, 2], [2, 2] ->= [0], [1#, 0] |-> [0#, 2, 1, 2, 1, 2], [1#, 0] |-> [2#, 1, 2, 1, 2], [1#, 0] |-> [1#, 2, 1, 2], [1#, 0] |-> [2#, 1, 2], [1#, 0] |-> [1#, 2], [1#, 0] |-> [2#], [2#, 2] |-> [0#]) 41.70/10.55 reason 41.70/10.55 remap for 10 rules 41.70/10.55 property Termination 41.70/10.55 has value True 41.70/10.55 for SRS ( [0] ->= [], [1, 0] ->= [0, 2, 1, 2, 1, 2], [2, 2] ->= [0], [3, 0] |-> [4, 2, 1, 2, 1, 2], [3, 0] |-> [5, 1, 2, 1, 2], [3, 0] |-> [3, 2, 1, 2], [3, 0] |-> [5, 1, 2], [3, 0] |-> [3, 2], [3, 0] |-> [5], [5, 2] |-> [4]) 41.70/10.55 reason 41.70/10.55 weights 41.70/10.55 Map [(3, 2/1), (5, 1/1)] 41.70/10.55 41.70/10.55 property Termination 41.70/10.55 has value True 41.70/10.55 for SRS ( [0] ->= [], [1, 0] ->= [0, 2, 1, 2, 1, 2], [2, 2] ->= [0], [3, 0] |-> [3, 2, 1, 2], [3, 0] |-> [3, 2]) 41.70/10.55 reason 41.70/10.55 EDG has 1 SCCs 41.70/10.55 property Termination 41.70/10.55 has value True 41.70/10.55 for SRS ( [3, 0] |-> [3, 2, 1, 2], [3, 0] |-> [3, 2], [0] ->= [], [1, 0] ->= [0, 2, 1, 2, 1, 2], [2, 2] ->= [0]) 41.70/10.55 reason 41.70/10.57 Matrix { monotone = Weak, domain = Arctic, bits = 3, dim = 4, solver = Minisatapi, verbose = False, tracing = False} 41.70/10.57 interpretation 41.70/10.57 0 Wk / 0A - - - \ 41.70/10.57 | 3A 0A 0A 4A | 41.70/10.57 | - 3A 0A - | 41.70/10.57 \ - - - 0A / 41.70/10.57 1 Wk / - 0A - 1A \ 41.70/10.57 | - 3A - 2A | 41.70/10.57 | 0A 3A 0A - | 41.70/10.57 \ - - - 0A / 41.70/10.57 2 Wk / 3A 0A 0A 4A \ 41.70/10.57 | 0A - - - | 41.70/10.57 | 3A 0A 0A - | 41.70/10.57 \ - - - 0A / 41.70/10.57 3 Wk / 0A 1A - 4A \ 41.70/10.57 | - - - - | 41.70/10.57 | - - - - | 41.70/10.57 \ - - - 0A / 41.70/10.57 [3, 0] |-> [3, 2, 1, 2] 41.70/10.57 lhs rhs ge gt 41.70/10.57 Wk / 4A 1A 1A 5A \ Wk / 3A 0A 0A 4A \ True True 41.70/10.57 | - - - - | | - - - - | 41.70/10.57 | - - - - | | - - - - | 41.70/10.57 \ - - - 0A / \ - - - 0A / 41.70/10.57 [3, 0] |-> [3, 2] 41.89/10.58 lhs rhs ge gt 41.89/10.58 Wk / 4A 1A 1A 5A \ Wk / 3A 0A 0A 4A \ True True 41.89/10.58 | - - - - | | - - - - | 41.89/10.58 | - - - - | | - - - - | 41.89/10.58 \ - - - 0A / \ - - - 0A / 41.89/10.58 [0] ->= [] 41.89/10.58 lhs rhs ge gt 41.89/10.58 Wk / 0A - - - \ Wk / 0A - - - \ True False 41.89/10.58 | 3A 0A 0A 4A | | - 0A - - | 41.89/10.58 | - 3A 0A - | | - - 0A - | 41.89/10.58 \ - - - 0A / \ - - - 0A / 41.89/10.58 [1, 0] ->= [0, 2, 1, 2, 1, 2] 41.89/10.58 lhs rhs ge gt 41.89/10.58 Wk / 3A 0A 0A 4A \ Wk / 3A 0A 0A 4A \ True False 41.89/10.61 | 6A 3A 3A 7A | | 6A 3A 3A 7A | 41.89/10.61 | 6A 3A 3A 7A | | 3A 0A 0A 4A | 41.89/10.61 \ - - - 0A / \ - - - 0A / 41.89/10.61 [2, 2] ->= [0] 41.89/10.61 lhs rhs ge gt 41.89/10.61 Wk / 6A 3A 3A 7A \ Wk / 0A - - - \ True False 41.89/10.61 | 3A 0A 0A 4A | | 3A 0A 0A 4A | 41.89/10.61 | 6A 3A 3A 7A | | - 3A 0A - | 41.89/10.61 \ - - - 0A / \ - - - 0A / 41.89/10.61 property Termination 41.89/10.61 has value True 41.89/10.61 for SRS ( [0] ->= [], [1, 0] ->= [0, 2, 1, 2, 1, 2], [2, 2] ->= [0]) 41.89/10.61 reason 41.89/10.61 EDG has 0 SCCs 41.89/10.61 41.89/10.61 ************************************************** 41.89/10.61 summary 41.89/10.61 ************************************************** 41.89/10.61 SRS with 3 rules on 3 letters Remap { tracing = False} 41.89/10.61 SRS with 3 rules on 3 letters reverse each lhs and rhs 41.89/10.61 SRS with 3 rules on 3 letters DP transform 41.89/10.61 SRS with 10 rules on 6 letters Remap { tracing = False} 41.89/10.61 SRS with 10 rules on 6 letters weights 41.89/10.61 SRS with 5 rules on 4 letters EDG 41.89/10.61 SRS with 5 rules on 4 letters Matrix { monotone = Weak, domain = Arctic, bits = 3, dim = 4, solver = Minisatapi, verbose = False, tracing = False} 41.89/10.61 SRS with 3 rules on 3 letters EDG 41.89/10.61 41.89/10.61 ************************************************** 41.89/10.61 (3, 3)\Deepee(10, 6)\Weight(5, 4)\Matrix{\Arctic}{4}(3, 3)\EDG[] 41.89/10.61 ************************************************** 42.22/10.70 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;tiling = \ m w -> weighted (And_Then (Worker (Tiling { method = m,width = w})) (Worker Remap));when_small = \ m -> And_Then (Worker (SizeAtmost 100)) m;when_medium = \ m -> And_Then (Worker (SizeAtmost 10000)) m;solver = Minisatapi;qpi = \ dim bits -> weighted (when_small (Worker (QPI { tracing = True,dim = dim,bits = bits,solver = solver})));matrix = \ dom dim bits -> weighted (when_small (Worker (Matrix { monotone = Weak,domain = dom,dim = dim,bits = bits,tracing = False,solver = solver})));kbo = \ b -> weighted (when_small (Worker (KBO { bits = b,solver = solver})));mb = Worker (Matchbound { method = RFC,max_size = 100000});remove = First_Of ([ Worker (Weight { modus = mo})] <> ([ Seq [ qpi 2 4, qpi 3 4, qpi 4 4], Seq [ qpi 5 4, qpi 6 3, qpi 7 3]] <> ([ matrix Arctic 4 3, matrix Natural 4 3] <> [ kbo 1, And_Then (Worker Mirror) (kbo 1)])));remove_tile = Seq [ remove, tiling Overlap 3];dp = As_Transformer (Apply (And_Then (Worker (DP { tracing = False})) (Worker Remap)) (Apply wop (Branch (Worker (EDG { tracing = False})) remove_tile)));noh = [ Timeout 10 (Worker (Enumerate { closure = Forward})), Timeout 10 (Worker (Enumerate { closure = Backward}))];yeah = Tree_Search_Preemptive 0 done [ Worker (Weight { modus = mo}), mb, And_Then (Worker Mirror) mb, dp, And_Then (Worker Mirror) dp]} 42.22/10.70 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 42.91/10.86 EOF