P == NP proof

Sudoku solving is NP complete^[1]
Human brains can solve sudoku in polynomial time
There exists one example of polynomial time solving of a NP complete problem => P == NP.

^[1]http://www.cs.ox.ac.uk/people/paul.goldberg/FCS/sudoku.html

>>17 Do you understand what NP mean?
The solver described is deterministic. i.e. its not NP anymore.
In computational complexity theory, a decision problem is NP-complete when it is both in NP and NP-hard. The set of NP-complete problems is often denoted by NP-C or NPC. The abbreviation NP refers to "nondeterministic polynomial time".