MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          appmin(min,Cons(x,xs),xs') -> appmin[Ite][True][Ite](<(x,min),min,Cons(x,xs),xs')
          appmin(min,Nil(),xs) -> Cons(min,minsort(remove(min,xs)))
          minsort(Cons(x,xs)) -> appmin(x,xs,Cons(x,xs))
          minsort(Nil()) -> Nil()
          notEmpty(Cons(x,xs)) -> True()
          notEmpty(Nil()) -> False()
          remove(x',Cons(x,xs)) -> remove[Ite](!EQ(x',x),x',Cons(x,xs))
      - Weak TRS:
          !EQ(0(),0()) -> True()
          !EQ(0(),S(y)) -> False()
          !EQ(S(x),0()) -> False()
          !EQ(S(x),S(y)) -> !EQ(x,y)
          <(x,0()) -> False()
          <(0(),S(y)) -> True()
          <(S(x),S(y)) -> <(x,y)
          appmin[Ite][True][Ite](False(),min,Cons(x,xs),xs') -> appmin(min,xs,xs')
          appmin[Ite][True][Ite](True(),min,Cons(x,xs),xs') -> appmin(x,xs,xs')
          remove[Ite](False(),x',Cons(x,xs)) -> Cons(x,remove(x',xs))
          remove[Ite](True(),x',Cons(x,xs)) -> xs
      - Signature:
          {!EQ/2,</2,appmin/3,appmin[Ite][True][Ite]/4,minsort/1,notEmpty/1,remove/2,remove[Ite]/3} / {0/0,Cons/2
          ,False/0,Nil/0,S/1,True/0}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {!EQ,<,appmin,appmin[Ite][True][Ite],minsort,notEmpty
          ,remove,remove[Ite]} and constructors {0,Cons,False,Nil,S,True}
  + Applied Processor:
      MI {miKind = Automaton Nothing, miDimension = 3, miUArgs = NoUArgs, miURules = NoURules, miSelector = Nothing}
  + Details:
      Incompatible
MAYBE