4.81/1.28 NO 4.81/1.28 property Termination 4.81/1.29 has value False 4.81/1.29 for SRS ( [a] -> [], [a, a] -> [b, a, b, c], [c] -> [], [c, b] -> [a, c]) 4.81/1.29 reason 4.81/1.29 remap for 4 rules 4.81/1.29 property Termination 4.81/1.29 has value False 4.81/1.29 for SRS ( [0] -> [], [0, 0] -> [1, 0, 1, 2], [2] -> [], [2, 1] -> [0, 2]) 4.81/1.29 reason 4.81/1.29 looping SRS derivation 4.81/1.29 Closure source : ccccaa 4.81/1.29 target : babccccaacc 4.81/1.29 steps : 18 4.81/1.29 strict : True 4.81/1.29 last_rule_app_source : 0 4.81/1.29 last_rule_app_target : 8 4.81/1.29 reason : Overlap (Inside 8) 4.81/1.29 Overlap (Inside 7) 4.81/1.29 Overlap (Inside 9) 4.81/1.29 Overlap (Inside 0) 4.81/1.29 Overlap (Inside 1) 4.81/1.29 Overlap (Left 1) 4.81/1.29 Overlap (Inside 1) 4.81/1.30 Overlap (Inside 0) 4.81/1.30 Overlap (Inside 1) 4.81/1.30 Overlap (Left 1) 4.81/1.30 Overlap (Inside 1) 4.81/1.30 Overlap (Inside 0) 4.81/1.30 Overlap (Inside 1) 4.81/1.30 Overlap (Left 1) 4.81/1.30 Overlap (Inside 0) 5.15/1.36 Overlap (Inside 1) 5.15/1.36 Overlap (Left 1) 5.15/1.36 Rule 1 5.15/1.36 Rule 3 5.15/1.36 Rule 2 5.15/1.36 Rule 1 5.15/1.36 Rule 3 5.15/1.36 Rule 2 5.15/1.36 Rule 1 5.15/1.36 Rule 0 5.15/1.36 Rule 3 5.15/1.36 Rule 3 5.15/1.36 Rule 1 5.15/1.36 Rule 0 5.15/1.37 Rule 3 5.15/1.37 Rule 3 5.15/1.37 Rule 1 5.15/1.37 Rule 3 5.15/1.37 Rule 3 5.15/1.37 Rule 2 5.15/1.37 5.15/1.37 5.15/1.37 ************************************************** 5.15/1.37 summary 5.15/1.37 ************************************************** 5.15/1.37 SRS with 4 rules on 3 letters Remap { tracing = False} 5.15/1.37 SRS with 4 rules on 3 letters looping SRS derivation 5.15/1.37 Closure source : ccccaa 5.15/1.37 target : babccccaacc 5.15/1.37 steps : 18 5.15/1.37 strict : True 5.15/1.37 last_rule_app_source : 0 5.15/1.37 last_rule_app_target : 8 5.15/1.37 reason : Overlap (Inside 8) 5.15/1.37 Overlap (Inside 7) 5.15/1.37 Overlap (Inside 9) 5.15/1.37 Overlap (Inside 0) 5.15/1.37 Overlap (Inside 1) 5.15/1.37 Overlap (Left 1) 5.15/1.37 Overlap (Inside 1) 5.15/1.37 Overlap (Inside 0) 5.15/1.37 Overlap (Inside 1) 5.15/1.37 Overlap (Left 1) 5.15/1.37 Overlap (Inside 1) 5.15/1.37 Overlap (Inside 0) 5.15/1.37 Overlap (Inside 1) 5.15/1.37 Overlap (Left 1) 5.15/1.37 Overlap (Inside 0) 5.15/1.37 Overlap (Inside 1) 5.15/1.37 Overlap (Left 1) 5.15/1.37 Rule 1 5.15/1.37 Rule 3 5.15/1.37 Rule 2 5.15/1.37 Rule 1 5.15/1.37 Rule 3 5.15/1.37 Rule 2 5.15/1.37 Rule 1 5.15/1.37 Rule 0 5.15/1.37 Rule 3 5.15/1.37 Rule 3 5.15/1.37 Rule 1 5.15/1.37 Rule 0 5.15/1.37 Rule 3 5.15/1.37 Rule 3 5.15/1.38 Rule 1 5.15/1.38 Rule 3 5.15/1.38 Rule 3 5.15/1.38 Rule 2 5.15/1.38 5.15/1.38 5.15/1.38 ************************************************** 5.15/1.38 (4, 3)\Loop[] 5.15/1.38 ************************************************** 6.00/1.55 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.00/1.55 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 6.00/1.59 EOF