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