MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          activate(X) -> X
          activate(n__cons(X1,X2)) -> cons(X1,X2)
          activate(n__from(X)) -> from(X)
          activate(n__nil()) -> nil()
          cons(X1,X2) -> n__cons(X1,X2)
          from(X) -> cons(X,n__from(s(X)))
          from(X) -> n__from(X)
          length(n__cons(X,Y)) -> s(length1(activate(Y)))
          length(n__nil()) -> 0()
          length1(X) -> length(activate(X))
          nil() -> n__nil()
      - Signature:
          {activate/1,cons/2,from/1,length/1,length1/1,nil/0} / {0/0,n__cons/2,n__from/1,n__nil/0,s/1}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {activate,cons,from,length,length1
          ,nil} and constructors {0,n__cons,n__from,n__nil,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