5.09/1.37 YES 5.09/1.37 property Termination 5.09/1.37 has value True 5.09/1.37 for SRS ( [a] -> [], [a, a, b] -> [b, a, b, a, a], [b, b] -> [b]) 5.09/1.37 reason 5.09/1.37 remap for 3 rules 5.09/1.37 property Termination 5.09/1.37 has value True 5.09/1.37 for SRS ( [0] -> [], [0, 0, 1] -> [1, 0, 1, 0, 0], [1, 1] -> [1]) 5.09/1.37 reason 5.09/1.37 reverse each lhs and rhs 5.09/1.37 property Termination 5.09/1.37 has value True 5.09/1.37 for SRS ( [0] -> [], [1, 0, 0] -> [0, 0, 1, 0, 1], [1, 1] -> [1]) 5.09/1.37 reason 5.09/1.37 DP transform 5.09/1.37 property Termination 5.09/1.37 has value True 5.09/1.37 for SRS ( [0] ->= [], [1, 0, 0] ->= [0, 0, 1, 0, 1], [1, 1] ->= [1], [1#, 0, 0] |-> [0#, 0, 1, 0, 1], [1#, 0, 0] |-> [0#, 1, 0, 1], [1#, 0, 0] |-> [1#, 0, 1], [1#, 0, 0] |-> [0#, 1], [1#, 0, 0] |-> [1#]) 5.09/1.37 reason 5.09/1.37 remap for 8 rules 5.09/1.37 property Termination 5.09/1.37 has value True 5.09/1.37 for SRS ( [0] ->= [], [1, 0, 0] ->= [0, 0, 1, 0, 1], [1, 1] ->= [1], [2, 0, 0] |-> [3, 0, 1, 0, 1], [2, 0, 0] |-> [3, 1, 0, 1], [2, 0, 0] |-> [2, 0, 1], [2, 0, 0] |-> [3, 1], [2, 0, 0] |-> [2]) 5.09/1.37 reason 5.09/1.37 weights 5.09/1.37 Map [(2, 3/1)] 5.09/1.37 5.09/1.37 property Termination 5.09/1.37 has value True 5.09/1.37 for SRS ( [0] ->= [], [1, 0, 0] ->= [0, 0, 1, 0, 1], [1, 1] ->= [1], [2, 0, 0] |-> [2, 0, 1], [2, 0, 0] |-> [2]) 5.09/1.37 reason 5.09/1.37 EDG has 1 SCCs 5.09/1.37 property Termination 5.09/1.37 has value True 5.09/1.37 for SRS ( [2, 0, 0] |-> [2, 0, 1], [2, 0, 0] |-> [2], [0] ->= [], [1, 0, 0] ->= [0, 0, 1, 0, 1], [1, 1] ->= [1]) 5.09/1.37 reason 5.09/1.37 Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 5.40/1.39 interpretation 5.40/1.39 0 / 0A 2A \ 5.40/1.39 \ 0A 0A / 5.40/1.39 1 / 0A 0A \ 5.40/1.39 \ -2A -2A / 5.40/1.39 2 / 4A 6A \ 5.40/1.39 \ 4A 6A / 5.40/1.39 [2, 0, 0] |-> [2, 0, 1] 5.40/1.39 lhs rhs ge gt 5.40/1.39 / 6A 8A \ / 6A 6A \ True False 5.40/1.39 \ 6A 8A / \ 6A 6A / 5.40/1.39 [2, 0, 0] |-> [2] 5.40/1.39 lhs rhs ge gt 5.40/1.39 / 6A 8A \ / 4A 6A \ True True 5.40/1.39 \ 6A 8A / \ 4A 6A / 5.40/1.39 [0] ->= [] 5.40/1.39 lhs rhs ge gt 5.40/1.39 / 0A 2A \ / 0A - \ True False 5.40/1.39 \ 0A 0A / \ - 0A / 5.40/1.39 [1, 0, 0] ->= [0, 0, 1, 0, 1] 5.40/1.39 lhs rhs ge gt 5.40/1.39 / 2A 2A \ / 2A 2A \ True False 5.40/1.39 \ 0A 0A / \ 0A 0A / 5.40/1.39 [1, 1] ->= [1] 5.40/1.39 lhs rhs ge gt 5.40/1.39 / 0A 0A \ / 0A 0A \ True False 5.40/1.39 \ -2A -2A / \ -2A -2A / 5.40/1.39 property Termination 5.40/1.39 has value True 5.40/1.39 for SRS ( [2, 0, 0] |-> [2, 0, 1], [0] ->= [], [1, 0, 0] ->= [0, 0, 1, 0, 1], [1, 1] ->= [1]) 5.40/1.39 reason 5.40/1.39 EDG has 1 SCCs 5.40/1.39 property Termination 5.40/1.39 has value True 5.40/1.39 for SRS ( [2, 0, 0] |-> [2, 0, 1], [0] ->= [], [1, 0, 0] ->= [0, 0, 1, 0, 1], [1, 1] ->= [1]) 5.40/1.39 reason 5.40/1.39 Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 5.40/1.39 interpretation 5.40/1.39 0 / 0A 2A \ 5.40/1.39 \ 0A 0A / 5.40/1.39 1 / 0A 0A \ 5.40/1.39 \ -2A -2A / 5.40/1.39 2 / 10A 10A \ 5.40/1.39 \ 10A 10A / 5.40/1.39 [2, 0, 0] |-> [2, 0, 1] 5.40/1.39 lhs rhs ge gt 5.40/1.39 / 12A 12A \ / 10A 10A \ True True 5.40/1.39 \ 12A 12A / \ 10A 10A / 5.40/1.39 [0] ->= [] 5.40/1.39 lhs rhs ge gt 5.40/1.39 / 0A 2A \ / 0A - \ True False 5.40/1.39 \ 0A 0A / \ - 0A / 5.40/1.39 [1, 0, 0] ->= [0, 0, 1, 0, 1] 5.40/1.39 lhs rhs ge gt 5.40/1.39 / 2A 2A \ / 2A 2A \ True False 5.40/1.39 \ 0A 0A / \ 0A 0A / 5.40/1.39 [1, 1] ->= [1] 5.40/1.39 lhs rhs ge gt 5.40/1.39 / 0A 0A \ / 0A 0A \ True False 5.40/1.39 \ -2A -2A / \ -2A -2A / 5.40/1.39 property Termination 5.40/1.39 has value True 5.40/1.39 for SRS ( [0] ->= [], [1, 0, 0] ->= [0, 0, 1, 0, 1], [1, 1] ->= [1]) 5.40/1.39 reason 5.40/1.39 EDG has 0 SCCs 5.40/1.39 5.40/1.39 ************************************************** 5.40/1.39 summary 5.40/1.39 ************************************************** 5.40/1.39 SRS with 3 rules on 2 letters Remap { tracing = False} 5.40/1.39 SRS with 3 rules on 2 letters reverse each lhs and rhs 5.40/1.39 SRS with 3 rules on 2 letters DP transform 5.40/1.40 SRS with 8 rules on 4 letters Remap { tracing = False} 5.40/1.41 SRS with 8 rules on 4 letters weights 5.40/1.43 SRS with 5 rules on 3 letters EDG 5.40/1.44 SRS with 5 rules on 3 letters Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 5.40/1.44 SRS with 4 rules on 3 letters EDG 5.40/1.44 SRS with 4 rules on 3 letters Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 5.40/1.44 SRS with 3 rules on 2 letters EDG 5.40/1.44 5.40/1.44 ************************************************** 5.40/1.44 (3, 2)\Deepee(8, 4)\Weight(5, 3)\Matrix{\Arctic}{2}(4, 3)\Matrix{\Arctic}{2}(3, 2)\EDG[] 5.40/1.44 ************************************************** 7.06/1.87 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.06/1.87 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 7.37/1.92 EOF