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