Translate the following inference to logic notation: For all x, if x_4 were a carpenter, then x_4 is playing squash. There is at least one x for which x_4 will not drive a car or x_4 will play tennis. For all x, x_4 will drive a car or x_4 is a taxi driver. For all x, x_4 is not a taxi driver or x_4 is a carpenter. For all x, if x_4 plays tennis, then x_4 is playing squash. Therefore there is at least one x for which x_4 will play squash.
forall x: P(x) -> Q(x). exists x: ~R(x) or S(x). forall x: R(x) or T(x). forall x: ~T(x) or P(x). forall x: S(x) -> Q(x). Therefore exists x: Q(x).