5.66/1.47 YES 5.66/1.47 property Termination 5.66/1.47 has value True 5.66/1.50 for SRS ( [a] -> [], [a, a, b] -> [b, b, a, a], [c, b] -> [c, a]) 5.66/1.50 reason 5.66/1.50 remap for 3 rules 5.66/1.50 property Termination 5.66/1.50 has value True 5.66/1.50 for SRS ( [0] -> [], [0, 0, 1] -> [1, 1, 0, 0], [2, 1] -> [2, 0]) 5.66/1.50 reason 5.66/1.51 reverse each lhs and rhs 5.66/1.51 property Termination 5.66/1.51 has value True 5.66/1.51 for SRS ( [0] -> [], [1, 0, 0] -> [0, 0, 1, 1], [1, 2] -> [0, 2]) 5.66/1.51 reason 5.66/1.51 DP transform 5.66/1.51 property Termination 5.66/1.51 has value True 5.66/1.51 for SRS ( [0] ->= [], [1, 0, 0] ->= [0, 0, 1, 1], [1, 2] ->= [0, 2], [1#, 0, 0] |-> [0#, 0, 1, 1], [1#, 0, 0] |-> [0#, 1, 1], [1#, 0, 0] |-> [1#, 1], [1#, 0, 0] |-> [1#], [1#, 2] |-> [0#, 2]) 5.66/1.51 reason 5.66/1.51 remap for 8 rules 5.66/1.51 property Termination 5.66/1.51 has value True 5.66/1.51 for SRS ( [0] ->= [], [1, 0, 0] ->= [0, 0, 1, 1], [1, 2] ->= [0, 2], [3, 0, 0] |-> [4, 0, 1, 1], [3, 0, 0] |-> [4, 1, 1], [3, 0, 0] |-> [3, 1], [3, 0, 0] |-> [3], [3, 2] |-> [4, 2]) 5.66/1.51 reason 5.66/1.51 weights 5.66/1.51 Map [(3, 3/1)] 5.66/1.51 5.66/1.51 property Termination 5.66/1.51 has value True 5.66/1.51 for SRS ( [0] ->= [], [1, 0, 0] ->= [0, 0, 1, 1], [1, 2] ->= [0, 2], [3, 0, 0] |-> [3, 1], [3, 0, 0] |-> [3]) 5.66/1.51 reason 5.66/1.51 EDG has 1 SCCs 5.66/1.51 property Termination 5.66/1.51 has value True 5.66/1.52 for SRS ( [3, 0, 0] |-> [3, 1], [3, 0, 0] |-> [3], [0] ->= [], [1, 0, 0] ->= [0, 0, 1, 1], [1, 2] ->= [0, 2]) 5.66/1.52 reason 5.66/1.52 Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 5.66/1.52 interpretation 5.66/1.52 0 / 0A 2A \ 5.66/1.52 \ 0A 0A / 5.66/1.52 1 / 0A 0A \ 5.66/1.52 \ 0A 0A / 5.66/1.52 2 / 20A 20A \ 5.66/1.52 \ 18A 18A / 5.66/1.52 3 / 14A 16A \ 5.66/1.52 \ 14A 16A / 5.66/1.52 [3, 0, 0] |-> [3, 1] 5.66/1.52 lhs rhs ge gt 5.66/1.52 / 16A 18A \ / 16A 16A \ True False 5.66/1.52 \ 16A 18A / \ 16A 16A / 5.66/1.52 [3, 0, 0] |-> [3] 5.66/1.52 lhs rhs ge gt 5.66/1.52 / 16A 18A \ / 14A 16A \ True True 5.66/1.52 \ 16A 18A / \ 14A 16A / 5.66/1.52 [0] ->= [] 5.66/1.52 lhs rhs ge gt 5.66/1.52 / 0A 2A \ / 0A - \ True False 5.66/1.52 \ 0A 0A / \ - 0A / 5.66/1.52 [1, 0, 0] ->= [0, 0, 1, 1] 5.66/1.52 lhs rhs ge gt 5.66/1.52 / 2A 2A \ / 2A 2A \ True False 5.66/1.52 \ 2A 2A / \ 2A 2A / 5.66/1.52 [1, 2] ->= [0, 2] 5.66/1.52 lhs rhs ge gt 5.66/1.52 / 20A 20A \ / 20A 20A \ True False 5.66/1.52 \ 20A 20A / \ 20A 20A / 5.66/1.52 property Termination 5.66/1.52 has value True 5.66/1.52 for SRS ( [3, 0, 0] |-> [3, 1], [0] ->= [], [1, 0, 0] ->= [0, 0, 1, 1], [1, 2] ->= [0, 2]) 5.66/1.52 reason 5.66/1.52 EDG has 1 SCCs 5.66/1.52 property Termination 5.66/1.52 has value True 5.66/1.52 for SRS ( [3, 0, 0] |-> [3, 1], [0] ->= [], [1, 0, 0] ->= [0, 0, 1, 1], [1, 2] ->= [0, 2]) 5.66/1.52 reason 5.66/1.52 Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 5.66/1.52 interpretation 5.66/1.52 0 / 0A 2A \ 5.66/1.52 \ 0A 0A / 5.66/1.52 1 / 0A 2A \ 5.66/1.52 \ -2A 0A / 5.66/1.52 2 / 24A 26A \ 5.66/1.52 \ 24A 26A / 5.66/1.52 3 / 15A 16A \ 5.66/1.52 \ 15A 16A / 5.66/1.52 [3, 0, 0] |-> [3, 1] 5.66/1.52 lhs rhs ge gt 5.66/1.52 / 17A 18A \ / 15A 17A \ True True 5.66/1.52 \ 17A 18A / \ 15A 17A / 5.66/1.52 [0] ->= [] 5.66/1.52 lhs rhs ge gt 5.66/1.52 / 0A 2A \ / 0A - \ True False 5.66/1.52 \ 0A 0A / \ - 0A / 5.66/1.52 [1, 0, 0] ->= [0, 0, 1, 1] 5.66/1.52 lhs rhs ge gt 5.66/1.52 / 2A 4A \ / 2A 4A \ True False 5.66/1.52 \ 0A 2A / \ 0A 2A / 5.66/1.52 [1, 2] ->= [0, 2] 5.66/1.53 lhs rhs ge gt 5.66/1.53 / 26A 28A \ / 26A 28A \ True False 5.66/1.53 \ 24A 26A / \ 24A 26A / 5.66/1.53 property Termination 5.66/1.53 has value True 5.66/1.53 for SRS ( [0] ->= [], [1, 0, 0] ->= [0, 0, 1, 1], [1, 2] ->= [0, 2]) 5.66/1.53 reason 5.66/1.53 EDG has 0 SCCs 5.66/1.53 5.66/1.53 ************************************************** 5.66/1.53 summary 5.66/1.53 ************************************************** 5.66/1.53 SRS with 3 rules on 3 letters Remap { tracing = False} 5.66/1.53 SRS with 3 rules on 3 letters reverse each lhs and rhs 5.66/1.53 SRS with 3 rules on 3 letters DP transform 5.66/1.53 SRS with 8 rules on 5 letters Remap { tracing = False} 5.66/1.53 SRS with 8 rules on 5 letters weights 5.66/1.53 SRS with 5 rules on 4 letters EDG 5.66/1.53 SRS with 5 rules on 4 letters Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 5.66/1.53 SRS with 4 rules on 4 letters EDG 5.66/1.53 SRS with 4 rules on 4 letters Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 5.66/1.53 SRS with 3 rules on 3 letters EDG 5.66/1.53 5.66/1.53 ************************************************** 6.01/1.54 (3, 3)\Deepee(8, 5)\Weight(5, 4)\Matrix{\Arctic}{2}(4, 4)\Matrix{\Arctic}{2}(3, 3)\EDG[] 6.01/1.54 ************************************************** 6.82/1.79 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]} 6.82/1.79 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 7.10/1.83 EOF