MAYBE

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

Strict Trs:
  { terms(N) -> cons(recip(sqr(N)), n__terms(s(N)))
  , terms(X) -> n__terms(X)
  , sqr(s(X)) -> s(add(sqr(X), dbl(X)))
  , sqr(0()) -> 0()
  , add(s(X), Y) -> s(add(X, Y))
  , add(0(), X) -> X
  , dbl(s(X)) -> s(s(dbl(X)))
  , dbl(0()) -> 0()
  , first(X1, X2) -> n__first(X1, X2)
  , first(s(X), cons(Y, Z)) -> cons(Y, n__first(X, activate(Z)))
  , first(0(), X) -> nil()
  , activate(X) -> X
  , activate(n__terms(X)) -> terms(X)
  , activate(n__first(X1, X2)) -> first(X1, X2) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The input cannot be shown compatible

Arrrr..