That can come later, if it's even possible. Just get the damn thing proven first.
Contrast that with, say, special relativity. I can't even really understand the consequences of special relativity (length contraction, relativity of simultaneity, time dilation, etc.) beyond accepting that my intuitions are completely errant at relativistic speeds. Because of that, I don't really expect or hope for an intuitive proof or explanation of special relativity.
Also, I'll preemptively mention that Gödel showed us that any formal problem is a problem in number theory. That said, a problem like P =? NP would almost surely be incomprehensible if expressed as an isomorphic problem in number theory. So my original point, clarified and rephrased, is that I would expect (or desire) the proof of a problem to be as intuitive as the statement of the problem combined with its consequences in the domain the problem is stated.
So it may be with mathematics. Things like Fermat's Last Theorem and P != NP may be difficult to grasp simply within our current frameworks, but new ideas may give rise to new frameworks that makes them more digestible.
If you can just get it proved somehow then you can proceed with confidence towards these new ideas.
The objection does seem to be at the head of the objection section of the community wiki, though:
http://michaelnielsen.org/polymath1/index.php?title=Deolalik...
So it seems this is the defender our star forward has to get past to hit the ultimate math-world goal. We can now root for our respective teams... Go defenders!
I'm rooting for defenders on the principle that the present proof doesn't seem illuminating. I'd prefer a proof that seemed to give insight into the nature of complexity itself. But it's still just a diversion...