0.00/0.03 NO 0.00/0.03 property Termination 0.00/0.03 has value False 0.00/0.03 for SRS ( [0, 0, 0, 0] -> [0, 1, 1, 1], [1, 0, 1, 1] -> [0, 0, 1, 0]) 0.00/0.03 reason 0.00/0.03 remap for 2 rules 0.00/0.03 property Termination 0.00/0.04 has value False 0.00/0.04 for SRS ( [0, 0, 0, 0] -> [0, 1, 1, 1], [1, 0, 1, 1] -> [0, 0, 1, 0]) 0.00/0.04 reason 0.00/0.04 looping SRS derivation 0.00/0.04 Closure source : abbbaabaaaa 0.00/0.04 target : abbbaabaaaa 0.00/0.05 steps : 25 0.00/0.05 strict : True 0.00/0.05 last_rule_app_source : 0 0.00/0.05 last_rule_app_target : 0 0.00/0.05 reason : Overlap (Left 3) 0.00/0.05 Overlap (Inside 3) 0.00/0.05 Overlap (Inside 1) 0.00/0.05 Overlap (Inside 2) 0.00/0.05 Overlap (Inside 4) 0.00/0.05 Overlap (Inside 2) 0.00/0.05 Overlap (Inside 3) 0.00/0.05 Overlap (Inside 5) 0.00/0.05 Overlap (Inside 3) 0.00/0.05 Overlap (Inside 4) 0.00/0.05 Overlap (Inside 6) 0.00/0.05 Overlap (Inside 4) 0.00/0.06 Overlap (Inside 5) 0.00/0.06 Overlap (Inside 0) 0.00/0.06 Overlap (Inside 2) 0.00/0.06 Overlap (Left 3) 0.00/0.06 Overlap (Inside 0) 0.00/0.06 Overlap (Inside 2) 0.00/0.06 Overlap (Left 3) 0.00/0.06 Overlap (Inside 0) 0.00/0.06 Overlap (Inside 2) 0.00/0.06 Overlap (Left 3) 0.00/0.06 Overlap (Left 2) 0.00/0.06 Overlap (Left 3) 0.00/0.06 Rule 0 0.00/0.06 Rule 1 0.00/0.06 Rule 0 0.00/0.06 Rule 1 0.00/0.06 Rule 1 0.00/0.06 Rule 0 0.00/0.06 Rule 1 0.00/0.06 Rule 1 0.00/0.06 Rule 0 0.00/0.06 Rule 1 0.00/0.06 Rule 1 0.00/0.06 Rule 0 0.00/0.06 Rule 0 0.00/0.06 Rule 1 0.00/0.06 Rule 1 0.00/0.06 Rule 0 0.00/0.06 Rule 1 0.00/0.06 Rule 1 0.00/0.06 Rule 0 0.00/0.06 Rule 1 0.00/0.06 Rule 1 0.00/0.06 Rule 0 0.00/0.06 Rule 1 0.00/0.07 Rule 1 0.00/0.07 Rule 0 0.00/0.07 0.00/0.07 0.00/0.07 ************************************************** 0.00/0.07 summary 0.00/0.07 ************************************************** 0.00/0.07 SRS with 2 rules on 2 letters Remap { tracing = False} 0.00/0.07 SRS with 2 rules on 2 letters looping SRS derivation 0.00/0.07 Closure source : abbbaabaaaa 0.00/0.07 target : abbbaabaaaa 0.00/0.07 steps : 25 0.00/0.07 strict : True 0.00/0.07 last_rule_app_source : 0 0.00/0.07 last_rule_app_target : 0 0.00/0.07 reason : Overlap (Left 3) 0.00/0.07 Overlap (Inside 3) 0.00/0.07 Overlap (Inside 1) 0.00/0.07 Overlap (Inside 2) 0.00/0.07 Overlap (Inside 4) 0.00/0.07 Overlap (Inside 2) 0.00/0.07 Overlap (Inside 3) 0.00/0.07 Overlap (Inside 5) 0.00/0.07 Overlap (Inside 3) 0.00/0.07 Overlap (Inside 4) 0.00/0.07 Overlap (Inside 6) 0.00/0.07 Overlap (Inside 4) 0.00/0.07 Overlap (Inside 5) 0.00/0.07 Overlap (Inside 0) 0.00/0.07 Overlap (Inside 2) 0.00/0.07 Overlap (Left 3) 0.00/0.07 Overlap (Inside 0) 0.00/0.07 Overlap (Inside 2) 0.00/0.07 Overlap (Left 3) 0.00/0.07 Overlap (Inside 0) 0.00/0.07 Overlap (Inside 2) 0.00/0.07 Overlap (Left 3) 0.00/0.07 Overlap (Left 2) 0.00/0.07 Overlap (Left 3) 0.00/0.07 Rule 0 0.00/0.07 Rule 1 0.00/0.07 Rule 0 0.00/0.07 Rule 1 0.00/0.07 Rule 1 0.00/0.07 Rule 0 0.00/0.07 Rule 1 0.00/0.07 Rule 1 0.00/0.07 Rule 0 0.00/0.07 Rule 1 0.00/0.07 Rule 1 0.00/0.07 Rule 0 0.00/0.07 Rule 0 0.00/0.07 Rule 1 0.00/0.07 Rule 1 0.00/0.07 Rule 0 0.00/0.07 Rule 1 0.00/0.07 Rule 1 0.00/0.07 Rule 0 0.00/0.07 Rule 1 0.00/0.07 Rule 1 0.00/0.07 Rule 0 0.00/0.07 Rule 1 0.00/0.07 Rule 1 0.00/0.07 Rule 0 0.00/0.07 0.00/0.07 0.00/0.07 ************************************************** 0.00/0.07 (2, 2)\Loop[] 0.00/0.07 ************************************************** 0.00/0.36 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]} 0.00/0.36 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 0.00/0.38 EOF