Nontrivial membership in NP
Integer Programming.

Showing that if there is an integer solution then there is a polynomial size integer solution is quite involved. See 


Christos Papadimitriou, "On the Complexity of Integer Programming", JACM, 1981.