Are any $A$, $B$, and $O$ such that:
- $O$ is a set (for oracle),
- $A$ and $B$ are the names of two known complexity classes,
- $A^X$ and $B^X$ have well-defined accepted meanings,
- $A=A^\emptyset\subset B^\emptyset=B$, i.e. $A$ is strictly contained in $B$,
- $A^O\supset B^O$, i.e. $A^O$ strictly contains $B^O$.
In the case of $\mathsf{P}$ and $\mathsf{EXP}$, it's impossible to find an oracle $O$ relative to which $\mathsf{P}^O$ strictly contains $\mathsf{EXP}^O$ since a $\mathsf{EXP}^X$ can completely simulate every step of any turing machine in $\mathsf{P}^X$ (i.e. the time hierarchy theorem relativizes).
I'm wondering if there are complexity classes $A$, $B$ s.t. $A \subset B$, yet for some oracle $O$, $A^O \supset B^O$. In other words, can the direction of strict inclusion change when complexity classes are relativized?