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