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