Translate the following inference to logic notation: For all x, x_13 is an office clerk or x_13 will play squash. For all x, if x_13 were an office clerk, then x_13 is a taxi driver. For all x, if x_13 plays squash, then x_13 is a taxi driver. For all x, if x_13 were excited, then x_13 is fast. There is at least one x for which x_13 is excited. Therefore there is at least one x for which x_13 is fast and x_13 is a taxi driver.
forall x: P(x) or Q(x). forall x: P(x) -> R(x). forall x: Q(x) -> R(x). forall x: S(x) -> T(x). exists x: S(x). Therefore exists x: T(x) and R(x).