MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          activate(X) -> X
          activate(n__from(X)) -> from(activate(X))
          activate(n__s(X)) -> s(activate(X))
          after(0(),XS) -> XS
          after(s(N),cons(X,XS)) -> after(N,activate(XS))
          from(X) -> cons(X,n__from(n__s(X)))
          from(X) -> n__from(X)
          s(X) -> n__s(X)
      - Signature:
          {activate/1,after/2,from/1,s/1} / {0/0,cons/2,n__from/1,n__s/1}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {activate,after,from,s} and constructors {0,cons,n__from
          ,n__s}
  + Applied Processor:
      Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = MiniSMT}
  + Details:
      The input can not be schown compatible.
MAYBE