7.58/2.01 YES 7.58/2.01 property Termination 7.58/2.01 has value True 7.58/2.01 for SRS ( [a] -> [], [a] -> [b, c], [c, b, b, b] -> [b, b, a, a]) 7.58/2.01 reason 7.58/2.01 remap for 3 rules 7.58/2.01 property Termination 7.58/2.01 has value True 7.58/2.01 for SRS ( [0] -> [], [0] -> [1, 2], [2, 1, 1, 1] -> [1, 1, 0, 0]) 7.58/2.01 reason 7.58/2.01 DP transform 7.58/2.01 property Termination 7.58/2.01 has value True 7.58/2.01 for SRS ( [0] ->= [], [0] ->= [1, 2], [2, 1, 1, 1] ->= [1, 1, 0, 0], [0#] |-> [2#], [2#, 1, 1, 1] |-> [0#, 0], [2#, 1, 1, 1] |-> [0#]) 7.58/2.01 reason 7.58/2.01 remap for 6 rules 7.58/2.01 property Termination 7.58/2.01 has value True 7.58/2.01 for SRS ( [0] ->= [], [0] ->= [1, 2], [2, 1, 1, 1] ->= [1, 1, 0, 0], [3] |-> [4], [4, 1, 1, 1] |-> [3, 0], [4, 1, 1, 1] |-> [3]) 7.58/2.01 reason 7.58/2.01 EDG has 1 SCCs 7.58/2.01 property Termination 7.58/2.01 has value True 7.58/2.01 for SRS ( [3] |-> [4], [4, 1, 1, 1] |-> [3], [4, 1, 1, 1] |-> [3, 0], [0] ->= [], [0] ->= [1, 2], [2, 1, 1, 1] ->= [1, 1, 0, 0]) 7.58/2.01 reason 7.58/2.01 Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 3, solver = Minisatapi, verbose = False, tracing = True} 7.58/2.01 interpretation 7.58/2.01 0 / 0A 0A 0A \ 7.58/2.01 | 0A 0A 0A | 7.58/2.01 \ 0A 0A 0A / 7.58/2.01 1 / 0A 3A 3A \ 7.58/2.01 | 0A 0A 3A | 7.58/2.01 \ 0A 0A 0A / 7.58/2.01 2 / 0A 0A 0A \ 7.58/2.01 | -3A -3A -3A | 7.58/2.01 \ -3A -3A -3A / 7.58/2.01 3 / 9A 9A 9A \ 7.58/2.01 | 9A 9A 9A | 7.58/2.01 \ 9A 9A 9A / 7.58/2.01 4 / 6A 6A 9A \ 7.58/2.01 | 6A 6A 9A | 7.58/2.01 \ 6A 6A 9A / 7.58/2.01 [3] |-> [4] 7.58/2.01 lhs rhs ge gt 7.58/2.01 / 9A 9A 9A \ / 6A 6A 9A \ True False 7.58/2.01 | 9A 9A 9A | | 6A 6A 9A | 7.58/2.01 \ 9A 9A 9A / \ 6A 6A 9A / 7.58/2.01 [4, 1, 1, 1] |-> [3] 7.58/2.01 lhs rhs ge gt 7.58/2.01 / 12A 12A 15A \ / 9A 9A 9A \ True True 7.58/2.01 | 12A 12A 15A | | 9A 9A 9A | 7.58/2.01 \ 12A 12A 15A / \ 9A 9A 9A / 7.58/2.01 [4, 1, 1, 1] |-> [3, 0] 7.58/2.01 lhs rhs ge gt 7.58/2.01 / 12A 12A 15A \ / 9A 9A 9A \ True True 7.58/2.01 | 12A 12A 15A | | 9A 9A 9A | 7.58/2.01 \ 12A 12A 15A / \ 9A 9A 9A / 7.58/2.01 [0] ->= [] 7.58/2.01 lhs rhs ge gt 7.58/2.01 / 0A 0A 0A \ / 0A - - \ True False 7.58/2.01 | 0A 0A 0A | | - 0A - | 7.58/2.01 \ 0A 0A 0A / \ - - 0A / 7.58/2.01 [0] ->= [1, 2] 7.58/2.01 lhs rhs ge gt 7.58/2.01 / 0A 0A 0A \ / 0A 0A 0A \ True False 7.58/2.01 | 0A 0A 0A | | 0A 0A 0A | 7.58/2.01 \ 0A 0A 0A / \ 0A 0A 0A / 7.58/2.01 [2, 1, 1, 1] ->= [1, 1, 0, 0] 7.58/2.01 lhs rhs ge gt 7.58/2.01 / 6A 6A 6A \ / 6A 6A 6A \ True False 7.58/2.01 | 3A 3A 3A | | 3A 3A 3A | 7.58/2.01 \ 3A 3A 3A / \ 3A 3A 3A / 7.58/2.01 property Termination 7.58/2.01 has value True 7.58/2.01 for SRS ( [3] |-> [4], [0] ->= [], [0] ->= [1, 2], [2, 1, 1, 1] ->= [1, 1, 0, 0]) 7.58/2.01 reason 7.58/2.02 weights 7.58/2.02 Map [(3, 1/1)] 7.58/2.02 7.58/2.02 property Termination 7.58/2.02 has value True 7.95/2.02 for SRS ( [0] ->= [], [0] ->= [1, 2], [2, 1, 1, 1] ->= [1, 1, 0, 0]) 7.95/2.02 reason 7.95/2.02 EDG has 0 SCCs 7.95/2.02 7.95/2.03 ************************************************** 7.95/2.03 summary 7.95/2.03 ************************************************** 7.95/2.03 SRS with 3 rules on 3 letters Remap { tracing = False} 7.95/2.03 SRS with 3 rules on 3 letters DP transform 7.95/2.03 SRS with 6 rules on 5 letters Remap { tracing = False} 7.95/2.03 SRS with 6 rules on 5 letters EDG 7.95/2.03 SRS with 6 rules on 5 letters Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 3, solver = Minisatapi, verbose = False, tracing = True} 7.95/2.03 SRS with 4 rules on 5 letters weights 7.95/2.03 SRS with 3 rules on 3 letters EDG 7.95/2.03 7.95/2.03 ************************************************** 7.95/2.03 (3, 3)\Deepee(6, 5)\Matrix{\Arctic}{3}(4, 5)\Weight(3, 3)\EDG[] 7.95/2.03 ************************************************** 8.49/2.18 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]} 8.49/2.18 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 8.52/2.21 EOF