3.01/0.79 YES 3.01/0.79 property Termination 3.01/0.79 has value True 3.01/0.80 for SRS ( [a, b, c] -> [c, c, c, b, b, b, a, a, a], [c, b] -> [a, a, a], [a] -> [], [b] -> [], [c] -> []) 3.01/0.80 reason 3.01/0.81 remap for 5 rules 3.01/0.81 property Termination 3.01/0.81 has value True 3.01/0.81 for SRS ( [0, 1, 2] -> [2, 2, 2, 1, 1, 1, 0, 0, 0], [2, 1] -> [0, 0, 0], [0] -> [], [1] -> [], [2] -> []) 3.01/0.81 reason 3.01/0.81 reverse each lhs and rhs 3.01/0.81 property Termination 3.01/0.81 has value True 3.01/0.81 for SRS ( [2, 1, 0] -> [0, 0, 0, 1, 1, 1, 2, 2, 2], [1, 2] -> [0, 0, 0], [0] -> [], [1] -> [], [2] -> []) 3.01/0.81 reason 3.01/0.81 DP transform 3.01/0.81 property Termination 3.01/0.81 has value True 3.01/0.85 for SRS ( [2, 1, 0] ->= [0, 0, 0, 1, 1, 1, 2, 2, 2], [1, 2] ->= [0, 0, 0], [0] ->= [], [1] ->= [], [2] ->= [], [2#, 1, 0] |-> [0#, 0, 0, 1, 1, 1, 2, 2, 2], [2#, 1, 0] |-> [0#, 0, 1, 1, 1, 2, 2, 2], [2#, 1, 0] |-> [0#, 1, 1, 1, 2, 2, 2], [2#, 1, 0] |-> [1#, 1, 1, 2, 2, 2], [2#, 1, 0] |-> [1#, 1, 2, 2, 2], [2#, 1, 0] |-> [1#, 2, 2, 2], [2#, 1, 0] |-> [2#, 2, 2], [2#, 1, 0] |-> [2#, 2], [2#, 1, 0] |-> [2#], [1#, 2] |-> [0#, 0, 0], [1#, 2] |-> [0#, 0], [1#, 2] |-> [0#]) 3.01/0.85 reason 3.01/0.85 remap for 17 rules 3.01/0.85 property Termination 3.01/0.85 has value True 3.01/0.87 for SRS ( [0, 1, 2] ->= [2, 2, 2, 1, 1, 1, 0, 0, 0], [1, 0] ->= [2, 2, 2], [2] ->= [], [1] ->= [], [0] ->= [], [3, 1, 2] |-> [4, 2, 2, 1, 1, 1, 0, 0, 0], [3, 1, 2] |-> [4, 2, 1, 1, 1, 0, 0, 0], [3, 1, 2] |-> [4, 1, 1, 1, 0, 0, 0], [3, 1, 2] |-> [5, 1, 1, 0, 0, 0], [3, 1, 2] |-> [5, 1, 0, 0, 0], [3, 1, 2] |-> [5, 0, 0, 0], [3, 1, 2] |-> [3, 0, 0], [3, 1, 2] |-> [3, 0], [3, 1, 2] |-> [3], [5, 0] |-> [4, 2, 2], [5, 0] |-> [4, 2], [5, 0] |-> [4]) 3.01/0.87 reason 3.01/0.87 weights 3.01/0.87 Map [(3, 4/1), (5, 3/1)] 3.01/0.87 3.01/0.87 property Termination 3.01/0.87 has value True 3.35/0.89 for SRS ( [0, 1, 2] ->= [2, 2, 2, 1, 1, 1, 0, 0, 0], [1, 0] ->= [2, 2, 2], [2] ->= [], [1] ->= [], [0] ->= [], [3, 1, 2] |-> [3, 0, 0], [3, 1, 2] |-> [3, 0], [3, 1, 2] |-> [3]) 3.35/0.89 reason 3.35/0.89 EDG has 1 SCCs 3.35/0.89 property Termination 3.35/0.89 has value True 3.35/0.89 for SRS ( [3, 1, 2] |-> [3, 0, 0], [3, 1, 2] |-> [3], [3, 1, 2] |-> [3, 0], [0, 1, 2] ->= [2, 2, 2, 1, 1, 1, 0, 0, 0], [1, 0] ->= [2, 2, 2], [2] ->= [], [1] ->= [], [0] ->= []) 3.35/0.89 reason 3.35/0.89 Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 3.35/0.89 interpretation 3.35/0.89 0 / 0A 0A \ 3.35/0.89 \ 0A 0A / 3.35/0.89 1 / 0A 2A \ 3.35/0.89 \ -2A 0A / 3.35/0.89 2 / 0A 0A \ 3.35/0.89 \ 0A 0A / 3.35/0.89 3 / 8A 8A \ 3.35/0.89 \ 8A 8A / 3.35/0.89 [3, 1, 2] |-> [3, 0, 0] 3.35/0.89 lhs rhs ge gt 3.35/0.89 / 10A 10A \ / 8A 8A \ True True 3.35/0.89 \ 10A 10A / \ 8A 8A / 3.35/0.89 [3, 1, 2] |-> [3] 3.35/0.89 lhs rhs ge gt 3.35/0.89 / 10A 10A \ / 8A 8A \ True True 3.35/0.89 \ 10A 10A / \ 8A 8A / 3.35/0.89 [3, 1, 2] |-> [3, 0] 3.42/0.89 lhs rhs ge gt 3.42/0.89 / 10A 10A \ / 8A 8A \ True True 3.42/0.89 \ 10A 10A / \ 8A 8A / 3.42/0.89 [0, 1, 2] ->= [2, 2, 2, 1, 1, 1, 0, 0, 0] 3.42/0.89 lhs rhs ge gt 3.42/0.89 / 2A 2A \ / 2A 2A \ True False 3.42/0.89 \ 2A 2A / \ 2A 2A / 3.42/0.89 [1, 0] ->= [2, 2, 2] 3.42/0.89 lhs rhs ge gt 3.42/0.89 / 2A 2A \ / 0A 0A \ True False 3.42/0.89 \ 0A 0A / \ 0A 0A / 3.42/0.90 [2] ->= [] 3.42/0.90 lhs rhs ge gt 3.42/0.90 / 0A 0A \ / 0A - \ True False 3.42/0.90 \ 0A 0A / \ - 0A / 3.42/0.90 [1] ->= [] 3.42/0.90 lhs rhs ge gt 3.42/0.90 / 0A 2A \ / 0A - \ True False 3.42/0.90 \ -2A 0A / \ - 0A / 3.42/0.90 [0] ->= [] 3.42/0.90 lhs rhs ge gt 3.42/0.90 / 0A 0A \ / 0A - \ True False 3.42/0.90 \ 0A 0A / \ - 0A / 3.42/0.90 property Termination 3.42/0.90 has value True 3.42/0.90 for SRS ( [0, 1, 2] ->= [2, 2, 2, 1, 1, 1, 0, 0, 0], [1, 0] ->= [2, 2, 2], [2] ->= [], [1] ->= [], [0] ->= []) 3.42/0.90 reason 3.42/0.90 EDG has 0 SCCs 3.42/0.90 3.42/0.90 ************************************************** 3.42/0.90 summary 3.42/0.90 ************************************************** 3.42/0.91 SRS with 5 rules on 3 letters Remap { tracing = False} 3.42/0.91 SRS with 5 rules on 3 letters reverse each lhs and rhs 3.42/0.91 SRS with 5 rules on 3 letters DP transform 3.42/0.91 SRS with 17 rules on 6 letters Remap { tracing = False} 3.42/0.91 SRS with 17 rules on 6 letters weights 3.42/0.91 SRS with 8 rules on 4 letters EDG 3.42/0.91 SRS with 8 rules on 4 letters Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 3.42/0.91 SRS with 5 rules on 3 letters EDG 3.42/0.91 3.42/0.91 ************************************************** 3.42/0.91 (5, 3)\Deepee(17, 6)\Weight(8, 4)\Matrix{\Arctic}{2}(5, 3)\EDG[] 3.42/0.91 ************************************************** 5.72/1.51 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.72/1.51 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 5.86/1.53 EOF