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