Translate the following inference to logic notation: For all x, z_3 is a poet or x_11 is not excited. For all x, z_3 is a poet if and only if x_11 will play tennis. For all x, x_11 will play tennis or x_11 is excited. Therefore there is at least one x for which z_3 is a poet.
forall x: P(x) or ~Q(x). forall x: P(x) <-> R(x). forall x: R(x) or Q(x). Therefore exists x: P(x).