MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          a(X) -> X
          a(nf(X1,X2)) -> f(a(X1),a(X2))
          a(ns(X)) -> s(a(X))
          a(nt(X)) -> t(a(X))
          d(0()) -> 0()
          d(s(X)) -> s(s(d(X)))
          f(X1,X2) -> nf(X1,X2)
          f(0(),X) -> nil()
          f(s(X),cs(Y,Z)) -> cs(Y,nf(X,a(Z)))
          p(X,0()) -> X
          p(0(),X) -> X
          p(s(X),s(Y)) -> s(s(p(X,Y)))
          q(0()) -> 0()
          q(s(X)) -> s(p(q(X),d(X)))
          s(X) -> ns(X)
          t(N) -> cs(r(q(N)),nt(ns(N)))
          t(X) -> nt(X)
      - Signature:
          {a/1,d/1,f/2,p/2,q/1,s/1,t/1} / {0/0,cs/2,nf/2,nil/0,ns/1,nt/1,r/1}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {a,d,f,p,q,s,t} and constructors {0,cs,nf,nil,ns,nt,r}
  + Applied Processor:
      Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = MiniSMT}
  + Details:
      The input can not be schown compatible.
MAYBE