0.49/0.17	YES
0.49/0.17	property Termination
0.49/0.17	has value True
0.49/0.18	for SRS ( [twoto, 0] -> [p, p, s, s, s, p, p, p, s, s, s, 0, p, p, s, s], [twoto, s] -> [p, p, s, s, p, p, p, s, s, s, twice, p, p, s, s, p, p, p, s, s, s, twoto, p, s, p, s], [twice, 0] -> [p, s, p, s, 0, s, p, s, s, s, s, p, s], [twice, s] -> [s, p, p, p, p, s, s, s, s, s, twice, p, s, p, s, p, s, p, s], [p, p, s] -> [p], [p, s] -> [], [p, 0] -> [0, s, s, s, s, p, s], [0] -> [])
0.49/0.18	reason
0.49/0.18	  remap for 8 rules
0.49/0.18	   property Termination
0.49/0.18	has value True
0.49/0.18	for SRS ( [0, 1] -> [2, 2, 3, 3, 3, 2, 2, 2, 3, 3, 3, 1, 2, 2, 3, 3], [0, 3] -> [2, 2, 3, 3, 2, 2, 2, 3, 3, 3, 4, 2, 2, 3, 3, 2, 2, 2, 3, 3, 3, 0, 2, 3, 2, 3], [4, 1] -> [2, 3, 2, 3, 1, 3, 2, 3, 3, 3, 3, 2, 3], [4, 3] -> [3, 2, 2, 2, 2, 3, 3, 3, 3, 3, 4, 2, 3, 2, 3, 2, 3, 2, 3], [2, 2, 3] -> [2], [2, 3] -> [], [2, 1] -> [1, 3, 3, 3, 3, 2, 3], [1] -> [])
0.49/0.18	reason
0.49/0.18	  weights
0.49/0.18	    Map [(0, 1/1), (1, 1/1)]
0.49/0.18	  
0.49/0.18	   property Termination
0.49/0.18	has value True
0.49/0.18	for SRS ( [0, 3] -> [2, 2, 3, 3, 2, 2, 2, 3, 3, 3, 4, 2, 2, 3, 3, 2, 2, 2, 3, 3, 3, 0, 2, 3, 2, 3], [4, 1] -> [2, 3, 2, 3, 1, 3, 2, 3, 3, 3, 3, 2, 3], [4, 3] -> [3, 2, 2, 2, 2, 3, 3, 3, 3, 3, 4, 2, 3, 2, 3, 2, 3, 2, 3], [2, 2, 3] -> [2], [2, 3] -> [], [2, 1] -> [1, 3, 3, 3, 3, 2, 3])
0.49/0.18	reason
0.49/0.18	  matchbound 2 certified by automaton with 245 states
0.49/0.18	  
0.49/0.18	
0.49/0.18	**************************************************
0.49/0.18	          summary
0.49/0.18	**************************************************
0.49/0.18	SRS with 8 rules on 5 letters       Remap   { tracing = False}
0.49/0.18	SRS with 8 rules on 5 letters       weights
0.49/0.18	SRS with 6 rules on 5 letters       Matchbound   { method = RFC, max_size = Nothing, verbose = False, tracing = False} matchbound 2 certified by automaton with 245 states
0.49/0.18	
0.49/0.18	**************************************************
0.49/0.18	(8, 5)\Weight(6, 5)\Rfcmatchbound[]
0.49/0.18	**************************************************
2.08/0.72	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.08/0.72	in Apply (Worker Remap) (First_Of ([ yeah] <> noh))
2.31/0.75	EOF