0.00/0.52 YES 0.00/0.53 property Termination 0.00/0.53 has value True 0.00/0.53 for SRS ( [a, a] -> [b], [b, c] -> [a], [c, b] -> [a, b, c, c]) 0.00/0.53 reason 0.00/0.53 remap for 3 rules 0.00/0.53 property Termination 0.00/0.53 has value True 0.00/0.54 for SRS ( [0, 0] -> [1], [1, 2] -> [0], [2, 1] -> [0, 1, 2, 2]) 0.00/0.54 reason 0.00/0.54 DP transform 0.00/0.54 property Termination 0.00/0.54 has value True 2.16/0.57 for SRS ( [0, 0] ->= [1], [1, 2] ->= [0], [2, 1] ->= [0, 1, 2, 2], [0#, 0] |-> [1#], [1#, 2] |-> [0#], [2#, 1] |-> [0#, 1, 2, 2], [2#, 1] |-> [1#, 2, 2], [2#, 1] |-> [2#, 2], [2#, 1] |-> [2#]) 2.16/0.57 reason 2.19/0.57 remap for 9 rules 2.19/0.57 property Termination 2.19/0.57 has value True 2.19/0.58 for SRS ( [0, 0] ->= [1], [1, 2] ->= [0], [2, 1] ->= [0, 1, 2, 2], [3, 0] |-> [4], [4, 2] |-> [3], [5, 1] |-> [3, 1, 2, 2], [5, 1] |-> [4, 2, 2], [5, 1] |-> [5, 2], [5, 1] |-> [5]) 2.19/0.58 reason 2.19/0.58 weights 2.19/0.58 Map [(5, 2/1)] 2.19/0.58 2.19/0.58 property Termination 2.19/0.58 has value True 2.19/0.58 for SRS ( [0, 0] ->= [1], [1, 2] ->= [0], [2, 1] ->= [0, 1, 2, 2], [3, 0] |-> [4], [4, 2] |-> [3], [5, 1] |-> [5, 2], [5, 1] |-> [5]) 2.19/0.58 reason 2.19/0.59 EDG has 2 SCCs 2.19/0.59 property Termination 2.19/0.59 has value True 2.19/0.60 for SRS ( [3, 0] |-> [4], [4, 2] |-> [3], [0, 0] ->= [1], [1, 2] ->= [0], [2, 1] ->= [0, 1, 2, 2]) 2.19/0.60 reason 2.19/0.60 Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 2.19/0.60 interpretation 2.19/0.60 0 / 0A 2A \ 2.19/0.60 \ 0A 0A / 2.19/0.60 1 / 2A 2A \ 2.19/0.60 \ 0A 0A / 2.19/0.60 2 / 0A 0A \ 2.19/0.60 \ 0A 0A / 2.19/0.60 3 / 16A 17A \ 2.19/0.60 \ 16A 17A / 2.19/0.60 4 / 15A 17A \ 2.19/0.60 \ 15A 17A / 2.19/0.60 [3, 0] |-> [4] 2.19/0.60 lhs rhs ge gt 2.19/0.60 / 17A 18A \ / 15A 17A \ True True 2.19/0.60 \ 17A 18A / \ 15A 17A / 2.19/0.60 [4, 2] |-> [3] 2.19/0.60 lhs rhs ge gt 2.19/0.60 / 17A 17A \ / 16A 17A \ True False 2.19/0.60 \ 17A 17A / \ 16A 17A / 2.19/0.60 [0, 0] ->= [1] 2.19/0.60 lhs rhs ge gt 2.19/0.60 / 2A 2A \ / 2A 2A \ True False 2.19/0.60 \ 0A 2A / \ 0A 0A / 2.19/0.60 [1, 2] ->= [0] 2.19/0.60 lhs rhs ge gt 2.19/0.60 / 2A 2A \ / 0A 2A \ True False 2.19/0.60 \ 0A 0A / \ 0A 0A / 2.19/0.60 [2, 1] ->= [0, 1, 2, 2] 2.19/0.60 lhs rhs ge gt 2.19/0.60 / 2A 2A \ / 2A 2A \ True False 2.19/0.60 \ 2A 2A / \ 2A 2A / 2.19/0.60 property Termination 2.19/0.60 has value True 2.19/0.60 for SRS ( [4, 2] |-> [3], [0, 0] ->= [1], [1, 2] ->= [0], [2, 1] ->= [0, 1, 2, 2]) 2.19/0.60 reason 2.19/0.60 weights 2.19/0.60 Map [(4, 1/1)] 2.19/0.60 2.19/0.60 property Termination 2.19/0.60 has value True 2.19/0.61 for SRS ( [0, 0] ->= [1], [1, 2] ->= [0], [2, 1] ->= [0, 1, 2, 2]) 2.19/0.61 reason 2.19/0.61 EDG has 0 SCCs 2.19/0.61 2.19/0.61 property Termination 2.33/0.62 has value True 2.33/0.63 for SRS ( [5, 1] |-> [5, 2], [5, 1] |-> [5], [0, 0] ->= [1], [1, 2] ->= [0], [2, 1] ->= [0, 1, 2, 2]) 2.33/0.63 reason 2.43/0.67 Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 2.43/0.67 interpretation 2.43/0.67 0 / 0A 2A \ 2.43/0.67 \ 0A 0A / 2.43/0.67 1 / 2A 2A \ 2.43/0.67 \ 0A 0A / 2.43/0.67 2 / 0A 0A \ 2.43/0.67 \ 0A 0A / 2.43/0.67 5 / 20A 21A \ 2.43/0.67 \ 20A 21A / 2.43/0.67 [5, 1] |-> [5, 2] 2.43/0.67 lhs rhs ge gt 2.43/0.67 / 22A 22A \ / 21A 21A \ True True 2.43/0.67 \ 22A 22A / \ 21A 21A / 2.43/0.67 [5, 1] |-> [5] 2.43/0.67 lhs rhs ge gt 2.43/0.67 / 22A 22A \ / 20A 21A \ True True 2.43/0.67 \ 22A 22A / \ 20A 21A / 2.43/0.67 [0, 0] ->= [1] 2.43/0.67 lhs rhs ge gt 2.43/0.67 / 2A 2A \ / 2A 2A \ True False 2.43/0.67 \ 0A 2A / \ 0A 0A / 2.43/0.67 [1, 2] ->= [0] 2.43/0.67 lhs rhs ge gt 2.43/0.67 / 2A 2A \ / 0A 2A \ True False 2.43/0.67 \ 0A 0A / \ 0A 0A / 2.43/0.67 [2, 1] ->= [0, 1, 2, 2] 2.43/0.67 lhs rhs ge gt 2.43/0.67 / 2A 2A \ / 2A 2A \ True False 2.43/0.67 \ 2A 2A / \ 2A 2A / 2.43/0.67 property Termination 2.43/0.67 has value True 2.43/0.68 for SRS ( [0, 0] ->= [1], [1, 2] ->= [0], [2, 1] ->= [0, 1, 2, 2]) 2.43/0.68 reason 2.43/0.68 EDG has 0 SCCs 2.43/0.68 2.43/0.68 ************************************************** 2.43/0.68 summary 2.43/0.68 ************************************************** 2.43/0.68 SRS with 3 rules on 3 letters Remap { tracing = False} 2.43/0.68 SRS with 3 rules on 3 letters DP transform 2.43/0.68 SRS with 9 rules on 6 letters Remap { tracing = False} 2.43/0.68 SRS with 9 rules on 6 letters weights 2.43/0.68 SRS with 7 rules on 6 letters EDG 2.43/0.68 2 sub-proofs 2.43/0.68 1 SRS with 5 rules on 5 letters Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 2.43/0.68 SRS with 4 rules on 5 letters weights 2.43/0.68 SRS with 3 rules on 3 letters EDG 2.43/0.68 2.43/0.68 2 SRS with 5 rules on 4 letters Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 2.43/0.68 SRS with 3 rules on 3 letters EDG 2.43/0.68 2.43/0.68 ************************************************** 2.43/0.68 (3, 3)\Deepee(9, 6)\Weight(7, 6)\EDG[(5, 5)\Matrix{\Arctic}{2}(4, 5)\Weight(3, 3)\EDG[],(5, 4)\Matrix{\Arctic}{2}(3, 3)\EDG[]] 2.43/0.68 ************************************************** 4.30/1.19 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.30/1.20 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 4.36/1.22 EOF