MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          bsort(.(x,y)) -> last(.(bubble(.(x,y)),bsort(butlast(bubble(.(x,y))))))
          bsort(nil()) -> nil()
          bubble(.(x,.(y,z))) -> if(<=(x,y),.(y,bubble(.(x,z))),.(x,bubble(.(y,z))))
          bubble(.(x,nil())) -> .(x,nil())
          bubble(nil()) -> nil()
          butlast(.(x,.(y,z))) -> .(x,butlast(.(y,z)))
          butlast(.(x,nil())) -> nil()
          butlast(nil()) -> nil()
          last(.(x,.(y,z))) -> last(.(y,z))
          last(.(x,nil())) -> x
          last(nil()) -> 0()
      - Signature:
          {bsort/1,bubble/1,butlast/1,last/1} / {./2,0/0,<=/2,if/3,nil/0}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {bsort,bubble,butlast,last} and constructors {.,0,<=,if
          ,nil}
  + Applied Processor:
      NaturalMI {miDimension = 3, miDegree = 3, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing}
  + Details:
      Incompatible
MAYBE