Is Murphy's Law of Complexity Theory consistent? What separations/collapses does it imply?
A counterexample to this Murphy's Law could actually be the famous paper

Baker, Theodore; Gill, John; Solovay, Robert, Relativizations of the $\cal P=?\cal N\cal P$ question, SIAM J. Comput. 4, 431-442 (1975). ZBL0323.68033.

It shows that the $P=^? NP$ question is 


hard: you cannot solve it with relativizable techniques; but also
easy: we can establish $P^A= NP^A$ for some oracles $A$, and $P^B \ne NP^B$ for some oracles $B$, so now we just have to figure out what whether a trivial oracle is more like $A$ or like $B$...