0.00/0.67	YES
0.00/0.67	property Termination
0.00/0.67	has value True
0.00/0.67	for SRS ( [0, 0, 0, 0] -> [0, 1, 0, 1], [1, 0, 1, 0] -> [0, 1, 0, 0])
0.00/0.67	reason
0.00/0.67	  remap for 2 rules
0.00/0.67	   property Termination
0.00/0.68	has value True
0.00/0.68	for SRS ( [0, 0, 0, 0] -> [0, 1, 0, 1], [1, 0, 1, 0] -> [0, 1, 0, 0])
0.00/0.68	reason
0.00/0.68	  DP transform
0.00/0.68	   property Termination
0.00/0.68	has value True
0.00/0.69	for SRS ( [0, 0, 0, 0] ->= [0, 1, 0, 1], [1, 0, 1, 0] ->= [0, 1, 0, 0], [0#, 0, 0, 0] |-> [0#, 1, 0, 1], [0#, 0, 0, 0] |-> [1#, 0, 1], [0#, 0, 0, 0] |-> [0#, 1], [0#, 0, 0, 0] |-> [1#], [1#, 0, 1, 0] |-> [0#, 1, 0, 0], [1#, 0, 1, 0] |-> [1#, 0, 0], [1#, 0, 1, 0] |-> [0#, 0])
0.00/0.69	reason
0.00/0.69	  remap for 9 rules
0.00/0.69	   property Termination
0.00/0.69	has value True
2.78/0.72	for SRS ( [0, 0, 0, 0] ->= [0, 1, 0, 1], [1, 0, 1, 0] ->= [0, 1, 0, 0], [2, 0, 0, 0] |-> [2, 1, 0, 1], [2, 0, 0, 0] |-> [3, 0, 1], [2, 0, 0, 0] |-> [2, 1], [2, 0, 0, 0] |-> [3], [3, 0, 1, 0] |-> [2, 1, 0, 0], [3, 0, 1, 0] |-> [3, 0, 0], [3, 0, 1, 0] |-> [2, 0])
2.78/0.72	reason
2.78/0.73	  weights
2.78/0.73	    Map [(0, 2/1), (1, 2/1), (3, 1/1)]
2.78/0.75	  
2.78/0.76	   property Termination
2.78/0.76	has value True
2.78/0.76	for SRS ( [0, 0, 0, 0] ->= [0, 1, 0, 1], [1, 0, 1, 0] ->= [0, 1, 0, 0], [2, 0, 0, 0] |-> [2, 1, 0, 1])
2.78/0.76	reason
2.78/0.76	  EDG has 1 SCCs
2.78/0.76	   property Termination
2.78/0.76	has value True
2.78/0.76	for SRS ( [2, 0, 0, 0] |-> [2, 1, 0, 1], [0, 0, 0, 0] ->= [0, 1, 0, 1], [1, 0, 1, 0] ->= [0, 1, 0, 0])
2.78/0.76	reason
2.78/0.76	  Matrix   { monotone = Weak, domain = Arctic, bits = 4, dim = 3, solver = Minisatapi, verbose = False, tracing = True}
2.78/0.76	    interpretation
2.78/0.76	      0  / 0A 3A 3A \
2.78/0.76	         | 0A 3A 3A |
2.78/0.76	         \ 0A 0A 0A /
2.78/0.76	      1  / 0A 3A 3A \
2.78/0.76	         | 0A 0A 3A |
2.78/0.76	         \ 0A 0A 3A /
2.78/0.76	      2  / 28A 29A 30A \
2.78/0.76	         | 28A 29A 30A |
2.78/0.76	         \ 28A 29A 30A /
2.78/0.76	    [2, 0, 0, 0] |-> [2, 1, 0, 1]
2.78/0.76	     lhs                rhs                ge     gt
2.78/0.76	        / 35A 38A 38A \    / 34A 36A 37A \   True   True
2.78/0.76	        | 35A 38A 38A |    | 34A 36A 37A |        
2.78/0.76	        \ 35A 38A 38A /    \ 34A 36A 37A /        
2.78/0.76	    [0, 0, 0, 0] ->= [0, 1, 0, 1]
2.78/0.76	     lhs               rhs             ge     gt
2.78/0.76	        / 9A 12A 12A \    / 6A 9A 9A \   True   False
2.78/0.76	        | 9A 12A 12A |    | 6A 9A 9A |        
2.78/0.76	        \ 6A 9A  9A  /    \ 6A 6A 9A /        
2.78/0.76	    [1, 0, 1, 0] ->= [0, 1, 0, 0]
2.78/0.76	     lhs             rhs             ge     gt
2.78/0.76	        / 9A 9A 9A \    / 6A 9A 9A \   True   False
2.78/0.76	        | 6A 9A 9A |    | 6A 9A 9A |        
2.78/0.76	        \ 6A 9A 9A /    \ 6A 9A 9A /        
2.78/0.76	   property Termination
2.78/0.76	has value True
2.78/0.76	for SRS ( [0, 0, 0, 0] ->= [0, 1, 0, 1], [1, 0, 1, 0] ->= [0, 1, 0, 0])
2.78/0.76	reason
2.78/0.76	  EDG has 0 SCCs
2.78/0.76	
2.78/0.76	**************************************************
2.78/0.76	          summary
2.78/0.76	**************************************************
2.78/0.76	SRS with 2 rules on 2 letters       Remap   { tracing = False}
2.78/0.76	SRS with 2 rules on 2 letters       DP transform
2.78/0.76	SRS with 9 rules on 4 letters       Remap   { tracing = False}
2.78/0.76	SRS with 9 rules on 4 letters       weights
2.78/0.76	SRS with 3 rules on 3 letters       EDG
2.78/0.76	SRS with 3 rules on 3 letters       Matrix   { monotone = Weak, domain = Arctic, bits = 4, dim = 3, solver = Minisatapi, verbose = False, tracing = True}
2.78/0.76	SRS with 2 rules on 2 letters       EDG
2.78/0.76	
2.78/0.76	**************************************************
2.78/0.76	(2, 2)\Deepee(9, 4)\Weight(3, 3)\Matrix{\Arctic}{3}(2, 2)\EDG[]
2.78/0.76	**************************************************
3.18/0.89	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]}
3.18/0.89	in Apply (Worker Remap) (First_Of ([ yeah] <> noh))
3.50/0.92	EOF