What open problems in computational complexity theory have the most 'obvious' answers, regardless of whether that answer is true or false? The problems I'm talking about certainly have more 'obvious' answers than P =?= NP.
I'll start this with
ZPP =?= EXPTIME
