Translate the following inference to logic notation: For all x, if x_6 plays tennis, then x_6 is listening to a song. For all x, if x_6 were curious, then x_6 is playing tennis. There is at least one x for which x_6 is a poet or x_6 will not listen to a song. Therefore there is at least one x for which if x_6 were curious, then x_6 is a poet.
forall x: P(x) -> Q(x). forall x: R(x) -> P(x). exists x: S(x) or ~Q(x). Therefore exists x: R(x) -> S(x).