5.14/1.37 YES 5.14/1.37 property Termination 5.14/1.37 has value True 5.14/1.37 for SRS ( [a] -> [], [a, a, b] -> [c, c, b, a], [b, c] -> [a, b]) 5.14/1.37 reason 5.14/1.37 remap for 3 rules 5.14/1.37 property Termination 5.14/1.37 has value True 5.39/1.37 for SRS ( [0] -> [], [0, 0, 1] -> [2, 2, 1, 0], [1, 2] -> [0, 1]) 5.39/1.37 reason 5.39/1.37 reverse each lhs and rhs 5.39/1.37 property Termination 5.39/1.37 has value True 5.39/1.37 for SRS ( [0] -> [], [1, 0, 0] -> [0, 1, 2, 2], [2, 1] -> [1, 0]) 5.39/1.37 reason 5.39/1.37 DP transform 5.39/1.37 property Termination 5.39/1.37 has value True 5.39/1.37 for SRS ( [0] ->= [], [1, 0, 0] ->= [0, 1, 2, 2], [2, 1] ->= [1, 0], [1#, 0, 0] |-> [0#, 1, 2, 2], [1#, 0, 0] |-> [1#, 2, 2], [1#, 0, 0] |-> [2#, 2], [1#, 0, 0] |-> [2#], [2#, 1] |-> [1#, 0], [2#, 1] |-> [0#]) 5.39/1.37 reason 5.39/1.37 remap for 9 rules 5.39/1.37 property Termination 5.39/1.37 has value True 5.39/1.40 for SRS ( [0] ->= [], [1, 0, 0] ->= [0, 1, 2, 2], [2, 1] ->= [1, 0], [3, 0, 0] |-> [4, 1, 2, 2], [3, 0, 0] |-> [3, 2, 2], [3, 0, 0] |-> [5, 2], [3, 0, 0] |-> [5], [5, 1] |-> [3, 0], [5, 1] |-> [4]) 5.39/1.40 reason 5.39/1.40 weights 5.39/1.40 Map [(1, 2/1), (3, 3/1), (5, 2/1)] 5.39/1.40 5.39/1.40 property Termination 5.39/1.40 has value True 5.39/1.40 for SRS ( [0] ->= [], [1, 0, 0] ->= [0, 1, 2, 2], [2, 1] ->= [1, 0], [3, 0, 0] |-> [3, 2, 2]) 5.39/1.40 reason 5.39/1.40 EDG has 1 SCCs 5.39/1.40 property Termination 5.39/1.40 has value True 5.39/1.40 for SRS ( [3, 0, 0] |-> [3, 2, 2], [0] ->= [], [1, 0, 0] ->= [0, 1, 2, 2], [2, 1] ->= [1, 0]) 5.39/1.40 reason 5.39/1.40 Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 3, solver = Minisatapi, verbose = False, tracing = True} 5.39/1.40 interpretation 5.39/1.40 0 / 0A 0A 3A \ 5.39/1.40 | 0A 0A 0A | 5.39/1.40 \ -3A -3A 0A / 5.39/1.40 1 / 21A 24A 24A \ 5.39/1.40 | 21A 21A 24A | 5.39/1.40 \ 21A 21A 24A / 5.39/1.43 2 / 0A 0A 3A \ 5.39/1.44 | -3A -3A 0A | 5.39/1.44 \ -3A -3A 0A / 5.39/1.45 3 / 37A 40A 40A \ 5.39/1.45 | 37A 40A 40A | 5.39/1.45 \ 37A 40A 40A / 5.85/1.51 [3, 0, 0] |-> [3, 2, 2] 5.85/1.51 lhs rhs ge gt 6.00/1.52 / 40A 40A 43A \ / 37A 37A 40A \ True True 6.03/1.54 | 40A 40A 43A | | 37A 37A 40A | 6.03/1.54 \ 40A 40A 43A / \ 37A 37A 40A / 6.03/1.55 [0] ->= [] 6.03/1.56 lhs rhs ge gt 6.03/1.57 / 0A 0A 3A \ / 0A - - \ True False 6.03/1.57 | 0A 0A 0A | | - 0A - | 6.03/1.57 \ -3A -3A 0A / \ - - 0A / 6.03/1.57 [1, 0, 0] ->= [0, 1, 2, 2] 6.03/1.57 lhs rhs ge gt 6.03/1.57 / 24A 24A 27A \ / 24A 24A 27A \ True False 6.03/1.57 | 21A 21A 24A | | 21A 21A 24A | 6.03/1.57 \ 21A 21A 24A / \ 21A 21A 24A / 6.03/1.57 [2, 1] ->= [1, 0] 6.03/1.57 lhs rhs ge gt 6.03/1.57 / 24A 24A 27A \ / 24A 24A 24A \ True False 6.03/1.57 | 21A 21A 24A | | 21A 21A 24A | 6.03/1.57 \ 21A 21A 24A / \ 21A 21A 24A / 6.03/1.57 property Termination 6.03/1.57 has value True 6.03/1.57 for SRS ( [0] ->= [], [1, 0, 0] ->= [0, 1, 2, 2], [2, 1] ->= [1, 0]) 6.03/1.57 reason 6.03/1.57 EDG has 0 SCCs 6.03/1.57 6.03/1.57 ************************************************** 6.03/1.57 summary 6.03/1.57 ************************************************** 6.03/1.57 SRS with 3 rules on 3 letters Remap { tracing = False} 6.03/1.57 SRS with 3 rules on 3 letters reverse each lhs and rhs 6.03/1.57 SRS with 3 rules on 3 letters DP transform 6.03/1.57 SRS with 9 rules on 6 letters Remap { tracing = False} 6.03/1.57 SRS with 9 rules on 6 letters weights 6.03/1.57 SRS with 4 rules on 4 letters EDG 6.03/1.57 SRS with 4 rules on 4 letters Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 3, solver = Minisatapi, verbose = False, tracing = True} 6.03/1.57 SRS with 3 rules on 3 letters EDG 6.03/1.57 6.03/1.59 ************************************************** 7.04/1.80 (3, 3)\Deepee(9, 6)\Weight(4, 4)\Matrix{\Arctic}{3}(3, 3)\EDG[] 7.04/1.80 ************************************************** 7.14/1.82 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]} 7.14/1.82 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 7.20/1.85 EOF