0.00/0.41 YES 0.00/0.41 property Termination 0.00/0.41 has value True 0.00/0.42 for SRS ( [a, a] -> [a, b], [a, c] -> [b], [b, b] -> [c, b, a]) 0.00/0.42 reason 0.00/0.42 remap for 3 rules 0.00/0.42 property Termination 0.00/0.42 has value True 0.00/0.42 for SRS ( [0, 0] -> [0, 1], [0, 2] -> [1], [1, 1] -> [2, 1, 0]) 0.00/0.42 reason 0.00/0.42 reverse each lhs and rhs 0.00/0.42 property Termination 0.00/0.42 has value True 0.00/0.42 for SRS ( [0, 0] -> [1, 0], [2, 0] -> [1], [1, 1] -> [0, 1, 2]) 0.00/0.42 reason 0.00/0.42 DP transform 0.00/0.42 property Termination 0.00/0.42 has value True 0.00/0.42 for SRS ( [0, 0] ->= [1, 0], [2, 0] ->= [1], [1, 1] ->= [0, 1, 2], [0#, 0] |-> [1#, 0], [2#, 0] |-> [1#], [1#, 1] |-> [0#, 1, 2], [1#, 1] |-> [1#, 2], [1#, 1] |-> [2#]) 0.00/0.42 reason 0.00/0.42 remap for 8 rules 0.00/0.42 property Termination 0.00/0.42 has value True 0.00/0.42 for SRS ( [0, 0] ->= [1, 0], [2, 0] ->= [1], [1, 1] ->= [0, 1, 2], [3, 0] |-> [4, 0], [5, 0] |-> [4], [4, 1] |-> [3, 1, 2], [4, 1] |-> [4, 2], [4, 1] |-> [5]) 0.00/0.42 reason 0.00/0.42 weights 0.00/0.42 Map [(0, 1/3), (1, 1/3)] 0.00/0.42 0.00/0.42 property Termination 0.00/0.42 has value True 0.00/0.42 for SRS ( [0, 0] ->= [1, 0], [2, 0] ->= [1], [1, 1] ->= [0, 1, 2], [3, 0] |-> [4, 0], [4, 1] |-> [3, 1, 2]) 0.00/0.42 reason 0.00/0.42 EDG has 1 SCCs 0.00/0.42 property Termination 0.00/0.42 has value True 0.00/0.42 for SRS ( [3, 0] |-> [4, 0], [4, 1] |-> [3, 1, 2], [0, 0] ->= [1, 0], [2, 0] ->= [1], [1, 1] ->= [0, 1, 2]) 0.00/0.42 reason 0.00/0.42 Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 0.00/0.42 interpretation 0.00/0.42 0 / 8A 8A \ 0.00/0.42 \ 6A 6A / 0.00/0.42 1 / 6A 8A \ 0.00/0.42 \ 6A 6A / 0.00/0.42 2 / 0A 0A \ 0.00/0.42 \ -2A -2A / 0.00/0.42 3 / 12A 12A \ 0.00/0.42 \ 12A 12A / 0.00/0.42 4 / 12A 14A \ 0.00/0.42 \ 12A 14A / 0.00/0.42 [3, 0] |-> [4, 0] 0.00/0.42 lhs rhs ge gt 0.00/0.42 / 20A 20A \ / 20A 20A \ True False 0.00/0.43 \ 20A 20A / \ 20A 20A / 0.00/0.43 [4, 1] |-> [3, 1, 2] 0.00/0.43 lhs rhs ge gt 0.00/0.43 / 20A 20A \ / 18A 18A \ True True 0.00/0.43 \ 20A 20A / \ 18A 18A / 0.00/0.43 [0, 0] ->= [1, 0] 0.00/0.43 lhs rhs ge gt 0.00/0.43 / 16A 16A \ / 14A 14A \ True False 0.00/0.43 \ 14A 14A / \ 14A 14A / 0.00/0.43 [2, 0] ->= [1] 0.00/0.43 lhs rhs ge gt 0.00/0.43 / 8A 8A \ / 6A 8A \ True False 0.00/0.43 \ 6A 6A / \ 6A 6A / 0.00/0.43 [1, 1] ->= [0, 1, 2] 0.00/0.43 lhs rhs ge gt 0.00/0.43 / 14A 14A \ / 14A 14A \ True False 0.00/0.43 \ 12A 14A / \ 12A 12A / 0.00/0.43 property Termination 0.00/0.43 has value True 0.00/0.46 for SRS ( [3, 0] |-> [4, 0], [0, 0] ->= [1, 0], [2, 0] ->= [1], [1, 1] ->= [0, 1, 2]) 0.00/0.46 reason 0.00/0.46 weights 0.00/0.46 Map [(3, 1/1)] 0.00/0.46 0.00/0.46 property Termination 0.00/0.46 has value True 0.00/0.46 for SRS ( [0, 0] ->= [1, 0], [2, 0] ->= [1], [1, 1] ->= [0, 1, 2]) 0.00/0.46 reason 0.00/0.46 EDG has 0 SCCs 0.00/0.46 0.00/0.46 ************************************************** 0.00/0.46 summary 0.00/0.46 ************************************************** 0.00/0.46 SRS with 3 rules on 3 letters Remap { tracing = False} 0.00/0.46 SRS with 3 rules on 3 letters reverse each lhs and rhs 0.00/0.46 SRS with 3 rules on 3 letters DP transform 0.00/0.46 SRS with 8 rules on 6 letters Remap { tracing = False} 0.00/0.46 SRS with 8 rules on 6 letters weights 0.00/0.46 SRS with 5 rules on 5 letters EDG 0.00/0.46 SRS with 5 rules on 5 letters Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 0.00/0.46 SRS with 4 rules on 5 letters weights 0.00/0.47 SRS with 3 rules on 3 letters EDG 0.00/0.47 0.00/0.47 ************************************************** 0.00/0.48 (3, 3)\Deepee(8, 6)\Weight(5, 5)\Matrix{\Arctic}{2}(4, 5)\Weight(3, 3)\EDG[] 0.00/0.48 ************************************************** 0.00/0.50 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.50 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 0.00/0.52 EOF