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