There are notable exceptions, Donald Knuth, for example, is on the P=NP side of the divide but thinks the proof might be non-constructive or that the runtime might have some completely impractical power. I think he cited the Robertson–Seymour theorem and pointed out that there is a gigantic space of polynomial time algorithms with big powers that nobody has explored.