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