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(N), cons(X, XS)) -> sel(N, XS)
  , sel(0(), cons(X, XS)) -> X
  , minus(X, 0()) -> 0()
  , minus(s(X), s(Y)) -> minus(X, Y)
  , quot(s(X), s(Y)) -> s(quot(minus(X, Y), s(Y)))
  , quot(0(), s(Y)) -> 0()
  , zWquot(XS, nil()) -> nil()
  , zWquot(cons(X, XS), cons(Y, YS)) ->
    cons(quot(X, Y), zWquot(XS, YS))
  , zWquot(nil(), XS) -> nil() }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The input cannot be shown compatible

Arrrr..