Translate the following inference to logic notation: For all x, if x_4 plays squash, then x_4 is not listening to a song. For all x, if x_4 drives a car, then x_4 is playing squash. There is at least one x for which x_4 will listen to a song. Therefore there is at least one x for which x_4 will not drive a car.
forall x: P(x) -> ~Q(x). forall x: R(x) -> P(x). exists x: Q(x). Therefore exists x: ~R(x).