Translate the following inference to logic notation: For all x, x_6 is a taxi driver. For all x, x_6 will not work. For all x, x_6 will work or x_6 will play squash. For all x, if x_6 were a taxi driver, then x_6 is taking a plane. Therefore for all x, x_6 will play squash.
forall x: P(x). forall x: ~Q(x). forall x: Q(x) or R(x). forall x: P(x) -> S(x). Therefore forall x: R(x).