MAYBE

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

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

The input cannot be shown compatible

Arrrr..