Translate the following inference to logic notation: For all x, if x_12 drinks water, then x_12 is a server. For all x, x_12 will drink water or x_12 is not a server. There is at least one x for which x_12 will drive a car if and only if x_12 is a server. Therefore there is at least one x for which if x_12 drinks water, then x_12 is driving a car.
forall x: P(x) -> Q(x). forall x: P(x) or ~Q(x). exists x: R(x) <-> Q(x). Therefore exists x: P(x) -> R(x).