Theorem 2: There is always a stable marriage, for any well-formed set of ROLs.
To prove this, we describe an algorithm for finding such a marriage.
