12.97/3.32 NO 12.97/3.32 property Termination 12.97/3.32 has value False 12.97/3.32 for SRS ( [a] -> [b], [b, b, b, c] -> [a, c, c, b, a, a]) 12.97/3.32 reason 12.97/3.32 remap for 2 rules 12.97/3.32 property Termination 12.97/3.32 has value False 12.97/3.32 for SRS ( [0] -> [1], [1, 1, 1, 2] -> [0, 2, 2, 1, 0, 0]) 12.97/3.32 reason 12.97/3.32 looping SRS derivation 12.97/3.32 Closure source : bbbbbbbbac 12.97/3.32 target : accaccbaccaccbbbbbbbbacbaa 12.97/3.32 steps : 26 12.97/3.32 strict : True 12.97/3.32 last_rule_app_source : 0 12.97/3.32 last_rule_app_target : 20 12.97/3.32 reason : Overlap (Inside 20) 12.97/3.32 Overlap (Inside 17) 12.97/3.32 Overlap (Inside 18) 12.97/3.32 Overlap (Inside 14) 12.97/3.32 Overlap (Inside 15) 12.97/3.32 Overlap (Inside 10) 12.97/3.32 Overlap (Inside 11) 12.97/3.32 Overlap (Inside 12) 12.97/3.32 Overlap (Inside 7) 12.97/3.32 Overlap (Inside 7) 12.97/3.32 Overlap (Inside 8) 12.97/3.32 Overlap (Inside 3) 12.97/3.32 Overlap (Inside 7) 12.97/3.32 Overlap (Inside 7) 12.97/3.32 Overlap (Inside 8) 12.97/3.32 Overlap (Inside 9) 12.97/3.32 Overlap (Inside 4) 12.97/3.32 Overlap (Inside 5) 12.97/3.32 Overlap (Left 2) 12.97/3.32 Overlap (Inside 0) 12.97/3.32 Overlap (Left 2) 12.97/3.32 Overlap (Inside 0) 12.97/3.32 Overlap (Left 2) 12.97/3.32 Overlap (Inside 0) 12.97/3.32 Overlap (Outside 2) 12.97/3.32 Rule 0 12.97/3.33 Rule 1 12.97/3.33 Rule 0 12.97/3.33 Rule 1 12.97/3.33 Rule 0 12.97/3.33 Rule 1 12.97/3.33 Rule 0 12.97/3.33 Rule 1 12.97/3.33 Rule 0 12.97/3.33 Rule 0 12.97/3.33 Rule 0 12.97/3.33 Rule 0 12.97/3.33 Rule 1 12.97/3.33 Rule 0 12.97/3.33 Rule 1 12.97/3.33 Rule 0 12.97/3.33 Rule 0 12.97/3.33 Rule 1 12.97/3.33 Rule 0 12.97/3.33 Rule 0 12.97/3.33 Rule 1 12.97/3.33 Rule 0 12.97/3.33 Rule 0 12.97/3.33 Rule 0 12.97/3.33 Rule 0 12.97/3.33 Rule 0 12.97/3.33 12.97/3.33 12.97/3.33 ************************************************** 12.97/3.33 summary 12.97/3.33 ************************************************** 12.97/3.33 SRS with 2 rules on 3 letters Remap { tracing = False} 12.97/3.33 SRS with 2 rules on 3 letters looping SRS derivation 12.97/3.33 Closure source : bbbbbbbbac 12.97/3.33 target : accaccbaccaccbbbbbbbbacbaa 12.97/3.33 steps : 26 12.97/3.33 strict : True 12.97/3.33 last_rule_app_source : 0 12.97/3.33 last_rule_app_target : 20 12.97/3.33 reason : Overlap (Inside 20) 12.97/3.33 Overlap (Inside 17) 12.97/3.33 Overlap (Inside 18) 12.97/3.33 Overlap (Inside 14) 12.97/3.33 Overlap (Inside 15) 12.97/3.33 Overlap (Inside 10) 12.97/3.33 Overlap (Inside 11) 12.97/3.33 Overlap (Inside 12) 12.97/3.33 Overlap (Inside 7) 12.97/3.33 Overlap (Inside 7) 12.97/3.33 Overlap (Inside 8) 12.97/3.33 Overlap (Inside 3) 12.97/3.33 Overlap (Inside 7) 12.97/3.33 Overlap (Inside 7) 12.97/3.33 Overlap (Inside 8) 12.97/3.33 Overlap (Inside 9) 12.97/3.33 Overlap (Inside 4) 12.97/3.34 Overlap (Inside 5) 12.97/3.34 Overlap (Left 2) 12.97/3.34 Overlap (Inside 0) 12.97/3.34 Overlap (Left 2) 12.97/3.34 Overlap (Inside 0) 12.97/3.34 Overlap (Left 2) 12.97/3.34 Overlap (Inside 0) 12.97/3.34 Overlap (Outside 2) 12.97/3.34 Rule 0 12.97/3.34 Rule 1 12.97/3.35 Rule 0 12.97/3.35 Rule 1 12.97/3.35 Rule 0 12.97/3.35 Rule 1 12.97/3.35 Rule 0 12.97/3.35 Rule 1 12.97/3.35 Rule 0 12.97/3.35 Rule 0 12.97/3.35 Rule 0 12.97/3.35 Rule 0 12.97/3.35 Rule 1 12.97/3.35 Rule 0 12.97/3.35 Rule 1 12.97/3.35 Rule 0 12.97/3.35 Rule 0 12.97/3.35 Rule 1 12.97/3.35 Rule 0 12.97/3.35 Rule 0 12.97/3.35 Rule 1 12.97/3.35 Rule 0 12.97/3.35 Rule 0 12.97/3.35 Rule 0 12.97/3.35 Rule 0 12.97/3.35 Rule 0 12.97/3.35 12.97/3.35 12.97/3.35 ************************************************** 12.97/3.35 (2, 3)\Loop[] 12.97/3.35 ************************************************** 14.92/3.84 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]} 14.92/3.85 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 14.92/3.90 EOF