MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          activate(X) -> X
          activate(n__first(X1,X2)) -> first(activate(X1),activate(X2))
          activate(n__s(X)) -> s(activate(X))
          activate(n__terms(X)) -> terms(activate(X))
          add(0(),X) -> X
          add(s(X),Y) -> s(add(X,Y))
          dbl(0()) -> 0()
          dbl(s(X)) -> s(s(dbl(X)))
          first(X1,X2) -> n__first(X1,X2)
          first(0(),X) -> nil()
          first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z)))
          s(X) -> n__s(X)
          sqr(0()) -> 0()
          sqr(s(X)) -> s(add(sqr(X),dbl(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__first/2,n__s/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__first,n__s,n__terms,nil,recip}
  + Applied Processor:
      Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = MiniSMT}
  + Details:
      The input can not be schown compatible.
MAYBE