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