5.95/1.52 YES 5.95/1.52 property Termination 5.95/1.52 has value True 5.95/1.52 for SRS ( [a] -> [], [a, b, b] -> [b, b, a, b, c, a], [b, c] -> []) 5.95/1.53 reason 5.95/1.53 remap for 3 rules 5.95/1.53 property Termination 5.95/1.53 has value True 5.95/1.54 for SRS ( [0] -> [], [0, 1, 1] -> [1, 1, 0, 1, 2, 0], [1, 2] -> []) 5.95/1.54 reason 5.95/1.54 DP transform 5.95/1.54 property Termination 5.95/1.54 has value True 5.95/1.55 for SRS ( [0] ->= [], [0, 1, 1] ->= [1, 1, 0, 1, 2, 0], [1, 2] ->= [], [0#, 1, 1] |-> [1#, 1, 0, 1, 2, 0], [0#, 1, 1] |-> [1#, 0, 1, 2, 0], [0#, 1, 1] |-> [0#, 1, 2, 0], [0#, 1, 1] |-> [1#, 2, 0], [0#, 1, 1] |-> [0#]) 5.95/1.55 reason 5.95/1.55 remap for 8 rules 5.95/1.55 property Termination 5.95/1.55 has value True 5.95/1.55 for SRS ( [0] ->= [], [0, 1, 1] ->= [1, 1, 0, 1, 2, 0], [1, 2] ->= [], [3, 1, 1] |-> [4, 1, 0, 1, 2, 0], [3, 1, 1] |-> [4, 0, 1, 2, 0], [3, 1, 1] |-> [3, 1, 2, 0], [3, 1, 1] |-> [4, 2, 0], [3, 1, 1] |-> [3]) 5.95/1.55 reason 5.95/1.55 weights 5.95/1.55 Map [(3, 3/1)] 5.95/1.55 5.95/1.56 property Termination 5.95/1.56 has value True 5.95/1.56 for SRS ( [0] ->= [], [0, 1, 1] ->= [1, 1, 0, 1, 2, 0], [1, 2] ->= [], [3, 1, 1] |-> [3, 1, 2, 0], [3, 1, 1] |-> [3]) 5.95/1.56 reason 5.95/1.56 EDG has 1 SCCs 5.95/1.56 property Termination 5.95/1.56 has value True 5.95/1.56 for SRS ( [3, 1, 1] |-> [3, 1, 2, 0], [3, 1, 1] |-> [3], [0] ->= [], [0, 1, 1] ->= [1, 1, 0, 1, 2, 0], [1, 2] ->= []) 5.95/1.56 reason 5.95/1.57 Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 5.95/1.57 interpretation 5.95/1.57 0 / 0A 0A \ 5.95/1.57 \ 0A 0A / 5.95/1.57 1 / 0A 2A \ 5.95/1.57 \ 0A 0A / 5.95/1.57 2 / 0A 0A \ 5.95/1.57 \ -2A -2A / 5.95/1.57 3 / 14A 16A \ 5.95/1.57 \ 14A 16A / 5.95/1.57 [3, 1, 1] |-> [3, 1, 2, 0] 5.95/1.57 lhs rhs ge gt 5.95/1.57 / 16A 18A \ / 16A 16A \ True False 5.95/1.57 \ 16A 18A / \ 16A 16A / 5.95/1.57 [3, 1, 1] |-> [3] 5.95/1.57 lhs rhs ge gt 5.95/1.57 / 16A 18A \ / 14A 16A \ True True 5.95/1.57 \ 16A 18A / \ 14A 16A / 5.95/1.57 [0] ->= [] 5.95/1.57 lhs rhs ge gt 5.95/1.57 / 0A 0A \ / 0A - \ True False 5.95/1.57 \ 0A 0A / \ - 0A / 6.19/1.58 [0, 1, 1] ->= [1, 1, 0, 1, 2, 0] 6.19/1.58 lhs rhs ge gt 6.19/1.58 / 2A 2A \ / 2A 2A \ True False 6.19/1.58 \ 2A 2A / \ 2A 2A / 6.19/1.58 [1, 2] ->= [] 6.19/1.58 lhs rhs ge gt 6.19/1.58 / 0A 0A \ / 0A - \ True False 6.19/1.58 \ 0A 0A / \ - 0A / 6.19/1.58 property Termination 6.19/1.58 has value True 6.19/1.59 for SRS ( [3, 1, 1] |-> [3, 1, 2, 0], [0] ->= [], [0, 1, 1] ->= [1, 1, 0, 1, 2, 0], [1, 2] ->= []) 6.19/1.59 reason 6.19/1.59 EDG has 1 SCCs 6.19/1.59 property Termination 6.19/1.59 has value True 6.19/1.59 for SRS ( [3, 1, 1] |-> [3, 1, 2, 0], [0] ->= [], [0, 1, 1] ->= [1, 1, 0, 1, 2, 0], [1, 2] ->= []) 6.19/1.59 reason 6.19/1.60 Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 6.19/1.60 interpretation 6.19/1.60 0 / 0A 0A \ 6.19/1.60 \ 0A 0A / 6.19/1.60 1 / 0A 2A \ 6.19/1.60 \ 0A 0A / 6.19/1.60 2 / 0A 0A \ 6.19/1.60 \ -2A -2A / 6.19/1.60 3 / 10A 11A \ 6.19/1.60 \ 10A 11A / 6.19/1.60 [3, 1, 1] |-> [3, 1, 2, 0] 6.19/1.60 lhs rhs ge gt 6.19/1.60 / 12A 13A \ / 11A 11A \ True True 6.19/1.61 \ 12A 13A / \ 11A 11A / 6.19/1.61 [0] ->= [] 6.19/1.61 lhs rhs ge gt 6.19/1.61 / 0A 0A \ / 0A - \ True False 6.19/1.61 \ 0A 0A / \ - 0A / 6.19/1.61 [0, 1, 1] ->= [1, 1, 0, 1, 2, 0] 6.19/1.61 lhs rhs ge gt 6.19/1.61 / 2A 2A \ / 2A 2A \ True False 6.19/1.61 \ 2A 2A / \ 2A 2A / 6.19/1.61 [1, 2] ->= [] 6.19/1.62 lhs rhs ge gt 6.19/1.62 / 0A 0A \ / 0A - \ True False 6.19/1.62 \ 0A 0A / \ - 0A / 6.19/1.62 property Termination 6.19/1.62 has value True 6.19/1.64 for SRS ( [0] ->= [], [0, 1, 1] ->= [1, 1, 0, 1, 2, 0], [1, 2] ->= []) 6.19/1.64 reason 6.19/1.64 EDG has 0 SCCs 6.19/1.64 6.19/1.64 ************************************************** 6.19/1.64 summary 6.19/1.64 ************************************************** 6.19/1.64 SRS with 3 rules on 3 letters Remap { tracing = False} 6.19/1.64 SRS with 3 rules on 3 letters DP transform 6.19/1.64 SRS with 8 rules on 5 letters Remap { tracing = False} 6.19/1.64 SRS with 8 rules on 5 letters weights 6.19/1.64 SRS with 5 rules on 4 letters EDG 6.19/1.64 SRS with 5 rules on 4 letters Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 6.19/1.64 SRS with 4 rules on 4 letters EDG 6.19/1.64 SRS with 4 rules on 4 letters Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 6.19/1.65 SRS with 3 rules on 3 letters EDG 6.19/1.65 6.19/1.65 ************************************************** 6.19/1.65 (3, 3)\Deepee(8, 5)\Weight(5, 4)\Matrix{\Arctic}{2}(4, 4)\Matrix{\Arctic}{2}(3, 3)\EDG[] 6.19/1.65 ************************************************** 8.88/2.33 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.88/2.33 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 9.42/2.43 EOF