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