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