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