Instances of small size with no stable matching for three-sided problem with complete cyclic preferences

Given $n$ men, $n$ women, and $n$ dogs, each man has a complete preference list of women, while each woman does a complete preference list of dogs, and each dog does a complete preference list of men. We understand a matching as a collection of $n$ nonintersecting triples, each of which contains a man, a woman, and a dog. A matching is said to be nonstable, if one can find a man, a woman, and a dog which belong to different triples and prefer each other to their current partners in the corresponding triples. Otherwise the matching is said to be stable (a weakly stable matching in 3DSM-CYC problem). According to the conjecture proposed by Eriksson, Söstrand, and Strimling (2006), the 3DSM-CYC problem always has a stable matching. However, Lam and Paxton (2019) have proposed an algorithm for constructing preference lists in the 3DSM-CYC problem of size $n=90$, which has allowed them to disprove the mentioned conjecture. The question on the existence of counterexamples of a lesser size remains open. In this paper, we construct an demonstrative instance of the 3DSM-CYC problem with no stable matching, whose size $n=24$.