7.13/1.88 YES 7.13/1.88 property Termination 7.13/1.88 has value True 7.13/1.88 for SRS ( [a, a, a] -> [a, a, b], [b, a, b] -> [a, b, a]) 7.13/1.88 reason 7.13/1.88 remap for 2 rules 7.13/1.88 property Termination 7.13/1.88 has value True 7.13/1.89 for SRS ( [0, 0, 0] -> [0, 0, 1], [1, 0, 1] -> [0, 1, 0]) 7.13/1.89 reason 7.13/1.89 reverse each lhs and rhs 7.13/1.89 property Termination 7.13/1.89 has value True 7.13/1.89 for SRS ( [0, 0, 0] -> [1, 0, 0], [1, 0, 1] -> [0, 1, 0]) 7.13/1.89 reason 7.13/1.89 DP transform 7.13/1.89 property Termination 7.13/1.89 has value True 7.48/1.93 for SRS ( [0, 0, 0] ->= [1, 0, 0], [1, 0, 1] ->= [0, 1, 0], [0#, 0, 0] |-> [1#, 0, 0], [1#, 0, 1] |-> [0#, 1, 0], [1#, 0, 1] |-> [1#, 0], [1#, 0, 1] |-> [0#]) 7.48/1.93 reason 7.48/1.93 remap for 6 rules 7.48/1.93 property Termination 7.48/1.93 has value True 7.48/1.93 for SRS ( [0, 0, 0] ->= [1, 0, 0], [1, 0, 1] ->= [0, 1, 0], [2, 0, 0] |-> [3, 0, 0], [3, 0, 1] |-> [2, 1, 0], [3, 0, 1] |-> [3, 0], [3, 0, 1] |-> [2]) 7.48/1.93 reason 7.48/1.93 weights 7.48/1.93 Map [(0, 1/3), (1, 1/3)] 7.48/1.93 7.48/1.93 property Termination 7.48/1.93 has value True 7.48/1.93 for SRS ( [0, 0, 0] ->= [1, 0, 0], [1, 0, 1] ->= [0, 1, 0], [2, 0, 0] |-> [3, 0, 0], [3, 0, 1] |-> [2, 1, 0]) 7.48/1.93 reason 7.48/1.93 EDG has 1 SCCs 7.48/1.93 property Termination 7.48/1.93 has value True 7.48/1.93 for SRS ( [2, 0, 0] |-> [3, 0, 0], [3, 0, 1] |-> [2, 1, 0], [0, 0, 0] ->= [1, 0, 0], [1, 0, 1] ->= [0, 1, 0]) 7.48/1.93 reason 7.48/1.93 Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 3, solver = Minisatapi, verbose = False, tracing = True} 7.48/1.93 interpretation 7.48/1.93 0 / 3A 6A 6A \ 7.48/1.93 | 3A 6A 6A | 7.48/1.93 \ 3A 3A 3A / 7.48/1.93 1 / 6A 6A 6A \ 7.48/1.93 | 3A 3A 6A | 7.48/1.93 \ 3A 3A 6A / 7.48/1.93 2 / 34A 35A 37A \ 7.48/1.93 | 34A 35A 37A | 7.48/1.93 \ 34A 35A 37A / 7.48/1.93 3 / 35A 35A 38A \ 7.48/1.93 | 35A 35A 38A | 7.48/1.93 \ 35A 35A 38A / 7.48/1.93 [2, 0, 0] |-> [3, 0, 0] 7.48/1.93 lhs rhs ge gt 7.48/1.93 / 44A 47A 47A \ / 44A 47A 47A \ True False 7.48/1.93 | 44A 47A 47A | | 44A 47A 47A | 7.48/1.93 \ 44A 47A 47A / \ 44A 47A 47A / 7.48/1.93 [3, 0, 1] |-> [2, 1, 0] 7.48/1.93 lhs rhs ge gt 7.48/1.93 / 47A 47A 47A \ / 46A 46A 46A \ True True 7.48/1.93 | 47A 47A 47A | | 46A 46A 46A | 7.48/1.93 \ 47A 47A 47A / \ 46A 46A 46A / 7.48/1.93 [0, 0, 0] ->= [1, 0, 0] 7.48/1.93 lhs rhs ge gt 7.48/1.93 / 15A 18A 18A \ / 15A 18A 18A \ True False 7.48/1.93 | 15A 18A 18A | | 12A 15A 15A | 7.48/1.93 \ 12A 15A 15A / \ 12A 15A 15A / 7.48/1.93 [1, 0, 1] ->= [0, 1, 0] 7.48/1.93 lhs rhs ge gt 7.48/1.93 / 15A 15A 18A \ / 15A 15A 15A \ True False 7.48/1.93 | 15A 15A 15A | | 15A 15A 15A | 7.48/1.93 \ 15A 15A 15A / \ 12A 15A 15A / 7.48/1.93 property Termination 7.48/1.93 has value True 7.48/1.93 for SRS ( [2, 0, 0] |-> [3, 0, 0], [0, 0, 0] ->= [1, 0, 0], [1, 0, 1] ->= [0, 1, 0]) 7.48/1.93 reason 7.48/1.93 weights 7.48/1.93 Map [(2, 1/1)] 7.48/1.93 7.48/1.93 property Termination 7.48/1.93 has value True 7.48/1.93 for SRS ( [0, 0, 0] ->= [1, 0, 0], [1, 0, 1] ->= [0, 1, 0]) 7.48/1.93 reason 7.48/1.93 EDG has 0 SCCs 7.48/1.93 7.48/1.93 ************************************************** 7.48/1.93 summary 7.48/1.93 ************************************************** 7.48/1.93 SRS with 2 rules on 2 letters Remap { tracing = False} 7.48/1.93 SRS with 2 rules on 2 letters reverse each lhs and rhs 7.48/1.93 SRS with 2 rules on 2 letters DP transform 7.48/1.93 SRS with 6 rules on 4 letters Remap { tracing = False} 7.48/1.93 SRS with 6 rules on 4 letters weights 7.48/1.93 SRS with 4 rules on 4 letters EDG 7.81/2.01 SRS with 4 rules on 4 letters Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 3, solver = Minisatapi, verbose = False, tracing = True} 7.81/2.01 SRS with 3 rules on 4 letters weights 7.81/2.01 SRS with 2 rules on 2 letters EDG 7.81/2.01 7.81/2.01 ************************************************** 7.81/2.01 (2, 2)\Deepee(6, 4)\Weight(4, 4)\Matrix{\Arctic}{3}(3, 4)\Weight(2, 2)\EDG[] 7.81/2.01 ************************************************** 7.81/2.03 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]} 7.81/2.03 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 8.11/2.09 EOF