7.00/1.81 YES 7.00/1.81 property Termination 7.00/1.81 has value True 7.00/1.81 for SRS ( [b, b, c] -> [a, a, b], [b, b, a] -> [c, b, b], [a, c, c] ->= [c, a, b], [a, b, a] ->= [b, c, c], [b, a, a] ->= [c, b, b]) 7.00/1.81 reason 7.00/1.81 remap for 5 rules 7.00/1.81 property Termination 7.00/1.81 has value True 7.00/1.81 for SRS ( [0, 0, 1] -> [2, 2, 0], [0, 0, 2] -> [1, 0, 0], [2, 1, 1] ->= [1, 2, 0], [2, 0, 2] ->= [0, 1, 1], [0, 2, 2] ->= [1, 0, 0]) 7.00/1.81 reason 7.00/1.81 Matrix { monotone = Strict, domain = Natural, bits = 3, dim = 4, solver = Minisatapi, verbose = False, tracing = False} 7.00/1.81 interpretation 7.00/1.81 0 St / 1 1 0 0 \ 7.00/1.81 | 1 0 1 0 | 7.00/1.81 | 1 0 1 0 | 7.00/1.81 \ 0 0 0 1 / 7.12/1.81 1 St / 1 1 0 1 \ 7.12/1.81 | 1 0 1 1 | 7.12/1.81 | 1 0 1 0 | 7.12/1.81 \ 0 0 0 1 / 7.12/1.81 2 St / 1 0 1 1 \ 7.12/1.81 | 1 1 0 1 | 7.12/1.81 | 1 1 0 1 | 7.12/1.81 \ 0 0 0 1 / 7.12/1.81 [0, 0, 1] -> [2, 2, 0] 7.12/1.81 lhs rhs ge gt 7.12/1.81 St / 4 2 2 3 \ St / 4 2 2 3 \ True False 7.12/1.81 | 4 2 2 3 | | 4 2 2 3 | 7.12/1.81 | 4 2 2 3 | | 4 2 2 3 | 7.12/1.81 \ 0 0 0 1 / \ 0 0 0 1 / 7.12/1.81 [0, 0, 2] -> [1, 0, 0] 7.12/1.81 lhs rhs ge gt 7.12/1.81 St / 4 2 2 4 \ St / 4 2 2 1 \ True True 7.12/1.81 | 4 2 2 4 | | 4 2 2 1 | 7.12/1.81 | 4 2 2 4 | | 4 2 2 0 | 7.12/1.81 \ 0 0 0 1 / \ 0 0 0 1 / 7.12/1.81 [2, 1, 1] ->= [1, 2, 0] 7.12/1.81 lhs rhs ge gt 7.12/1.81 St / 4 2 2 5 \ St / 4 2 2 3 \ True True 7.12/1.81 | 4 2 2 6 | | 4 2 2 3 | 7.12/1.81 | 4 2 2 6 | | 4 2 2 2 | 7.12/1.81 \ 0 0 0 1 / \ 0 0 0 1 / 7.12/1.81 [2, 0, 2] ->= [0, 1, 1] 7.12/1.81 lhs rhs ge gt 7.12/1.81 St / 4 2 2 5 \ St / 4 2 2 5 \ True False 7.12/1.81 | 4 2 2 5 | | 4 2 2 4 | 7.12/1.81 | 4 2 2 5 | | 4 2 2 4 | 7.12/1.81 \ 0 0 0 1 / \ 0 0 0 1 / 7.12/1.81 [0, 2, 2] ->= [1, 0, 0] 7.12/1.81 lhs rhs ge gt 7.12/1.81 St / 4 2 2 6 \ St / 4 2 2 1 \ True True 7.12/1.81 | 4 2 2 6 | | 4 2 2 1 | 7.12/1.81 | 4 2 2 6 | | 4 2 2 0 | 7.12/1.81 \ 0 0 0 1 / \ 0 0 0 1 / 7.12/1.81 property Termination 7.12/1.81 has value True 7.12/1.81 for SRS ( [0, 0, 1] -> [2, 2, 0], [2, 0, 2] ->= [0, 1, 1]) 7.12/1.81 reason 7.12/1.81 weights 7.12/1.81 Map [(0, 3/1), (2, 1/1)] 7.12/1.81 7.12/1.81 property Termination 7.12/1.81 has value True 7.12/1.81 for SRS ( ) 7.12/1.81 reason 7.12/1.81 has no strict rules 7.12/1.81 7.12/1.81 ************************************************** 7.12/1.81 summary 7.12/1.81 ************************************************** 7.12/1.81 SRS with 5 rules on 3 letters Remap { tracing = False} 7.12/1.81 SRS with 5 rules on 3 letters Matrix { monotone = Strict, domain = Natural, bits = 3, dim = 4, solver = Minisatapi, verbose = False, tracing = False} 7.12/1.81 SRS with 2 rules on 3 letters weights 7.12/1.81 SRS with 0 rules on 0 letters has no strict rules 7.12/1.81 7.12/1.81 ************************************************** 7.12/1.81 (5, 3)\Matrix{\Natural}{4}(2, 3)\Weight(0, 0)[] 7.12/1.81 ************************************************** 7.12/1.81 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;when_small = \ m -> And_Then (Worker (SizeAtmost 100)) m;when_medium = \ m -> And_Then (Worker (SizeAtmost 10000)) m;tiling = \ m w -> weighted (And_Then (Worker (Tiling { method = m,width = w})) (Worker Remap));matrix = \ mo dom dim bits -> weighted (Worker (Matrix { monotone = mo,domain = dom,dim = dim,bits = bits}));kbo = \ b -> weighted (Worker (KBO { bits = b,solver = Minisatapi}));method = Apply wop (Tree_Search_Preemptive 0 done ([ ] <> ([ when_medium (kbo 1), when_medium (And_Then (Worker Mirror) (kbo 1))] <> ((for [ 3, 4] (\ d -> when_small (matrix Strict Natural d 3))) <> (for [ 2, 3, 5, 8] (\ w -> tiling Overlap w))))))} 7.12/1.81 in Apply (Worker Remap) method 7.15/1.84 EOF