MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          del(x,cons(y,z)) -> if(eq(x,y),z,cons(y,del(x,z)))
          del(x,nil()) -> nil()
          eq(0(),0()) -> true()
          eq(0(),s(y)) -> false()
          eq(s(x),0()) -> false()
          eq(s(x),s(y)) -> eq(x,y)
          if(false(),x,y) -> y
          if(true(),x,y) -> x
          le(0(),y) -> true()
          le(s(x),0()) -> false()
          le(s(x),s(y)) -> le(x,y)
          min(x,cons(y,z)) -> if(le(x,y),min(x,z),min(y,z))
          min(x,nil()) -> x
          minsort(cons(x,y)) -> cons(min(x,y),minsort(del(min(x,y),cons(x,y))))
          minsort(nil()) -> nil()
      - Signature:
          {del/2,eq/2,if/3,le/2,min/2,minsort/1} / {0/0,cons/2,false/0,nil/0,s/1,true/0}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {del,eq,if,le,min,minsort} 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