3.47/0.89 YES 3.47/0.89 property Termination 3.47/0.89 has value True 3.47/0.89 for SRS ( [b, b, a, b] -> [b, b, b, a], [b, b, a, a] -> [a, a, b, b], [b, a, a, a] -> [b, b, b, a]) 3.47/0.89 reason 3.47/0.89 remap for 3 rules 3.47/0.89 property Termination 3.47/0.89 has value True 3.47/0.89 for SRS ( [0, 0, 1, 0] -> [0, 0, 0, 1], [0, 0, 1, 1] -> [1, 1, 0, 0], [0, 1, 1, 1] -> [0, 0, 0, 1]) 3.47/0.89 reason 3.47/0.89 weights 3.47/0.89 Map [(1, 1/1)] 3.47/0.89 3.47/0.89 property Termination 3.47/0.89 has value True 3.47/0.89 for SRS ( [0, 0, 1, 0] -> [0, 0, 0, 1], [0, 0, 1, 1] -> [1, 1, 0, 0]) 3.47/0.89 reason 3.47/0.89 reverse each lhs and rhs 3.47/0.89 property Termination 3.47/0.89 has value True 3.47/0.89 for SRS ( [0, 1, 0, 0] -> [1, 0, 0, 0], [1, 1, 0, 0] -> [0, 0, 1, 1]) 3.47/0.89 reason 3.47/0.89 DP transform 3.47/0.89 property Termination 3.47/0.89 has value True 3.47/0.89 for SRS ( [0, 1, 0, 0] ->= [1, 0, 0, 0], [1, 1, 0, 0] ->= [0, 0, 1, 1], [0#, 1, 0, 0] |-> [1#, 0, 0, 0], [0#, 1, 0, 0] |-> [0#, 0, 0], [1#, 1, 0, 0] |-> [0#, 0, 1, 1], [1#, 1, 0, 0] |-> [0#, 1, 1], [1#, 1, 0, 0] |-> [1#, 1], [1#, 1, 0, 0] |-> [1#]) 3.47/0.89 reason 3.47/0.89 remap for 8 rules 3.47/0.89 property Termination 3.47/0.89 has value True 3.47/0.89 for SRS ( [0, 1, 0, 0] ->= [1, 0, 0, 0], [1, 1, 0, 0] ->= [0, 0, 1, 1], [2, 1, 0, 0] |-> [3, 0, 0, 0], [2, 1, 0, 0] |-> [2, 0, 0], [3, 1, 0, 0] |-> [2, 0, 1, 1], [3, 1, 0, 0] |-> [2, 1, 1], [3, 1, 0, 0] |-> [3, 1], [3, 1, 0, 0] |-> [3]) 3.47/0.89 reason 3.47/0.89 weights 3.47/0.89 Map [(0, 1/7), (1, 1/7)] 3.47/0.89 3.47/0.89 property Termination 3.47/0.89 has value True 3.48/0.89 for SRS ( [0, 1, 0, 0] ->= [1, 0, 0, 0], [1, 1, 0, 0] ->= [0, 0, 1, 1], [2, 1, 0, 0] |-> [3, 0, 0, 0], [3, 1, 0, 0] |-> [2, 0, 1, 1]) 3.48/0.89 reason 3.48/0.90 EDG has 1 SCCs 3.48/0.90 property Termination 3.48/0.90 has value True 3.52/0.90 for SRS ( [2, 1, 0, 0] |-> [3, 0, 0, 0], [3, 1, 0, 0] |-> [2, 0, 1, 1], [0, 1, 0, 0] ->= [1, 0, 0, 0], [1, 1, 0, 0] ->= [0, 0, 1, 1]) 3.52/0.90 reason 3.52/0.90 Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 3.52/0.90 interpretation 3.52/0.90 0 / 0A 2A \ 3.52/0.90 \ -2A 0A / 3.52/0.90 1 / 0A 2A \ 3.52/0.90 \ 0A 0A / 3.52/0.90 2 / 4A 6A \ 3.52/0.90 \ 4A 6A / 3.52/0.90 3 / 6A 8A \ 3.52/0.90 \ 6A 8A / 3.52/0.90 [2, 1, 0, 0] |-> [3, 0, 0, 0] 3.52/0.90 lhs rhs ge gt 3.52/0.90 / 6A 8A \ / 6A 8A \ True False 3.52/0.90 \ 6A 8A / \ 6A 8A / 3.52/0.90 [3, 1, 0, 0] |-> [2, 0, 1, 1] 3.52/0.90 lhs rhs ge gt 3.52/0.90 / 8A 10A \ / 6A 8A \ True True 3.52/0.90 \ 8A 10A / \ 6A 8A / 3.52/0.90 [0, 1, 0, 0] ->= [1, 0, 0, 0] 3.52/0.90 lhs rhs ge gt 3.52/0.90 / 2A 4A \ / 0A 2A \ True False 3.52/0.90 \ 0A 2A / \ 0A 2A / 3.52/0.90 [1, 1, 0, 0] ->= [0, 0, 1, 1] 3.52/0.90 lhs rhs ge gt 3.52/0.90 / 2A 4A \ / 2A 4A \ True False 3.52/0.90 \ 0A 2A / \ 0A 2A / 3.52/0.90 property Termination 3.52/0.90 has value True 3.52/0.90 for SRS ( [2, 1, 0, 0] |-> [3, 0, 0, 0], [0, 1, 0, 0] ->= [1, 0, 0, 0], [1, 1, 0, 0] ->= [0, 0, 1, 1]) 3.52/0.90 reason 3.52/0.90 weights 3.52/0.90 Map [(1, 1/1), (2, 1/1)] 3.52/0.90 3.52/0.90 property Termination 3.52/0.91 has value True 3.54/0.91 for SRS ( [0, 1, 0, 0] ->= [1, 0, 0, 0], [1, 1, 0, 0] ->= [0, 0, 1, 1]) 3.54/0.91 reason 3.54/0.91 EDG has 0 SCCs 3.54/0.91 3.54/0.91 ************************************************** 3.54/0.91 summary 3.54/0.91 ************************************************** 3.54/0.91 SRS with 3 rules on 2 letters Remap { tracing = False} 3.54/0.91 SRS with 3 rules on 2 letters weights 3.54/0.91 SRS with 2 rules on 2 letters reverse each lhs and rhs 3.54/0.91 SRS with 2 rules on 2 letters DP transform 3.54/0.91 SRS with 8 rules on 4 letters Remap { tracing = False} 3.54/0.91 SRS with 8 rules on 4 letters weights 3.54/0.91 SRS with 4 rules on 4 letters EDG 3.54/0.91 SRS with 4 rules on 4 letters Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 3.54/0.92 SRS with 3 rules on 4 letters weights 3.54/0.92 SRS with 2 rules on 2 letters EDG 3.54/0.92 3.54/0.92 ************************************************** 3.54/0.93 (3, 2)\Weight(2, 2)\Deepee(8, 4)\Weight(4, 4)\Matrix{\Arctic}{2}(3, 4)\Weight(2, 2)\EDG[] 3.54/0.93 ************************************************** 4.23/1.14 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.23/1.14 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 4.23/1.16 EOF