MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          activate(X) -> X
          activate(n__add(X1,X2)) -> add(activate(X1),activate(X2))
          activate(n__dbl(X)) -> dbl(activate(X))
          activate(n__first(X1,X2)) -> first(activate(X1),activate(X2))
          activate(n__s(X)) -> s(X)
          activate(n__sqr(X)) -> sqr(activate(X))
          activate(n__terms(X)) -> terms(activate(X))
          add(X1,X2) -> n__add(X1,X2)
          add(0(),X) -> X
          add(s(X),Y) -> s(n__add(activate(X),Y))
          dbl(X) -> n__dbl(X)
          dbl(0()) -> 0()
          dbl(s(X)) -> s(n__s(n__dbl(activate(X))))
          first(X1,X2) -> n__first(X1,X2)
          first(0(),X) -> nil()
          first(s(X),cons(Y,Z)) -> cons(Y,n__first(activate(X),activate(Z)))
          s(X) -> n__s(X)
          sqr(X) -> n__sqr(X)
          sqr(0()) -> 0()
          sqr(s(X)) -> s(n__add(n__sqr(activate(X)),n__dbl(activate(X))))
          terms(N) -> cons(recip(sqr(N)),n__terms(n__s(N)))
          terms(X) -> n__terms(X)
      - Signature:
          {activate/1,add/2,dbl/1,first/2,s/1,sqr/1,terms/1} / {0/0,cons/2,n__add/2,n__dbl/1,n__first/2,n__s/1
          ,n__sqr/1,n__terms/1,nil/0,recip/1}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {activate,add,dbl,first,s,sqr,terms} and constructors {0
          ,cons,n__add,n__dbl,n__first,n__s,n__sqr,n__terms,nil,recip}
  + Applied Processor:
      NaturalPI {shape = Mixed 3, restrict = NoRestrict, uargs = UArgs, urules = URules, selector = Nothing}
  + Details:
      Incompatible
MAYBE