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