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