MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          del(x,.(y,z)) -> if(=(x,y),z,.(y,del(x,z)))
          del(x,nil()) -> nil()
          min(x,.(y,z)) -> if(<=(x,y),min(x,z),min(y,z))
          min(x,nil()) -> x
          msort(.(x,y)) -> .(min(x,y),msort(del(min(x,y),.(x,y))))
          msort(nil()) -> nil()
      - Signature:
          {del/2,min/2,msort/1} / {./2,<=/2,=/2,if/3,nil/0}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {del,min,msort} and constructors {.,<=,=,if,nil}
  + Applied Processor:
      Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = Z3}
  + Details:
      The input can not be schown compatible.
MAYBE