@DrJoyee By “3-SAT solved?” I meant an algorithm that solves every 3-SAT instance in polynomial time. Since 3-SAT is NP-complete, that would prove P = NP. “NPC” was a pun on NP-complete and non-player character 😄. The simulation question would still need its own evidence.