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