24.65/6.31 NO 24.65/6.31 property Termination 24.65/6.31 has value False 24.65/6.31 for SRS ( [a] -> [], [a, a] -> [b, a, b, c, c], [c] -> [], [c, b] -> [a]) 24.65/6.31 reason 24.65/6.31 remap for 4 rules 24.65/6.31 property Termination 24.65/6.31 has value False 24.65/6.32 for SRS ( [0] -> [], [0, 0] -> [1, 0, 1, 2, 2], [2] -> [], [2, 1] -> [0]) 24.65/6.32 reason 24.65/6.32 looping SRS derivation 24.65/6.32 Closure source : ccccaa 24.65/6.32 target : babbabccccaacc 25.01/6.33 steps : 20 25.01/6.33 strict : True 25.01/6.33 last_rule_app_source : 0 25.01/6.33 last_rule_app_target : 10 25.01/6.33 reason : Overlap (Inside 10) 25.01/6.33 Overlap (Inside 12) 25.01/6.33 Overlap (Inside 13) 25.01/6.33 Overlap (Inside 7) 25.01/6.33 Overlap (Inside 7) 25.01/6.33 Overlap (Inside 3) 25.01/6.34 Overlap (Inside 3) 25.01/6.34 Overlap (Inside 4) 25.01/6.34 Overlap (Inside 4) 25.01/6.34 Overlap (Inside 0) 25.01/6.34 Overlap (Left 1) 25.01/6.34 Overlap (Inside 3) 25.01/6.34 Overlap (Inside 3) 25.01/6.35 Overlap (Inside 0) 25.01/6.35 Overlap (Left 1) 25.01/6.36 Overlap (Inside 0) 25.01/6.36 Overlap (Left 1) 25.01/6.36 Overlap (Inside 0) 25.01/6.36 Overlap (Left 1) 25.01/6.36 Rule 1 25.01/6.36 Rule 3 25.01/6.37 Rule 1 25.01/6.37 Rule 3 25.01/6.37 Rule 1 25.01/6.37 Rule 3 25.01/6.37 Rule 1 25.01/6.37 Rule 2 25.01/6.37 Rule 3 25.01/6.37 Rule 3 25.01/6.37 Rule 1 25.01/6.37 Rule 3 25.01/6.37 Rule 1 25.01/6.37 Rule 3 25.01/6.37 Rule 1 25.01/6.37 Rule 3 25.01/6.37 Rule 0 25.01/6.37 Rule 3 25.01/6.37 Rule 2 25.01/6.37 Rule 3 25.01/6.37 25.01/6.37 25.01/6.37 ************************************************** 25.01/6.37 summary 25.01/6.37 ************************************************** 25.01/6.38 SRS with 4 rules on 3 letters Remap { tracing = False} 25.01/6.38 SRS with 4 rules on 3 letters looping SRS derivation 25.01/6.38 Closure source : ccccaa 25.01/6.38 target : babbabccccaacc 25.01/6.38 steps : 20 25.01/6.38 strict : True 25.01/6.38 last_rule_app_source : 0 25.01/6.38 last_rule_app_target : 10 25.01/6.38 reason : Overlap (Inside 10) 25.01/6.38 Overlap (Inside 12) 25.01/6.38 Overlap (Inside 13) 25.01/6.38 Overlap (Inside 7) 25.01/6.38 Overlap (Inside 7) 25.01/6.38 Overlap (Inside 3) 25.01/6.39 Overlap (Inside 3) 25.01/6.39 Overlap (Inside 4) 25.24/6.40 Overlap (Inside 4) 25.24/6.40 Overlap (Inside 0) 25.24/6.40 Overlap (Left 1) 25.24/6.40 Overlap (Inside 3) 25.24/6.40 Overlap (Inside 3) 25.24/6.41 Overlap (Inside 0) 25.24/6.41 Overlap (Left 1) 25.24/6.41 Overlap (Inside 0) 25.24/6.41 Overlap (Left 1) 25.24/6.41 Overlap (Inside 0) 25.24/6.41 Overlap (Left 1) 25.24/6.41 Rule 1 25.24/6.41 Rule 3 25.24/6.41 Rule 1 25.24/6.41 Rule 3 25.24/6.41 Rule 1 25.24/6.41 Rule 3 25.24/6.41 Rule 1 25.24/6.41 Rule 2 25.24/6.41 Rule 3 25.24/6.41 Rule 3 25.24/6.41 Rule 1 25.24/6.41 Rule 3 25.24/6.41 Rule 1 25.24/6.42 Rule 3 25.24/6.42 Rule 1 25.24/6.42 Rule 3 25.24/6.42 Rule 0 25.24/6.42 Rule 3 25.24/6.42 Rule 2 25.24/6.42 Rule 3 25.24/6.42 25.24/6.42 25.24/6.42 ************************************************** 25.24/6.42 (4, 3)\Loop[] 25.24/6.42 ************************************************** 26.59/6.79 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]} 26.59/6.80 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 26.71/6.88 EOF