Disjoint NPUnknown control sequence '\mathsf' -pairs are a well studied complexity-theoretic concept with important applications in cryptography and propositional proof complexity. In this paper we introduce a natural generalization of the notion of disjoint NPUnknown control sequence '\mathsf' -pairs to disjoint k-tuples of NPUnknown control sequence '\mathsf' -sets for k≥2. We define subclasses of the class of all disjoint k-tuples of NPUnknown control sequence '\mathsf' -sets. These subclasses are associated with a propositional proof system and possess complete tuples which are defined from the proof system. In our main result we show that complete disjoint NPUnknown control sequence '\mathsf' -pairs exist if and only if complete disjoint k-tuples of NPUnknown control sequence '\mathsf' -sets exist for all k≥2. Further, this is equivalent to the existence of a propositional proof system in which the disjointness of all k-tuples is shortly provable. We also show that a strengthening of this conditions characterizes the existence of optimal proof systems
