Translate the following inference to logic notation: For all x, if x_9 drives a car, then x_9 is playing squash. For all x, if x_9 plays squash, then x_9 is a sailor. For all x, x_9 is a musician if and only if x_9 will drive a car. There is at least one x for which x_9 is not a sailor. Therefore there is at least one x for which x_9 is not a musician.
forall x: P(x) -> Q(x). forall x: Q(x) -> R(x). forall x: S(x) <-> P(x). exists x: ~R(x). Therefore exists x: ~S(x).