0.00/0.05	YES
0.00/0.05	property Termination
0.00/0.05	has value True
0.00/0.06	for SRS ( [a, b, c] -> [c, b, a], [C, B, A] -> [A, B, C], [b, a, C] -> [C, a, b], [c, A, B] -> [B, A, c], [A, c, b] -> [b, c, A], [B, C, a] -> [a, C, B], [a, A] -> [], [A, a] -> [], [b, B] -> [], [B, b] -> [], [c, C] -> [], [C, c] -> [])
0.00/0.06	reason
0.00/0.06	  remap for 12 rules
0.00/0.06	   property Termination
0.00/0.06	has value True
0.00/0.07	for SRS ( [0, 1, 2] -> [2, 1, 0], [3, 4, 5] -> [5, 4, 3], [1, 0, 3] -> [3, 0, 1], [2, 5, 4] -> [4, 5, 2], [5, 2, 1] -> [1, 2, 5], [4, 3, 0] -> [0, 3, 4], [0, 5] -> [], [5, 0] -> [], [1, 4] -> [], [4, 1] -> [], [2, 3] -> [], [3, 2] -> [])
0.00/0.07	reason
0.00/0.07	  weights
0.00/0.07	    Map [(0, 2/1), (1, 2/1), (2, 2/1), (3, 2/1), (4, 2/1), (5, 2/1)]
0.00/0.07	  
0.00/0.07	   property Termination
0.00/0.07	has value True
0.00/0.07	for SRS ( [0, 1, 2] -> [2, 1, 0], [3, 4, 5] -> [5, 4, 3], [1, 0, 3] -> [3, 0, 1], [2, 5, 4] -> [4, 5, 2], [5, 2, 1] -> [1, 2, 5], [4, 3, 0] -> [0, 3, 4])
0.00/0.08	reason
0.00/0.08	  reverse each lhs and rhs
0.00/0.08	   property Termination
0.00/0.08	has value True
0.00/0.08	for SRS ( [2, 1, 0] -> [0, 1, 2], [5, 4, 3] -> [3, 4, 5], [3, 0, 1] -> [1, 0, 3], [4, 5, 2] -> [2, 5, 4], [1, 2, 5] -> [5, 2, 1], [0, 3, 4] -> [4, 3, 0])
0.00/0.08	reason
0.00/0.08	  matchbound 1 certified by automaton with 70 states
0.00/0.08	  
0.00/0.08	
0.00/0.08	**************************************************
0.00/0.08	          summary
0.00/0.08	**************************************************
0.00/0.08	SRS with 12 rules on 6 letters       Remap   { tracing = False}
0.00/0.08	SRS with 12 rules on 6 letters       weights
0.00/0.08	SRS with 6 rules on 6 letters       reverse each lhs and rhs
0.00/0.08	SRS with 6 rules on 6 letters       Matchbound   { method = RFC, max_size = Nothing, verbose = False, tracing = False} matchbound 1 certified by automaton with 70 states
0.00/0.08	
0.00/0.08	**************************************************
0.00/0.08	(12, 6)\Weight(6, 6)\Rfcmatchbound[]
0.00/0.08	**************************************************
0.00/0.09	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]}
0.00/0.09	in Apply (Worker Remap) (First_Of ([ yeah] <> noh))
0.00/0.11	EOF