Chess Composition - Eliminating Duplicate Solutions – Automatically?

Recently there have been headlines along the lines of "A Machine Composes Problems". The question I am interested in here however is a bit different - with so many chess problems and studies having been composed over the last two three hundred years, it would be curious to test their correctness in a fashion as automatic as possible.

The test would have to check both that the problem is correct, and that the problem one and only one solution. Loading a position into Fritz is obviously going to show that, but how would one automatically run a test on the entire database of checkmate  problems/studies/tactical solutions?

Has anyone heard of such an initiative and whether this has been ever done either by chess composers or engine authors?

I would imagine those two categories of people are probably quite interested in doing something like this.