The million dollar question here is... a literal million dollar question.

The natural way to go up in complexity from NP is along the polynomial hierarchy, but since it could be the case that P=NP, those problems aren't provably harder.For all we know it could even be the case that P=PSPACE.

You could invoke the nondeterministic variant of the time-hierarchy theorem.