Translate the following inference to logic notation: For all x, if x_14 drinks water, then x_14 is sleeping. There is at least one x for which x_14 will drive a car if and only if x_14 will sleep. For all x, if x_14 sleeps, then x_14 is drinking water. For all x, if x_14 makes tea, then x_14 is driving a car. For all x, if x_14 drives a car, then x_14 is making tea. For all x, x_14 will not drink water. Therefore there is at least one x for which x_14 will not make tea.
forall x: P(x) -> Q(x). exists x: R(x) <-> Q(x). forall x: Q(x) -> P(x). forall x: S(x) -> R(x). forall x: R(x) -> S(x). forall x: ~P(x). Therefore exists x: ~S(x).