2.40/0.64 YES 2.40/0.64 property Termination 2.40/0.64 has value True 2.50/0.65 for SRS ( [a, b, a, a] -> [a, b, b, b], [b, b, a, a] -> [a, b, a, b], [b, a, a, b] -> [b, a, b, a]) 2.50/0.65 reason 2.50/0.65 remap for 3 rules 2.50/0.65 property Termination 2.50/0.65 has value True 2.50/0.65 for SRS ( [0, 1, 0, 0] -> [0, 1, 1, 1], [1, 1, 0, 0] -> [0, 1, 0, 1], [1, 0, 0, 1] -> [1, 0, 1, 0]) 2.50/0.65 reason 2.50/0.65 weights 2.50/0.65 Map [(0, 1/1)] 2.50/0.65 2.50/0.65 property Termination 2.50/0.65 has value True 2.50/0.65 for SRS ( [1, 1, 0, 0] -> [0, 1, 0, 1], [1, 0, 0, 1] -> [1, 0, 1, 0]) 2.50/0.65 reason 2.50/0.65 reverse each lhs and rhs 2.50/0.65 property Termination 2.50/0.65 has value True 2.50/0.65 for SRS ( [0, 0, 1, 1] -> [1, 0, 1, 0], [1, 0, 0, 1] -> [0, 1, 0, 1]) 2.50/0.65 reason 2.50/0.65 DP transform 2.50/0.65 property Termination 2.50/0.65 has value True 2.50/0.65 for SRS ( [0, 0, 1, 1] ->= [1, 0, 1, 0], [1, 0, 0, 1] ->= [0, 1, 0, 1], [0#, 0, 1, 1] |-> [1#, 0, 1, 0], [0#, 0, 1, 1] |-> [0#, 1, 0], [0#, 0, 1, 1] |-> [1#, 0], [0#, 0, 1, 1] |-> [0#], [1#, 0, 0, 1] |-> [0#, 1, 0, 1], [1#, 0, 0, 1] |-> [1#, 0, 1]) 2.50/0.65 reason 2.50/0.65 remap for 8 rules 2.50/0.65 property Termination 2.50/0.65 has value True 2.50/0.65 for SRS ( [0, 0, 1, 1] ->= [1, 0, 1, 0], [1, 0, 0, 1] ->= [0, 1, 0, 1], [2, 0, 1, 1] |-> [3, 0, 1, 0], [2, 0, 1, 1] |-> [2, 1, 0], [2, 0, 1, 1] |-> [3, 0], [2, 0, 1, 1] |-> [2], [3, 0, 0, 1] |-> [2, 1, 0, 1], [3, 0, 0, 1] |-> [3, 0, 1]) 2.50/0.65 reason 2.50/0.65 weights 2.50/0.65 Map [(0, 1/7), (1, 1/7)] 2.50/0.65 2.50/0.65 property Termination 2.50/0.65 has value True 2.50/0.65 for SRS ( [0, 0, 1, 1] ->= [1, 0, 1, 0], [1, 0, 0, 1] ->= [0, 1, 0, 1], [2, 0, 1, 1] |-> [3, 0, 1, 0], [3, 0, 0, 1] |-> [2, 1, 0, 1]) 2.50/0.65 reason 2.50/0.66 EDG has 1 SCCs 2.50/0.66 property Termination 2.50/0.66 has value True 2.50/0.66 for SRS ( [2, 0, 1, 1] |-> [3, 0, 1, 0], [3, 0, 0, 1] |-> [2, 1, 0, 1], [0, 0, 1, 1] ->= [1, 0, 1, 0], [1, 0, 0, 1] ->= [0, 1, 0, 1]) 2.50/0.66 reason 2.50/0.66 Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 2.50/0.66 interpretation 2.50/0.66 0 / 0A 2A \ 2.50/0.66 \ 0A 2A / 2.50/0.66 1 / 0A 0A \ 2.50/0.66 \ -2A -2A / 2.50/0.66 2 / 3A 4A \ 2.50/0.66 \ 3A 4A / 2.50/0.66 3 / 1A 1A \ 2.50/0.66 \ 1A 1A / 2.50/0.66 [2, 0, 1, 1] |-> [3, 0, 1, 0] 2.50/0.66 lhs rhs ge gt 2.50/0.66 / 4A 4A \ / 1A 3A \ True True 2.50/0.66 \ 4A 4A / \ 1A 3A / 2.50/0.66 [3, 0, 0, 1] |-> [2, 1, 0, 1] 2.50/0.66 lhs rhs ge gt 2.50/0.66 / 3A 3A \ / 3A 3A \ True False 2.50/0.66 \ 3A 3A / \ 3A 3A / 2.50/0.66 [0, 0, 1, 1] ->= [1, 0, 1, 0] 2.50/0.66 lhs rhs ge gt 2.50/0.66 / 2A 2A \ / 0A 2A \ True False 2.50/0.66 \ 2A 2A / \ -2A 0A / 2.50/0.66 [1, 0, 0, 1] ->= [0, 1, 0, 1] 2.50/0.66 lhs rhs ge gt 2.50/0.66 / 2A 2A \ / 0A 0A \ True False 2.50/0.66 \ 0A 0A / \ 0A 0A / 2.50/0.66 property Termination 2.50/0.66 has value True 2.50/0.66 for SRS ( [3, 0, 0, 1] |-> [2, 1, 0, 1], [0, 0, 1, 1] ->= [1, 0, 1, 0], [1, 0, 0, 1] ->= [0, 1, 0, 1]) 2.50/0.66 reason 2.50/0.66 weights 2.50/0.66 Map [(0, 1/1), (3, 1/1)] 2.50/0.66 2.50/0.66 property Termination 2.50/0.66 has value True 2.50/0.66 for SRS ( [0, 0, 1, 1] ->= [1, 0, 1, 0], [1, 0, 0, 1] ->= [0, 1, 0, 1]) 2.50/0.66 reason 2.50/0.66 EDG has 0 SCCs 2.50/0.66 2.50/0.66 ************************************************** 2.50/0.66 summary 2.50/0.66 ************************************************** 2.50/0.66 SRS with 3 rules on 2 letters Remap { tracing = False} 2.50/0.66 SRS with 3 rules on 2 letters weights 2.50/0.66 SRS with 2 rules on 2 letters reverse each lhs and rhs 2.50/0.66 SRS with 2 rules on 2 letters DP transform 2.50/0.67 SRS with 8 rules on 4 letters Remap { tracing = False} 2.50/0.67 SRS with 8 rules on 4 letters weights 2.50/0.67 SRS with 4 rules on 4 letters EDG 2.50/0.68 SRS with 4 rules on 4 letters Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 2.50/0.68 SRS with 3 rules on 4 letters weights 2.50/0.68 SRS with 2 rules on 2 letters EDG 2.50/0.68 2.50/0.68 ************************************************** 2.50/0.70 (3, 2)\Weight(2, 2)\Deepee(8, 4)\Weight(4, 4)\Matrix{\Arctic}{2}(3, 4)\Weight(2, 2)\EDG[] 2.50/0.70 ************************************************** 2.76/0.77 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.76/0.77 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 3.16/0.85 EOF