On the difficulty of proving P=NP in ZFC | Dark Hacker News