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