5.93/1.85 NO 5.93/2.01 property Termination 5.93/2.01 has value False 5.93/2.01 for SRS ( [a] -> [], [a, b] -> [b, c, a, a], [a, c, c] -> [b, a]) 5.93/2.01 reason 5.93/2.01 remap for 3 rules 5.93/2.01 property Termination 5.93/2.01 has value False 5.93/2.01 for SRS ( [0] -> [], [0, 1] -> [1, 2, 0, 0], [0, 2, 2] -> [1, 0]) 5.93/2.01 reason 5.93/2.01 looping SRS derivation 5.93/2.01 Closure source : aaaaaaab 5.93/2.01 target : bcbcabcbcaaaaaaabaaa 5.93/2.01 steps : 24 5.93/2.01 strict : True 5.93/2.01 last_rule_app_source : 0 5.93/2.01 last_rule_app_target : 16 5.93/2.01 reason : Overlap (Inside 16) 5.93/2.01 Overlap (Inside 18) 5.93/2.01 Overlap (Inside 18) 5.93/2.01 Overlap (Inside 7) 5.93/2.01 Overlap (Inside 8) 5.93/2.01 Overlap (Inside 10) 5.93/2.01 Overlap (Inside 10) 5.93/2.01 Overlap (Inside 5) 5.93/2.01 Overlap (Inside 2) 5.93/2.01 Overlap (Inside 4) 5.93/2.01 Overlap (Inside 5) 5.93/2.01 Overlap (Inside 6) 5.93/2.01 Overlap (Inside 3) 5.93/2.01 Overlap (Left 1) 5.93/2.01 Overlap (Inside 2) 5.93/2.01 Overlap (Inside 2) 5.93/2.01 Overlap (Left 1) 5.93/2.01 Overlap (Left 1) 5.93/2.01 Overlap (Inside 2) 5.93/2.01 Overlap (Inside 2) 5.93/2.01 Overlap (Left 1) 5.93/2.01 Overlap (Left 1) 5.93/2.01 Overlap (Left 1) 5.93/2.01 Rule 1 5.93/2.01 Rule 1 5.93/2.01 Rule 1 5.93/2.01 Rule 1 5.93/2.01 Rule 0 5.93/2.01 Rule 0 5.93/2.01 Rule 1 5.93/2.01 Rule 1 5.93/2.01 Rule 0 5.93/2.01 Rule 0 5.93/2.01 Rule 1 5.93/2.01 Rule 2 5.93/2.01 Rule 2 5.93/2.01 Rule 1 5.93/2.01 Rule 1 5.93/2.01 Rule 1 5.93/2.01 Rule 1 5.93/2.01 Rule 0 5.93/2.01 Rule 0 5.93/2.01 Rule 2 5.93/2.01 Rule 1 5.93/2.01 Rule 0 5.93/2.01 Rule 0 5.93/2.01 Rule 2 5.93/2.01 5.93/2.01 5.93/2.01 ************************************************** 5.93/2.01 summary 5.93/2.01 ************************************************** 5.93/2.01 SRS with 3 rules on 3 letters Remap { tracing = False} 5.93/2.01 SRS with 3 rules on 3 letters looping SRS derivation 5.93/2.01 Closure source : aaaaaaab 5.93/2.01 target : bcbcabcbcaaaaaaabaaa 5.93/2.01 steps : 24 5.93/2.01 strict : True 5.93/2.01 last_rule_app_source : 0 5.93/2.01 last_rule_app_target : 16 5.93/2.01 reason : Overlap (Inside 16) 5.93/2.01 Overlap (Inside 18) 5.93/2.01 Overlap (Inside 18) 5.93/2.01 Overlap (Inside 7) 5.93/2.01 Overlap (Inside 8) 5.93/2.01 Overlap (Inside 10) 5.93/2.01 Overlap (Inside 10) 5.93/2.01 Overlap (Inside 5) 5.93/2.01 Overlap (Inside 2) 5.93/2.01 Overlap (Inside 4) 5.93/2.01 Overlap (Inside 5) 5.93/2.01 Overlap (Inside 6) 5.93/2.01 Overlap (Inside 3) 5.93/2.01 Overlap (Left 1) 5.93/2.01 Overlap (Inside 2) 5.93/2.01 Overlap (Inside 2) 5.93/2.01 Overlap (Left 1) 5.93/2.01 Overlap (Left 1) 5.93/2.01 Overlap (Inside 2) 5.93/2.01 Overlap (Inside 2) 5.93/2.01 Overlap (Left 1) 5.93/2.01 Overlap (Left 1) 5.93/2.01 Overlap (Left 1) 5.93/2.01 Rule 1 5.93/2.01 Rule 1 5.93/2.01 Rule 1 5.93/2.01 Rule 1 5.93/2.01 Rule 0 5.93/2.01 Rule 0 5.93/2.01 Rule 1 5.93/2.01 Rule 1 5.93/2.01 Rule 0 5.93/2.01 Rule 0 5.93/2.01 Rule 1 5.93/2.01 Rule 2 5.93/2.01 Rule 2 5.93/2.01 Rule 1 5.93/2.01 Rule 1 5.93/2.01 Rule 1 5.93/2.01 Rule 1 5.93/2.01 Rule 0 5.93/2.01 Rule 0 5.93/2.01 Rule 2 5.93/2.01 Rule 1 5.93/2.01 Rule 0 5.93/2.01 Rule 0 5.93/2.01 Rule 2 5.93/2.01 5.93/2.01 5.93/2.01 ************************************************** 5.93/2.01 (3, 3)\Loop[] 5.93/2.01 ************************************************** 11.91/3.02 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]} 11.91/3.03 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 11.91/3.06 EOF