0.00/0.59 YES 0.00/0.59 property Termination 0.00/0.59 has value True 2.36/0.61 for SRS ( [a] -> [], [a] -> [b, c], [a, b, b] -> [b, b, a, a]) 2.36/0.61 reason 2.36/0.61 remap for 3 rules 2.36/0.61 property Termination 2.36/0.61 has value True 2.36/0.61 for SRS ( [0] -> [], [0] -> [1, 2], [0, 1, 1] -> [1, 1, 0, 0]) 2.36/0.61 reason 2.36/0.61 DP transform 2.36/0.61 property Termination 2.36/0.61 has value True 2.36/0.61 for SRS ( [0] ->= [], [0] ->= [1, 2], [0, 1, 1] ->= [1, 1, 0, 0], [0#, 1, 1] |-> [0#, 0], [0#, 1, 1] |-> [0#]) 2.36/0.61 reason 2.36/0.61 remap for 5 rules 2.36/0.61 property Termination 2.36/0.61 has value True 2.40/0.62 for SRS ( [0] ->= [], [0] ->= [1, 2], [0, 1, 1] ->= [1, 1, 0, 0], [3, 1, 1] |-> [3, 0], [3, 1, 1] |-> [3]) 2.40/0.62 reason 2.40/0.62 EDG has 1 SCCs 2.40/0.62 property Termination 2.40/0.62 has value True 2.40/0.62 for SRS ( [3, 1, 1] |-> [3, 0], [3, 1, 1] |-> [3], [0] ->= [], [0] ->= [1, 2], [0, 1, 1] ->= [1, 1, 0, 0]) 2.40/0.62 reason 2.40/0.63 Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 2.40/0.63 interpretation 2.40/0.63 0 / 0A 0A \ 2.40/0.63 \ 0A 0A / 2.40/0.63 1 / 0A 2A \ 2.40/0.63 \ 0A 0A / 2.40/0.63 2 / 0A 0A \ 2.40/0.63 \ -2A -2A / 2.40/0.63 3 / 7A 9A \ 2.40/0.63 \ 7A 9A / 2.40/0.63 [3, 1, 1] |-> [3, 0] 2.40/0.63 lhs rhs ge gt 2.40/0.63 / 9A 11A \ / 9A 9A \ True False 2.40/0.63 \ 9A 11A / \ 9A 9A / 2.40/0.63 [3, 1, 1] |-> [3] 2.40/0.63 lhs rhs ge gt 2.40/0.63 / 9A 11A \ / 7A 9A \ True True 2.40/0.63 \ 9A 11A / \ 7A 9A / 2.40/0.63 [0] ->= [] 2.40/0.63 lhs rhs ge gt 2.40/0.64 / 0A 0A \ / 0A - \ True False 2.40/0.64 \ 0A 0A / \ - 0A / 2.40/0.64 [0] ->= [1, 2] 2.40/0.64 lhs rhs ge gt 2.40/0.64 / 0A 0A \ / 0A 0A \ True False 2.40/0.64 \ 0A 0A / \ 0A 0A / 2.40/0.64 [0, 1, 1] ->= [1, 1, 0, 0] 2.40/0.64 lhs rhs ge gt 2.40/0.64 / 2A 2A \ / 2A 2A \ True False 2.40/0.64 \ 2A 2A / \ 2A 2A / 2.40/0.64 property Termination 2.40/0.64 has value True 2.40/0.64 for SRS ( [3, 1, 1] |-> [3, 0], [0] ->= [], [0] ->= [1, 2], [0, 1, 1] ->= [1, 1, 0, 0]) 2.40/0.64 reason 2.40/0.65 EDG has 1 SCCs 2.40/0.65 property Termination 2.40/0.65 has value True 2.40/0.65 for SRS ( [3, 1, 1] |-> [3, 0], [0] ->= [], [0] ->= [1, 2], [0, 1, 1] ->= [1, 1, 0, 0]) 2.40/0.65 reason 2.40/0.66 Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 2.40/0.66 interpretation 2.40/0.66 0 / 0A 0A \ 2.40/0.66 \ 0A 0A / 2.40/0.66 1 / 0A 2A \ 2.40/0.66 \ 0A 0A / 2.40/0.66 2 / 0A 0A \ 2.40/0.66 \ -2A -2A / 2.40/0.66 3 / 24A 24A \ 2.40/0.66 \ 24A 24A / 2.40/0.66 [3, 1, 1] |-> [3, 0] 2.40/0.66 lhs rhs ge gt 2.40/0.66 / 26A 26A \ / 24A 24A \ True True 2.40/0.66 \ 26A 26A / \ 24A 24A / 2.40/0.66 [0] ->= [] 2.40/0.66 lhs rhs ge gt 2.40/0.66 / 0A 0A \ / 0A - \ True False 2.40/0.66 \ 0A 0A / \ - 0A / 2.40/0.66 [0] ->= [1, 2] 2.40/0.66 lhs rhs ge gt 2.40/0.66 / 0A 0A \ / 0A 0A \ True False 2.40/0.66 \ 0A 0A / \ 0A 0A / 2.40/0.66 [0, 1, 1] ->= [1, 1, 0, 0] 2.40/0.66 lhs rhs ge gt 2.40/0.66 / 2A 2A \ / 2A 2A \ True False 2.40/0.66 \ 2A 2A / \ 2A 2A / 2.40/0.66 property Termination 2.40/0.66 has value True 2.40/0.66 for SRS ( [0] ->= [], [0] ->= [1, 2], [0, 1, 1] ->= [1, 1, 0, 0]) 2.40/0.66 reason 2.40/0.66 EDG has 0 SCCs 2.40/0.66 2.40/0.66 ************************************************** 2.40/0.66 summary 2.40/0.66 ************************************************** 2.40/0.66 SRS with 3 rules on 3 letters Remap { tracing = False} 2.40/0.66 SRS with 3 rules on 3 letters DP transform 2.40/0.66 SRS with 5 rules on 4 letters Remap { tracing = False} 2.40/0.66 SRS with 5 rules on 4 letters EDG 2.40/0.66 SRS with 5 rules on 4 letters Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 2.40/0.66 SRS with 4 rules on 4 letters EDG 2.40/0.66 SRS with 4 rules on 4 letters Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 2.40/0.66 SRS with 3 rules on 3 letters EDG 2.40/0.66 2.40/0.66 ************************************************** 2.40/0.66 (3, 3)\Deepee(5, 4)\Matrix{\Arctic}{2}(4, 4)\Matrix{\Arctic}{2}(3, 3)\EDG[] 2.40/0.66 ************************************************** 4.08/1.16 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]} 4.08/1.16 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 4.08/1.18 EOF