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