MAYBE

We are left with following problem, upon which TcT provides the
certificate MAYBE.

Strict Trs:
  { f(X) -> cons(X, n__f(g(X)))
  , f(X) -> n__f(X)
  , g(0()) -> s(0())
  , g(s(X)) -> s(s(g(X)))
  , sel(0(), cons(X, Y)) -> X
  , sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
  , activate(X) -> X
  , activate(n__f(X)) -> f(X) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The input cannot be shown compatible

Arrrr..