Translate the following inference to logic notation: For all x, if x_12 plays squash, then x_12 is a lawyer. There is at least one x for which if x_12 were a cashier, then x_12 is a lawyer. For all x, if x_12 were excited, then x_12 is running. For all x, x_12 will play squash or x_12 is a cashier. For all x, x_12 is excited. Therefore there is at least one x for which x_12 will go running and x_12 is a lawyer.
forall x: P(x) -> Q(x). exists x: R(x) -> Q(x). forall x: S(x) -> T(x). forall x: P(x) or R(x). forall x: S(x). Therefore exists x: T(x) and Q(x).