MAYBE

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

Strict Trs:
  { first(X1, X2) -> n__first(X1, X2)
  , first(0(), X) -> nil()
  , first(s(X), cons(Y, Z)) -> cons(Y, n__first(X, activate(Z)))
  , activate(X) -> X
  , activate(n__first(X1, X2)) -> first(X1, X2)
  , activate(n__from(X)) -> from(X)
  , from(X) -> cons(X, n__from(s(X)))
  , from(X) -> n__from(X) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The input cannot be shown compatible

Arrrr..