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