Translate the following inference to logic notation: For all x, if x_6 cooks, then x_6 is a soldier. For all x, x_6 will cook or x_6 will not drink water. There is at least one x for which x_6 is not a soldier. 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). exists x: ~Q(x). Therefore exists x: ~R(x).