YES
Input TRS:
    1: le(0(),s(x)) -> true()
    2: le(x,0()) -> false()
    3: le(s(x),s(y)) -> le(x,y)
    4: min(cons(x,nil())) -> x
    5: min(cons(x,l)) -> x | le(x,min(l)) --> true()
    6: min(cons(x,l)) -> min(l) | le(x,min(l)) --> false()
    7: min(cons(x,l)) -> min(l) | min(l) --> x
Infeasibility test:
    le(x1,min(nil())) --> true()
Symbol transition graph:
    min	-->  # 0 cons false le min nil s true
    le	--> false le true
  Collapsable symbols: { min min }