2.47/0.69 YES 2.47/0.69 property Termination 2.47/0.69 has value True 2.47/0.69 for SRS ( [b, a] -> [b, b], [b, a, b] -> [b, a, a], [a, a, a] -> [a, b, b]) 2.47/0.69 reason 2.47/0.69 remap for 3 rules 2.47/0.69 property Termination 2.47/0.69 has value True 2.47/0.69 for SRS ( [0, 1] -> [0, 0], [0, 1, 0] -> [0, 1, 1], [1, 1, 1] -> [1, 0, 0]) 2.47/0.69 reason 2.47/0.69 reverse each lhs and rhs 2.47/0.69 property Termination 2.47/0.69 has value True 2.47/0.69 for SRS ( [1, 0] -> [0, 0], [0, 1, 0] -> [1, 1, 0], [1, 1, 1] -> [0, 0, 1]) 2.47/0.69 reason 2.47/0.69 DP transform 2.47/0.69 property Termination 2.47/0.69 has value True 2.47/0.69 for SRS ( [1, 0] ->= [0, 0], [0, 1, 0] ->= [1, 1, 0], [1, 1, 1] ->= [0, 0, 1], [1#, 0] |-> [0#, 0], [0#, 1, 0] |-> [1#, 1, 0], [1#, 1, 1] |-> [0#, 0, 1], [1#, 1, 1] |-> [0#, 1]) 2.47/0.69 reason 2.47/0.69 remap for 7 rules 2.47/0.69 property Termination 2.47/0.69 has value True 2.47/0.69 for SRS ( [0, 1] ->= [1, 1], [1, 0, 1] ->= [0, 0, 1], [0, 0, 0] ->= [1, 1, 0], [2, 1] |-> [3, 1], [3, 0, 1] |-> [2, 0, 1], [2, 0, 0] |-> [3, 1, 0], [2, 0, 0] |-> [3, 0]) 2.47/0.69 reason 2.47/0.69 weights 2.47/0.69 Map [(0, 1/1), (1, 1/1)] 2.47/0.69 2.47/0.69 property Termination 2.47/0.69 has value True 2.47/0.69 for SRS ( [0, 1] ->= [1, 1], [1, 0, 1] ->= [0, 0, 1], [0, 0, 0] ->= [1, 1, 0], [2, 1] |-> [3, 1], [3, 0, 1] |-> [2, 0, 1], [2, 0, 0] |-> [3, 1, 0]) 2.47/0.69 reason 2.47/0.69 EDG has 1 SCCs 2.47/0.69 property Termination 2.47/0.69 has value True 2.47/0.69 for SRS ( [2, 1] |-> [3, 1], [3, 0, 1] |-> [2, 0, 1], [2, 0, 0] |-> [3, 1, 0], [0, 1] ->= [1, 1], [1, 0, 1] ->= [0, 0, 1], [0, 0, 0] ->= [1, 1, 0]) 2.47/0.69 reason 2.47/0.69 Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 2.47/0.69 interpretation 2.47/0.69 0 / 6A 8A \ 2.47/0.69 \ 6A 6A / 2.47/0.69 1 / 6A 8A \ 2.47/0.69 \ 4A 6A / 2.47/0.69 2 / 7A 7A \ 2.47/0.69 \ 7A 7A / 2.47/0.69 3 / 5A 7A \ 2.47/0.69 \ 5A 7A / 2.47/0.69 [2, 1] |-> [3, 1] 2.47/0.69 lhs rhs ge gt 2.47/0.69 / 13A 15A \ / 11A 13A \ True True 2.47/0.69 \ 13A 15A / \ 11A 13A / 2.47/0.69 [3, 0, 1] |-> [2, 0, 1] 2.47/0.69 lhs rhs ge gt 2.47/0.69 / 19A 21A \ / 19A 21A \ True False 2.47/0.69 \ 19A 21A / \ 19A 21A / 2.47/0.69 [2, 0, 0] |-> [3, 1, 0] 2.47/0.69 lhs rhs ge gt 2.47/0.69 / 21A 21A \ / 19A 19A \ True True 2.47/0.69 \ 21A 21A / \ 19A 19A / 2.47/0.69 [0, 1] ->= [1, 1] 2.47/0.69 lhs rhs ge gt 2.47/0.69 / 12A 14A \ / 12A 14A \ True False 2.47/0.69 \ 12A 14A / \ 10A 12A / 2.47/0.69 [1, 0, 1] ->= [0, 0, 1] 2.47/0.69 lhs rhs ge gt 2.47/0.69 / 20A 22A \ / 20A 22A \ True False 2.47/0.69 \ 18A 20A / \ 18A 20A / 2.47/0.69 [0, 0, 0] ->= [1, 1, 0] 2.47/0.69 lhs rhs ge gt 2.47/0.69 / 20A 22A \ / 20A 20A \ True False 2.47/0.69 \ 20A 20A / \ 18A 18A / 2.47/0.69 property Termination 2.47/0.69 has value True 2.47/0.69 for SRS ( [3, 0, 1] |-> [2, 0, 1], [0, 1] ->= [1, 1], [1, 0, 1] ->= [0, 0, 1], [0, 0, 0] ->= [1, 1, 0]) 2.47/0.70 reason 2.47/0.70 weights 2.47/0.70 Map [(3, 1/1)] 2.47/0.70 2.47/0.70 property Termination 2.47/0.70 has value True 2.47/0.70 for SRS ( [0, 1] ->= [1, 1], [1, 0, 1] ->= [0, 0, 1], [0, 0, 0] ->= [1, 1, 0]) 2.47/0.70 reason 2.47/0.70 EDG has 0 SCCs 2.47/0.70 2.47/0.70 ************************************************** 2.47/0.70 summary 2.75/0.71 ************************************************** 2.75/0.72 SRS with 3 rules on 2 letters Remap { tracing = False} 2.75/0.72 SRS with 3 rules on 2 letters reverse each lhs and rhs 2.75/0.72 SRS with 3 rules on 2 letters DP transform 2.75/0.73 SRS with 7 rules on 4 letters Remap { tracing = False} 2.75/0.73 SRS with 7 rules on 4 letters weights 2.75/0.73 SRS with 6 rules on 4 letters EDG 2.75/0.73 SRS with 6 rules on 4 letters Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 2.75/0.73 SRS with 4 rules on 4 letters weights 2.75/0.73 SRS with 3 rules on 2 letters EDG 2.75/0.73 2.75/0.73 ************************************************** 2.75/0.74 (3, 2)\Deepee(7, 4)\Weight(6, 4)\Matrix{\Arctic}{2}(4, 4)\Weight(3, 2)\EDG[] 2.75/0.74 ************************************************** 2.75/0.75 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.75/0.75 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 2.90/0.78 EOF