5.86/1.57 YES 5.86/1.57 property Termination 5.86/1.57 has value True 5.86/1.57 for SRS ( [b, b, b, a] -> [b, a, a, a], [b, b, b, b] -> [b, a, a, b], [a, a, b, a] -> [b, a, b, a], [b, a, a, b] -> [a, a, a, b]) 5.86/1.57 reason 5.86/1.57 remap for 4 rules 5.86/1.57 property Termination 5.86/1.57 has value True 5.86/1.57 for SRS ( [0, 0, 0, 1] -> [0, 1, 1, 1], [0, 0, 0, 0] -> [0, 1, 1, 0], [1, 1, 0, 1] -> [0, 1, 0, 1], [0, 1, 1, 0] -> [1, 1, 1, 0]) 5.86/1.57 reason 5.86/1.57 DP transform 5.86/1.57 property Termination 5.86/1.57 has value True 5.86/1.57 for SRS ( [0, 0, 0, 1] ->= [0, 1, 1, 1], [0, 0, 0, 0] ->= [0, 1, 1, 0], [1, 1, 0, 1] ->= [0, 1, 0, 1], [0, 1, 1, 0] ->= [1, 1, 1, 0], [0#, 0, 0, 1] |-> [0#, 1, 1, 1], [0#, 0, 0, 1] |-> [1#, 1, 1], [0#, 0, 0, 1] |-> [1#, 1], [0#, 0, 0, 0] |-> [0#, 1, 1, 0], [0#, 0, 0, 0] |-> [1#, 1, 0], [0#, 0, 0, 0] |-> [1#, 0], [1#, 1, 0, 1] |-> [0#, 1, 0, 1], [0#, 1, 1, 0] |-> [1#, 1, 1, 0]) 5.86/1.57 reason 6.19/1.58 remap for 12 rules 6.19/1.58 property Termination 6.19/1.58 has value True 6.28/1.60 for SRS ( [0, 0, 0, 1] ->= [0, 1, 1, 1], [0, 0, 0, 0] ->= [0, 1, 1, 0], [1, 1, 0, 1] ->= [0, 1, 0, 1], [0, 1, 1, 0] ->= [1, 1, 1, 0], [2, 0, 0, 1] |-> [2, 1, 1, 1], [2, 0, 0, 1] |-> [3, 1, 1], [2, 0, 0, 1] |-> [3, 1], [2, 0, 0, 0] |-> [2, 1, 1, 0], [2, 0, 0, 0] |-> [3, 1, 0], [2, 0, 0, 0] |-> [3, 0], [3, 1, 0, 1] |-> [2, 1, 0, 1], [2, 1, 1, 0] |-> [3, 1, 1, 0]) 6.28/1.61 reason 6.28/1.61 weights 6.28/1.61 Map [(0, 1/6), (1, 1/6)] 6.28/1.61 6.28/1.61 property Termination 6.28/1.61 has value True 6.28/1.62 for SRS ( [0, 0, 0, 1] ->= [0, 1, 1, 1], [0, 0, 0, 0] ->= [0, 1, 1, 0], [1, 1, 0, 1] ->= [0, 1, 0, 1], [0, 1, 1, 0] ->= [1, 1, 1, 0], [2, 0, 0, 1] |-> [2, 1, 1, 1], [2, 0, 0, 0] |-> [2, 1, 1, 0], [3, 1, 0, 1] |-> [2, 1, 0, 1], [2, 1, 1, 0] |-> [3, 1, 1, 0]) 6.28/1.62 reason 6.28/1.62 EDG has 1 SCCs 6.28/1.62 property Termination 6.28/1.62 has value True 6.34/1.63 for SRS ( [2, 0, 0, 1] |-> [2, 1, 1, 1], [2, 1, 1, 0] |-> [3, 1, 1, 0], [3, 1, 0, 1] |-> [2, 1, 0, 1], [2, 0, 0, 0] |-> [2, 1, 1, 0], [0, 0, 0, 1] ->= [0, 1, 1, 1], [0, 0, 0, 0] ->= [0, 1, 1, 0], [1, 1, 0, 1] ->= [0, 1, 0, 1], [0, 1, 1, 0] ->= [1, 1, 1, 0]) 6.34/1.63 reason 6.34/1.63 Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 6.34/1.63 interpretation 6.34/1.63 0 / 0A 2A \ 6.34/1.63 \ 0A 2A / 6.34/1.63 1 / 0A 2A \ 6.34/1.63 \ 0A 0A / 6.34/1.63 2 / 24A 26A \ 6.34/1.63 \ 24A 26A / 6.34/1.63 3 / 26A 26A \ 6.34/1.63 \ 26A 26A / 6.34/1.63 [2, 0, 0, 1] |-> [2, 1, 1, 1] 6.34/1.63 lhs rhs ge gt 6.34/1.63 / 30A 30A \ / 28A 28A \ True True 6.34/1.63 \ 30A 30A / \ 28A 28A / 6.34/1.63 [2, 1, 1, 0] |-> [3, 1, 1, 0] 6.34/1.63 lhs rhs ge gt 6.34/1.63 / 28A 30A \ / 28A 30A \ True False 6.34/1.63 \ 28A 30A / \ 28A 30A / 6.34/1.63 [3, 1, 0, 1] |-> [2, 1, 0, 1] 6.34/1.63 lhs rhs ge gt 6.34/1.63 / 30A 30A \ / 28A 28A \ True True 6.34/1.63 \ 30A 30A / \ 28A 28A / 6.34/1.63 [2, 0, 0, 0] |-> [2, 1, 1, 0] 6.34/1.63 lhs rhs ge gt 6.34/1.63 / 30A 32A \ / 28A 30A \ True True 6.34/1.63 \ 30A 32A / \ 28A 30A / 6.34/1.63 [0, 0, 0, 1] ->= [0, 1, 1, 1] 6.34/1.63 lhs rhs ge gt 6.34/1.63 / 6A 6A \ / 4A 4A \ True True 6.34/1.63 \ 6A 6A / \ 4A 4A / 6.34/1.63 [0, 0, 0, 0] ->= [0, 1, 1, 0] 6.34/1.63 lhs rhs ge gt 6.34/1.63 / 6A 8A \ / 4A 6A \ True True 6.34/1.63 \ 6A 8A / \ 4A 6A / 6.34/1.63 [1, 1, 0, 1] ->= [0, 1, 0, 1] 6.34/1.63 lhs rhs ge gt 6.34/1.63 / 4A 4A \ / 4A 4A \ True False 6.34/1.63 \ 4A 4A / \ 4A 4A / 6.34/1.63 [0, 1, 1, 0] ->= [1, 1, 1, 0] 6.34/1.63 lhs rhs ge gt 6.34/1.63 / 4A 6A \ / 4A 6A \ True False 6.34/1.63 \ 4A 6A / \ 2A 4A / 6.34/1.63 property Termination 6.34/1.63 has value True 6.34/1.63 for SRS ( [2, 1, 1, 0] |-> [3, 1, 1, 0], [0, 0, 0, 1] ->= [0, 1, 1, 1], [0, 0, 0, 0] ->= [0, 1, 1, 0], [1, 1, 0, 1] ->= [0, 1, 0, 1], [0, 1, 1, 0] ->= [1, 1, 1, 0]) 6.34/1.63 reason 6.34/1.63 weights 6.34/1.63 Map [(2, 1/1)] 6.34/1.63 6.34/1.63 property Termination 6.34/1.63 has value True 6.34/1.63 for SRS ( [0, 0, 0, 1] ->= [0, 1, 1, 1], [0, 0, 0, 0] ->= [0, 1, 1, 0], [1, 1, 0, 1] ->= [0, 1, 0, 1], [0, 1, 1, 0] ->= [1, 1, 1, 0]) 6.34/1.63 reason 6.34/1.63 EDG has 0 SCCs 6.34/1.63 6.34/1.63 ************************************************** 6.34/1.63 summary 6.34/1.63 ************************************************** 6.34/1.63 SRS with 4 rules on 2 letters Remap { tracing = False} 6.34/1.63 SRS with 4 rules on 2 letters DP transform 6.34/1.63 SRS with 12 rules on 4 letters Remap { tracing = False} 6.34/1.63 SRS with 12 rules on 4 letters weights 6.34/1.63 SRS with 8 rules on 4 letters EDG 6.34/1.64 SRS with 8 rules on 4 letters Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 6.34/1.64 SRS with 5 rules on 4 letters weights 6.34/1.64 SRS with 4 rules on 2 letters EDG 6.34/1.64 6.34/1.64 ************************************************** 6.34/1.64 (4, 2)\Deepee(12, 4)\Weight(8, 4)\Matrix{\Arctic}{2}(5, 4)\Weight(4, 2)\EDG[] 6.34/1.64 ************************************************** 8.55/2.22 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]} 8.55/2.22 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 8.55/2.24 EOF