0.00/0.52 YES 0.00/0.52 property Termination 0.00/0.52 has value True 0.00/0.53 for SRS ( [a] -> [], [a] -> [b, b, c], [c, c, a] -> [a, a, c, c]) 0.00/0.53 reason 0.00/0.53 remap for 3 rules 0.00/0.53 property Termination 0.00/0.53 has value True 0.00/0.53 for SRS ( [0] -> [], [0] -> [1, 1, 2], [2, 2, 0] -> [0, 0, 2, 2]) 0.00/0.53 reason 0.00/0.53 reverse each lhs and rhs 0.00/0.53 property Termination 0.00/0.53 has value True 0.00/0.53 for SRS ( [0] -> [], [0] -> [2, 1, 1], [0, 2, 2] -> [2, 2, 0, 0]) 0.00/0.53 reason 0.00/0.53 DP transform 0.00/0.53 property Termination 0.00/0.53 has value True 0.00/0.53 for SRS ( [0] ->= [], [0] ->= [2, 1, 1], [0, 2, 2] ->= [2, 2, 0, 0], [0#, 2, 2] |-> [0#, 0], [0#, 2, 2] |-> [0#]) 0.00/0.53 reason 0.00/0.53 remap for 5 rules 0.00/0.53 property Termination 0.00/0.53 has value True 0.00/0.53 for SRS ( [0] ->= [], [0] ->= [1, 2, 2], [0, 1, 1] ->= [1, 1, 0, 0], [3, 1, 1] |-> [3, 0], [3, 1, 1] |-> [3]) 0.00/0.53 reason 0.00/0.53 EDG has 1 SCCs 0.00/0.53 property Termination 0.00/0.53 has value True 0.00/0.53 for SRS ( [3, 1, 1] |-> [3, 0], [3, 1, 1] |-> [3], [0] ->= [], [0] ->= [1, 2, 2], [0, 1, 1] ->= [1, 1, 0, 0]) 0.00/0.53 reason 0.00/0.53 Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 0.00/0.53 interpretation 0.00/0.53 0 / 0A 0A \ 0.00/0.53 \ 0A 0A / 0.00/0.53 1 / 0A 2A \ 0.00/0.53 \ 0A 0A / 0.00/0.53 2 / 0A 0A \ 0.00/0.53 \ -2A -2A / 0.00/0.53 3 / 7A 9A \ 0.00/0.53 \ 7A 9A / 0.00/0.53 [3, 1, 1] |-> [3, 0] 0.00/0.53 lhs rhs ge gt 0.00/0.53 / 9A 11A \ / 9A 9A \ True False 0.00/0.53 \ 9A 11A / \ 9A 9A / 0.00/0.53 [3, 1, 1] |-> [3] 0.00/0.53 lhs rhs ge gt 0.00/0.53 / 9A 11A \ / 7A 9A \ True True 0.00/0.53 \ 9A 11A / \ 7A 9A / 0.00/0.53 [0] ->= [] 0.00/0.53 lhs rhs ge gt 0.00/0.53 / 0A 0A \ / 0A - \ True False 0.00/0.53 \ 0A 0A / \ - 0A / 0.00/0.53 [0] ->= [1, 2, 2] 0.00/0.53 lhs rhs ge gt 0.00/0.53 / 0A 0A \ / 0A 0A \ True False 0.00/0.53 \ 0A 0A / \ 0A 0A / 0.00/0.53 [0, 1, 1] ->= [1, 1, 0, 0] 0.00/0.53 lhs rhs ge gt 0.00/0.53 / 2A 2A \ / 2A 2A \ True False 0.00/0.53 \ 2A 2A / \ 2A 2A / 0.00/0.53 property Termination 0.00/0.53 has value True 0.00/0.53 for SRS ( [3, 1, 1] |-> [3, 0], [0] ->= [], [0] ->= [1, 2, 2], [0, 1, 1] ->= [1, 1, 0, 0]) 0.00/0.53 reason 0.00/0.53 EDG has 1 SCCs 0.00/0.53 property Termination 0.00/0.53 has value True 0.00/0.53 for SRS ( [3, 1, 1] |-> [3, 0], [0] ->= [], [0] ->= [1, 2, 2], [0, 1, 1] ->= [1, 1, 0, 0]) 0.00/0.53 reason 0.00/0.53 Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 0.00/0.53 interpretation 0.00/0.53 0 / 0A 0A \ 0.00/0.53 \ 0A 0A / 0.00/0.53 1 / 0A 2A \ 0.00/0.53 \ 0A 0A / 0.00/0.53 2 / 0A 0A \ 0.00/0.53 \ -2A -2A / 0.00/0.53 3 / 7A 8A \ 0.00/0.53 \ 7A 8A / 0.00/0.53 [3, 1, 1] |-> [3, 0] 0.00/0.53 lhs rhs ge gt 0.00/0.53 / 9A 10A \ / 8A 8A \ True True 0.00/0.53 \ 9A 10A / \ 8A 8A / 0.00/0.53 [0] ->= [] 0.00/0.53 lhs rhs ge gt 0.00/0.53 / 0A 0A \ / 0A - \ True False 0.00/0.53 \ 0A 0A / \ - 0A / 0.00/0.53 [0] ->= [1, 2, 2] 0.00/0.53 lhs rhs ge gt 0.00/0.53 / 0A 0A \ / 0A 0A \ True False 0.00/0.53 \ 0A 0A / \ 0A 0A / 0.00/0.53 [0, 1, 1] ->= [1, 1, 0, 0] 0.00/0.53 lhs rhs ge gt 0.00/0.53 / 2A 2A \ / 2A 2A \ True False 0.00/0.53 \ 2A 2A / \ 2A 2A / 0.00/0.53 property Termination 0.00/0.53 has value True 0.00/0.53 for SRS ( [0] ->= [], [0] ->= [1, 2, 2], [0, 1, 1] ->= [1, 1, 0, 0]) 0.00/0.53 reason 0.00/0.53 EDG has 0 SCCs 0.00/0.53 0.00/0.53 ************************************************** 0.00/0.53 summary 0.00/0.53 ************************************************** 0.00/0.53 SRS with 3 rules on 3 letters Remap { tracing = False} 0.00/0.53 SRS with 3 rules on 3 letters reverse each lhs and rhs 0.00/0.53 SRS with 3 rules on 3 letters DP transform 0.00/0.53 SRS with 5 rules on 4 letters Remap { tracing = False} 0.00/0.53 SRS with 5 rules on 4 letters EDG 0.00/0.54 SRS with 5 rules on 4 letters Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 0.00/0.54 SRS with 4 rules on 4 letters EDG 0.00/0.54 SRS with 4 rules on 4 letters Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 0.00/0.54 SRS with 3 rules on 3 letters EDG 0.00/0.54 0.00/0.54 ************************************************** 0.00/0.54 (3, 3)\Deepee(5, 4)\Matrix{\Arctic}{2}(4, 4)\Matrix{\Arctic}{2}(3, 3)\EDG[] 0.00/0.54 ************************************************** 2.10/0.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]} 2.10/0.55 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 2.15/0.57 EOF