7.85/2.01 YES 7.85/2.02 property Termination 7.85/2.02 has value True 7.85/2.02 for SRS ( [a, a, b] -> [c, a, c, a, a], [a, c] -> [b, a]) 7.85/2.02 reason 7.85/2.02 remap for 2 rules 7.85/2.02 property Termination 7.85/2.02 has value True 7.85/2.02 for SRS ( [0, 0, 1] -> [2, 0, 2, 0, 0], [0, 2] -> [1, 0]) 7.85/2.02 reason 7.85/2.02 reverse each lhs and rhs 7.85/2.02 property Termination 7.85/2.02 has value True 7.85/2.02 for SRS ( [1, 0, 0] -> [0, 0, 2, 0, 2], [2, 0] -> [0, 1]) 7.85/2.02 reason 7.85/2.02 DP transform 7.85/2.02 property Termination 7.85/2.02 has value True 7.85/2.02 for SRS ( [1, 0, 0] ->= [0, 0, 2, 0, 2], [2, 0] ->= [0, 1], [1#, 0, 0] |-> [2#, 0, 2], [1#, 0, 0] |-> [2#], [2#, 0] |-> [1#]) 7.85/2.02 reason 7.85/2.04 remap for 5 rules 7.85/2.04 property Termination 7.85/2.05 has value True 8.15/2.10 for SRS ( [0, 1, 1] ->= [1, 1, 2, 1, 2], [2, 1] ->= [1, 0], [3, 1, 1] |-> [4, 1, 2], [3, 1, 1] |-> [4], [4, 1] |-> [3]) 8.15/2.10 reason 8.15/2.10 EDG has 1 SCCs 8.15/2.10 property Termination 8.15/2.10 has value True 8.15/2.10 for SRS ( [3, 1, 1] |-> [4, 1, 2], [4, 1] |-> [3], [3, 1, 1] |-> [4], [0, 1, 1] ->= [1, 1, 2, 1, 2], [2, 1] ->= [1, 0]) 8.15/2.10 reason 8.15/2.10 Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 3, solver = Minisatapi, verbose = False, tracing = True} 8.15/2.10 interpretation 8.15/2.10 0 / 0A 0A 3A \ 8.15/2.10 | -3A -3A 0A | 8.15/2.10 \ -3A -3A 0A / 8.15/2.10 1 / 0A 0A 3A \ 8.15/2.10 | 0A 0A 0A | 8.15/2.10 \ -3A 0A 0A / 8.15/2.10 2 / 0A 0A 0A \ 8.15/2.10 | 0A 0A 0A | 8.15/2.10 \ -3A -3A -3A / 8.15/2.10 3 / 29A 31A 32A \ 8.15/2.10 | 29A 31A 32A | 8.15/2.10 \ 29A 31A 32A / 8.15/2.10 4 / 32A 32A 32A \ 8.15/2.10 | 32A 32A 32A | 8.15/2.10 \ 32A 32A 32A / 8.15/2.10 [3, 1, 1] |-> [4, 1, 2] 8.15/2.10 lhs rhs ge gt 8.15/2.10 / 32A 32A 34A \ / 32A 32A 32A \ True False 8.15/2.10 | 32A 32A 34A | | 32A 32A 32A | 8.15/2.10 \ 32A 32A 34A / \ 32A 32A 32A / 8.15/2.10 [4, 1] |-> [3] 8.15/2.10 lhs rhs ge gt 8.15/2.10 / 32A 32A 35A \ / 29A 31A 32A \ True True 8.15/2.10 | 32A 32A 35A | | 29A 31A 32A | 8.15/2.10 \ 32A 32A 35A / \ 29A 31A 32A / 8.15/2.10 [3, 1, 1] |-> [4] 8.15/2.10 lhs rhs ge gt 8.15/2.10 / 32A 32A 34A \ / 32A 32A 32A \ True False 8.15/2.10 | 32A 32A 34A | | 32A 32A 32A | 8.15/2.10 \ 32A 32A 34A / \ 32A 32A 32A / 8.15/2.10 [0, 1, 1] ->= [1, 1, 2, 1, 2] 8.15/2.10 lhs rhs ge gt 8.15/2.10 / 3A 3A 3A \ / 3A 3A 3A \ True False 8.15/2.10 | 0A 0A 0A | | 0A 0A 0A | 8.15/2.10 \ 0A 0A 0A / \ 0A 0A 0A / 8.15/2.10 [2, 1] ->= [1, 0] 8.15/2.10 lhs rhs ge gt 8.15/2.10 / 0A 0A 3A \ / 0A 0A 3A \ True False 8.15/2.10 | 0A 0A 3A | | 0A 0A 3A | 8.15/2.10 \ -3A -3A 0A / \ -3A -3A 0A / 8.15/2.10 property Termination 8.15/2.10 has value True 8.15/2.10 for SRS ( [3, 1, 1] |-> [4, 1, 2], [3, 1, 1] |-> [4], [0, 1, 1] ->= [1, 1, 2, 1, 2], [2, 1] ->= [1, 0]) 8.15/2.10 reason 8.15/2.10 weights 8.15/2.10 Map [(3, 2/1)] 8.15/2.10 8.15/2.10 property Termination 8.15/2.10 has value True 8.15/2.10 for SRS ( [0, 1, 1] ->= [1, 1, 2, 1, 2], [2, 1] ->= [1, 0]) 8.15/2.10 reason 8.15/2.10 EDG has 0 SCCs 8.15/2.10 8.15/2.10 ************************************************** 8.15/2.10 summary 8.15/2.10 ************************************************** 8.15/2.10 SRS with 2 rules on 3 letters Remap { tracing = False} 8.15/2.10 SRS with 2 rules on 3 letters reverse each lhs and rhs 8.15/2.10 SRS with 2 rules on 3 letters DP transform 8.15/2.10 SRS with 5 rules on 5 letters Remap { tracing = False} 8.15/2.10 SRS with 5 rules on 5 letters EDG 8.15/2.10 SRS with 5 rules on 5 letters Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 3, solver = Minisatapi, verbose = False, tracing = True} 8.15/2.10 SRS with 4 rules on 5 letters weights 8.15/2.10 SRS with 2 rules on 3 letters EDG 8.15/2.10 8.15/2.10 ************************************************** 8.15/2.10 (2, 3)\Deepee(5, 5)\Matrix{\Arctic}{3}(4, 5)\Weight(2, 3)\EDG[] 8.15/2.10 ************************************************** 8.51/2.17 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]} 8.51/2.17 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 8.51/2.22 EOF