Translate the following inference to logic notation: For all x, if y were a sailor, then y is an astronaut. There is at least one x for which if y plays tennis, then y is making tea. For all x, y is a sailor or y will not listen to a song. For all x, if y were an astronaut, then y is playing tennis. Therefore there is at least one x for which if y listens to a song, then y is making tea.
forall x: P(x) -> Q(x). exists x: R(x) -> S(x). forall x: P(x) or ~T(x). forall x: Q(x) -> R(x). Therefore exists x: T(x) -> S(x).