Translate the following inference to logic notation: There is at least one x for which if x_8 goes running, then x_8 is sleeping. For all x, if x_8 were a janitor, then x_8 is sleeping. For all x, x_8 will drive a car. For all x, x_8 is a janitor or x_8 will not drive a car. Therefore there is at least one x for which x_8 will sleep.
exists x: P(x) -> Q(x). forall x: R(x) -> Q(x). forall x: S(x). forall x: R(x) or ~S(x). Therefore exists x: Q(x).