5.41/1.46	YES
5.41/1.46	property Termination
5.41/1.46	has value True
5.41/1.46	for SRS ( [a] -> [], [a] -> [b, c, b], [a, b, b] -> [b, b, a, a])
5.41/1.46	reason
5.41/1.46	  remap for 3 rules
5.41/1.46	   property Termination
5.41/1.47	has value True
5.41/1.47	for SRS ( [0] -> [], [0] -> [1, 2, 1], [0, 1, 1] -> [1, 1, 0, 0])
5.41/1.47	reason
5.41/1.47	  DP transform
5.41/1.47	   property Termination
5.41/1.47	has value True
5.76/1.48	for SRS ( [0] ->= [], [0] ->= [1, 2, 1], [0, 1, 1] ->= [1, 1, 0, 0], [0#, 1, 1] |-> [0#, 0], [0#, 1, 1] |-> [0#])
5.76/1.48	reason
5.76/1.48	  remap for 5 rules
5.76/1.48	   property Termination
5.76/1.48	has value True
5.76/1.48	for SRS ( [0] ->= [], [0] ->= [1, 2, 1], [0, 1, 1] ->= [1, 1, 0, 0], [3, 1, 1] |-> [3, 0], [3, 1, 1] |-> [3])
5.76/1.48	reason
5.76/1.49	  EDG has 1 SCCs
5.76/1.49	   property Termination
5.76/1.49	has value True
5.83/1.49	for SRS ( [3, 1, 1] |-> [3, 0], [3, 1, 1] |-> [3], [0] ->= [], [0] ->= [1, 2, 1], [0, 1, 1] ->= [1, 1, 0, 0])
5.83/1.49	reason
5.83/1.50	  Matrix   { monotone = Weak, domain = Arctic, bits = 4, dim = 3, solver = Minisatapi, verbose = False, tracing = True}
5.83/1.50	    interpretation
5.83/1.50	      0  / 0A  0A  3A \
5.83/1.50	         | 0A  0A  3A |
5.83/1.50	         \ -3A -3A 0A /
5.83/1.50	      1  / 0A  0A 3A \
5.83/1.50	         | 0A  0A 3A |
5.83/1.50	         \ -3A 0A 0A /
5.83/1.50	      2  / 0A  0A  0A  \
5.83/1.50	         | -3A -3A -3A |
5.83/1.50	         \ -3A -3A -3A /
5.83/1.50	      3  / 18A 18A 19A \
5.83/1.50	         | 18A 18A 19A |
5.83/1.50	         \ 18A 18A 19A /
5.83/1.50	    [3, 1, 1] |-> [3, 0]
5.83/1.50	     lhs                rhs                ge     gt
5.83/1.50	        / 19A 21A 22A \    / 18A 18A 21A \   True   True
5.83/1.50	        | 19A 21A 22A |    | 18A 18A 21A |        
5.83/1.50	        \ 19A 21A 22A /    \ 18A 18A 21A /        
5.83/1.50	    [3, 1, 1] |-> [3]
5.83/1.50	     lhs                rhs                ge     gt
5.83/1.50	        / 19A 21A 22A \    / 18A 18A 19A \   True   True
5.83/1.50	        | 19A 21A 22A |    | 18A 18A 19A |        
5.83/1.50	        \ 19A 21A 22A /    \ 18A 18A 19A /        
5.83/1.50	    [0] ->= []
5.83/1.50	     lhs               rhs             ge     gt
5.83/1.50	        / 0A  0A  3A \    / 0A -  -  \   True   False
5.83/1.50	        | 0A  0A  3A |    | -  0A -  |        
5.83/1.50	        \ -3A -3A 0A /    \ -  -  0A /        
5.83/1.50	    [0] ->= [1, 2, 1]
5.83/1.50	     lhs               rhs               ge     gt
5.83/1.50	        / 0A  0A  3A \    / 0A  0A  3A \   True   False
5.83/1.50	        | 0A  0A  3A |    | 0A  0A  3A |        
5.83/1.50	        \ -3A -3A 0A /    \ -3A -3A 0A /        
5.83/1.51	    [0, 1, 1] ->= [1, 1, 0, 0]
5.83/1.51	     lhs             rhs             ge     gt
5.83/1.51	        / 3A 3A 6A \    / 3A 3A 6A \   True   False
5.83/1.51	        | 3A 3A 6A |    | 3A 3A 6A |        
5.83/1.51	        \ 0A 0A 3A /    \ 0A 0A 3A /        
5.83/1.51	   property Termination
5.83/1.51	has value True
5.83/1.51	for SRS ( [0] ->= [], [0] ->= [1, 2, 1], [0, 1, 1] ->= [1, 1, 0, 0])
5.83/1.51	reason
5.83/1.51	  EDG has 0 SCCs
5.83/1.51	
5.83/1.51	**************************************************
5.83/1.51	          summary
5.83/1.51	**************************************************
5.83/1.51	SRS with 3 rules on 3 letters       Remap   { tracing = False}
5.83/1.51	SRS with 3 rules on 3 letters       DP transform
5.83/1.51	SRS with 5 rules on 4 letters       Remap   { tracing = False}
5.83/1.51	SRS with 5 rules on 4 letters       EDG
5.83/1.51	SRS with 5 rules on 4 letters       Matrix   { monotone = Weak, domain = Arctic, bits = 4, dim = 3, solver = Minisatapi, verbose = False, tracing = True}
5.83/1.51	SRS with 3 rules on 3 letters       EDG
5.83/1.51	
5.83/1.51	**************************************************
5.83/1.52	(3, 3)\Deepee(5, 4)\Matrix{\Arctic}{3}(3, 3)\EDG[]
5.83/1.52	**************************************************
6.27/1.64	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]}
6.27/1.64	in Apply (Worker Remap) (First_Of ([ yeah] <> noh))
6.49/1.70	EOF