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