Independence of the conjugacy problem and conjugacy separability

We construct a class of finitely generated groups which have arbitrarily large conjugacy separability function, but in which the conjugacy problem can be solved in polynomial time, demonstrating that the McKinsey algorithm for the conjugacy problem can have complexity which lies arbitrarily far from the optimum.