9.50/2.42 YES 9.50/2.42 property Termination 9.50/2.42 has value True 9.50/2.42 for SRS ( [b, a, a, b] -> [b, a, a, a], [a, b, b, a] -> [a, a, b, b], [b, a, a, a] -> [b, b, b, a]) 9.50/2.42 reason 9.50/2.42 remap for 3 rules 9.50/2.42 property Termination 9.50/2.42 has value True 9.50/2.42 for SRS ( [0, 1, 1, 0] -> [0, 1, 1, 1], [1, 0, 0, 1] -> [1, 1, 0, 0], [0, 1, 1, 1] -> [0, 0, 0, 1]) 9.50/2.42 reason 9.50/2.42 reverse each lhs and rhs 9.50/2.42 property Termination 9.50/2.42 has value True 9.50/2.42 for SRS ( [0, 1, 1, 0] -> [1, 1, 1, 0], [1, 0, 0, 1] -> [0, 0, 1, 1], [1, 1, 1, 0] -> [1, 0, 0, 0]) 9.50/2.42 reason 9.50/2.42 DP transform 9.50/2.42 property Termination 9.50/2.42 has value True 9.50/2.44 for SRS ( [0, 1, 1, 0] ->= [1, 1, 1, 0], [1, 0, 0, 1] ->= [0, 0, 1, 1], [1, 1, 1, 0] ->= [1, 0, 0, 0], [0#, 1, 1, 0] |-> [1#, 1, 1, 0], [1#, 0, 0, 1] |-> [0#, 0, 1, 1], [1#, 0, 0, 1] |-> [0#, 1, 1], [1#, 0, 0, 1] |-> [1#, 1], [1#, 1, 1, 0] |-> [1#, 0, 0, 0], [1#, 1, 1, 0] |-> [0#, 0, 0], [1#, 1, 1, 0] |-> [0#, 0]) 9.50/2.44 reason 9.50/2.44 remap for 10 rules 9.50/2.44 property Termination 9.50/2.44 has value True 9.50/2.44 for SRS ( [0, 1, 1, 0] ->= [1, 1, 1, 0], [1, 0, 0, 1] ->= [0, 0, 1, 1], [1, 1, 1, 0] ->= [1, 0, 0, 0], [2, 1, 1, 0] |-> [3, 1, 1, 0], [3, 0, 0, 1] |-> [2, 0, 1, 1], [3, 0, 0, 1] |-> [2, 1, 1], [3, 0, 0, 1] |-> [3, 1], [3, 1, 1, 0] |-> [3, 0, 0, 0], [3, 1, 1, 0] |-> [2, 0, 0], [3, 1, 1, 0] |-> [2, 0]) 9.50/2.44 reason 9.50/2.44 weights 9.50/2.44 Map [(0, 1/6), (1, 1/6)] 9.50/2.44 9.50/2.44 property Termination 9.50/2.44 has value True 9.50/2.44 for SRS ( [0, 1, 1, 0] ->= [1, 1, 1, 0], [1, 0, 0, 1] ->= [0, 0, 1, 1], [1, 1, 1, 0] ->= [1, 0, 0, 0], [2, 1, 1, 0] |-> [3, 1, 1, 0], [3, 0, 0, 1] |-> [2, 0, 1, 1], [3, 1, 1, 0] |-> [3, 0, 0, 0]) 9.50/2.44 reason 9.50/2.44 EDG has 1 SCCs 9.50/2.44 property Termination 9.50/2.44 has value True 9.50/2.44 for SRS ( [2, 1, 1, 0] |-> [3, 1, 1, 0], [3, 1, 1, 0] |-> [3, 0, 0, 0], [3, 0, 0, 1] |-> [2, 0, 1, 1], [0, 1, 1, 0] ->= [1, 1, 1, 0], [1, 0, 0, 1] ->= [0, 0, 1, 1], [1, 1, 1, 0] ->= [1, 0, 0, 0]) 9.50/2.44 reason 9.50/2.44 Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 9.50/2.44 interpretation 9.50/2.44 0 / 2A 2A \ 9.50/2.44 \ 2A 2A / 9.50/2.44 1 / 2A 4A \ 9.50/2.44 \ 0A 2A / 9.50/2.44 2 / 21A 22A \ 9.50/2.44 \ 21A 22A / 9.50/2.44 3 / 21A 22A \ 9.50/2.44 \ 21A 22A / 9.50/2.44 [2, 1, 1, 0] |-> [3, 1, 1, 0] 9.50/2.44 lhs rhs ge gt 9.50/2.44 / 29A 29A \ / 29A 29A \ True False 9.50/2.44 \ 29A 29A / \ 29A 29A / 9.50/2.44 [3, 1, 1, 0] |-> [3, 0, 0, 0] 9.50/2.44 lhs rhs ge gt 9.50/2.44 / 29A 29A \ / 28A 28A \ True True 9.50/2.44 \ 29A 29A / \ 28A 28A / 9.50/2.44 [3, 0, 0, 1] |-> [2, 0, 1, 1] 9.50/2.44 lhs rhs ge gt 9.50/2.44 / 28A 30A \ / 28A 30A \ True False 9.50/2.44 \ 28A 30A / \ 28A 30A / 9.50/2.44 [0, 1, 1, 0] ->= [1, 1, 1, 0] 9.50/2.44 lhs rhs ge gt 9.50/2.44 / 10A 10A \ / 10A 10A \ True False 9.50/2.44 \ 10A 10A / \ 8A 8A / 9.50/2.44 [1, 0, 0, 1] ->= [0, 0, 1, 1] 9.50/2.44 lhs rhs ge gt 9.50/2.44 / 10A 12A \ / 8A 10A \ True False 9.50/2.44 \ 8A 10A / \ 8A 10A / 9.50/2.44 [1, 1, 1, 0] ->= [1, 0, 0, 0] 9.50/2.44 lhs rhs ge gt 9.50/2.44 / 10A 10A \ / 10A 10A \ True False 9.50/2.44 \ 8A 8A / \ 8A 8A / 9.50/2.44 property Termination 9.50/2.44 has value True 9.50/2.44 for SRS ( [2, 1, 1, 0] |-> [3, 1, 1, 0], [3, 0, 0, 1] |-> [2, 0, 1, 1], [0, 1, 1, 0] ->= [1, 1, 1, 0], [1, 0, 0, 1] ->= [0, 0, 1, 1], [1, 1, 1, 0] ->= [1, 0, 0, 0]) 9.50/2.44 reason 9.50/2.44 EDG has 1 SCCs 9.50/2.44 property Termination 9.50/2.44 has value True 9.50/2.44 for SRS ( [2, 1, 1, 0] |-> [3, 1, 1, 0], [3, 0, 0, 1] |-> [2, 0, 1, 1], [0, 1, 1, 0] ->= [1, 1, 1, 0], [1, 0, 0, 1] ->= [0, 0, 1, 1], [1, 1, 1, 0] ->= [1, 0, 0, 0]) 9.50/2.44 reason 9.50/2.44 Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 9.50/2.44 interpretation 9.50/2.44 0 / 4A 6A \ 9.50/2.44 \ 2A 4A / 9.50/2.44 1 / 4A 4A \ 9.50/2.44 \ 4A 4A / 9.50/2.44 2 / 6A 8A \ 9.50/2.44 \ 6A 8A / 9.50/2.44 3 / 8A 8A \ 9.50/2.44 \ 8A 8A / 9.50/2.44 [2, 1, 1, 0] |-> [3, 1, 1, 0] 9.50/2.44 lhs rhs ge gt 9.50/2.44 / 20A 22A \ / 20A 22A \ True False 9.50/2.44 \ 20A 22A / \ 20A 22A / 9.50/2.44 [3, 0, 0, 1] |-> [2, 0, 1, 1] 9.50/2.44 lhs rhs ge gt 9.50/2.44 / 22A 22A \ / 20A 20A \ True True 9.50/2.44 \ 22A 22A / \ 20A 20A / 9.50/2.44 [0, 1, 1, 0] ->= [1, 1, 1, 0] 9.50/2.44 lhs rhs ge gt 9.50/2.44 / 18A 20A \ / 16A 18A \ True False 9.50/2.44 \ 16A 18A / \ 16A 18A / 9.50/2.44 [1, 0, 0, 1] ->= [0, 0, 1, 1] 9.50/2.44 lhs rhs ge gt 9.50/2.44 / 18A 18A \ / 18A 18A \ True False 9.50/2.44 \ 18A 18A / \ 16A 16A / 9.50/2.44 [1, 1, 1, 0] ->= [1, 0, 0, 0] 9.50/2.44 lhs rhs ge gt 9.50/2.44 / 16A 18A \ / 16A 18A \ True False 9.50/2.44 \ 16A 18A / \ 16A 18A / 9.50/2.44 property Termination 9.50/2.44 has value True 9.50/2.45 for SRS ( [2, 1, 1, 0] |-> [3, 1, 1, 0], [0, 1, 1, 0] ->= [1, 1, 1, 0], [1, 0, 0, 1] ->= [0, 0, 1, 1], [1, 1, 1, 0] ->= [1, 0, 0, 0]) 9.50/2.45 reason 9.50/2.45 weights 9.50/2.45 Map [(2, 1/1)] 9.50/2.45 9.50/2.45 property Termination 9.50/2.45 has value True 9.50/2.45 for SRS ( [0, 1, 1, 0] ->= [1, 1, 1, 0], [1, 0, 0, 1] ->= [0, 0, 1, 1], [1, 1, 1, 0] ->= [1, 0, 0, 0]) 9.50/2.45 reason 9.50/2.45 EDG has 0 SCCs 9.50/2.45 9.50/2.45 ************************************************** 9.50/2.45 summary 9.50/2.45 ************************************************** 9.50/2.45 SRS with 3 rules on 2 letters Remap { tracing = False} 9.50/2.45 SRS with 3 rules on 2 letters reverse each lhs and rhs 9.50/2.46 SRS with 3 rules on 2 letters DP transform 9.50/2.46 SRS with 10 rules on 4 letters Remap { tracing = False} 9.50/2.46 SRS with 10 rules on 4 letters weights 9.50/2.46 SRS with 6 rules on 4 letters EDG 9.50/2.46 SRS with 6 rules on 4 letters Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 9.50/2.46 SRS with 5 rules on 4 letters EDG 9.50/2.46 SRS with 5 rules on 4 letters Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 9.50/2.46 SRS with 4 rules on 4 letters weights 9.50/2.46 SRS with 3 rules on 2 letters EDG 9.50/2.46 9.50/2.46 ************************************************** 9.83/2.51 (3, 2)\Deepee(10, 4)\Weight(6, 4)\Matrix{\Arctic}{2}(5, 4)\Matrix{\Arctic}{2}(4, 4)\Weight(3, 2)\EDG[] 9.83/2.51 ************************************************** 12.66/3.27 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]} 12.66/3.27 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 12.72/3.36 EOF