4.09/1.09 YES 4.09/1.09 property Termination 4.09/1.09 has value True 4.09/1.09 for SRS ( [a] -> [], [a, b] -> [b, b, a, a, c], [b] -> [], [c, a, c] -> []) 4.09/1.09 reason 4.09/1.09 remap for 4 rules 4.09/1.10 property Termination 4.09/1.10 has value True 4.09/1.10 for SRS ( [0] -> [], [0, 1] -> [1, 1, 0, 0, 2], [1] -> [], [2, 0, 2] -> []) 4.09/1.10 reason 4.09/1.10 reverse each lhs and rhs 4.09/1.10 property Termination 4.09/1.10 has value True 4.09/1.11 for SRS ( [0] -> [], [1, 0] -> [2, 0, 0, 1, 1], [1] -> [], [2, 0, 2] -> []) 4.09/1.11 reason 4.09/1.11 DP transform 4.09/1.11 property Termination 4.09/1.11 has value True 4.09/1.11 for SRS ( [0] ->= [], [1, 0] ->= [2, 0, 0, 1, 1], [1] ->= [], [2, 0, 2] ->= [], [1#, 0] |-> [2#, 0, 0, 1, 1], [1#, 0] |-> [0#, 0, 1, 1], [1#, 0] |-> [0#, 1, 1], [1#, 0] |-> [1#, 1], [1#, 0] |-> [1#]) 4.09/1.11 reason 4.09/1.11 remap for 9 rules 4.09/1.11 property Termination 4.09/1.11 has value True 4.09/1.11 for SRS ( [0] ->= [], [1, 0] ->= [2, 0, 0, 1, 1], [1] ->= [], [2, 0, 2] ->= [], [3, 0] |-> [4, 0, 0, 1, 1], [3, 0] |-> [5, 0, 1, 1], [3, 0] |-> [5, 1, 1], [3, 0] |-> [3, 1], [3, 0] |-> [3]) 4.09/1.11 reason 4.09/1.11 weights 4.09/1.12 Map [(3, 3/1)] 4.09/1.12 4.09/1.12 property Termination 4.09/1.12 has value True 4.09/1.12 for SRS ( [0] ->= [], [1, 0] ->= [2, 0, 0, 1, 1], [1] ->= [], [2, 0, 2] ->= [], [3, 0] |-> [3, 1], [3, 0] |-> [3]) 4.09/1.12 reason 4.09/1.12 EDG has 1 SCCs 4.09/1.12 property Termination 4.09/1.12 has value True 4.37/1.12 for SRS ( [3, 0] |-> [3, 1], [3, 0] |-> [3], [0] ->= [], [1, 0] ->= [2, 0, 0, 1, 1], [1] ->= [], [2, 0, 2] ->= []) 4.37/1.12 reason 4.37/1.12 Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 3, solver = Minisatapi, verbose = False, tracing = True} 4.37/1.12 interpretation 4.37/1.12 0 / 0A 3A 3A \ 4.37/1.12 | 0A 3A 3A | 4.37/1.12 \ 0A 0A 0A / 4.37/1.12 1 / 0A 3A 3A \ 4.37/1.12 | -3A 0A 0A | 4.37/1.13 \ -3A 0A 0A / 4.37/1.13 2 / 0A 0A 0A \ 4.37/1.13 | -3A -3A 0A | 4.37/1.13 \ -3A -3A -3A / 4.37/1.13 3 / 12A 13A 15A \ 4.37/1.13 | 12A 13A 15A | 4.37/1.13 \ 12A 13A 15A / 4.37/1.13 [3, 0] |-> [3, 1] 4.37/1.13 lhs rhs ge gt 4.37/1.13 / 15A 16A 16A \ / 12A 15A 15A \ True True 4.37/1.13 | 15A 16A 16A | | 12A 15A 15A | 4.37/1.13 \ 15A 16A 16A / \ 12A 15A 15A / 4.37/1.13 [3, 0] |-> [3] 4.37/1.13 lhs rhs ge gt 4.37/1.13 / 15A 16A 16A \ / 12A 13A 15A \ True True 4.37/1.13 | 15A 16A 16A | | 12A 13A 15A | 4.37/1.13 \ 15A 16A 16A / \ 12A 13A 15A / 4.37/1.13 [0] ->= [] 4.37/1.13 lhs rhs ge gt 4.37/1.13 / 0A 3A 3A \ / 0A - - \ True False 4.37/1.13 | 0A 3A 3A | | - 0A - | 4.37/1.13 \ 0A 0A 0A / \ - - 0A / 4.37/1.13 [1, 0] ->= [2, 0, 0, 1, 1] 4.37/1.13 lhs rhs ge gt 4.37/1.13 / 3A 6A 6A \ / 3A 6A 6A \ True False 4.37/1.13 | 0A 3A 3A | | 0A 3A 3A | 4.37/1.13 \ 0A 3A 3A / \ 0A 3A 3A / 4.37/1.13 [1] ->= [] 4.37/1.13 lhs rhs ge gt 4.37/1.13 / 0A 3A 3A \ / 0A - - \ True False 4.37/1.13 | -3A 0A 0A | | - 0A - | 4.37/1.13 \ -3A 0A 0A / \ - - 0A / 4.37/1.13 [2, 0, 2] ->= [] 4.37/1.13 lhs rhs ge gt 4.37/1.13 / 0A 0A 3A \ / 0A - - \ True False 4.37/1.13 | 0A 0A 0A | | - 0A - | 4.37/1.13 \ -3A -3A 0A / \ - - 0A / 4.37/1.13 property Termination 4.37/1.13 has value True 4.37/1.13 for SRS ( [0] ->= [], [1, 0] ->= [2, 0, 0, 1, 1], [1] ->= [], [2, 0, 2] ->= []) 4.37/1.13 reason 4.37/1.13 EDG has 0 SCCs 4.37/1.13 4.37/1.13 ************************************************** 4.37/1.13 summary 4.37/1.13 ************************************************** 4.37/1.14 SRS with 4 rules on 3 letters Remap { tracing = False} 4.37/1.14 SRS with 4 rules on 3 letters reverse each lhs and rhs 4.37/1.14 SRS with 4 rules on 3 letters DP transform 4.37/1.14 SRS with 9 rules on 6 letters Remap { tracing = False} 4.37/1.14 SRS with 9 rules on 6 letters weights 4.37/1.14 SRS with 6 rules on 4 letters EDG 4.37/1.14 SRS with 6 rules on 4 letters Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 3, solver = Minisatapi, verbose = False, tracing = True} 4.37/1.14 SRS with 4 rules on 3 letters EDG 4.37/1.14 4.37/1.14 ************************************************** 4.37/1.14 (4, 3)\Deepee(9, 6)\Weight(6, 4)\Matrix{\Arctic}{3}(4, 3)\EDG[] 4.37/1.14 ************************************************** 4.57/1.21 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]} 4.57/1.21 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 4.80/1.25 EOF