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