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