Translate the following inference to logic notation: For all x, if x_3 listens to a song, then x_3 is making tea. For all x, x_3 will listen to a song. There is at least one x for which x_3 will cook. Therefore there is at least one x for which x_3 will cook.
forall x: P(x) -> Q(x). forall x: P(x). exists x: R(x). Therefore exists x: R(x).