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

>>12
Its already solved without backtracking/guessing, but they didn't publish the source code.
https://news.nd.edu/news/32826-notre-dame-researcher-helps-make-sudoku-puzzles-less-puzzling/