2.40/0.69	YES
2.40/0.69	property Termination
2.40/0.69	has value True
2.40/0.69	for SRS ( [foo, 0] -> [0, s, p, p, p, s, s, s, p, s], [foo, s] -> [p, s, p, p, p, s, s, p, s, s, p, s, foo, p, p, s, s, p, s, bar, p, p, s, s, p, s], [bar, 0] -> [0, p, s, s, s], [bar, s] -> [p, s, p, p, s, s, foo, s, p, p, s, s], [p, p, s] -> [p], [p, s] -> [], [p, 0] -> [0, s, s, s, s])
2.40/0.69	reason
2.40/0.69	  remap for 7 rules
2.40/0.69	   property Termination
2.40/0.69	has value True
2.40/0.69	for SRS ( [0, 1] -> [1, 2, 3, 3, 3, 2, 2, 2, 3, 2], [0, 2] -> [3, 2, 3, 3, 3, 2, 2, 3, 2, 2, 3, 2, 0, 3, 3, 2, 2, 3, 2, 4, 3, 3, 2, 2, 3, 2], [4, 1] -> [1, 3, 2, 2, 2], [4, 2] -> [3, 2, 3, 3, 2, 2, 0, 2, 3, 3, 2, 2], [3, 3, 2] -> [3], [3, 2] -> [], [3, 1] -> [1, 2, 2, 2, 2])
2.40/0.69	reason
2.40/0.69	  reverse each lhs and rhs
2.40/0.69	   property Termination
2.40/0.69	has value True
2.40/0.69	for SRS ( [1, 0] -> [2, 3, 2, 2, 2, 3, 3, 3, 2, 1], [2, 0] -> [2, 3, 2, 2, 3, 3, 4, 2, 3, 2, 2, 3, 3, 0, 2, 3, 2, 2, 3, 2, 2, 3, 3, 3, 2, 3], [1, 4] -> [2, 2, 2, 3, 1], [2, 4] -> [2, 2, 3, 3, 2, 0, 2, 2, 3, 3, 2, 3], [2, 3, 3] -> [3], [2, 3] -> [], [1, 3] -> [2, 2, 2, 2, 1])
2.40/0.69	reason
2.40/0.70	  matchbound 2 certified by automaton with 155 states
2.40/0.70	  
2.40/0.70	
2.40/0.70	**************************************************
2.40/0.70	          summary
2.40/0.70	**************************************************
2.40/0.70	SRS with 7 rules on 5 letters       Remap   { tracing = False}
2.40/0.70	SRS with 7 rules on 5 letters       reverse each lhs and rhs
2.40/0.70	SRS with 7 rules on 5 letters       Matchbound   { method = RFC, max_size = Nothing, verbose = False, tracing = False} matchbound 2 certified by automaton with 155 states
2.40/0.70	
2.40/0.70	**************************************************
2.40/0.70	(7, 5)\Rfcmatchbound[]
2.40/0.70	**************************************************
5.10/1.42	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]}
5.10/1.43	in Apply (Worker Remap) (First_Of ([ yeah] <> noh))
5.10/1.47	EOF