21.79/5.54 NO 21.79/5.54 property Termination 21.79/5.54 has value False 21.96/5.57 for SRS ( [a] -> [], [a] -> [b], [a, b] -> [b, a, c, a], [b] -> [], [c, c] -> []) 21.96/5.57 reason 21.96/5.57 remap for 5 rules 21.96/5.57 property Termination 21.96/5.57 has value False 21.96/5.58 for SRS ( [0] -> [], [0] -> [1], [0, 1] -> [1, 0, 2, 0], [1] -> [], [2, 2] -> []) 21.96/5.58 reason 21.96/5.58 looping SRS derivation 21.96/5.58 Closure source : aaab 21.96/5.58 target : baaab 21.96/5.58 steps : 17 21.96/5.58 strict : True 21.96/5.58 last_rule_app_source : 0 21.96/5.58 last_rule_app_target : 4 21.96/5.58 reason : Overlap (Inside 4) 21.96/5.58 Overlap (Inside 4) 21.96/5.58 Overlap (Inside 5) 21.96/5.59 Overlap (Inside 2) 21.96/5.60 Overlap (Inside 3) 21.96/5.60 Overlap (Inside 3) 21.96/5.60 Overlap (Inside 3) 21.96/5.61 Overlap (Inside 4) 21.96/5.61 Overlap (Inside 5) 21.96/5.61 Overlap (Inside 7) 21.96/5.61 Overlap (Inside 8) 21.96/5.61 Overlap (Inside 6) 21.96/5.61 Overlap (Inside 3) 21.96/5.61 Overlap (Left 1) 21.96/5.61 Overlap (Inside 1) 21.96/5.61 Overlap (Left 1) 21.96/5.61 Rule 2 21.96/5.61 Rule 2 21.96/5.61 Rule 1 21.96/5.61 Rule 2 21.96/5.61 Rule 2 21.96/5.61 Rule 0 21.96/5.61 Rule 1 21.96/5.61 Rule 2 21.96/5.61 Rule 4 21.96/5.61 Rule 2 21.96/5.61 Rule 3 21.96/5.61 Rule 3 21.96/5.62 Rule 0 21.96/5.62 Rule 4 21.96/5.62 Rule 0 21.96/5.62 Rule 4 21.96/5.62 Rule 1 21.96/5.62 21.96/5.62 21.96/5.62 ************************************************** 21.96/5.62 summary 21.96/5.62 ************************************************** 21.96/5.62 SRS with 5 rules on 3 letters Remap { tracing = False} 21.96/5.62 SRS with 5 rules on 3 letters looping SRS derivation 21.96/5.62 Closure source : aaab 21.96/5.62 target : baaab 21.96/5.62 steps : 17 21.96/5.62 strict : True 21.96/5.62 last_rule_app_source : 0 21.96/5.62 last_rule_app_target : 4 21.96/5.62 reason : Overlap (Inside 4) 21.96/5.62 Overlap (Inside 4) 21.96/5.62 Overlap (Inside 5) 21.96/5.63 Overlap (Inside 2) 21.96/5.63 Overlap (Inside 3) 21.96/5.63 Overlap (Inside 3) 21.96/5.63 Overlap (Inside 3) 21.96/5.63 Overlap (Inside 4) 21.96/5.63 Overlap (Inside 5) 21.96/5.63 Overlap (Inside 7) 21.96/5.63 Overlap (Inside 8) 21.96/5.63 Overlap (Inside 6) 21.96/5.63 Overlap (Inside 3) 21.96/5.63 Overlap (Left 1) 21.96/5.63 Overlap (Inside 1) 21.96/5.63 Overlap (Left 1) 21.96/5.63 Rule 2 21.96/5.63 Rule 2 21.96/5.63 Rule 1 21.96/5.63 Rule 2 21.96/5.63 Rule 2 21.96/5.64 Rule 0 21.96/5.64 Rule 1 21.96/5.64 Rule 2 21.96/5.64 Rule 4 21.96/5.64 Rule 2 21.96/5.64 Rule 3 21.96/5.64 Rule 3 21.96/5.64 Rule 0 21.96/5.64 Rule 4 21.96/5.64 Rule 0 21.96/5.64 Rule 4 21.96/5.64 Rule 1 21.96/5.64 21.96/5.64 21.96/5.64 ************************************************** 21.96/5.64 (5, 3)\Loop[] 21.96/5.64 ************************************************** 24.23/6.22 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]} 24.23/6.24 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 24.65/6.32 EOF