8.24/2.09 YES 8.24/2.09 property Termination 8.24/2.09 has value True 8.24/2.09 for SRS ( [a, b] -> [], [a, b, c] -> [b, c, b, c, a, a, b]) 8.24/2.09 reason 8.24/2.09 remap for 2 rules 8.24/2.09 property Termination 8.24/2.09 has value True 8.24/2.09 for SRS ( [0, 1] -> [], [0, 1, 2] -> [1, 2, 1, 2, 0, 0, 1]) 8.24/2.09 reason 8.24/2.09 reverse each lhs and rhs 8.24/2.09 property Termination 8.24/2.09 has value True 8.24/2.09 for SRS ( [1, 0] -> [], [2, 1, 0] -> [1, 0, 0, 2, 1, 2, 1]) 8.24/2.09 reason 8.24/2.09 DP transform 8.24/2.09 property Termination 8.24/2.09 has value True 8.24/2.09 for SRS ( [1, 0] ->= [], [2, 1, 0] ->= [1, 0, 0, 2, 1, 2, 1], [2#, 1, 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#]) 8.24/2.09 reason 8.24/2.09 remap for 7 rules 8.24/2.09 property Termination 8.24/2.09 has value True 8.24/2.09 for SRS ( [0, 1] ->= [], [2, 0, 1] ->= [0, 1, 1, 2, 0, 2, 0], [3, 0, 1] |-> [4, 1, 1, 2, 0, 2, 0], [3, 0, 1] |-> [3, 0, 2, 0], [3, 0, 1] |-> [4, 2, 0], [3, 0, 1] |-> [3, 0], [3, 0, 1] |-> [4]) 8.24/2.09 reason 8.24/2.09 weights 8.24/2.09 Map [(3, 3/1)] 8.24/2.09 8.24/2.09 property Termination 8.24/2.09 has value True 8.24/2.09 for SRS ( [0, 1] ->= [], [2, 0, 1] ->= [0, 1, 1, 2, 0, 2, 0], [3, 0, 1] |-> [3, 0, 2, 0], [3, 0, 1] |-> [3, 0]) 8.24/2.09 reason 8.24/2.09 EDG has 1 SCCs 8.24/2.09 property Termination 8.24/2.09 has value True 8.24/2.09 for SRS ( [3, 0, 1] |-> [3, 0, 2, 0], [3, 0, 1] |-> [3, 0], [0, 1] ->= [], [2, 0, 1] ->= [0, 1, 1, 2, 0, 2, 0]) 8.24/2.09 reason 8.24/2.09 Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 3, solver = Minisatapi, verbose = False, tracing = True} 8.24/2.09 interpretation 8.24/2.09 0 / 0A 0A 0A \ 8.24/2.09 | -3A -3A 0A | 8.24/2.09 \ -3A -3A -3A / 8.24/2.09 1 / 0A 3A 3A \ 8.24/2.09 | 0A 0A 3A | 8.24/2.09 \ 0A 0A 3A / 8.24/2.09 2 / 0A 3A 3A \ 8.24/2.09 | 0A 3A 3A | 8.24/2.09 \ -3A 0A 0A / 8.24/2.09 3 / 15A 17A 17A \ 8.24/2.09 | 15A 17A 17A | 8.24/2.09 \ 15A 17A 17A / 8.24/2.09 [3, 0, 1] |-> [3, 0, 2, 0] 8.24/2.09 lhs rhs ge gt 8.24/2.09 / 17A 18A 20A \ / 15A 15A 18A \ True True 8.24/2.09 | 17A 18A 20A | | 15A 15A 18A | 8.24/2.09 \ 17A 18A 20A / \ 15A 15A 18A / 8.24/2.09 [3, 0, 1] |-> [3, 0] 8.24/2.09 lhs rhs ge gt 8.24/2.09 / 17A 18A 20A \ / 15A 15A 17A \ True True 8.24/2.09 | 17A 18A 20A | | 15A 15A 17A | 8.24/2.09 \ 17A 18A 20A / \ 15A 15A 17A / 8.24/2.09 [0, 1] ->= [] 8.24/2.09 lhs rhs ge gt 8.24/2.09 / 0A 3A 3A \ / 0A - - \ True False 8.24/2.09 | 0A 0A 3A | | - 0A - | 8.24/2.09 \ -3A 0A 0A / \ - - 0A / 8.24/2.09 [2, 0, 1] ->= [0, 1, 1, 2, 0, 2, 0] 8.24/2.09 lhs rhs ge gt 8.24/2.09 / 3A 3A 6A \ / 3A 3A 6A \ True False 8.24/2.09 | 3A 3A 6A | | 3A 3A 6A | 8.24/2.09 \ 0A 0A 3A / \ 0A 0A 3A / 8.24/2.09 property Termination 8.24/2.09 has value True 8.24/2.09 for SRS ( [0, 1] ->= [], [2, 0, 1] ->= [0, 1, 1, 2, 0, 2, 0]) 8.24/2.09 reason 8.24/2.09 EDG has 0 SCCs 8.24/2.09 8.24/2.09 ************************************************** 8.24/2.09 summary 8.24/2.09 ************************************************** 8.24/2.09 SRS with 2 rules on 3 letters Remap { tracing = False} 8.24/2.09 SRS with 2 rules on 3 letters reverse each lhs and rhs 8.24/2.09 SRS with 2 rules on 3 letters DP transform 8.24/2.09 SRS with 7 rules on 5 letters Remap { tracing = False} 8.24/2.09 SRS with 7 rules on 5 letters weights 8.24/2.09 SRS with 4 rules on 4 letters EDG 8.24/2.09 SRS with 4 rules on 4 letters Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 3, solver = Minisatapi, verbose = False, tracing = True} 8.24/2.09 SRS with 2 rules on 3 letters EDG 8.24/2.09 8.24/2.09 ************************************************** 8.24/2.09 (2, 3)\Deepee(7, 5)\Weight(4, 4)\Matrix{\Arctic}{3}(2, 3)\EDG[] 8.24/2.09 ************************************************** 10.87/2.78 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]} 10.87/2.78 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 10.87/2.81 EOF