2.61/0.73 YES 2.61/0.73 property Termination 2.61/0.73 has value True 2.61/0.75 for SRS ( [a] -> [], [a, b] -> [c, b], [b] -> [a, a, c], [c, c] -> [b]) 2.92/0.75 reason 2.92/0.75 remap for 4 rules 2.92/0.76 property Termination 2.92/0.76 has value True 2.92/0.76 for SRS ( [0] -> [], [0, 1] -> [2, 1], [1] -> [0, 0, 2], [2, 2] -> [1]) 2.92/0.76 reason 2.92/0.76 DP transform 2.92/0.76 property Termination 2.92/0.76 has value True 2.92/0.76 for SRS ( [0] ->= [], [0, 1] ->= [2, 1], [1] ->= [0, 0, 2], [2, 2] ->= [1], [0#, 1] |-> [2#, 1], [1#] |-> [0#, 0, 2], [1#] |-> [0#, 2], [1#] |-> [2#], [2#, 2] |-> [1#]) 2.92/0.76 reason 2.92/0.76 remap for 9 rules 2.92/0.76 property Termination 2.92/0.76 has value True 2.92/0.77 for SRS ( [0] ->= [], [0, 1] ->= [2, 1], [1] ->= [0, 0, 2], [2, 2] ->= [1], [3, 1] |-> [4, 1], [5] |-> [3, 0, 2], [5] |-> [3, 2], [5] |-> [4], [4, 2] |-> [5]) 2.92/0.77 reason 2.92/0.77 EDG has 1 SCCs 2.92/0.77 property Termination 2.92/0.77 has value True 2.92/0.77 for SRS ( [3, 1] |-> [4, 1], [4, 2] |-> [5], [5] |-> [4], [5] |-> [3, 2], [5] |-> [3, 0, 2], [0] ->= [], [0, 1] ->= [2, 1], [1] ->= [0, 0, 2], [2, 2] ->= [1]) 2.92/0.77 reason 2.92/0.77 Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 2.92/0.77 interpretation 2.92/0.77 0 / 0A 2A \ 2.92/0.77 \ -2A 0A / 2.92/0.77 1 / 2A 2A \ 2.92/0.77 \ 2A 2A / 2.92/0.77 2 / 2A 2A \ 2.92/0.77 \ 0A 0A / 2.92/0.77 3 / 13A 15A \ 2.92/0.77 \ 13A 15A / 2.92/0.77 4 / 14A 14A \ 2.92/0.77 \ 14A 14A / 2.92/0.77 5 / 16A 16A \ 2.92/0.77 \ 16A 16A / 2.92/0.77 [3, 1] |-> [4, 1] 2.92/0.77 lhs rhs ge gt 2.92/0.77 / 17A 17A \ / 16A 16A \ True True 2.92/0.77 \ 17A 17A / \ 16A 16A / 2.92/0.77 [4, 2] |-> [5] 2.92/0.77 lhs rhs ge gt 2.92/0.77 / 16A 16A \ / 16A 16A \ True False 2.92/0.77 \ 16A 16A / \ 16A 16A / 2.92/0.77 [5] |-> [4] 2.92/0.77 lhs rhs ge gt 2.92/0.77 / 16A 16A \ / 14A 14A \ True True 2.92/0.77 \ 16A 16A / \ 14A 14A / 2.92/0.77 [5] |-> [3, 2] 2.92/0.77 lhs rhs ge gt 2.92/0.77 / 16A 16A \ / 15A 15A \ True True 2.92/0.77 \ 16A 16A / \ 15A 15A / 2.92/0.77 [5] |-> [3, 0, 2] 2.92/0.77 lhs rhs ge gt 2.92/0.77 / 16A 16A \ / 15A 15A \ True True 2.92/0.77 \ 16A 16A / \ 15A 15A / 2.92/0.77 [0] ->= [] 2.92/0.77 lhs rhs ge gt 2.92/0.77 / 0A 2A \ / 0A - \ True False 2.92/0.77 \ -2A 0A / \ - 0A / 2.92/0.77 [0, 1] ->= [2, 1] 2.92/0.77 lhs rhs ge gt 2.92/0.77 / 4A 4A \ / 4A 4A \ True False 2.92/0.77 \ 2A 2A / \ 2A 2A / 2.92/0.77 [1] ->= [0, 0, 2] 2.92/0.77 lhs rhs ge gt 2.92/0.77 / 2A 2A \ / 2A 2A \ True False 2.92/0.77 \ 2A 2A / \ 0A 0A / 2.92/0.77 [2, 2] ->= [1] 2.92/0.77 lhs rhs ge gt 2.92/0.77 / 4A 4A \ / 2A 2A \ True False 2.92/0.77 \ 2A 2A / \ 2A 2A / 2.92/0.77 property Termination 2.92/0.77 has value True 2.92/0.77 for SRS ( [4, 2] |-> [5], [0] ->= [], [0, 1] ->= [2, 1], [1] ->= [0, 0, 2], [2, 2] ->= [1]) 2.92/0.77 reason 2.92/0.77 weights 2.92/0.77 Map [(4, 1/1)] 2.92/0.77 2.92/0.77 property Termination 2.92/0.77 has value True 2.92/0.77 for SRS ( [0] ->= [], [0, 1] ->= [2, 1], [1] ->= [0, 0, 2], [2, 2] ->= [1]) 2.92/0.77 reason 2.92/0.77 EDG has 0 SCCs 2.92/0.77 2.92/0.77 ************************************************** 2.92/0.77 summary 2.92/0.77 ************************************************** 2.92/0.77 SRS with 4 rules on 3 letters Remap { tracing = False} 2.92/0.77 SRS with 4 rules on 3 letters DP transform 2.92/0.77 SRS with 9 rules on 6 letters Remap { tracing = False} 2.92/0.77 SRS with 9 rules on 6 letters EDG 3.02/0.79 SRS with 9 rules on 6 letters Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 3.02/0.79 SRS with 5 rules on 5 letters weights 3.02/0.79 SRS with 4 rules on 3 letters EDG 3.02/0.79 3.02/0.79 ************************************************** 3.02/0.79 (4, 3)\Deepee(9, 6)\Matrix{\Arctic}{2}(5, 5)\Weight(4, 3)\EDG[] 3.02/0.79 ************************************************** 5.28/1.41 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.28/1.41 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 5.46/1.44 EOF