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