2.40/0.66 YES 2.40/0.66 property Termination 2.40/0.66 has value True 2.40/0.66 for SRS ( [a] -> [], [a, a] -> [b], [b] -> [a], [b, c] -> [c, c, b, a]) 2.40/0.66 reason 2.40/0.66 remap for 4 rules 2.40/0.66 property Termination 2.65/0.69 has value True 2.65/0.69 for SRS ( [0] -> [], [0, 0] -> [1], [1] -> [0], [1, 2] -> [2, 2, 1, 0]) 2.65/0.69 reason 2.65/0.69 reverse each lhs and rhs 2.65/0.69 property Termination 2.65/0.69 has value True 2.65/0.69 for SRS ( [0] -> [], [0, 0] -> [1], [1] -> [0], [2, 1] -> [0, 1, 2, 2]) 2.65/0.69 reason 2.65/0.69 DP transform 2.65/0.70 property Termination 2.65/0.70 has value True 2.65/0.70 for SRS ( [0] ->= [], [0, 0] ->= [1], [1] ->= [0], [2, 1] ->= [0, 1, 2, 2], [0#, 0] |-> [1#], [1#] |-> [0#], [2#, 1] |-> [0#, 1, 2, 2], [2#, 1] |-> [1#, 2, 2], [2#, 1] |-> [2#, 2], [2#, 1] |-> [2#]) 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.72 for SRS ( [0] ->= [], [0, 0] ->= [1], [1] ->= [0], [2, 1] ->= [0, 1, 2, 2], [3, 0] |-> [4], [4] |-> [3], [5, 1] |-> [3, 1, 2, 2], [5, 1] |-> [4, 2, 2], [5, 1] |-> [5, 2], [5, 1] |-> [5]) 2.65/0.72 reason 2.65/0.72 weights 2.65/0.72 Map [(5, 2/1)] 2.65/0.72 2.65/0.72 property Termination 2.65/0.72 has value True 2.65/0.72 for SRS ( [0] ->= [], [0, 0] ->= [1], [1] ->= [0], [2, 1] ->= [0, 1, 2, 2], [3, 0] |-> [4], [4] |-> [3], [5, 1] |-> [5, 2], [5, 1] |-> [5]) 2.65/0.72 reason 2.65/0.73 EDG has 2 SCCs 2.65/0.73 property Termination 2.65/0.73 has value True 2.65/0.73 for SRS ( [3, 0] |-> [4], [4] |-> [3], [0] ->= [], [0, 0] ->= [1], [1] ->= [0], [2, 1] ->= [0, 1, 2, 2]) 2.65/0.73 reason 2.65/0.73 Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 2.65/0.73 interpretation 2.65/0.73 0 / 0A 2A \ 2.65/0.73 \ 0A 0A / 2.65/0.73 1 / 2A 2A \ 2.65/0.73 \ 0A 0A / 2.65/0.73 2 / 0A 0A \ 2.65/0.73 \ 0A 0A / 2.65/0.73 3 / 30A 31A \ 2.65/0.73 \ 30A 31A / 2.65/0.73 4 / 30A 31A \ 2.65/0.73 \ 30A 31A / 2.65/0.74 [3, 0] |-> [4] 2.65/0.74 lhs rhs ge gt 2.65/0.74 / 31A 32A \ / 30A 31A \ True True 2.65/0.74 \ 31A 32A / \ 30A 31A / 2.65/0.74 [4] |-> [3] 2.65/0.74 lhs rhs ge gt 2.65/0.74 / 30A 31A \ / 30A 31A \ True False 2.65/0.74 \ 30A 31A / \ 30A 31A / 2.65/0.74 [0] ->= [] 2.65/0.74 lhs rhs ge gt 2.65/0.74 / 0A 2A \ / 0A - \ True False 2.65/0.74 \ 0A 0A / \ - 0A / 2.65/0.74 [0, 0] ->= [1] 2.65/0.74 lhs rhs ge gt 2.65/0.74 / 2A 2A \ / 2A 2A \ True False 2.65/0.74 \ 0A 2A / \ 0A 0A / 2.65/0.74 [1] ->= [0] 2.65/0.74 lhs rhs ge gt 2.65/0.74 / 2A 2A \ / 0A 2A \ True False 2.65/0.74 \ 0A 0A / \ 0A 0A / 2.65/0.74 [2, 1] ->= [0, 1, 2, 2] 2.65/0.74 lhs rhs ge gt 2.65/0.74 / 2A 2A \ / 2A 2A \ True False 2.65/0.74 \ 2A 2A / \ 2A 2A / 2.65/0.74 property Termination 2.65/0.74 has value True 2.65/0.74 for SRS ( [4] |-> [3], [0] ->= [], [0, 0] ->= [1], [1] ->= [0], [2, 1] ->= [0, 1, 2, 2]) 2.65/0.74 reason 2.65/0.74 weights 2.65/0.74 Map [(4, 1/1)] 2.65/0.74 2.65/0.74 property Termination 2.65/0.74 has value True 2.65/0.74 for SRS ( [0] ->= [], [0, 0] ->= [1], [1] ->= [0], [2, 1] ->= [0, 1, 2, 2]) 2.65/0.74 reason 2.65/0.74 EDG has 0 SCCs 2.65/0.74 2.65/0.74 property Termination 2.65/0.74 has value True 2.65/0.74 for SRS ( [5, 1] |-> [5, 2], [5, 1] |-> [5], [0] ->= [], [0, 0] ->= [1], [1] ->= [0], [2, 1] ->= [0, 1, 2, 2]) 2.65/0.74 reason 2.65/0.74 Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 2.65/0.74 interpretation 2.65/0.74 0 / 0A 2A \ 2.65/0.74 \ 0A 0A / 2.65/0.74 1 / 0A 2A \ 2.65/0.74 \ 0A 2A / 2.65/0.74 2 / 0A 2A \ 2.65/0.74 \ -2A 0A / 2.65/0.74 5 / 16A 18A \ 2.65/0.74 \ 16A 18A / 2.65/0.74 [5, 1] |-> [5, 2] 2.65/0.74 lhs rhs ge gt 2.65/0.74 / 18A 20A \ / 16A 18A \ True True 2.65/0.74 \ 18A 20A / \ 16A 18A / 2.65/0.74 [5, 1] |-> [5] 2.65/0.74 lhs rhs ge gt 2.65/0.74 / 18A 20A \ / 16A 18A \ True True 2.65/0.74 \ 18A 20A / \ 16A 18A / 2.65/0.74 [0] ->= [] 2.65/0.74 lhs rhs ge gt 2.65/0.74 / 0A 2A \ / 0A - \ True False 2.65/0.74 \ 0A 0A / \ - 0A / 2.65/0.74 [0, 0] ->= [1] 2.65/0.74 lhs rhs ge gt 2.65/0.74 / 2A 2A \ / 0A 2A \ True False 2.65/0.74 \ 0A 2A / \ 0A 2A / 2.65/0.74 [1] ->= [0] 2.65/0.74 lhs rhs ge gt 2.65/0.74 / 0A 2A \ / 0A 2A \ True False 2.65/0.74 \ 0A 2A / \ 0A 0A / 2.65/0.74 [2, 1] ->= [0, 1, 2, 2] 2.65/0.74 lhs rhs ge gt 2.65/0.74 / 2A 4A \ / 2A 4A \ True False 2.65/0.74 \ 0A 2A / \ 0A 2A / 2.65/0.74 property Termination 2.65/0.74 has value True 2.65/0.75 for SRS ( [0] ->= [], [0, 0] ->= [1], [1] ->= [0], [2, 1] ->= [0, 1, 2, 2]) 2.65/0.75 reason 2.65/0.75 EDG has 0 SCCs 2.65/0.75 2.65/0.75 ************************************************** 2.65/0.75 summary 2.65/0.75 ************************************************** 2.65/0.75 SRS with 4 rules on 3 letters Remap { tracing = False} 2.65/0.75 SRS with 4 rules on 3 letters reverse each lhs and rhs 2.65/0.75 SRS with 4 rules on 3 letters DP transform 2.65/0.75 SRS with 10 rules on 6 letters Remap { tracing = False} 2.65/0.76 SRS with 10 rules on 6 letters weights 2.65/0.76 SRS with 8 rules on 6 letters EDG 2.65/0.76 2 sub-proofs 2.65/0.76 1 SRS with 6 rules on 5 letters Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 2.65/0.76 SRS with 5 rules on 5 letters weights 2.65/0.76 SRS with 4 rules on 3 letters EDG 2.65/0.76 2.65/0.76 2 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.76 SRS with 4 rules on 3 letters EDG 2.65/0.76 2.65/0.76 ************************************************** 2.98/0.79 (4, 3)\Deepee(10, 6)\Weight(8, 6)\EDG[(6, 5)\Matrix{\Arctic}{2}(5, 5)\Weight(4, 3)\EDG[],(6, 4)\Matrix{\Arctic}{2}(4, 3)\EDG[]] 3.11/0.83 ************************************************** 3.74/1.00 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]} 3.74/1.00 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 3.74/1.05 EOF