I have been working on a checkmate-in-3 problem for a long time. So long that I am becoming convinced it is not solvable. 

Is there a way to prove it is not solvable?

I want to avoid putting the problem in an engine, in case it will show me a solution. For the same reason I do not want to share the problem.