9.88/2.51 YES 9.88/2.52 property Termination 9.88/2.54 has value True 10.28/2.65 for SRS ( [a, c] -> [c, b], [a] -> [b, b, b], [b, c, b] -> [a, c]) 10.28/2.65 reason 10.28/2.65 remap for 3 rules 10.28/2.65 property Termination 10.28/2.65 has value True 10.28/2.65 for SRS ( [0, 1] -> [1, 2], [0] -> [2, 2, 2], [2, 1, 2] -> [0, 1]) 10.28/2.65 reason 10.28/2.65 DP transform 10.28/2.65 property Termination 10.28/2.65 has value True 10.28/2.65 for SRS ( [0, 1] ->= [1, 2], [0] ->= [2, 2, 2], [2, 1, 2] ->= [0, 1], [0#, 1] |-> [2#], [0#] |-> [2#, 2, 2], [0#] |-> [2#, 2], [0#] |-> [2#], [2#, 1, 2] |-> [0#, 1]) 10.28/2.65 reason 10.28/2.65 remap for 8 rules 10.28/2.65 property Termination 10.28/2.65 has value True 10.28/2.65 for SRS ( [0, 1] ->= [1, 2], [0] ->= [2, 2, 2], [2, 1, 2] ->= [0, 1], [3, 1] |-> [4], [3] |-> [4, 2, 2], [3] |-> [4, 2], [3] |-> [4], [4, 1, 2] |-> [3, 1]) 10.28/2.65 reason 10.28/2.65 weights 10.28/2.65 Map [(1, 1/1)] 10.28/2.65 10.28/2.65 property Termination 10.28/2.65 has value True 10.28/2.66 for SRS ( [0, 1] ->= [1, 2], [0] ->= [2, 2, 2], [2, 1, 2] ->= [0, 1], [3] |-> [4, 2, 2], [3] |-> [4, 2], [3] |-> [4], [4, 1, 2] |-> [3, 1]) 10.28/2.66 reason 10.28/2.66 EDG has 1 SCCs 10.28/2.66 property Termination 10.28/2.66 has value True 10.28/2.66 for SRS ( [3] |-> [4, 2, 2], [4, 1, 2] |-> [3, 1], [3] |-> [4], [3] |-> [4, 2], [0, 1] ->= [1, 2], [0] ->= [2, 2, 2], [2, 1, 2] ->= [0, 1]) 10.28/2.66 reason 10.28/2.67 Matrix { monotone = Weak, domain = Natural, bits = 3, dim = 4, solver = Minisatapi, verbose = False, tracing = False} 10.28/2.67 interpretation 10.28/2.67 0 Wk / 1 0 0 0 \ 10.28/2.67 | 0 1 0 1 | 10.28/2.67 | 0 0 1 3 | 10.28/2.67 \ 0 0 0 1 / 10.28/2.68 1 Wk / 1 1 0 1 \ 10.28/2.68 | 1 3 1 0 | 10.28/2.68 | 0 0 2 4 | 10.28/2.68 \ 0 0 0 1 / 10.28/2.68 2 Wk / 1 0 0 0 \ 10.28/2.68 | 0 1 0 0 | 10.28/2.68 | 0 0 1 1 | 10.28/2.68 \ 0 0 0 1 / 11.11/2.85 3 Wk / 2 1 0 0 \ 11.11/2.85 | 1 2 0 3 | 11.11/2.85 | 0 0 0 4 | 11.11/2.85 \ 0 0 0 1 / 11.11/2.87 4 Wk / 2 1 0 0 \ 11.11/2.87 | 1 2 0 1 | 11.11/2.87 | 0 0 0 4 | 11.11/2.87 \ 0 0 0 1 / 11.11/2.87 [3] |-> [4, 2, 2] 11.11/2.88 lhs rhs ge gt 11.11/2.88 Wk / 2 1 0 0 \ Wk / 2 1 0 0 \ True False 11.11/2.88 | 1 2 0 3 | | 1 2 0 1 | 11.11/2.88 | 0 0 0 4 | | 0 0 0 4 | 11.11/2.88 \ 0 0 0 1 / \ 0 0 0 1 / 11.11/2.89 [4, 1, 2] |-> [3, 1] 11.11/2.89 lhs rhs ge gt 11.11/2.89 Wk / 3 5 1 3 \ Wk / 3 5 1 2 \ True True 11.11/2.89 | 3 7 2 4 | | 3 7 2 4 | 11.11/2.89 | 0 0 0 4 | | 0 0 0 4 | 11.11/2.89 \ 0 0 0 1 / \ 0 0 0 1 / 11.11/2.89 [3] |-> [4] 11.11/2.90 lhs rhs ge gt 11.11/2.90 Wk / 2 1 0 0 \ Wk / 2 1 0 0 \ True False 11.11/2.90 | 1 2 0 3 | | 1 2 0 1 | 11.11/2.90 | 0 0 0 4 | | 0 0 0 4 | 11.11/2.90 \ 0 0 0 1 / \ 0 0 0 1 / 11.11/2.90 [3] |-> [4, 2] 11.47/2.91 lhs rhs ge gt 11.47/2.91 Wk / 2 1 0 0 \ Wk / 2 1 0 0 \ True False 11.47/2.91 | 1 2 0 3 | | 1 2 0 1 | 11.47/2.91 | 0 0 0 4 | | 0 0 0 4 | 11.47/2.91 \ 0 0 0 1 / \ 0 0 0 1 / 11.47/2.91 [0, 1] ->= [1, 2] 11.47/2.92 lhs rhs ge gt 11.47/2.92 Wk / 1 1 0 1 \ Wk / 1 1 0 1 \ True False 11.47/2.92 | 1 3 1 1 | | 1 3 1 1 | 11.47/2.92 | 0 0 2 7 | | 0 0 2 6 | 11.47/2.92 \ 0 0 0 1 / \ 0 0 0 1 / 11.47/2.93 [0] ->= [2, 2, 2] 11.47/2.94 lhs rhs ge gt 11.47/2.94 Wk / 1 0 0 0 \ Wk / 1 0 0 0 \ True False 11.47/2.94 | 0 1 0 1 | | 0 1 0 0 | 11.47/2.94 | 0 0 1 3 | | 0 0 1 3 | 11.47/2.94 \ 0 0 0 1 / \ 0 0 0 1 / 11.47/2.95 [2, 1, 2] ->= [0, 1] 11.47/2.96 lhs rhs ge gt 11.47/2.96 Wk / 1 1 0 1 \ Wk / 1 1 0 1 \ True False 11.47/2.96 | 1 3 1 1 | | 1 3 1 1 | 11.47/2.96 | 0 0 2 7 | | 0 0 2 7 | 11.47/2.96 \ 0 0 0 1 / \ 0 0 0 1 / 11.47/2.96 property Termination 11.47/2.96 has value True 11.47/2.96 for SRS ( [3] |-> [4, 2, 2], [3] |-> [4], [3] |-> [4, 2], [0, 1] ->= [1, 2], [0] ->= [2, 2, 2], [2, 1, 2] ->= [0, 1]) 11.47/2.96 reason 11.47/2.96 weights 11.47/2.96 Map [(3, 3/1)] 11.47/2.97 11.47/2.97 property Termination 11.47/2.97 has value True 11.47/2.97 for SRS ( [0, 1] ->= [1, 2], [0] ->= [2, 2, 2], [2, 1, 2] ->= [0, 1]) 11.47/2.97 reason 11.47/2.97 EDG has 0 SCCs 11.47/2.97 11.47/2.97 ************************************************** 11.47/2.97 summary 11.47/2.97 ************************************************** 11.47/2.97 SRS with 3 rules on 3 letters Remap { tracing = False} 11.47/2.97 SRS with 3 rules on 3 letters DP transform 11.47/2.98 SRS with 8 rules on 5 letters Remap { tracing = False} 11.47/2.98 SRS with 8 rules on 5 letters weights 11.47/2.98 SRS with 7 rules on 5 letters EDG 11.47/2.98 SRS with 7 rules on 5 letters Matrix { monotone = Weak, domain = Natural, bits = 3, dim = 4, solver = Minisatapi, verbose = False, tracing = False} 11.78/2.99 SRS with 6 rules on 5 letters weights 11.78/2.99 SRS with 3 rules on 3 letters EDG 11.78/2.99 11.78/2.99 ************************************************** 11.78/2.99 (3, 3)\Deepee(8, 5)\Weight(7, 5)\Matrix{\Natural}{4}(6, 5)\Weight(3, 3)\EDG[] 11.78/2.99 ************************************************** 13.53/3.44 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]} 13.53/3.44 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 13.53/3.48 EOF