ついに証明されたぞー
https://arxiv.org/abs/1708.03486

A Solution of the P versus NP Problem

Norbert Blum
(Submitted on 11 Aug 2017)
Berg and Ulfberg and Amano and Maruoka have used CNF-DNF-approximators to prove
exponential lower bounds for the monotone network complexity of the clique function and of
Andreev's function. We show that these approximators can be used to prove the same
lower bound for their non-monotone network complexity. This implies P not equal NP.