Translate the following inference to logic notation: For all x, x_5 will play squash or x_5 is not a poet. For all x, x_5 is a poet. There is at least one x for which if x_5 writes a letter, then x_5 is playing squash. Therefore there is at least one x for which x_5 will play squash.
forall x: P(x) or ~Q(x). forall x: Q(x). exists x: R(x) -> P(x). Therefore exists x: P(x).