0.00/0.15 YES 0.00/0.15 property Termination 0.00/0.15 has value True 0.00/0.17 for SRS ( [thrice, 0] -> [p, s, p, p, p, s, s, s, 0, p, s, p, s], [thrice, s] -> [p, p, s, s, half, p, p, s, s, p, s, sixtimes, p, s, p, p, s, s], [half, 0] -> [p, p, s, s, p, s, 0, p, s, s, s, s], [half, s] -> [p, s, p, p, s, s, p, p, s, s, half, p, p, s, s, p, s], [half, s, s] -> [p, s, p, s, s, p, p, s, s, half, p, p, s, s, p, s], [sixtimes, 0] -> [p, s, p, s, 0, s, s, s, s, s, p, s, p, s], [sixtimes, s] -> [p, p, s, s, s, s, s, s, s, p, p, s, p, s, s, s, sixtimes, p, s, p, p, p, s, s, s], [p, p, s] -> [p], [p, s] -> [], [p, 0] -> [0, s, s, s, s], [0] -> []) 0.00/0.17 reason 0.00/0.18 remap for 11 rules 0.00/0.18 property Termination 0.00/0.18 has value True 0.00/0.20 for SRS ( [0, 1] -> [2, 3, 2, 2, 2, 3, 3, 3, 1, 2, 3, 2, 3], [0, 3] -> [2, 2, 3, 3, 4, 2, 2, 3, 3, 2, 3, 5, 2, 3, 2, 2, 3, 3], [4, 1] -> [2, 2, 3, 3, 2, 3, 1, 2, 3, 3, 3, 3], [4, 3] -> [2, 3, 2, 2, 3, 3, 2, 2, 3, 3, 4, 2, 2, 3, 3, 2, 3], [4, 3, 3] -> [2, 3, 2, 3, 3, 2, 2, 3, 3, 4, 2, 2, 3, 3, 2, 3], [5, 1] -> [2, 3, 2, 3, 1, 3, 3, 3, 3, 3, 2, 3, 2, 3], [5, 3] -> [2, 2, 3, 3, 3, 3, 3, 3, 3, 2, 2, 3, 2, 3, 3, 3, 5, 2, 3, 2, 2, 2, 3, 3, 3], [2, 2, 3] -> [2], [2, 3] -> [], [2, 1] -> [1, 3, 3, 3, 3], [1] -> []) 0.00/0.20 reason 0.00/0.20 weights 0.00/0.21 Map [(0, 6/1), (1, 3/1), (4, 1/1), (5, 1/1)] 0.00/0.21 0.00/0.21 property Termination 0.00/0.21 has value True 0.00/0.21 for SRS ( [4, 3] -> [2, 3, 2, 2, 3, 3, 2, 2, 3, 3, 4, 2, 2, 3, 3, 2, 3], [4, 3, 3] -> [2, 3, 2, 3, 3, 2, 2, 3, 3, 4, 2, 2, 3, 3, 2, 3], [5, 3] -> [2, 2, 3, 3, 3, 3, 3, 3, 3, 2, 2, 3, 2, 3, 3, 3, 5, 2, 3, 2, 2, 2, 3, 3, 3], [2, 2, 3] -> [2], [2, 3] -> [], [2, 1] -> [1, 3, 3, 3, 3]) 0.00/0.21 reason 0.00/0.21 matchbound 2 certified by automaton with 227 states 0.00/0.21 0.00/0.21 0.00/0.21 ************************************************** 0.00/0.21 summary 0.00/0.21 ************************************************** 0.00/0.21 SRS with 11 rules on 6 letters Remap { tracing = False} 0.00/0.22 SRS with 11 rules on 6 letters weights 0.00/0.22 SRS with 6 rules on 5 letters Matchbound { method = RFC, max_size = Nothing, verbose = False, tracing = False} matchbound 2 certified by automaton with 227 states 0.00/0.22 0.00/0.22 ************************************************** 0.00/0.22 (11, 6)\Weight(6, 5)\Rfcmatchbound[] 0.00/0.22 ************************************************** 2.42/0.80 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]} 2.42/0.80 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 2.69/0.82 EOF