41.51/10.59 YES 41.51/10.59 property Termination 41.51/10.59 has value True 41.51/10.59 for SRS ( [b, b] -> [c, c, c, c], [c] -> [], [b, c, b] -> [b, b, b]) 41.51/10.59 reason 41.51/10.59 remap for 3 rules 41.51/10.59 property Termination 41.51/10.59 has value True 41.51/10.59 for SRS ( [0, 0] -> [1, 1, 1, 1], [1] -> [], [0, 1, 0] -> [0, 0, 0]) 41.51/10.59 reason 41.51/10.59 reverse each lhs and rhs 41.51/10.59 property Termination 41.51/10.59 has value True 41.51/10.59 for SRS ( [0, 0] -> [1, 1, 1, 1], [1] -> [], [0, 1, 0] -> [0, 0, 0]) 41.51/10.59 reason 41.51/10.59 DP transform 41.51/10.59 property Termination 41.51/10.59 has value True 41.51/10.59 for SRS ( [0, 0] ->= [1, 1, 1, 1], [1] ->= [], [0, 1, 0] ->= [0, 0, 0], [0#, 0] |-> [1#, 1, 1, 1], [0#, 0] |-> [1#, 1, 1], [0#, 0] |-> [1#, 1], [0#, 0] |-> [1#], [0#, 1, 0] |-> [0#, 0, 0], [0#, 1, 0] |-> [0#, 0]) 41.51/10.59 reason 41.51/10.59 remap for 9 rules 41.51/10.59 property Termination 41.51/10.59 has value True 41.51/10.59 for SRS ( [0, 0] ->= [1, 1, 1, 1], [1] ->= [], [0, 1, 0] ->= [0, 0, 0], [2, 0] |-> [3, 1, 1, 1], [2, 0] |-> [3, 1, 1], [2, 0] |-> [3, 1], [2, 0] |-> [3], [2, 1, 0] |-> [2, 0, 0], [2, 1, 0] |-> [2, 0]) 41.51/10.59 reason 41.51/10.59 weights 41.51/10.59 Map [(2, 4/1)] 41.51/10.59 41.51/10.59 property Termination 41.51/10.59 has value True 41.51/10.59 for SRS ( [0, 0] ->= [1, 1, 1, 1], [1] ->= [], [0, 1, 0] ->= [0, 0, 0], [2, 1, 0] |-> [2, 0, 0], [2, 1, 0] |-> [2, 0]) 41.51/10.59 reason 41.51/10.59 EDG has 1 SCCs 41.51/10.59 property Termination 41.51/10.59 has value True 41.51/10.59 for SRS ( [2, 1, 0] |-> [2, 0, 0], [2, 1, 0] |-> [2, 0], [0, 0] ->= [1, 1, 1, 1], [1] ->= [], [0, 1, 0] ->= [0, 0, 0]) 41.51/10.59 reason 41.51/10.59 Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 41.51/10.59 interpretation 41.51/10.59 0 / 2A 2A \ 41.51/10.59 \ 2A 2A / 41.51/10.59 1 / 0A 2A \ 41.51/10.59 \ -2A 0A / 41.51/10.59 2 / 26A 26A \ 41.51/10.59 \ 26A 26A / 41.51/10.59 [2, 1, 0] |-> [2, 0, 0] 41.51/10.59 lhs rhs ge gt 41.51/10.59 / 30A 30A \ / 30A 30A \ True False 41.51/10.59 \ 30A 30A / \ 30A 30A / 41.51/10.59 [2, 1, 0] |-> [2, 0] 41.51/10.59 lhs rhs ge gt 41.51/10.59 / 30A 30A \ / 28A 28A \ True True 41.51/10.59 \ 30A 30A / \ 28A 28A / 41.51/10.59 [0, 0] ->= [1, 1, 1, 1] 41.51/10.59 lhs rhs ge gt 41.51/10.59 / 4A 4A \ / 0A 2A \ True True 41.51/10.59 \ 4A 4A / \ -2A 0A / 41.51/10.59 [1] ->= [] 41.51/10.59 lhs rhs ge gt 41.51/10.59 / 0A 2A \ / 0A - \ True False 41.51/10.59 \ -2A 0A / \ - 0A / 41.51/10.59 [0, 1, 0] ->= [0, 0, 0] 41.51/10.59 lhs rhs ge gt 41.51/10.59 / 6A 6A \ / 6A 6A \ True False 41.51/10.59 \ 6A 6A / \ 6A 6A / 41.51/10.59 property Termination 41.51/10.59 has value True 41.51/10.59 for SRS ( [2, 1, 0] |-> [2, 0, 0], [0, 0] ->= [1, 1, 1, 1], [1] ->= [], [0, 1, 0] ->= [0, 0, 0]) 41.51/10.59 reason 41.51/10.59 EDG has 1 SCCs 41.51/10.59 property Termination 41.51/10.59 has value True 41.51/10.59 for SRS ( [2, 1, 0] |-> [2, 0, 0], [0, 0] ->= [1, 1, 1, 1], [1] ->= [], [0, 1, 0] ->= [0, 0, 0]) 41.51/10.60 reason 41.51/10.60 Matrix { monotone = Weak, domain = Arctic, bits = 3, dim = 4, solver = Minisatapi, verbose = False, tracing = False} 41.51/10.60 interpretation 41.51/10.60 0 Wk / 1A 1A 1A 0A \ 41.51/10.60 | 3A - 1A - | 41.51/10.60 | - 2A 0A 0A | 41.51/10.60 \ - - - 0A / 41.51/10.60 1 Wk / 0A - - - \ 41.51/10.60 | - 0A - - | 41.51/10.60 | 5A 1A 0A - | 41.51/10.60 \ - - - 0A / 41.51/10.60 2 Wk / - 0A 1A 0A \ 41.51/10.60 | - - - - | 41.51/10.60 | - - - - | 41.51/10.60 \ - - - 0A / 41.51/10.60 [2, 1, 0] |-> [2, 0, 0] 41.51/10.60 lhs rhs ge gt 41.51/10.60 Wk / 7A 7A 7A 6A \ Wk / 6A 4A 4A 3A \ True True 41.51/10.60 | - - - - | | - - - - | 41.51/10.60 | - - - - | | - - - - | 41.51/10.60 \ - - - 0A / \ - - - 0A / 41.51/10.60 [0, 0] ->= [1, 1, 1, 1] 41.51/10.60 lhs rhs ge gt 41.51/10.60 Wk / 4A 3A 2A 1A \ Wk / 0A - - - \ True False 41.51/10.60 | 4A 4A 4A 3A | | - 0A - - | 41.51/10.60 | 5A 2A 3A 0A | | 5A 1A 0A - | 41.51/10.60 \ - - - 0A / \ - - - 0A / 41.51/10.60 [1] ->= [] 41.51/10.60 lhs rhs ge gt 41.51/10.60 Wk / 0A - - - \ Wk / 0A - - - \ True False 41.51/10.60 | - 0A - - | | - 0A - - | 41.51/10.60 | 5A 1A 0A - | | - - 0A - | 41.51/10.60 \ - - - 0A / \ - - - 0A / 41.51/10.60 [0, 1, 0] ->= [0, 0, 0] 41.51/10.60 lhs rhs ge gt 41.51/10.60 Wk / 7A 7A 7A 6A \ Wk / 6A 5A 5A 4A \ True False 41.51/10.60 | 7A 7A 7A 6A | | 7A 6A 5A 4A | 41.51/10.60 | 6A 6A 6A 5A | | 6A 6A 6A 5A | 41.51/10.60 \ - - - 0A / \ - - - 0A / 41.51/10.60 property Termination 41.51/10.60 has value True 41.51/10.60 for SRS ( [0, 0] ->= [1, 1, 1, 1], [1] ->= [], [0, 1, 0] ->= [0, 0, 0]) 41.51/10.60 reason 41.51/10.60 EDG has 0 SCCs 41.51/10.60 41.51/10.60 ************************************************** 41.51/10.60 summary 41.51/10.60 ************************************************** 41.51/10.60 SRS with 3 rules on 2 letters Remap { tracing = False} 41.51/10.60 SRS with 3 rules on 2 letters reverse each lhs and rhs 41.51/10.60 SRS with 3 rules on 2 letters DP transform 41.51/10.60 SRS with 9 rules on 4 letters Remap { tracing = False} 41.51/10.60 SRS with 9 rules on 4 letters weights 41.51/10.60 SRS with 5 rules on 3 letters EDG 41.51/10.60 SRS with 5 rules on 3 letters Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 41.51/10.60 SRS with 4 rules on 3 letters EDG 41.51/10.60 SRS with 4 rules on 3 letters Matrix { monotone = Weak, domain = Arctic, bits = 3, dim = 4, solver = Minisatapi, verbose = False, tracing = False} 41.51/10.60 SRS with 3 rules on 2 letters EDG 41.51/10.60 41.51/10.60 ************************************************** 41.51/10.60 (3, 2)\Deepee(9, 4)\Weight(5, 3)\Matrix{\Arctic}{2}(4, 3)\Matrix{\Arctic}{4}(3, 2)\EDG[] 41.51/10.60 ************************************************** 41.91/10.62 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]} 41.91/10.62 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 42.06/10.74 EOF