Translate the following inference to logic notation: For all x, y_3 is an office clerk. For all x, if y_3 drinks water, then y_3 is not working. There is at least one x for which y_3 will work or y_3 is not an office clerk. Therefore there is at least one x for which y_3 will not drink water.
forall x: P(x). forall x: Q(x) -> ~R(x). exists x: R(x) or ~P(x). Therefore exists x: ~Q(x).