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