4.01/1.04 YES 4.01/1.05 property Termination 4.01/1.05 has value True 4.01/1.05 for SRS ( [a] -> [b], [a, a] -> [a, b, a, c], [c, b, b] -> [a]) 4.01/1.05 reason 4.01/1.05 remap for 3 rules 4.01/1.05 property Termination 4.01/1.05 has value True 4.01/1.05 for SRS ( [0] -> [1], [0, 0] -> [0, 1, 0, 2], [2, 1, 1] -> [0]) 4.01/1.05 reason 4.01/1.05 DP transform 4.01/1.05 property Termination 4.01/1.05 has value True 4.01/1.05 for SRS ( [0] ->= [1], [0, 0] ->= [0, 1, 0, 2], [2, 1, 1] ->= [0], [0#, 0] |-> [0#, 1, 0, 2], [0#, 0] |-> [0#, 2], [0#, 0] |-> [2#], [2#, 1, 1] |-> [0#]) 4.01/1.05 reason 4.01/1.05 remap for 7 rules 4.01/1.05 property Termination 4.01/1.05 has value True 4.01/1.06 for SRS ( [0] ->= [1], [0, 0] ->= [0, 1, 0, 2], [2, 1, 1] ->= [0], [3, 0] |-> [3, 1, 0, 2], [3, 0] |-> [3, 2], [3, 0] |-> [4], [4, 1, 1] |-> [3]) 4.01/1.06 reason 4.01/1.07 EDG has 1 SCCs 4.01/1.07 property Termination 4.01/1.07 has value True 4.01/1.08 for SRS ( [4, 1, 1] |-> [3], [3, 0] |-> [4], [3, 0] |-> [3, 2], [0] ->= [1], [0, 0] ->= [0, 1, 0, 2], [2, 1, 1] ->= [0]) 4.01/1.08 reason 4.01/1.08 Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 4.01/1.08 interpretation 4.01/1.08 0 / 2A 2A \ 4.01/1.08 \ 0A 0A / 4.01/1.08 1 / 0A 2A \ 4.01/1.08 \ 0A 0A / 4.01/1.08 2 / 0A 0A \ 4.01/1.08 \ -2A 0A / 4.01/1.08 3 / 27A 29A \ 4.01/1.08 \ 27A 29A / 4.01/1.08 4 / 25A 27A \ 4.01/1.08 \ 25A 27A / 4.01/1.08 [4, 1, 1] |-> [3] 4.01/1.08 lhs rhs ge gt 4.01/1.08 / 27A 29A \ / 27A 29A \ True False 4.01/1.08 \ 27A 29A / \ 27A 29A / 4.01/1.08 [3, 0] |-> [4] 4.01/1.08 lhs rhs ge gt 4.01/1.08 / 29A 29A \ / 25A 27A \ True True 4.01/1.08 \ 29A 29A / \ 25A 27A / 4.01/1.08 [3, 0] |-> [3, 2] 4.01/1.08 lhs rhs ge gt 4.01/1.08 / 29A 29A \ / 27A 29A \ True False 4.01/1.08 \ 29A 29A / \ 27A 29A / 4.01/1.08 [0] ->= [1] 4.01/1.08 lhs rhs ge gt 4.01/1.08 / 2A 2A \ / 0A 2A \ True False 4.01/1.08 \ 0A 0A / \ 0A 0A / 4.01/1.08 [0, 0] ->= [0, 1, 0, 2] 4.01/1.08 lhs rhs ge gt 4.01/1.08 / 4A 4A \ / 4A 4A \ True False 4.01/1.08 \ 2A 2A / \ 2A 2A / 4.01/1.08 [2, 1, 1] ->= [0] 4.01/1.08 lhs rhs ge gt 4.01/1.08 / 2A 2A \ / 2A 2A \ True False 4.01/1.08 \ 0A 2A / \ 0A 0A / 4.01/1.08 property Termination 4.01/1.08 has value True 4.24/1.09 for SRS ( [4, 1, 1] |-> [3], [3, 0] |-> [3, 2], [0] ->= [1], [0, 0] ->= [0, 1, 0, 2], [2, 1, 1] ->= [0]) 4.24/1.09 reason 4.24/1.09 weights 4.24/1.09 Map [(4, 1/1)] 4.24/1.09 4.24/1.09 property Termination 4.24/1.09 has value True 4.24/1.09 for SRS ( [3, 0] |-> [3, 2], [0] ->= [1], [0, 0] ->= [0, 1, 0, 2], [2, 1, 1] ->= [0]) 4.24/1.09 reason 4.24/1.09 EDG has 1 SCCs 4.24/1.09 property Termination 4.24/1.09 has value True 4.24/1.09 for SRS ( [3, 0] |-> [3, 2], [0] ->= [1], [0, 0] ->= [0, 1, 0, 2], [2, 1, 1] ->= [0]) 4.24/1.09 reason 4.24/1.10 Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 4.24/1.10 interpretation 4.24/1.10 0 / 2A 2A \ 4.24/1.10 \ 0A 0A / 4.24/1.10 1 / 0A 2A \ 4.24/1.10 \ 0A 0A / 4.24/1.10 2 / 0A 0A \ 4.24/1.10 \ -2A -2A / 4.24/1.10 3 / 4A 5A \ 4.24/1.10 \ 4A 5A / 4.24/1.10 [3, 0] |-> [3, 2] 4.24/1.10 lhs rhs ge gt 4.24/1.10 / 6A 6A \ / 4A 4A \ True True 4.24/1.10 \ 6A 6A / \ 4A 4A / 4.24/1.10 [0] ->= [1] 4.24/1.10 lhs rhs ge gt 4.24/1.10 / 2A 2A \ / 0A 2A \ True False 4.24/1.10 \ 0A 0A / \ 0A 0A / 4.24/1.10 [0, 0] ->= [0, 1, 0, 2] 4.24/1.10 lhs rhs ge gt 4.24/1.10 / 4A 4A \ / 4A 4A \ True False 4.24/1.10 \ 2A 2A / \ 2A 2A / 4.24/1.10 [2, 1, 1] ->= [0] 4.24/1.10 lhs rhs ge gt 4.24/1.10 / 2A 2A \ / 2A 2A \ True False 4.24/1.10 \ 0A 0A / \ 0A 0A / 4.24/1.10 property Termination 4.24/1.10 has value True 4.24/1.10 for SRS ( [0] ->= [1], [0, 0] ->= [0, 1, 0, 2], [2, 1, 1] ->= [0]) 4.24/1.10 reason 4.24/1.10 EDG has 0 SCCs 4.24/1.10 4.24/1.10 ************************************************** 4.24/1.10 summary 4.24/1.10 ************************************************** 4.24/1.10 SRS with 3 rules on 3 letters Remap { tracing = False} 4.24/1.10 SRS with 3 rules on 3 letters DP transform 4.24/1.10 SRS with 7 rules on 5 letters Remap { tracing = False} 4.24/1.10 SRS with 7 rules on 5 letters EDG 4.24/1.10 SRS with 6 rules on 5 letters Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 4.24/1.10 SRS with 5 rules on 5 letters weights 4.24/1.10 SRS with 4 rules on 4 letters EDG 4.24/1.10 SRS with 4 rules on 4 letters Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 4.24/1.10 SRS with 3 rules on 3 letters EDG 4.24/1.10 4.24/1.10 ************************************************** 4.24/1.11 (3, 3)\Deepee(7, 5)\EDG(6, 5)\Matrix{\Arctic}{2}(5, 5)\Weight(4, 4)\Matrix{\Arctic}{2}(3, 3)\EDG[] 4.24/1.11 ************************************************** 5.81/1.56 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]} 5.81/1.56 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 5.81/1.58 EOF