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