5.44/1.42 YES 5.44/1.42 property Termination 5.44/1.43 has value True 5.44/1.44 for SRS ( [a, a, a, a] -> [b, a, a, a], [a, b, b, b] -> [b, a, b, a], [b, b, a, a] -> [a, b, b, a]) 5.44/1.44 reason 5.44/1.44 remap for 3 rules 5.44/1.44 property Termination 5.44/1.44 has value True 5.44/1.44 for SRS ( [0, 0, 0, 0] -> [1, 0, 0, 0], [0, 1, 1, 1] -> [1, 0, 1, 0], [1, 1, 0, 0] -> [0, 1, 1, 0]) 5.44/1.44 reason 5.44/1.44 DP transform 5.44/1.44 property Termination 5.44/1.44 has value True 5.72/1.46 for SRS ( [0, 0, 0, 0] ->= [1, 0, 0, 0], [0, 1, 1, 1] ->= [1, 0, 1, 0], [1, 1, 0, 0] ->= [0, 1, 1, 0], [0#, 0, 0, 0] |-> [1#, 0, 0, 0], [0#, 1, 1, 1] |-> [1#, 0, 1, 0], [0#, 1, 1, 1] |-> [0#, 1, 0], [0#, 1, 1, 1] |-> [1#, 0], [0#, 1, 1, 1] |-> [0#], [1#, 1, 0, 0] |-> [0#, 1, 1, 0], [1#, 1, 0, 0] |-> [1#, 1, 0], [1#, 1, 0, 0] |-> [1#, 0]) 5.72/1.46 reason 5.72/1.46 remap for 11 rules 5.72/1.46 property Termination 5.72/1.46 has value True 5.72/1.49 for SRS ( [0, 0, 0, 0] ->= [1, 0, 0, 0], [0, 1, 1, 1] ->= [1, 0, 1, 0], [1, 1, 0, 0] ->= [0, 1, 1, 0], [2, 0, 0, 0] |-> [3, 0, 0, 0], [2, 1, 1, 1] |-> [3, 0, 1, 0], [2, 1, 1, 1] |-> [2, 1, 0], [2, 1, 1, 1] |-> [3, 0], [2, 1, 1, 1] |-> [2], [3, 1, 0, 0] |-> [2, 1, 1, 0], [3, 1, 0, 0] |-> [3, 1, 0], [3, 1, 0, 0] |-> [3, 0]) 5.72/1.49 reason 5.72/1.49 weights 5.72/1.49 Map [(0, 1/9), (1, 1/9)] 5.72/1.49 5.72/1.49 property Termination 5.72/1.49 has value True 5.72/1.49 for SRS ( [0, 0, 0, 0] ->= [1, 0, 0, 0], [0, 1, 1, 1] ->= [1, 0, 1, 0], [1, 1, 0, 0] ->= [0, 1, 1, 0], [2, 0, 0, 0] |-> [3, 0, 0, 0], [2, 1, 1, 1] |-> [3, 0, 1, 0], [3, 1, 0, 0] |-> [2, 1, 1, 0]) 5.72/1.49 reason 5.72/1.49 EDG has 1 SCCs 5.72/1.49 property Termination 5.72/1.49 has value True 5.72/1.50 for SRS ( [2, 0, 0, 0] |-> [3, 0, 0, 0], [3, 1, 0, 0] |-> [2, 1, 1, 0], [2, 1, 1, 1] |-> [3, 0, 1, 0], [0, 0, 0, 0] ->= [1, 0, 0, 0], [0, 1, 1, 1] ->= [1, 0, 1, 0], [1, 1, 0, 0] ->= [0, 1, 1, 0]) 5.72/1.50 reason 5.72/1.50 Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 5.72/1.50 interpretation 5.72/1.50 0 / 0A 2A \ 5.72/1.50 \ 0A 2A / 5.72/1.50 1 / 2A 2A \ 5.72/1.50 \ 0A 0A / 5.72/1.50 2 / 3A 5A \ 5.72/1.50 \ 3A 5A / 5.72/1.50 3 / 4A 4A \ 5.72/1.50 \ 4A 4A / 5.72/1.50 [2, 0, 0, 0] |-> [3, 0, 0, 0] 5.72/1.50 lhs rhs ge gt 5.72/1.50 / 9A 11A \ / 8A 10A \ True True 5.72/1.50 \ 9A 11A / \ 8A 10A / 5.72/1.50 [3, 1, 0, 0] |-> [2, 1, 1, 0] 5.72/1.50 lhs rhs ge gt 5.72/1.50 / 8A 10A \ / 7A 9A \ True True 5.72/1.50 \ 8A 10A / \ 7A 9A / 5.72/1.50 [2, 1, 1, 1] |-> [3, 0, 1, 0] 5.72/1.50 lhs rhs ge gt 5.72/1.50 / 9A 9A \ / 6A 8A \ True True 5.72/1.50 \ 9A 9A / \ 6A 8A / 5.72/1.50 [0, 0, 0, 0] ->= [1, 0, 0, 0] 5.72/1.50 lhs rhs ge gt 5.72/1.50 / 6A 8A \ / 6A 8A \ True False 5.72/1.50 \ 6A 8A / \ 4A 6A / 5.72/1.50 [0, 1, 1, 1] ->= [1, 0, 1, 0] 5.72/1.50 lhs rhs ge gt 5.72/1.50 / 6A 6A \ / 4A 6A \ True False 5.72/1.50 \ 6A 6A / \ 2A 4A / 5.72/1.50 [1, 1, 0, 0] ->= [0, 1, 1, 0] 5.72/1.50 lhs rhs ge gt 5.72/1.50 / 6A 8A \ / 4A 6A \ True False 5.72/1.50 \ 4A 6A / \ 4A 6A / 5.72/1.50 property Termination 5.72/1.50 has value True 5.72/1.51 for SRS ( [0, 0, 0, 0] ->= [1, 0, 0, 0], [0, 1, 1, 1] ->= [1, 0, 1, 0], [1, 1, 0, 0] ->= [0, 1, 1, 0]) 5.72/1.51 reason 5.72/1.51 EDG has 0 SCCs 5.72/1.51 5.72/1.51 ************************************************** 5.72/1.51 summary 5.72/1.51 ************************************************** 5.72/1.51 SRS with 3 rules on 2 letters Remap { tracing = False} 5.72/1.51 SRS with 3 rules on 2 letters DP transform 5.90/1.52 SRS with 11 rules on 4 letters Remap { tracing = False} 5.90/1.52 SRS with 11 rules on 4 letters weights 5.90/1.52 SRS with 6 rules on 4 letters EDG 5.90/1.53 SRS with 6 rules on 4 letters Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 5.90/1.53 SRS with 3 rules on 2 letters EDG 5.90/1.53 5.90/1.53 ************************************************** 5.90/1.53 (3, 2)\Deepee(11, 4)\Weight(6, 4)\Matrix{\Arctic}{2}(3, 2)\EDG[] 5.90/1.53 ************************************************** 7.05/1.83 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]} 7.05/1.83 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 7.20/1.90 EOF