Translate the following inference to logic notation: For all x, x_5 will go running or x_5 will play tennis. There is at least one x for which if x_5 goes running, then x_5 is drinking water. For all x, if x_5 plays tennis, then x_5 is a janitor. For all x, if x_5 drinks water, then x_5 is a scientist. For all x, if x_5 were a janitor, then x_5 is a scientist. Therefore there is at least one x for which x_5 is a scientist.
forall x: P(x) or Q(x). exists x: P(x) -> R(x). forall x: Q(x) -> S(x). forall x: R(x) -> T(x). forall x: S(x) -> T(x). Therefore exists x: T(x).