Let $\displaystyle \theta$ be $\displaystyle \forall{x}\forall{y}\exists{z}((R(x,z)\wedge {R(y,z)})\wedge \forall{w}((R(x,w)\wedge {R(y,w)}) \rightarrow R(z,w)))$ and let $\displaystyle \phi$ be $\displaystyle \forall{x}\forall{y}\exists{z}((R(z,x)\wedge {R(z,y)})\wedge \forall{w}((R(w,x)\wedge {R(w,y)}) \rightarrow R(w,z)))$

Where R is a binary predicate symbol.

I have been asked to find an L structure consisting of 3 elements such that $\displaystyle \theta \not \models \phi$

My Professor hasn't really given us a method to do this, any help would be appreciated.