3.93/1.07 NO 3.93/1.07 property Termination 3.93/1.07 has value False 3.93/1.07 for SRS ( [a, b] -> [], [a, c] -> [c, c, c, b], [b, c] -> [a, b]) 3.93/1.07 reason 3.93/1.08 remap for 3 rules 3.93/1.08 property Termination 3.93/1.08 has value False 3.93/1.08 for SRS ( [0, 1] -> [], [0, 2] -> [2, 2, 2, 1], [1, 2] -> [0, 1]) 3.93/1.08 reason 3.93/1.08 looping SRS derivation 3.93/1.08 Closure source : bccccccc 3.93/1.08 target : cccbcccccccbbb 3.93/1.08 steps : 30 4.23/1.08 strict : True 4.23/1.08 last_rule_app_source : 0 4.23/1.08 last_rule_app_target : 10 4.23/1.08 reason : Overlap (Inside 10) 4.23/1.08 Overlap (Inside 10) 4.23/1.08 Overlap (Inside 9) 4.23/1.08 Overlap (Inside 9) 4.23/1.08 Overlap (Inside 6) 4.23/1.08 Overlap (Inside 7) 4.23/1.08 Overlap (Inside 8) 4.23/1.08 Overlap (Inside 9) 4.23/1.08 Overlap (Inside 9) 4.23/1.08 Overlap (Inside 8) 4.23/1.08 Overlap (Inside 9) 4.23/1.08 Overlap (Inside 10) 4.23/1.08 Overlap (Inside 10) 4.23/1.08 Overlap (Inside 12) 4.23/1.08 Overlap (Inside 12) 4.23/1.08 Overlap (Inside 7) 4.23/1.08 Overlap (Inside 9) 4.23/1.08 Overlap (Inside 6) 4.23/1.09 Overlap (Inside 0) 4.23/1.09 Overlap (Inside 1) 4.23/1.09 Overlap (Inside 2) 4.23/1.09 Overlap (Inside 3) 4.23/1.09 Overlap (Right 1) 4.23/1.09 Overlap (Inside 5) 4.23/1.09 Overlap (Right 1) 4.23/1.09 Overlap (Right 1) 4.23/1.09 Overlap (Right 1) 4.23/1.09 Overlap (Right 1) 4.23/1.10 Overlap (Right 1) 4.23/1.10 Rule 2 4.23/1.10 Rule 2 4.23/1.10 Rule 2 4.23/1.10 Rule 2 4.23/1.10 Rule 2 4.23/1.10 Rule 2 4.23/1.10 Rule 0 4.23/1.10 Rule 1 4.23/1.10 Rule 1 4.23/1.10 Rule 1 4.23/1.10 Rule 1 4.23/1.10 Rule 1 4.23/1.10 Rule 2 4.23/1.10 Rule 2 4.23/1.10 Rule 2 4.23/1.10 Rule 2 4.23/1.10 Rule 0 4.23/1.10 Rule 2 4.23/1.10 Rule 0 4.23/1.10 Rule 1 4.23/1.10 Rule 2 4.23/1.10 Rule 2 4.23/1.10 Rule 0 4.23/1.10 Rule 1 4.23/1.10 Rule 1 4.23/1.10 Rule 1 4.23/1.10 Rule 2 4.23/1.10 Rule 0 4.23/1.10 Rule 2 4.23/1.10 Rule 0 4.23/1.10 4.23/1.10 4.23/1.10 ************************************************** 4.23/1.10 summary 4.23/1.10 ************************************************** 4.23/1.10 SRS with 3 rules on 3 letters Remap { tracing = False} 4.23/1.10 SRS with 3 rules on 3 letters looping SRS derivation 4.23/1.10 Closure source : bccccccc 4.23/1.10 target : cccbcccccccbbb 4.23/1.10 steps : 30 4.23/1.10 strict : True 4.23/1.10 last_rule_app_source : 0 4.23/1.10 last_rule_app_target : 10 4.23/1.10 reason : Overlap (Inside 10) 4.23/1.10 Overlap (Inside 10) 4.23/1.10 Overlap (Inside 9) 4.23/1.10 Overlap (Inside 9) 4.23/1.10 Overlap (Inside 6) 4.23/1.11 Overlap (Inside 7) 4.23/1.11 Overlap (Inside 8) 4.23/1.11 Overlap (Inside 9) 4.23/1.11 Overlap (Inside 9) 4.23/1.11 Overlap (Inside 8) 4.23/1.11 Overlap (Inside 9) 4.23/1.11 Overlap (Inside 10) 4.23/1.11 Overlap (Inside 10) 4.23/1.11 Overlap (Inside 12) 4.23/1.11 Overlap (Inside 12) 4.23/1.11 Overlap (Inside 7) 4.23/1.11 Overlap (Inside 9) 4.23/1.11 Overlap (Inside 6) 4.23/1.12 Overlap (Inside 0) 4.23/1.12 Overlap (Inside 1) 4.23/1.12 Overlap (Inside 2) 4.23/1.12 Overlap (Inside 3) 4.23/1.12 Overlap (Right 1) 4.23/1.12 Overlap (Inside 5) 4.23/1.12 Overlap (Right 1) 4.23/1.12 Overlap (Right 1) 4.23/1.12 Overlap (Right 1) 4.23/1.12 Overlap (Right 1) 4.23/1.12 Overlap (Right 1) 4.23/1.12 Rule 2 4.23/1.12 Rule 2 4.23/1.12 Rule 2 4.23/1.12 Rule 2 4.23/1.12 Rule 2 4.23/1.12 Rule 2 4.23/1.12 Rule 0 4.23/1.12 Rule 1 4.23/1.12 Rule 1 4.23/1.12 Rule 1 4.23/1.12 Rule 1 4.23/1.12 Rule 1 4.23/1.13 Rule 2 4.23/1.13 Rule 2 4.23/1.13 Rule 2 4.23/1.13 Rule 2 4.23/1.13 Rule 0 4.23/1.13 Rule 2 4.23/1.13 Rule 0 4.23/1.13 Rule 1 4.23/1.13 Rule 2 4.23/1.13 Rule 2 4.23/1.13 Rule 0 4.23/1.13 Rule 1 4.23/1.13 Rule 1 4.23/1.14 Rule 1 4.23/1.14 Rule 2 4.23/1.14 Rule 0 4.23/1.14 Rule 2 4.23/1.14 Rule 0 4.23/1.14 4.23/1.14 4.23/1.14 ************************************************** 4.23/1.14 (3, 3)\Loop[] 4.23/1.14 ************************************************** 8.85/2.35 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.85/2.36 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 9.14/2.39 EOF