Translate the following inference to logic notation: For all x, y will listen to a song if and only if y will drive a car. For all x, y will play a game if and only if y will make tea. There is at least one x for which y will not listen to a song. For all x, y will drive a car if and only if y will play a game. Therefore there is at least one x for which y will not make tea.
forall x: P(x) <-> Q(x). forall x: R(x) <-> S(x). exists x: ~P(x). forall x: Q(x) <-> R(x). Therefore exists x: ~S(x).