0.00/0.03	YES
0.00/0.03	property Termination
0.00/0.03	has value True
0.00/0.03	for SRS ( [P] -> [Q, Q, p], [p, p] -> [q, q], [p, Q, Q] -> [Q, Q, p], [Q, p, q] -> [q, p, Q], [q, q, p] -> [p, q, q], [q, Q] -> [], [Q, q] -> [], [p, P] -> [], [P, p] -> [])
0.00/0.03	reason
0.00/0.03	  remap for 9 rules
0.00/0.03	   property Termination
0.00/0.03	has value True
0.00/0.04	for SRS ( [0] -> [1, 1, 2], [2, 2] -> [3, 3], [2, 1, 1] -> [1, 1, 2], [1, 2, 3] -> [3, 2, 1], [3, 3, 2] -> [2, 3, 3], [3, 1] -> [], [1, 3] -> [], [2, 0] -> [], [0, 2] -> [])
0.00/0.04	reason
0.00/0.04	  weights
0.00/0.04	    Map [(0, 6/1), (1, 2/1), (2, 1/1)]
0.00/0.04	  
0.00/0.04	   property Termination
0.00/0.04	has value True
0.00/0.04	for SRS ( [2, 1, 1] -> [1, 1, 2], [1, 2, 3] -> [3, 2, 1], [3, 3, 2] -> [2, 3, 3])
0.00/0.04	reason
0.00/0.04	  matchbound 1 certified by automaton with 37 states
0.00/0.04	  
0.00/0.04	
0.00/0.04	**************************************************
0.00/0.04	          summary
0.00/0.04	**************************************************
0.00/0.04	SRS with 9 rules on 4 letters       Remap   { tracing = False}
0.00/0.04	SRS with 9 rules on 4 letters       weights
0.00/0.04	SRS with 3 rules on 3 letters       Matchbound   { method = RFC, max_size = Nothing, verbose = False, tracing = False} matchbound 1 certified by automaton with 37 states
0.00/0.04	
0.00/0.04	**************************************************
0.00/0.04	(9, 4)\Weight(3, 3)\Rfcmatchbound[]
0.00/0.04	**************************************************
0.00/0.06	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.06	in Apply (Worker Remap) (First_Of ([ yeah] <> noh))
0.00/0.07	EOF