2.25/0.59	YES
2.25/0.59	property Termination
2.25/0.59	has value True
2.25/0.59	for SRS ( [a, b, c, a] -> [b, a, c, b, a, b], [a, d] -> [c], [a, f, f] -> [g], [b, g] -> [g, b], [c] -> [f, f], [c, a, c] -> [b, c, a, b, c], [c, d] -> [a, a], [g] -> [c, a], [g] -> [d, d, d, d])
2.25/0.59	reason
2.25/0.59	  remap for 9 rules
2.25/0.59	   property Termination
2.25/0.59	has value True
2.25/0.59	for SRS ( [0, 1, 2, 0] -> [1, 0, 2, 1, 0, 1], [0, 3] -> [2], [0, 4, 4] -> [5], [1, 5] -> [5, 1], [2] -> [4, 4], [2, 0, 2] -> [1, 2, 0, 1, 2], [2, 3] -> [0, 0], [5] -> [2, 0], [5] -> [3, 3, 3, 3])
2.25/0.59	reason
2.25/0.60	  weights
2.25/0.60	    Map [(0, 18/1), (2, 27/1), (3, 11/1), (4, 27/2), (5, 45/1)]
2.25/0.60	  
2.25/0.60	   property Termination
2.25/0.60	has value True
2.25/0.60	for SRS ( [0, 1, 2, 0] -> [1, 0, 2, 1, 0, 1], [0, 4, 4] -> [5], [1, 5] -> [5, 1], [2] -> [4, 4], [2, 0, 2] -> [1, 2, 0, 1, 2], [5] -> [2, 0])
2.25/0.60	reason
2.25/0.60	  reverse each lhs and rhs
2.25/0.60	   property Termination
2.25/0.60	has value True
2.25/0.60	for SRS ( [0, 2, 1, 0] -> [1, 0, 1, 2, 0, 1], [4, 4, 0] -> [5], [5, 1] -> [1, 5], [2] -> [4, 4], [2, 0, 2] -> [2, 1, 0, 2, 1], [5] -> [0, 2])
2.25/0.60	reason
2.25/0.60	  matchbound 5 certified by automaton with 120 states
2.25/0.60	  
2.25/0.60	
2.25/0.60	**************************************************
2.25/0.60	          summary
2.25/0.60	**************************************************
2.25/0.60	SRS with 9 rules on 6 letters       Remap   { tracing = False}
2.25/0.60	SRS with 9 rules on 6 letters       weights
2.25/0.60	SRS with 6 rules on 5 letters       reverse each lhs and rhs
2.25/0.60	SRS with 6 rules on 5 letters       Matchbound   { method = RFC, max_size = Nothing, verbose = False, tracing = False} matchbound 5 certified by automaton with 120 states
2.25/0.60	
2.25/0.60	**************************************************
2.25/0.61	(9, 6)\Weight(6, 5)\Rfcmatchbound[]
2.25/0.61	**************************************************
4.54/1.25	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]}
4.54/1.26	in Apply (Worker Remap) (First_Of ([ yeah] <> noh))
4.54/1.28	EOF