Translate the following inference to logic notation: For all x, if x_4 takes a plane, then x_4 is playing squash. For all x, x_4 will not play squash. There is at least one x for which x_4 will take a plane. Therefore there is at least one x for which x_4 will cook.
forall x: P(x) -> Q(x). forall x: ~Q(x). exists x: P(x). Therefore exists x: R(x).