Translate the following inference to logic notation: There is at least one x for which if x_10 works, then x_10 is driving a car. For all x, if x_10 writes a letter, then x_10 is playing squash. For all x, if x_10 plays squash, then x_10 is driving a car. For all x, x_10 will write a letter or x_10 will work. Therefore there is at least one x for which x_10 will drive a car or x_10 is a scientist.
exists x: P(x) -> Q(x). forall x: R(x) -> S(x). forall x: S(x) -> Q(x). forall x: R(x) or P(x). Therefore exists x: Q(x) or T(x).