The meaning of "set" in NP-complete problem
It doesn't matter. If a certain problem has one version in which the encoding of sets allows for repeated elements (which are ignored semantically), and another in which repeated elements are forbidden, then there is a simple polynomial time reduction from the former to the latter showing that if the first version is NP-complete, so is the second one.