As is known, the problem of finding a three-dimensional stable matching with cyclic preferences (3DSM-CYC) always has a solution, if the number of objects of each type (i.e., the problem size n) does not exceed 5. According ...