5.47/1.40 YES 5.47/1.40 property Termination 5.47/1.40 has value True 5.47/1.41 for SRS ( [b, a, b] -> [a, b, a], [b, b, a] -> [b, b, b]) 5.47/1.41 reason 5.47/1.41 remap for 2 rules 5.47/1.41 property Termination 5.47/1.41 has value True 5.47/1.41 for SRS ( [0, 1, 0] -> [1, 0, 1], [0, 0, 1] -> [0, 0, 0]) 5.47/1.41 reason 5.47/1.42 reverse each lhs and rhs 5.47/1.42 property Termination 5.47/1.42 has value True 5.47/1.42 for SRS ( [0, 1, 0] -> [1, 0, 1], [1, 0, 0] -> [0, 0, 0]) 5.47/1.42 reason 5.47/1.42 DP transform 5.47/1.43 property Termination 5.47/1.43 has value True 5.47/1.43 for SRS ( [0, 1, 0] ->= [1, 0, 1], [1, 0, 0] ->= [0, 0, 0], [0#, 1, 0] |-> [1#, 0, 1], [0#, 1, 0] |-> [0#, 1], [0#, 1, 0] |-> [1#], [1#, 0, 0] |-> [0#, 0, 0]) 5.47/1.43 reason 5.47/1.43 remap for 6 rules 5.47/1.43 property Termination 5.47/1.43 has value True 5.47/1.43 for SRS ( [0, 1, 0] ->= [1, 0, 1], [1, 0, 0] ->= [0, 0, 0], [2, 1, 0] |-> [3, 0, 1], [2, 1, 0] |-> [2, 1], [2, 1, 0] |-> [3], [3, 0, 0] |-> [2, 0, 0]) 5.47/1.43 reason 5.47/1.43 weights 5.47/1.43 Map [(0, 1/3), (1, 1/3)] 5.47/1.43 5.47/1.43 property Termination 5.47/1.43 has value True 5.47/1.43 for SRS ( [0, 1, 0] ->= [1, 0, 1], [1, 0, 0] ->= [0, 0, 0], [2, 1, 0] |-> [3, 0, 1], [3, 0, 0] |-> [2, 0, 0]) 5.47/1.43 reason 5.47/1.43 EDG has 1 SCCs 5.47/1.43 property Termination 5.47/1.43 has value True 5.47/1.44 for SRS ( [2, 1, 0] |-> [3, 0, 1], [3, 0, 0] |-> [2, 0, 0], [0, 1, 0] ->= [1, 0, 1], [1, 0, 0] ->= [0, 0, 0]) 5.47/1.44 reason 5.47/1.44 Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 3, solver = Minisatapi, verbose = False, tracing = True} 5.47/1.44 interpretation 5.47/1.44 0 / 3A 3A 6A \ 5.47/1.44 | 0A 3A 3A | 5.47/1.44 \ 0A 3A 3A / 5.47/1.44 1 / 3A 3A 3A \ 5.47/1.44 | 3A 3A 3A | 5.47/1.44 \ 0A 0A 3A / 5.47/1.44 2 / 37A 38A 40A \ 5.47/1.44 | 37A 38A 40A | 5.47/1.44 \ 37A 38A 40A / 5.47/1.44 3 / 37A 37A 37A \ 5.47/1.44 | 37A 37A 37A | 5.47/1.44 \ 37A 37A 37A / 5.47/1.44 [2, 1, 0] |-> [3, 0, 1] 5.47/1.44 lhs rhs ge gt 5.47/1.44 / 44A 46A 47A \ / 43A 43A 46A \ True True 5.47/1.44 | 44A 46A 47A | | 43A 43A 46A | 5.47/1.44 \ 44A 46A 47A / \ 43A 43A 46A / 5.47/1.44 [3, 0, 0] |-> [2, 0, 0] 5.47/1.44 lhs rhs ge gt 5.47/1.44 / 43A 46A 46A \ / 43A 46A 46A \ True False 5.47/1.44 | 43A 46A 46A | | 43A 46A 46A | 5.47/1.44 \ 43A 46A 46A / \ 43A 46A 46A / 5.47/1.44 [0, 1, 0] ->= [1, 0, 1] 5.47/1.44 lhs rhs ge gt 5.47/1.44 / 9A 12A 12A \ / 9A 9A 12A \ True False 5.47/1.44 | 9A 9A 12A | | 9A 9A 12A | 5.47/1.44 \ 9A 9A 12A / \ 9A 9A 9A / 5.47/1.44 [1, 0, 0] ->= [0, 0, 0] 5.47/1.44 lhs rhs ge gt 5.47/1.44 / 9A 12A 12A \ / 9A 12A 12A \ True False 5.47/1.44 | 9A 12A 12A | | 6A 9A 9A | 5.47/1.44 \ 6A 9A 9A / \ 6A 9A 9A / 5.47/1.44 property Termination 5.47/1.44 has value True 5.47/1.44 for SRS ( [3, 0, 0] |-> [2, 0, 0], [0, 1, 0] ->= [1, 0, 1], [1, 0, 0] ->= [0, 0, 0]) 5.47/1.44 reason 5.47/1.44 weights 5.47/1.44 Map [(3, 1/1)] 5.47/1.44 5.47/1.44 property Termination 5.47/1.44 has value True 5.47/1.44 for SRS ( [0, 1, 0] ->= [1, 0, 1], [1, 0, 0] ->= [0, 0, 0]) 5.47/1.44 reason 5.47/1.44 EDG has 0 SCCs 5.47/1.44 5.47/1.44 ************************************************** 5.47/1.44 summary 5.47/1.44 ************************************************** 5.47/1.44 SRS with 2 rules on 2 letters Remap { tracing = False} 5.47/1.44 SRS with 2 rules on 2 letters reverse each lhs and rhs 5.47/1.44 SRS with 2 rules on 2 letters DP transform 5.47/1.44 SRS with 6 rules on 4 letters Remap { tracing = False} 5.47/1.44 SRS with 6 rules on 4 letters weights 5.47/1.44 SRS with 4 rules on 4 letters EDG 5.47/1.44 SRS with 4 rules on 4 letters Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 3, solver = Minisatapi, verbose = False, tracing = True} 5.94/1.53 SRS with 3 rules on 4 letters weights 5.94/1.61 SRS with 2 rules on 2 letters EDG 6.37/1.64 6.37/1.65 ************************************************** 6.37/1.69 (2, 2)\Deepee(6, 4)\Weight(4, 4)\Matrix{\Arctic}{3}(3, 4)\Weight(2, 2)\EDG[] 6.37/1.69 ************************************************** 6.73/1.75 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.73/1.75 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 7.03/1.85 EOF