To expand on my previous response: you want a proof that is checkable in polynomial time; yes - completely agree. I was just playing the devil's advocate case, that maybe integer solutions could be assumed (if it was a low-level class, for example).