Translate the following inference to logic notation: For all x, if x_5 makes tea, then x_5 is fast. For all x, if x_5 drives a car, then x_5 is making tea. For all x, if x_5 plays squash, then x_5 is fast. There is at least one x for which if x_5 were fast, then x_5 is cooking. For all x, x_5 will play squash or x_5 will drive a car. Therefore there is at least one x for which x_5 will cook.
forall x: P(x) -> Q(x). forall x: R(x) -> P(x). forall x: S(x) -> Q(x). exists x: Q(x) -> T(x). forall x: S(x) or R(x). Therefore exists x: T(x).