5.75/1.51 NO 5.75/1.52 property Termination 5.75/1.52 has value False 5.75/1.52 for SRS ( [a, a] -> [a, b], [b, b, c] -> [c, c, a, a, a]) 5.75/1.52 reason 5.75/1.52 remap for 2 rules 5.75/1.52 property Termination 5.75/1.52 has value False 5.75/1.52 for SRS ( [0, 0] -> [0, 1], [1, 1, 2] -> [2, 2, 0, 0, 0]) 5.75/1.52 reason 5.75/1.52 looping SRS derivation 5.75/1.52 Closure source : bbcabccacc 5.75/1.52 target : ccaccaccaaccabbcabccaccaaa 5.75/1.52 steps : 24 5.75/1.52 strict : True 5.75/1.52 last_rule_app_source : 0 5.75/1.52 last_rule_app_target : 21 5.75/1.52 reason : Overlap (Right 2) 5.75/1.53 Overlap (Inside 20) 5.75/1.53 Overlap (Inside 21) 5.75/1.53 Overlap (Right 2) 5.75/1.53 Overlap (Inside 16) 5.75/1.53 Overlap (Inside 17) 5.75/1.53 Overlap (Right 1) 5.75/1.53 Overlap (Inside 12) 5.75/1.53 Overlap (Inside 13) 5.75/1.53 Overlap (Inside 10) 5.75/1.53 Overlap (Right 2) 5.75/1.53 Overlap (Inside 9) 5.75/1.53 Overlap (Inside 10) 6.01/1.53 Overlap (Inside 6) 6.01/1.53 Overlap (Inside 9) 6.01/1.53 Overlap (Inside 10) 6.01/1.53 Overlap (Inside 5) 6.01/1.53 Overlap (Inside 6) 6.01/1.56 Overlap (Inside 3) 6.01/1.56 Overlap (Right 1) 6.01/1.56 Overlap (Inside 2) 6.01/1.56 Overlap (Inside 3) 6.01/1.56 Overlap (Right 1) 6.01/1.56 Rule 1 6.01/1.56 Rule 0 6.01/1.56 Rule 0 6.15/1.57 Rule 0 6.15/1.57 Rule 1 6.15/1.57 Rule 1 6.15/1.57 Rule 0 6.15/1.57 Rule 0 6.15/1.57 Rule 0 6.15/1.57 Rule 0 6.15/1.57 Rule 1 6.15/1.57 Rule 0 6.15/1.57 Rule 0 6.15/1.57 Rule 1 6.15/1.57 Rule 1 6.15/1.57 Rule 0 6.15/1.57 Rule 0 6.15/1.57 Rule 0 6.15/1.57 Rule 0 6.15/1.57 Rule 0 6.15/1.57 Rule 1 6.15/1.57 Rule 0 6.15/1.57 Rule 0 6.15/1.57 Rule 1 6.15/1.57 6.15/1.57 6.15/1.57 ************************************************** 6.15/1.57 summary 6.15/1.57 ************************************************** 6.15/1.57 SRS with 2 rules on 3 letters Remap { tracing = False} 6.15/1.57 SRS with 2 rules on 3 letters looping SRS derivation 6.15/1.57 Closure source : bbcabccacc 6.15/1.57 target : ccaccaccaaccabbcabccaccaaa 6.15/1.57 steps : 24 6.15/1.57 strict : True 6.15/1.57 last_rule_app_source : 0 6.15/1.57 last_rule_app_target : 21 6.15/1.57 reason : Overlap (Right 2) 6.15/1.57 Overlap (Inside 20) 6.15/1.57 Overlap (Inside 21) 6.15/1.57 Overlap (Right 2) 6.15/1.57 Overlap (Inside 16) 6.15/1.57 Overlap (Inside 17) 6.15/1.57 Overlap (Right 1) 6.15/1.57 Overlap (Inside 12) 6.15/1.57 Overlap (Inside 13) 6.15/1.57 Overlap (Inside 10) 6.15/1.57 Overlap (Right 2) 6.15/1.58 Overlap (Inside 9) 6.15/1.58 Overlap (Inside 10) 6.15/1.58 Overlap (Inside 6) 6.15/1.58 Overlap (Inside 9) 6.15/1.58 Overlap (Inside 10) 6.15/1.58 Overlap (Inside 5) 6.15/1.58 Overlap (Inside 6) 6.15/1.58 Overlap (Inside 3) 6.15/1.58 Overlap (Right 1) 6.15/1.58 Overlap (Inside 2) 6.15/1.58 Overlap (Inside 3) 6.15/1.58 Overlap (Right 1) 6.15/1.58 Rule 1 6.15/1.58 Rule 0 6.15/1.58 Rule 0 6.15/1.58 Rule 0 6.15/1.58 Rule 1 6.15/1.58 Rule 1 6.15/1.58 Rule 0 6.15/1.58 Rule 0 6.15/1.58 Rule 0 6.15/1.58 Rule 0 6.15/1.58 Rule 1 6.15/1.58 Rule 0 6.15/1.58 Rule 0 6.15/1.58 Rule 1 6.15/1.58 Rule 1 6.15/1.58 Rule 0 6.15/1.58 Rule 0 6.15/1.58 Rule 0 6.15/1.58 Rule 0 6.15/1.58 Rule 0 6.15/1.58 Rule 1 6.15/1.58 Rule 0 6.15/1.58 Rule 0 6.15/1.58 Rule 1 6.15/1.58 6.15/1.58 6.15/1.58 ************************************************** 6.15/1.58 (2, 3)\Loop[] 6.15/1.58 ************************************************** 6.83/1.75 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]} 6.83/1.75 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 6.89/1.79 EOF