4.23/1.13 NO 4.23/1.13 property Termination 4.23/1.13 has value False 4.23/1.14 for SRS ( [a] -> [], [a, b] -> [b, c, a, a], [c, c] -> [c, b, a]) 4.23/1.14 reason 4.23/1.14 remap for 3 rules 4.23/1.14 property Termination 4.23/1.14 has value False 4.23/1.15 for SRS ( [0] -> [], [0, 1] -> [1, 2, 0, 0], [2, 2] -> [2, 1, 0]) 4.23/1.16 reason 4.23/1.16 looping SRS derivation 4.23/1.16 Closure source : ccccc 4.23/1.16 target : cbbcbcbbcabcccccaaa 4.23/1.16 steps : 28 4.23/1.16 strict : True 4.23/1.16 last_rule_app_source : 0 4.23/1.16 last_rule_app_target : 15 4.23/1.17 reason : Overlap (Inside 15) 4.23/1.17 Overlap (Inside 15) 4.23/1.17 Overlap (Inside 14) 4.23/1.17 Overlap (Inside 14) 4.23/1.17 Overlap (Inside 13) 4.23/1.17 Overlap (Inside 13) 4.23/1.17 Overlap (Inside 12) 4.23/1.17 Overlap (Inside 12) 4.23/1.17 Overlap (Inside 10) 4.23/1.17 Overlap (Inside 7) 4.23/1.17 Overlap (Inside 9) 4.23/1.17 Overlap (Inside 10) 4.23/1.17 Overlap (Inside 11) 4.23/1.17 Overlap (Inside 12) 4.23/1.17 Overlap (Inside 5) 4.23/1.17 Overlap (Inside 6) 4.64/1.19 Overlap (Inside 7) 4.64/1.19 Overlap (Inside 7) 4.64/1.19 Overlap (Inside 6) 4.64/1.19 Overlap (Inside 6) 4.64/1.19 Overlap (Inside 4) 4.64/1.19 Overlap (Inside 5) 4.64/1.19 Overlap (Inside 2) 4.64/1.19 Overlap (Left 1) 4.64/1.19 Overlap (Inside 2) 4.64/1.20 Overlap (Left 1) 4.64/1.20 Overlap (Left 1) 4.64/1.20 Rule 2 4.64/1.20 Rule 2 4.64/1.20 Rule 2 4.64/1.20 Rule 1 4.64/1.20 Rule 2 4.64/1.20 Rule 1 4.64/1.20 Rule 1 4.64/1.20 Rule 1 4.64/1.20 Rule 0 4.64/1.20 Rule 0 4.64/1.20 Rule 0 4.64/1.20 Rule 0 4.64/1.20 Rule 2 4.64/1.20 Rule 2 4.64/1.20 Rule 1 4.64/1.20 Rule 1 4.64/1.20 Rule 1 4.64/1.20 Rule 1 4.64/1.20 Rule 1 4.64/1.20 Rule 1 4.64/1.20 Rule 0 4.64/1.20 Rule 0 4.64/1.20 Rule 0 4.64/1.20 Rule 0 4.64/1.20 Rule 0 4.64/1.20 Rule 0 4.64/1.20 Rule 0 4.64/1.20 Rule 0 4.71/1.20 4.71/1.20 4.71/1.21 ************************************************** 4.71/1.21 summary 4.71/1.21 ************************************************** 4.71/1.21 SRS with 3 rules on 3 letters Remap { tracing = False} 4.71/1.21 SRS with 3 rules on 3 letters looping SRS derivation 4.71/1.21 Closure source : ccccc 4.71/1.21 target : cbbcbcbbcabcccccaaa 4.71/1.21 steps : 28 4.71/1.21 strict : True 4.71/1.21 last_rule_app_source : 0 4.71/1.21 last_rule_app_target : 15 4.71/1.21 reason : Overlap (Inside 15) 4.71/1.21 Overlap (Inside 15) 4.71/1.22 Overlap (Inside 14) 4.71/1.22 Overlap (Inside 14) 4.71/1.22 Overlap (Inside 13) 4.71/1.22 Overlap (Inside 13) 4.71/1.22 Overlap (Inside 12) 4.71/1.22 Overlap (Inside 12) 4.71/1.22 Overlap (Inside 10) 4.71/1.22 Overlap (Inside 7) 4.71/1.22 Overlap (Inside 9) 4.71/1.22 Overlap (Inside 10) 4.71/1.22 Overlap (Inside 11) 4.71/1.22 Overlap (Inside 12) 4.71/1.22 Overlap (Inside 5) 4.78/1.23 Overlap (Inside 6) 4.78/1.23 Overlap (Inside 7) 4.78/1.23 Overlap (Inside 7) 4.78/1.23 Overlap (Inside 6) 4.78/1.23 Overlap (Inside 6) 4.78/1.23 Overlap (Inside 4) 4.78/1.23 Overlap (Inside 5) 4.78/1.23 Overlap (Inside 2) 4.78/1.23 Overlap (Left 1) 4.78/1.23 Overlap (Inside 2) 4.78/1.24 Overlap (Left 1) 4.78/1.24 Overlap (Left 1) 4.78/1.24 Rule 2 4.78/1.24 Rule 2 4.78/1.24 Rule 2 4.78/1.24 Rule 1 4.78/1.24 Rule 2 4.78/1.24 Rule 1 4.78/1.24 Rule 1 4.78/1.24 Rule 1 4.78/1.24 Rule 0 4.78/1.24 Rule 0 4.78/1.24 Rule 0 4.78/1.25 Rule 0 4.78/1.25 Rule 2 4.78/1.25 Rule 2 4.78/1.25 Rule 1 4.78/1.25 Rule 1 4.78/1.25 Rule 1 4.78/1.25 Rule 1 4.78/1.25 Rule 1 4.78/1.25 Rule 1 4.78/1.25 Rule 0 4.78/1.25 Rule 0 4.78/1.25 Rule 0 4.78/1.25 Rule 0 4.78/1.25 Rule 0 4.78/1.25 Rule 0 4.78/1.25 Rule 0 4.78/1.25 Rule 0 4.78/1.25 4.78/1.25 4.78/1.25 ************************************************** 4.78/1.25 (3, 3)\Loop[] 4.78/1.25 ************************************************** 8.26/2.23 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]} 8.26/2.23 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 8.26/2.27 EOF