Translate the following inference to logic notation: For all x, x_9 is happy or x_9 will not play squash. For all x, if x_9 drives a car, then x_9 is happy. For all x, if x_9 were happy, then x_9 is driving a car. For all x, x_9 will play squash or x_9 will drive a car. Therefore for all x, x_9 is happy.
forall x: P(x) or ~Q(x). forall x: R(x) -> P(x). forall x: P(x) -> R(x). forall x: Q(x) or R(x). Therefore forall x: P(x).