2.65/0.70 YES 2.65/0.70 property Termination 2.65/0.70 has value True 2.65/0.70 for SRS ( [a, b, c] -> [c, b, a, a, c, b], [a] -> [], [b] -> [], [c] -> []) 2.65/0.70 reason 2.65/0.70 remap for 4 rules 2.65/0.70 property Termination 2.65/0.70 has value True 2.65/0.70 for SRS ( [0, 1, 2] -> [2, 1, 0, 0, 2, 1], [0] -> [], [1] -> [], [2] -> []) 2.65/0.70 reason 2.65/0.70 DP transform 2.65/0.70 property Termination 2.65/0.70 has value True 2.65/0.70 for SRS ( [0, 1, 2] ->= [2, 1, 0, 0, 2, 1], [0] ->= [], [1] ->= [], [2] ->= [], [0#, 1, 2] |-> [2#, 1, 0, 0, 2, 1], [0#, 1, 2] |-> [1#, 0, 0, 2, 1], [0#, 1, 2] |-> [0#, 0, 2, 1], [0#, 1, 2] |-> [0#, 2, 1], [0#, 1, 2] |-> [2#, 1], [0#, 1, 2] |-> [1#]) 2.65/0.70 reason 2.65/0.70 remap for 10 rules 2.65/0.70 property Termination 2.65/0.70 has value True 2.65/0.70 for SRS ( [0, 1, 2] ->= [2, 1, 0, 0, 2, 1], [0] ->= [], [1] ->= [], [2] ->= [], [3, 1, 2] |-> [4, 1, 0, 0, 2, 1], [3, 1, 2] |-> [5, 0, 0, 2, 1], [3, 1, 2] |-> [3, 0, 2, 1], [3, 1, 2] |-> [3, 2, 1], [3, 1, 2] |-> [4, 1], [3, 1, 2] |-> [5]) 2.65/0.70 reason 2.65/0.70 weights 2.65/0.70 Map [(3, 4/1)] 2.65/0.70 2.65/0.70 property Termination 2.65/0.70 has value True 2.65/0.70 for SRS ( [0, 1, 2] ->= [2, 1, 0, 0, 2, 1], [0] ->= [], [1] ->= [], [2] ->= [], [3, 1, 2] |-> [3, 0, 2, 1], [3, 1, 2] |-> [3, 2, 1]) 2.65/0.70 reason 2.65/0.70 EDG has 1 SCCs 2.65/0.70 property Termination 2.65/0.70 has value True 2.65/0.71 for SRS ( [3, 1, 2] |-> [3, 0, 2, 1], [3, 1, 2] |-> [3, 2, 1], [0, 1, 2] ->= [2, 1, 0, 0, 2, 1], [0] ->= [], [1] ->= [], [2] ->= []) 2.65/0.71 reason 2.65/0.71 Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 2.65/0.71 interpretation 2.65/0.71 0 / 0A 0A \ 2.65/0.71 \ 0A 0A / 2.65/0.71 1 / 0A 2A \ 2.65/0.71 \ -2A 0A / 2.65/0.71 2 / 0A 2A \ 2.65/0.71 \ 0A 2A / 2.65/0.71 3 / 13A 13A \ 2.65/0.71 \ 13A 13A / 2.65/0.71 [3, 1, 2] |-> [3, 0, 2, 1] 2.65/0.71 lhs rhs ge gt 2.65/0.71 / 15A 17A \ / 13A 15A \ True True 2.65/0.71 \ 15A 17A / \ 13A 15A / 2.65/0.72 [3, 1, 2] |-> [3, 2, 1] 2.65/0.72 lhs rhs ge gt 2.65/0.72 / 15A 17A \ / 13A 15A \ True True 2.65/0.72 \ 15A 17A / \ 13A 15A / 2.65/0.72 [0, 1, 2] ->= [2, 1, 0, 0, 2, 1] 2.65/0.72 lhs rhs ge gt 2.65/0.72 / 2A 4A \ / 2A 4A \ True False 2.65/0.72 \ 2A 4A / \ 2A 4A / 2.65/0.72 [0] ->= [] 2.65/0.72 lhs rhs ge gt 2.65/0.73 / 0A 0A \ / 0A - \ True False 2.65/0.73 \ 0A 0A / \ - 0A / 2.65/0.73 [1] ->= [] 2.65/0.73 lhs rhs ge gt 2.65/0.73 / 0A 2A \ / 0A - \ True False 2.65/0.73 \ -2A 0A / \ - 0A / 2.65/0.73 [2] ->= [] 2.65/0.73 lhs rhs ge gt 2.65/0.73 / 0A 2A \ / 0A - \ True False 2.65/0.73 \ 0A 2A / \ - 0A / 2.65/0.73 property Termination 2.65/0.73 has value True 2.65/0.73 for SRS ( [0, 1, 2] ->= [2, 1, 0, 0, 2, 1], [0] ->= [], [1] ->= [], [2] ->= []) 2.65/0.73 reason 2.65/0.73 EDG has 0 SCCs 2.65/0.73 2.65/0.73 ************************************************** 2.65/0.73 summary 2.65/0.73 ************************************************** 2.65/0.73 SRS with 4 rules on 3 letters Remap { tracing = False} 2.65/0.73 SRS with 4 rules on 3 letters DP transform 2.65/0.74 SRS with 10 rules on 6 letters Remap { tracing = False} 2.65/0.74 SRS with 10 rules on 6 letters weights 2.65/0.74 SRS with 6 rules on 4 letters EDG 2.65/0.74 SRS with 6 rules on 4 letters Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 2.65/0.74 SRS with 4 rules on 3 letters EDG 2.65/0.74 2.65/0.74 ************************************************** 2.65/0.74 (4, 3)\Deepee(10, 6)\Weight(6, 4)\Matrix{\Arctic}{2}(4, 3)\EDG[] 2.65/0.74 ************************************************** 5.32/1.40 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.32/1.40 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 5.32/1.42 EOF