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