Translate the following inference to logic notation: There is at least one x for which x_5 is a soldier or x_5 will make tea. For all x, if x_5 were a soldier, then x_5 is excited. For all x, if x_5 goes running, then x_5 is playing squash. For all x, if x_5 were excited, then x_5 is playing squash. For all x, if x_5 makes tea, then x_5 is running. Therefore there is at least one x for which x_5 will play squash.
exists x: P(x) or Q(x). forall x: P(x) -> R(x). forall x: S(x) -> T(x). forall x: R(x) -> T(x). forall x: Q(x) -> S(x). Therefore exists x: T(x).