0.00/0.11 YES 0.00/0.11 property Termination 0.00/0.11 has value True 0.00/0.11 for SRS ( [a, b] -> [b, b, a], [c, b] -> [b, c, c]) 0.00/0.11 reason 0.00/0.11 remap for 2 rules 0.00/0.11 property Termination 0.00/0.11 has value True 0.00/0.11 for SRS ( [0, 1] -> [1, 1, 0], [2, 1] -> [1, 2, 2]) 0.00/0.11 reason 0.00/0.11 DP transform 0.00/0.11 property Termination 0.00/0.11 has value True 0.00/0.11 for SRS ( [0, 1] ->= [1, 1, 0], [2, 1] ->= [1, 2, 2], [0#, 1] |-> [0#], [2#, 1] |-> [2#, 2], [2#, 1] |-> [2#]) 0.00/0.11 reason 0.00/0.11 remap for 5 rules 0.00/0.11 property Termination 0.00/0.11 has value True 0.00/0.11 for SRS ( [0, 1] ->= [1, 1, 0], [2, 1] ->= [1, 2, 2], [3, 1] |-> [3], [4, 1] |-> [4, 2], [4, 1] |-> [4]) 0.00/0.11 reason 0.00/0.11 EDG has 2 SCCs 0.00/0.11 property Termination 0.00/0.11 has value True 0.00/0.11 for SRS ( [3, 1] |-> [3], [0, 1] ->= [1, 1, 0], [2, 1] ->= [1, 2, 2]) 0.00/0.11 reason 0.00/0.11 Matrix { monotone = Strict, domain = Natural, bits = 3, dim = 2, solver = Minisatapi, verbose = False, tracing = False} 0.00/0.11 interpretation 0.00/0.11 0 / 2 1 \ 0.00/0.11 \ 0 1 / 0.00/0.11 1 / 1 1 \ 0.00/0.11 \ 0 1 / 0.00/0.11 2 / 1 0 \ 0.00/0.11 \ 0 1 / 0.00/0.11 3 / 2 0 \ 0.00/0.11 \ 0 1 / 0.00/0.11 [3, 1] |-> [3] 0.00/0.11 lhs rhs ge gt 0.00/0.11 / 2 2 \ / 2 0 \ True True 0.00/0.11 \ 0 1 / \ 0 1 / 0.00/0.11 [0, 1] ->= [1, 1, 0] 0.00/0.11 lhs rhs ge gt 0.00/0.11 / 2 3 \ / 2 3 \ True False 0.00/0.11 \ 0 1 / \ 0 1 / 0.00/0.11 [2, 1] ->= [1, 2, 2] 0.00/0.11 lhs rhs ge gt 0.00/0.11 / 1 1 \ / 1 1 \ True False 0.00/0.11 \ 0 1 / \ 0 1 / 0.00/0.11 property Termination 0.00/0.11 has value True 0.00/0.11 for SRS ( [0, 1] ->= [1, 1, 0], [2, 1] ->= [1, 2, 2]) 0.00/0.11 reason 0.00/0.11 EDG has 0 SCCs 0.00/0.11 0.00/0.11 property Termination 0.00/0.11 has value True 0.00/0.11 for SRS ( [4, 1] |-> [4, 2], [4, 1] |-> [4], [0, 1] ->= [1, 1, 0], [2, 1] ->= [1, 2, 2]) 0.00/0.11 reason 0.00/0.11 Matrix { monotone = Strict, domain = Natural, bits = 3, dim = 2, solver = Minisatapi, verbose = False, tracing = False} 0.00/0.11 interpretation 0.00/0.11 0 / 2 1 \ 0.00/0.11 \ 0 1 / 0.00/0.11 1 / 1 1 \ 0.00/0.11 \ 0 1 / 0.00/0.11 2 / 1 0 \ 0.00/0.11 \ 0 1 / 0.00/0.11 4 / 2 0 \ 0.00/0.11 \ 0 1 / 0.00/0.11 [4, 1] |-> [4, 2] 0.00/0.11 lhs rhs ge gt 0.00/0.11 / 2 2 \ / 2 0 \ True True 0.00/0.11 \ 0 1 / \ 0 1 / 0.00/0.11 [4, 1] |-> [4] 0.00/0.11 lhs rhs ge gt 0.00/0.11 / 2 2 \ / 2 0 \ True True 0.00/0.11 \ 0 1 / \ 0 1 / 0.00/0.11 [0, 1] ->= [1, 1, 0] 0.00/0.11 lhs rhs ge gt 0.00/0.11 / 2 3 \ / 2 3 \ True False 0.00/0.11 \ 0 1 / \ 0 1 / 0.00/0.11 [2, 1] ->= [1, 2, 2] 0.00/0.11 lhs rhs ge gt 0.00/0.11 / 1 1 \ / 1 1 \ True False 0.00/0.11 \ 0 1 / \ 0 1 / 0.00/0.11 property Termination 0.00/0.11 has value True 0.00/0.11 for SRS ( [0, 1] ->= [1, 1, 0], [2, 1] ->= [1, 2, 2]) 0.00/0.11 reason 0.00/0.11 EDG has 0 SCCs 0.00/0.11 0.00/0.11 ************************************************** 0.00/0.11 summary 0.00/0.11 ************************************************** 0.00/0.11 SRS with 2 rules on 3 letters Remap { tracing = False} 0.00/0.11 SRS with 2 rules on 3 letters DP transform 0.00/0.11 SRS with 5 rules on 5 letters Remap { tracing = False} 0.00/0.11 SRS with 5 rules on 5 letters EDG 0.00/0.11 2 sub-proofs 0.00/0.11 1 SRS with 3 rules on 4 letters Matrix { monotone = Strict, domain = Natural, bits = 3, dim = 2, solver = Minisatapi, verbose = False, tracing = False} 0.00/0.11 SRS with 2 rules on 3 letters EDG 0.00/0.11 0.00/0.11 2 SRS with 4 rules on 4 letters Matrix { monotone = Strict, domain = Natural, bits = 3, dim = 2, solver = Minisatapi, verbose = False, tracing = False} 0.00/0.11 SRS with 2 rules on 3 letters EDG 0.00/0.11 0.00/0.11 ************************************************** 0.00/0.11 (2, 3)\Deepee(5, 5)\EDG[(3, 4)\Matrix{\Natural}{2}(2, 3)\EDG[],(4, 4)\Matrix{\Natural}{2}(2, 3)\EDG[]] 0.00/0.11 ************************************************** 0.00/0.12 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.12 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 0.00/0.13 EOF