Translate the following inference to logic notation: For all x, y_4 is curious if and only if y_4 will listen to a song. There is at least one x for which y_4 will not listen to a song. For all x, y_4 will listen to a song or y_4 is not curious. Therefore there is at least one x for which y_4 is not curious.
forall x: P(x) <-> Q(x). exists x: ~Q(x). forall x: Q(x) or ~P(x). Therefore exists x: ~P(x).