P is not equal to NP.  This is "obvious", is a straightforward arithmetic proposition doesn't involve any fancy set theory or spacefilling curves, and yet it's so hard that there have whole workshops ("Barriers") and important papers (BGS, natural proofs etc.) devoted to the question of what makes it so hard.  Scott Aaronson describes "a would-be P≠NP prover who hasn’t yet grasped the sheer number of mangled skeletons and severed heads that line his path."   P≠PSPACE is even more obvious and yet there is a comparable lack of progress.