Maymin proved that for binary systems, the path-cut lower bound is sharper than the minimax lower bound for highly reliable components, which was originally conjectured by Barlow and Proschan. In this note, an example is constructed to illustrate that this, in general, is not the case for multistate systems. However, an affirmative result is obtained under mild conditions we imposed. Examples are given to illustrate the applications of our results.