Is it possible to divide all non-empty subsets of a set of 10 elements into triples so that in each triple, two of the subsets do not intersect and in their union give the third? Proposed by Vladislav Frank