A double partition problem asks for a number of nonnegative integer solutions to a system of two linear Diophantine equations with integer coefficients. Artur Cayley suggested a reduction of a double partition to a sum of scalar partitions with an algorithm subject to a set of conditions. We show that when these conditions are not satisfied and the original algorithm fails its modification solves the reduction problem.