19.84/5.04 NO 20.12/5.13 property Termination 20.53/5.20 has value False 21.26/5.44 for SRS ( [a] -> [b], [b, a, b, c] -> [b, c, c, a, a, a]) 21.26/5.44 reason 21.26/5.44 remap for 2 rules 21.26/5.44 property Termination 21.26/5.44 has value False 21.72/5.49 for SRS ( [0] -> [1], [1, 0, 1, 2] -> [1, 2, 2, 0, 0, 0]) 21.72/5.49 reason 21.72/5.49 looping SRS derivation 21.72/5.49 Closure source : baacabccbcc 21.72/5.49 target : bccbccbccabccbaacabccbccaaa 21.72/5.50 steps : 20 21.72/5.50 strict : True 21.72/5.50 last_rule_app_source : 0 21.72/5.50 last_rule_app_target : 21 21.72/5.51 reason : Overlap (Right 3) 21.72/5.51 Overlap (Inside 23) 21.84/5.52 Overlap (Inside 21) 21.84/5.52 Overlap (Right 2) 21.84/5.52 Overlap (Inside 18) 21.87/5.54 Overlap (Inside 13) 21.87/5.54 Overlap (Inside 10) 21.87/5.54 Overlap (Right 3) 21.87/5.54 Overlap (Inside 14) 21.87/5.54 Overlap (Inside 10) 21.87/5.54 Overlap (Inside 6) 21.87/5.54 Overlap (Inside 10) 21.87/5.54 Overlap (Inside 8) 21.87/5.55 Overlap (Inside 6) 21.87/5.55 Overlap (Inside 3) 21.87/5.56 Overlap (Right 1) 21.87/5.56 Overlap (Inside 5) 21.87/5.56 Overlap (Inside 3) 21.87/5.56 Overlap (Outside 2) 21.87/5.56 Rule 0 21.87/5.56 Rule 1 21.87/5.56 Rule 0 21.87/5.56 Rule 0 21.87/5.56 Rule 1 21.87/5.56 Rule 1 21.87/5.56 Rule 0 21.87/5.56 Rule 0 21.87/5.56 Rule 0 21.87/5.56 Rule 1 21.87/5.59 Rule 0 22.18/5.61 Rule 0 22.18/5.66 Rule 1 22.49/5.73 Rule 1 22.49/5.74 Rule 0 22.49/5.77 Rule 0 23.03/5.84 Rule 1 23.03/5.86 Rule 0 23.03/5.91 Rule 0 23.41/5.92 Rule 1 23.41/5.95 23.41/5.95 23.71/6.03 ************************************************** 23.71/6.04 summary 23.71/6.04 ************************************************** 25.35/6.42 SRS with 2 rules on 3 letters Remap { tracing = False} 25.35/6.44 SRS with 2 rules on 3 letters looping SRS derivation 25.35/6.45 Closure source : baacabccbcc 25.35/6.45 target : bccbccbccabccbaacabccbccaaa 25.35/6.45 steps : 20 25.35/6.45 strict : True 25.35/6.45 last_rule_app_source : 0 25.35/6.47 last_rule_app_target : 21 25.35/6.47 reason : Overlap (Right 3) 25.35/6.47 Overlap (Inside 23) 25.35/6.47 Overlap (Inside 21) 25.35/6.48 Overlap (Right 2) 25.35/6.48 Overlap (Inside 18) 25.35/6.48 Overlap (Inside 13) 25.35/6.48 Overlap (Inside 10) 25.35/6.48 Overlap (Right 3) 25.35/6.49 Overlap (Inside 14) 25.35/6.49 Overlap (Inside 10) 25.35/6.49 Overlap (Inside 6) 25.35/6.51 Overlap (Inside 10) 25.74/6.51 Overlap (Inside 8) 25.74/6.51 Overlap (Inside 6) 25.74/6.51 Overlap (Inside 3) 25.74/6.51 Overlap (Right 1) 25.74/6.51 Overlap (Inside 5) 25.74/6.51 Overlap (Inside 3) 25.74/6.51 Overlap (Outside 2) 25.74/6.51 Rule 0 25.74/6.51 Rule 1 25.74/6.51 Rule 0 25.74/6.51 Rule 0 25.74/6.51 Rule 1 25.74/6.51 Rule 1 25.74/6.51 Rule 0 25.74/6.51 Rule 0 25.74/6.51 Rule 0 25.74/6.51 Rule 1 25.74/6.57 Rule 0 26.09/6.61 Rule 0 26.09/6.63 Rule 1 26.09/6.65 Rule 1 26.46/6.69 Rule 0 26.55/6.71 Rule 0 26.55/6.73 Rule 1 26.55/6.74 Rule 0 26.55/6.74 Rule 0 26.55/6.77 Rule 1 26.97/6.83 26.97/6.83 26.97/6.83 ************************************************** 26.97/6.83 (2, 3)\Loop[] 26.97/6.83 ************************************************** 56.31/14.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]} 56.31/14.23 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 56.80/14.36 EOF