Translate the following inference to logic notation: For all x, x_9 will not sleep. For all x, x_9 will write a letter. For all x, x_9 is a bartender or x_9 will play squash. For all x, x_9 will not play squash or x_9 will drive a car. For all x, x_9 is not a bartender or x_9 will sleep. Therefore for all x, x_9 will drive a car.
forall x: ~P(x). forall x: Q(x). forall x: R(x) or S(x). forall x: ~S(x) or T(x). forall x: ~R(x) or P(x). Therefore forall x: T(x).