3.30/0.91 YES 3.30/0.91 property Termination 3.30/0.91 has value True 3.60/0.92 for SRS ( [a] -> [b], [a, c] -> [c, c, a, b], [b, b] -> [a]) 3.60/0.92 reason 3.60/0.92 remap for 3 rules 3.60/0.93 property Termination 3.60/0.93 has value True 3.60/0.93 for SRS ( [0] -> [1], [0, 2] -> [2, 2, 0, 1], [1, 1] -> [0]) 3.60/0.93 reason 3.60/0.93 reverse each lhs and rhs 3.60/0.93 property Termination 3.60/0.93 has value True 3.60/0.93 for SRS ( [0] -> [1], [2, 0] -> [1, 0, 2, 2], [1, 1] -> [0]) 3.60/0.93 reason 3.60/0.93 DP transform 3.60/0.93 property Termination 3.60/0.93 has value True 3.60/0.93 for SRS ( [0] ->= [1], [2, 0] ->= [1, 0, 2, 2], [1, 1] ->= [0], [0#] |-> [1#], [2#, 0] |-> [1#, 0, 2, 2], [2#, 0] |-> [0#, 2, 2], [2#, 0] |-> [2#, 2], [2#, 0] |-> [2#], [1#, 1] |-> [0#]) 3.60/0.93 reason 3.60/0.93 remap for 9 rules 3.60/0.93 property Termination 3.60/0.93 has value True 3.60/0.93 for SRS ( [0] ->= [1], [2, 0] ->= [1, 0, 2, 2], [1, 1] ->= [0], [3] |-> [4], [5, 0] |-> [4, 0, 2, 2], [5, 0] |-> [3, 2, 2], [5, 0] |-> [5, 2], [5, 0] |-> [5], [4, 1] |-> [3]) 3.60/0.93 reason 3.60/0.93 weights 3.60/0.93 Map [(5, 2/1)] 3.60/0.93 3.60/0.93 property Termination 3.60/0.93 has value True 3.60/0.93 for SRS ( [0] ->= [1], [2, 0] ->= [1, 0, 2, 2], [1, 1] ->= [0], [3] |-> [4], [5, 0] |-> [5, 2], [5, 0] |-> [5], [4, 1] |-> [3]) 3.60/0.93 reason 3.60/0.94 EDG has 2 SCCs 3.60/0.94 property Termination 3.60/0.94 has value True 3.60/0.94 for SRS ( [3] |-> [4], [4, 1] |-> [3], [0] ->= [1], [2, 0] ->= [1, 0, 2, 2], [1, 1] ->= [0]) 3.60/0.94 reason 3.60/0.94 Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 3.60/0.94 interpretation 3.60/0.94 0 / 2A 2A \ 3.60/0.94 \ 0A 0A / 3.60/0.94 1 / 0A 2A \ 3.60/0.94 \ 0A 0A / 3.60/0.94 2 / 0A 0A \ 3.60/0.94 \ 0A 0A / 3.60/0.94 3 / 25A 26A \ 3.60/0.94 \ 25A 26A / 3.60/0.94 4 / 25A 26A \ 3.60/0.94 \ 25A 26A / 3.60/0.94 [3] |-> [4] 3.60/0.94 lhs rhs ge gt 3.60/0.94 / 25A 26A \ / 25A 26A \ True False 3.60/0.94 \ 25A 26A / \ 25A 26A / 3.60/0.94 [4, 1] |-> [3] 3.60/0.94 lhs rhs ge gt 3.60/0.94 / 26A 27A \ / 25A 26A \ True True 3.60/0.94 \ 26A 27A / \ 25A 26A / 3.60/0.94 [0] ->= [1] 3.60/0.94 lhs rhs ge gt 3.60/0.94 / 2A 2A \ / 0A 2A \ True False 3.60/0.94 \ 0A 0A / \ 0A 0A / 3.60/0.94 [2, 0] ->= [1, 0, 2, 2] 3.60/0.94 lhs rhs ge gt 3.60/0.94 / 2A 2A \ / 2A 2A \ True False 3.60/0.94 \ 2A 2A / \ 2A 2A / 3.60/0.94 [1, 1] ->= [0] 3.60/0.94 lhs rhs ge gt 3.60/0.94 / 2A 2A \ / 2A 2A \ True False 3.60/0.94 \ 0A 2A / \ 0A 0A / 3.60/0.94 property Termination 3.60/0.94 has value True 3.60/0.94 for SRS ( [3] |-> [4], [0] ->= [1], [2, 0] ->= [1, 0, 2, 2], [1, 1] ->= [0]) 3.60/0.94 reason 3.60/0.94 weights 3.60/0.94 Map [(3, 1/1)] 3.60/0.94 3.60/0.94 property Termination 3.60/0.94 has value True 3.60/0.94 for SRS ( [0] ->= [1], [2, 0] ->= [1, 0, 2, 2], [1, 1] ->= [0]) 3.60/0.94 reason 3.60/0.94 EDG has 0 SCCs 3.60/0.94 3.60/0.94 property Termination 3.60/0.94 has value True 3.60/0.94 for SRS ( [5, 0] |-> [5, 2], [5, 0] |-> [5], [0] ->= [1], [2, 0] ->= [1, 0, 2, 2], [1, 1] ->= [0]) 3.60/0.94 reason 3.60/0.94 Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 3.60/0.94 interpretation 3.60/0.94 0 / 2A 2A \ 3.60/0.94 \ 0A 0A / 3.60/0.94 1 / 0A 2A \ 3.60/0.94 \ 0A 0A / 3.60/0.94 2 / 0A 0A \ 3.60/0.94 \ 0A 0A / 3.60/0.94 5 / 28A 29A \ 3.60/0.94 \ 28A 29A / 3.60/0.94 [5, 0] |-> [5, 2] 3.60/0.94 lhs rhs ge gt 3.60/0.94 / 30A 30A \ / 29A 29A \ True True 3.60/0.94 \ 30A 30A / \ 29A 29A / 3.60/0.94 [5, 0] |-> [5] 3.60/0.94 lhs rhs ge gt 3.60/0.94 / 30A 30A \ / 28A 29A \ True True 3.60/0.94 \ 30A 30A / \ 28A 29A / 3.60/0.94 [0] ->= [1] 3.60/0.94 lhs rhs ge gt 3.60/0.94 / 2A 2A \ / 0A 2A \ True False 3.60/0.94 \ 0A 0A / \ 0A 0A / 3.60/0.94 [2, 0] ->= [1, 0, 2, 2] 3.60/0.94 lhs rhs ge gt 3.60/0.94 / 2A 2A \ / 2A 2A \ True False 3.60/0.94 \ 2A 2A / \ 2A 2A / 3.60/0.94 [1, 1] ->= [0] 3.60/0.94 lhs rhs ge gt 3.60/0.94 / 2A 2A \ / 2A 2A \ True False 3.60/0.94 \ 0A 2A / \ 0A 0A / 3.60/0.94 property Termination 3.60/0.94 has value True 3.60/0.94 for SRS ( [0] ->= [1], [2, 0] ->= [1, 0, 2, 2], [1, 1] ->= [0]) 3.60/0.94 reason 3.60/0.94 EDG has 0 SCCs 3.60/0.94 3.60/0.94 ************************************************** 3.60/0.94 summary 3.60/0.94 ************************************************** 3.60/0.95 SRS with 3 rules on 3 letters Remap { tracing = False} 3.60/0.95 SRS with 3 rules on 3 letters reverse each lhs and rhs 3.60/0.95 SRS with 3 rules on 3 letters DP transform 3.60/0.95 SRS with 9 rules on 6 letters Remap { tracing = False} 3.60/0.95 SRS with 9 rules on 6 letters weights 3.60/0.95 SRS with 7 rules on 6 letters EDG 3.60/0.95 2 sub-proofs 3.60/0.95 1 SRS with 5 rules on 5 letters Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 3.60/0.95 SRS with 4 rules on 5 letters weights 3.60/0.95 SRS with 3 rules on 3 letters EDG 3.60/0.95 3.60/0.95 2 SRS with 5 rules on 4 letters Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 3.60/0.95 SRS with 3 rules on 3 letters EDG 3.60/0.95 3.60/0.95 ************************************************** 3.60/0.96 (3, 3)\Deepee(9, 6)\Weight(7, 6)\EDG[(5, 5)\Matrix{\Arctic}{2}(4, 5)\Weight(3, 3)\EDG[],(5, 4)\Matrix{\Arctic}{2}(3, 3)\EDG[]] 3.60/0.96 ************************************************** 4.74/1.25 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]} 4.74/1.25 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 4.89/1.29 EOF