MAYBE We are left with following problem, upon which TcT provides the certificate MAYBE. Strict Trs: { from(X) -> cons(X, from(s(X))) , sel(s(X), cons(Y, Z)) -> sel(X, Z) , sel(0(), cons(X, Y)) -> X } Obligation: innermost runtime complexity Answer: MAYBE We add following weak dependency pairs: Strict DPs: { from^#(X) -> c_1(from^#(s(X))) , sel^#(s(X), cons(Y, Z)) -> c_2(sel^#(X, Z)) , sel^#(0(), cons(X, Y)) -> c_3() } and mark the set of starting terms. We are left with following problem, upon which TcT provides the certificate MAYBE. Strict DPs: { from^#(X) -> c_1(from^#(s(X))) , sel^#(s(X), cons(Y, Z)) -> c_2(sel^#(X, Z)) , sel^#(0(), cons(X, Y)) -> c_3() } Strict Trs: { from(X) -> cons(X, from(s(X))) , sel(s(X), cons(Y, Z)) -> sel(X, Z) , sel(0(), cons(X, Y)) -> X } Obligation: innermost runtime complexity Answer: MAYBE No rule is usable, rules are removed from the input problem. We are left with following problem, upon which TcT provides the certificate MAYBE. Strict DPs: { from^#(X) -> c_1(from^#(s(X))) , sel^#(s(X), cons(Y, Z)) -> c_2(sel^#(X, Z)) , sel^#(0(), cons(X, Y)) -> c_3() } Obligation: innermost runtime complexity Answer: MAYBE The weightgap principle applies (using the following constant growth matrix-interpretation) The following argument positions are usable: Uargs(c_1) = {1}, Uargs(c_2) = {1} TcT has computed following constructor-restricted matrix interpretation. [cons](x1, x2) = [1] x2 + [2] [s](x1) = [1] x1 + [1] [0] = [2] [from^#](x1) = [2] x1 + [1] [c_1](x1) = [1] x1 + [1] [sel^#](x1, x2) = [1] x1 + [1] x2 + [2] [c_2](x1) = [1] x1 + [2] [c_3] = [1] This order satisfies following ordering constraints: Further, it can be verified that all rules not oriented are covered by the weightgap condition. We are left with following problem, upon which TcT provides the certificate MAYBE. Strict DPs: { from^#(X) -> c_1(from^#(s(X))) } Weak DPs: { sel^#(s(X), cons(Y, Z)) -> c_2(sel^#(X, Z)) , sel^#(0(), cons(X, Y)) -> c_3() } Obligation: innermost runtime complexity Answer: MAYBE The following weak DPs constitute a sub-graph of the DG that is closed under successors. The DPs are removed. { sel^#(s(X), cons(Y, Z)) -> c_2(sel^#(X, Z)) , sel^#(0(), cons(X, Y)) -> c_3() } We are left with following problem, upon which TcT provides the certificate MAYBE. Strict DPs: { from^#(X) -> c_1(from^#(s(X))) } Obligation: innermost runtime complexity Answer: MAYBE The input cannot be shown compatible Arrrr..