Translate the following inference to logic notation: For all x, x_3 will not take a plane or x_3 will play a game. There is at least one x for which if x_3 were a server, then x_3 is a musician. For all x, if x_3 plays a game, then x_3 is cooking. For all x, if x_3 were a musician, then x_3 is cooking. For all x, x_3 will take a plane or x_3 is a server. Therefore there is at least one x for which x_3 will cook.
forall x: ~P(x) or Q(x). exists x: R(x) -> S(x). forall x: Q(x) -> T(x). forall x: S(x) -> T(x). forall x: P(x) or R(x). Therefore exists x: T(x).