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