4.80/1.27 YES 4.80/1.27 property Termination 4.80/1.27 has value True 4.80/1.27 for SRS ( [a] -> [], [a, a, b] -> [b, b, a, a], [b] -> [a, c, a]) 4.80/1.27 reason 4.80/1.27 remap for 3 rules 4.80/1.27 property Termination 4.80/1.27 has value True 4.80/1.27 for SRS ( [0] -> [], [0, 0, 1] -> [1, 1, 0, 0], [1] -> [0, 2, 0]) 4.80/1.27 reason 4.80/1.27 reverse each lhs and rhs 4.80/1.27 property Termination 4.80/1.27 has value True 4.80/1.27 for SRS ( [0] -> [], [1, 0, 0] -> [0, 0, 1, 1], [1] -> [0, 2, 0]) 4.80/1.27 reason 4.80/1.27 DP transform 4.80/1.27 property Termination 4.80/1.27 has value True 4.80/1.27 for SRS ( [0] ->= [], [1, 0, 0] ->= [0, 0, 1, 1], [1] ->= [0, 2, 0], [1#, 0, 0] |-> [0#, 0, 1, 1], [1#, 0, 0] |-> [0#, 1, 1], [1#, 0, 0] |-> [1#, 1], [1#, 0, 0] |-> [1#], [1#] |-> [0#, 2, 0], [1#] |-> [0#]) 4.80/1.27 reason 4.80/1.27 remap for 9 rules 4.80/1.27 property Termination 4.80/1.27 has value True 4.80/1.27 for SRS ( [0] ->= [], [1, 0, 0] ->= [0, 0, 1, 1], [1] ->= [0, 2, 0], [3, 0, 0] |-> [4, 0, 1, 1], [3, 0, 0] |-> [4, 1, 1], [3, 0, 0] |-> [3, 1], [3, 0, 0] |-> [3], [3] |-> [4, 2, 0], [3] |-> [4]) 4.80/1.27 reason 4.80/1.27 weights 4.80/1.27 Map [(3, 4/1)] 4.80/1.27 4.80/1.27 property Termination 4.80/1.27 has value True 4.80/1.27 for SRS ( [0] ->= [], [1, 0, 0] ->= [0, 0, 1, 1], [1] ->= [0, 2, 0], [3, 0, 0] |-> [3, 1], [3, 0, 0] |-> [3]) 4.80/1.27 reason 4.80/1.27 EDG has 1 SCCs 4.80/1.27 property Termination 4.80/1.27 has value True 4.80/1.27 for SRS ( [3, 0, 0] |-> [3, 1], [3, 0, 0] |-> [3], [0] ->= [], [1, 0, 0] ->= [0, 0, 1, 1], [1] ->= [0, 2, 0]) 4.80/1.27 reason 4.80/1.27 Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 3, solver = Minisatapi, verbose = False, tracing = True} 4.80/1.27 interpretation 4.80/1.27 0 / 0A 0A 3A \ 4.80/1.27 | 0A 0A 3A | 4.80/1.27 \ -3A 0A 0A / 4.80/1.27 1 / 0A 0A 3A \ 4.80/1.27 | 0A 0A 3A | 4.80/1.27 \ -3A -3A 0A / 4.80/1.27 2 / 0A 0A 0A \ 4.80/1.27 | -3A -3A -3A | 4.80/1.27 \ -3A -3A -3A / 4.80/1.27 3 / 40A 40A 43A \ 4.80/1.27 | 40A 40A 43A | 4.80/1.27 \ 40A 40A 43A / 4.80/1.27 [3, 0, 0] |-> [3, 1] 4.80/1.27 lhs rhs ge gt 4.80/1.27 / 43A 43A 46A \ / 40A 40A 43A \ True True 4.80/1.27 | 43A 43A 46A | | 40A 40A 43A | 4.80/1.27 \ 43A 43A 46A / \ 40A 40A 43A / 4.80/1.27 [3, 0, 0] |-> [3] 4.80/1.27 lhs rhs ge gt 4.80/1.28 / 43A 43A 46A \ / 40A 40A 43A \ True True 4.80/1.28 | 43A 43A 46A | | 40A 40A 43A | 4.80/1.28 \ 43A 43A 46A / \ 40A 40A 43A / 4.80/1.28 [0] ->= [] 4.80/1.28 lhs rhs ge gt 4.80/1.28 / 0A 0A 3A \ / 0A - - \ True False 4.80/1.28 | 0A 0A 3A | | - 0A - | 4.80/1.28 \ -3A 0A 0A / \ - - 0A / 4.80/1.29 [1, 0, 0] ->= [0, 0, 1, 1] 4.80/1.29 lhs rhs ge gt 4.80/1.29 / 3A 3A 6A \ / 3A 3A 6A \ True False 4.80/1.29 | 3A 3A 6A | | 3A 3A 6A | 4.80/1.29 \ 0A 0A 3A / \ 0A 0A 3A / 4.80/1.29 [1] ->= [0, 2, 0] 4.80/1.29 lhs rhs ge gt 4.80/1.29 / 0A 0A 3A \ / 0A 0A 3A \ True False 4.80/1.29 | 0A 0A 3A | | 0A 0A 3A | 4.80/1.29 \ -3A -3A 0A / \ -3A -3A 0A / 4.80/1.29 property Termination 4.80/1.29 has value True 4.80/1.29 for SRS ( [0] ->= [], [1, 0, 0] ->= [0, 0, 1, 1], [1] ->= [0, 2, 0]) 4.80/1.29 reason 4.80/1.29 EDG has 0 SCCs 4.80/1.29 4.80/1.29 ************************************************** 4.80/1.29 summary 4.80/1.29 ************************************************** 4.80/1.30 SRS with 3 rules on 3 letters Remap { tracing = False} 4.80/1.30 SRS with 3 rules on 3 letters reverse each lhs and rhs 4.80/1.30 SRS with 3 rules on 3 letters DP transform 4.80/1.30 SRS with 9 rules on 5 letters Remap { tracing = False} 4.80/1.30 SRS with 9 rules on 5 letters weights 4.80/1.30 SRS with 5 rules on 4 letters EDG 4.80/1.30 SRS with 5 rules on 4 letters Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 3, solver = Minisatapi, verbose = False, tracing = True} 4.80/1.30 SRS with 3 rules on 3 letters EDG 4.80/1.30 4.80/1.30 ************************************************** 4.80/1.31 (3, 3)\Deepee(9, 5)\Weight(5, 4)\Matrix{\Arctic}{3}(3, 3)\EDG[] 4.80/1.31 ************************************************** 5.12/1.34 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.12/1.34 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 5.43/1.44 EOF