3.61/0.93	YES
3.61/0.93	property Termination
3.61/0.93	has value True
3.61/0.93	for SRS ( [a, b, b, a] -> [b, a, b, a], [a, b, b, b] -> [a, a, b, a], [a, a, a, a] -> [b, b, b, a])
3.61/0.93	reason
3.61/0.93	  remap for 3 rules
3.61/0.93	   property Termination
3.61/0.93	has value True
3.61/0.93	for SRS ( [0, 1, 1, 0] -> [1, 0, 1, 0], [0, 1, 1, 1] -> [0, 0, 1, 0], [0, 0, 0, 0] -> [1, 1, 1, 0])
3.61/0.93	reason
3.61/0.93	  DP transform
3.61/0.93	   property Termination
3.61/0.93	has value True
3.61/0.93	for SRS ( [0, 1, 1, 0] ->= [1, 0, 1, 0], [0, 1, 1, 1] ->= [0, 0, 1, 0], [0, 0, 0, 0] ->= [1, 1, 1, 0], [0#, 1, 1, 0] |-> [0#, 1, 0], [0#, 1, 1, 1] |-> [0#, 0, 1, 0], [0#, 1, 1, 1] |-> [0#, 1, 0], [0#, 1, 1, 1] |-> [0#])
3.61/0.93	reason
3.61/0.93	  remap for 7 rules
3.61/0.93	   property Termination
3.61/0.93	has value True
3.61/0.93	for SRS ( [0, 1, 1, 0] ->= [1, 0, 1, 0], [0, 1, 1, 1] ->= [0, 0, 1, 0], [0, 0, 0, 0] ->= [1, 1, 1, 0], [2, 1, 1, 0] |-> [2, 1, 0], [2, 1, 1, 1] |-> [2, 0, 1, 0], [2, 1, 1, 1] |-> [2, 1, 0], [2, 1, 1, 1] |-> [2])
3.61/0.93	reason
3.61/0.93	  weights
3.61/0.93	    Map [(0, 1/5), (1, 1/5)]
3.61/0.93	  
3.61/0.93	   property Termination
3.61/0.93	has value True
3.61/0.93	for SRS ( [0, 1, 1, 0] ->= [1, 0, 1, 0], [0, 1, 1, 1] ->= [0, 0, 1, 0], [0, 0, 0, 0] ->= [1, 1, 1, 0], [2, 1, 1, 1] |-> [2, 0, 1, 0])
3.61/0.93	reason
3.61/0.93	  EDG has 1 SCCs
3.61/0.93	   property Termination
3.61/0.93	has value True
3.61/0.93	for SRS ( [2, 1, 1, 1] |-> [2, 0, 1, 0], [0, 1, 1, 0] ->= [1, 0, 1, 0], [0, 1, 1, 1] ->= [0, 0, 1, 0], [0, 0, 0, 0] ->= [1, 1, 1, 0])
3.61/0.93	reason
3.61/0.93	  Matrix   { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True}
3.61/0.93	    interpretation
3.61/0.93	      0  / 2A 4A \
3.61/0.93	         \ 2A 4A /
3.61/0.93	      1  / 4A 4A \
3.61/0.93	         \ 2A 2A /
3.61/0.93	      2  / 16A 17A \
3.61/0.93	         \ 16A 17A /
3.61/0.93	    [2, 1, 1, 1] |-> [2, 0, 1, 0]
3.61/0.93	     lhs            rhs            ge     gt
3.61/0.93	        / 28A 28A \    / 25A 27A \   True   True
3.61/0.93	        \ 28A 28A /    \ 25A 27A /        
3.61/0.93	    [0, 1, 1, 0] ->= [1, 0, 1, 0]
3.61/0.93	     lhs            rhs            ge     gt
3.61/0.93	        / 12A 14A \    / 12A 14A \   True   False
3.61/0.93	        \ 12A 14A /    \ 10A 12A /        
3.61/0.93	    [0, 1, 1, 1] ->= [0, 0, 1, 0]
3.61/0.93	     lhs            rhs            ge     gt
3.61/0.93	        / 14A 14A \    / 12A 14A \   True   False
3.61/0.93	        \ 14A 14A /    \ 12A 14A /        
3.61/0.93	    [0, 0, 0, 0] ->= [1, 1, 1, 0]
3.61/0.93	     lhs            rhs            ge     gt
3.61/0.93	        / 14A 16A \    / 14A 16A \   True   False
3.61/0.93	        \ 14A 16A /    \ 12A 14A /        
3.61/0.93	   property Termination
3.61/0.93	has value True
3.61/0.93	for SRS ( [0, 1, 1, 0] ->= [1, 0, 1, 0], [0, 1, 1, 1] ->= [0, 0, 1, 0], [0, 0, 0, 0] ->= [1, 1, 1, 0])
3.61/0.93	reason
3.61/0.93	  EDG has 0 SCCs
3.61/0.93	
3.61/0.93	**************************************************
3.61/0.93	          summary
3.61/0.93	**************************************************
3.61/0.93	SRS with 3 rules on 2 letters       Remap   { tracing = False}
3.61/0.93	SRS with 3 rules on 2 letters       DP transform
3.61/0.93	SRS with 7 rules on 3 letters       Remap   { tracing = False}
3.61/0.93	SRS with 7 rules on 3 letters       weights
3.61/0.93	SRS with 4 rules on 3 letters       EDG
3.61/0.93	SRS with 4 rules on 3 letters       Matrix   { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True}
3.61/0.93	SRS with 3 rules on 2 letters       EDG
3.61/0.93	
3.61/0.93	**************************************************
3.61/0.93	(3, 2)\Deepee(7, 3)\Weight(4, 3)\Matrix{\Arctic}{2}(3, 2)\EDG[]
3.61/0.93	**************************************************
4.96/1.31	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]}
4.96/1.31	in Apply (Worker Remap) (First_Of ([ yeah] <> noh))
4.96/1.33	EOF