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