5.42/1.44 NO 5.42/1.44 property Termination 5.42/1.44 has value False 5.42/1.45 for SRS ( [a] -> [], [a, b] -> [b, a, c, b, a], [b] -> [], [c, c] -> []) 5.42/1.45 reason 5.42/1.46 remap for 4 rules 5.42/1.46 property Termination 5.42/1.46 has value False 5.42/1.46 for SRS ( [0] -> [], [0, 1] -> [1, 0, 2, 1, 0], [1] -> [], [2, 2] -> []) 5.42/1.46 reason 5.42/1.46 looping SRS derivation 5.42/1.46 Closure source : abbbcb 5.42/1.46 target : babbbcba 5.42/1.46 steps : 12 5.42/1.46 strict : True 5.42/1.46 last_rule_app_source : 0 5.42/1.46 last_rule_app_target : 5 5.42/1.46 reason : Overlap (Inside 5) 5.42/1.46 Overlap (Right 1) 5.42/1.46 Overlap (Right 1) 5.42/1.46 Overlap (Inside 6) 5.42/1.46 Overlap (Inside 6) 5.42/1.46 Overlap (Right 1) 5.42/1.46 Overlap (Inside 2) 5.42/1.46 Overlap (Inside 3) 5.42/1.46 Overlap (Inside 3) 5.42/1.46 Overlap (Right 1) 5.42/1.46 Overlap (Inside 3) 5.42/1.46 Rule 1 5.42/1.46 Rule 2 5.42/1.46 Rule 1 5.42/1.46 Rule 2 5.42/1.46 Rule 0 5.42/1.46 Rule 3 5.42/1.46 Rule 1 5.42/1.46 Rule 2 5.42/1.46 Rule 0 5.42/1.46 Rule 3 5.42/1.46 Rule 1 5.42/1.46 Rule 0 5.42/1.46 5.42/1.46 5.42/1.46 ************************************************** 5.42/1.46 summary 5.42/1.47 ************************************************** 5.42/1.47 SRS with 4 rules on 3 letters Remap { tracing = False} 5.42/1.47 SRS with 4 rules on 3 letters looping SRS derivation 5.42/1.47 Closure source : abbbcb 5.42/1.47 target : babbbcba 5.42/1.47 steps : 12 5.42/1.47 strict : True 5.42/1.47 last_rule_app_source : 0 5.42/1.47 last_rule_app_target : 5 5.42/1.47 reason : Overlap (Inside 5) 5.42/1.47 Overlap (Right 1) 5.42/1.47 Overlap (Right 1) 5.42/1.47 Overlap (Inside 6) 5.42/1.47 Overlap (Inside 6) 5.42/1.47 Overlap (Right 1) 5.42/1.47 Overlap (Inside 2) 5.42/1.47 Overlap (Inside 3) 5.42/1.47 Overlap (Inside 3) 5.75/1.47 Overlap (Right 1) 5.75/1.48 Overlap (Inside 3) 5.75/1.48 Rule 1 5.75/1.48 Rule 2 5.75/1.48 Rule 1 5.75/1.48 Rule 2 5.75/1.48 Rule 0 5.75/1.48 Rule 3 5.75/1.48 Rule 1 5.75/1.48 Rule 2 5.75/1.48 Rule 0 5.75/1.48 Rule 3 5.75/1.48 Rule 1 5.75/1.48 Rule 0 5.75/1.48 5.75/1.48 5.75/1.48 ************************************************** 5.75/1.48 (4, 3)\Loop[] 5.75/1.48 ************************************************** 7.59/2.03 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]} 7.59/2.05 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 8.49/2.25 EOF