The ABC-partition problem is a variant of 3-partition in which, instead of a single set $S$ with $3 m$ positive integers, there are three sets $A, B, C$ with $m$ positive integers in each. The goal is to construct $m$ triplets with the same sum, each of which contains exactly one integer from $A,...