0.00/0.03	YES
0.00/0.03	property Termination
0.00/0.03	has value True
0.00/0.04	for SRS ( [b, c, a] -> [a, b], [b, b, b] -> [c, a, c], [c, d] -> [d, c], [c, d, b] -> [d, c, c], [d, c] -> [b, b, b], [c, b] -> [d, a], [d, b, c] -> [a, a], [d, a] -> [b])
0.00/0.04	reason
0.00/0.04	  remap for 8 rules
0.00/0.04	   property Termination
0.00/0.04	has value True
0.00/0.04	for SRS ( [0, 1, 2] -> [2, 0], [0, 0, 0] -> [1, 2, 1], [1, 3] -> [3, 1], [1, 3, 0] -> [3, 1, 1], [3, 1] -> [0, 0, 0], [1, 0] -> [3, 2], [3, 0, 1] -> [2, 2], [3, 2] -> [0])
0.00/0.04	reason
0.00/0.04	  weights
0.00/0.04	    Map [(0, 1/7), (1, 1/7), (3, 2/7)]
0.00/0.04	  
0.00/0.04	   property Termination
0.00/0.04	has value True
0.00/0.04	for SRS ( [1, 3] -> [3, 1], [1, 3, 0] -> [3, 1, 1], [3, 1] -> [0, 0, 0], [1, 0] -> [3, 2])
0.00/0.04	reason
0.00/0.04	  DP transform
0.00/0.04	   property Termination
0.00/0.04	has value True
0.00/0.04	for SRS ( [1, 3] ->= [3, 1], [1, 3, 0] ->= [3, 1, 1], [3, 1] ->= [0, 0, 0], [1, 0] ->= [3, 2], [1#, 3] |-> [3#, 1], [1#, 3] |-> [1#], [1#, 3, 0] |-> [3#, 1, 1], [1#, 3, 0] |-> [1#, 1], [1#, 3, 0] |-> [1#], [1#, 0] |-> [3#, 2])
0.00/0.04	reason
0.00/0.04	  remap for 10 rules
0.00/0.04	   property Termination
0.00/0.04	has value True
0.00/0.04	for SRS ( [0, 1] ->= [1, 0], [0, 1, 2] ->= [1, 0, 0], [1, 0] ->= [2, 2, 2], [0, 2] ->= [1, 3], [4, 1] |-> [5, 0], [4, 1] |-> [4], [4, 1, 2] |-> [5, 0, 0], [4, 1, 2] |-> [4, 0], [4, 1, 2] |-> [4], [4, 2] |-> [5, 3])
0.00/0.04	reason
0.00/0.04	  weights
0.00/0.04	    Map [(0, 1/7), (1, 2/7), (2, 1/7), (4, 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 ( [0, 1] ->= [1, 0], [0, 1, 2] ->= [1, 0, 0], [1, 0] ->= [2, 2, 2], [0, 2] ->= [1, 3])
0.00/0.04	reason
0.00/0.04	  EDG has 0 SCCs
0.00/0.04	
0.00/0.04	**************************************************
0.00/0.04	          summary
0.00/0.04	**************************************************
0.00/0.04	SRS with 8 rules on 4 letters       Remap   { tracing = False}
0.00/0.04	SRS with 8 rules on 4 letters       weights
0.00/0.04	SRS with 4 rules on 4 letters       DP transform
0.00/0.04	SRS with 10 rules on 6 letters       Remap   { tracing = False}
0.00/0.04	SRS with 10 rules on 6 letters       weights
0.00/0.04	SRS with 4 rules on 4 letters       EDG
0.00/0.04	
0.00/0.04	**************************************************
0.00/0.04	(8, 4)\Weight(4, 4)\Deepee(10, 6)\Weight(4, 4)\EDG[]
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.06	EOF