MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          cond(false(),n,l) -> tail(nthtail(s(n),l))
          cond(true(),n,l) -> l
          ge(u,0()) -> true()
          ge(0(),s(v)) -> false()
          ge(s(u),s(v)) -> ge(u,v)
          length(cons(x,l)) -> s(length(l))
          length(nil()) -> 0()
          nthtail(n,l) -> cond(ge(n,length(l)),n,l)
          tail(cons(x,l)) -> l
          tail(nil()) -> nil()
      - Signature:
          {cond/3,ge/2,length/1,nthtail/2,tail/1} / {0/0,cons/2,false/0,nil/0,s/1,true/0}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {cond,ge,length,nthtail,tail} and constructors {0,cons
          ,false,nil,s,true}
  + Applied Processor:
      Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = Z3}
  + Details:
      The input can not be schown compatible.
MAYBE