0.00/0.49 YES 0.00/0.49 property Termination 0.00/0.52 has value True 0.00/0.52 for SRS ( [a, a] -> [b], [a, b] -> [c, a], [b, c] -> [c, b, a]) 0.00/0.52 reason 0.00/0.52 remap for 3 rules 0.00/0.52 property Termination 0.00/0.52 has value True 0.00/0.52 for SRS ( [0, 0] -> [1], [0, 1] -> [2, 0], [1, 2] -> [2, 1, 0]) 0.00/0.52 reason 0.00/0.52 reverse each lhs and rhs 0.00/0.52 property Termination 0.00/0.52 has value True 0.00/0.52 for SRS ( [0, 0] -> [1], [1, 0] -> [0, 2], [2, 1] -> [0, 1, 2]) 0.00/0.52 reason 0.00/0.52 DP transform 0.00/0.52 property Termination 0.00/0.52 has value True 0.00/0.52 for SRS ( [0, 0] ->= [1], [1, 0] ->= [0, 2], [2, 1] ->= [0, 1, 2], [0#, 0] |-> [1#], [1#, 0] |-> [0#, 2], [1#, 0] |-> [2#], [2#, 1] |-> [0#, 1, 2], [2#, 1] |-> [1#, 2], [2#, 1] |-> [2#]) 0.00/0.52 reason 0.00/0.52 remap for 9 rules 0.00/0.52 property Termination 0.00/0.52 has value True 0.00/0.52 for SRS ( [0, 0] ->= [1], [1, 0] ->= [0, 2], [2, 1] ->= [0, 1, 2], [3, 0] |-> [4], [4, 0] |-> [3, 2], [4, 0] |-> [5], [5, 1] |-> [3, 1, 2], [5, 1] |-> [4, 2], [5, 1] |-> [5]) 0.00/0.52 reason 0.00/0.52 EDG has 1 SCCs 0.00/0.52 property Termination 0.00/0.52 has value True 0.00/0.52 for SRS ( [3, 0] |-> [4], [4, 0] |-> [5], [5, 1] |-> [5], [5, 1] |-> [4, 2], [4, 0] |-> [3, 2], [5, 1] |-> [3, 1, 2], [0, 0] ->= [1], [1, 0] ->= [0, 2], [2, 1] ->= [0, 1, 2]) 0.00/0.52 reason 0.00/0.52 Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 0.00/0.52 interpretation 0.00/0.52 0 / 0A 2A \ 0.00/0.52 \ 0A 0A / 0.00/0.52 1 / 0A 2A \ 0.00/0.52 \ 0A 2A / 0.00/0.52 2 / 0A 2A \ 0.00/0.52 \ -2A 0A / 0.00/0.52 3 / 28A 30A \ 0.00/0.52 \ 28A 30A / 0.00/0.52 4 / 29A 29A \ 0.00/0.52 \ 29A 29A / 0.00/0.52 5 / 29A 30A \ 0.00/0.52 \ 29A 30A / 0.00/0.52 [3, 0] |-> [4] 0.00/0.52 lhs rhs ge gt 0.00/0.52 / 30A 30A \ / 29A 29A \ True True 0.00/0.52 \ 30A 30A / \ 29A 29A / 0.00/0.52 [4, 0] |-> [5] 0.00/0.52 lhs rhs ge gt 0.00/0.52 / 29A 31A \ / 29A 30A \ True False 0.00/0.52 \ 29A 31A / \ 29A 30A / 0.00/0.52 [5, 1] |-> [5] 0.00/0.52 lhs rhs ge gt 0.00/0.52 / 30A 32A \ / 29A 30A \ True True 0.00/0.52 \ 30A 32A / \ 29A 30A / 0.00/0.52 [5, 1] |-> [4, 2] 0.00/0.52 lhs rhs ge gt 0.00/0.52 / 30A 32A \ / 29A 31A \ True True 0.00/0.52 \ 30A 32A / \ 29A 31A / 0.00/0.52 [4, 0] |-> [3, 2] 0.00/0.52 lhs rhs ge gt 0.00/0.52 / 29A 31A \ / 28A 30A \ True True 0.00/0.52 \ 29A 31A / \ 28A 30A / 0.00/0.52 [5, 1] |-> [3, 1, 2] 0.00/0.52 lhs rhs ge gt 0.00/0.52 / 30A 32A \ / 30A 32A \ True False 0.00/0.52 \ 30A 32A / \ 30A 32A / 0.00/0.52 [0, 0] ->= [1] 0.00/0.52 lhs rhs ge gt 0.00/0.52 / 2A 2A \ / 0A 2A \ True False 0.00/0.52 \ 0A 2A / \ 0A 2A / 0.00/0.52 [1, 0] ->= [0, 2] 0.00/0.52 lhs rhs ge gt 0.00/0.52 / 2A 2A \ / 0A 2A \ True False 0.00/0.52 \ 2A 2A / \ 0A 2A / 0.00/0.52 [2, 1] ->= [0, 1, 2] 0.00/0.52 lhs rhs ge gt 0.00/0.52 / 2A 4A \ / 2A 4A \ True False 0.00/0.52 \ 0A 2A / \ 0A 2A / 0.00/0.52 property Termination 0.00/0.52 has value True 0.00/0.52 for SRS ( [4, 0] |-> [5], [5, 1] |-> [3, 1, 2], [0, 0] ->= [1], [1, 0] ->= [0, 2], [2, 1] ->= [0, 1, 2]) 0.00/0.52 reason 0.00/0.52 weights 0.00/0.52 Map [(4, 2/1), (5, 1/1)] 0.00/0.52 0.00/0.52 property Termination 0.00/0.52 has value True 0.00/0.52 for SRS ( [0, 0] ->= [1], [1, 0] ->= [0, 2], [2, 1] ->= [0, 1, 2]) 0.00/0.52 reason 0.00/0.52 EDG has 0 SCCs 0.00/0.52 0.00/0.52 ************************************************** 0.00/0.52 summary 0.00/0.52 ************************************************** 0.00/0.52 SRS with 3 rules on 3 letters Remap { tracing = False} 0.00/0.52 SRS with 3 rules on 3 letters reverse each lhs and rhs 0.00/0.52 SRS with 3 rules on 3 letters DP transform 0.00/0.52 SRS with 9 rules on 6 letters Remap { tracing = False} 0.00/0.52 SRS with 9 rules on 6 letters EDG 0.00/0.52 SRS with 9 rules on 6 letters Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 0.00/0.52 SRS with 5 rules on 6 letters weights 0.00/0.52 SRS with 3 rules on 3 letters EDG 0.00/0.52 0.00/0.52 ************************************************** 0.00/0.52 (3, 3)\Deepee(9, 6)\Matrix{\Arctic}{2}(5, 6)\Weight(3, 3)\EDG[] 0.00/0.52 ************************************************** 0.00/0.59 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]} 0.00/0.59 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 0.00/0.61 EOF