Translate the following inference to logic notation: For all x, if x_5 goes running, then x_5 is curious. There is at least one x for which x_5 will play tennis or x_5 will sleep. For all x, if x_5 plays tennis, then x_5 is running. For all x, x_5 is not curious. Therefore there is at least one x for which x_5 will sleep.
forall x: P(x) -> Q(x). exists x: R(x) or S(x). forall x: R(x) -> P(x). forall x: ~Q(x). Therefore exists x: S(x).