Translate the following inference to logic notation: There is at least one x for which if x_2 takes a plane, then x_2 is playing squash. For all x, x_2 will work or x_2 is not a musician. For all x, if x_2 drives a car, then x_2 is playing squash. For all x, x_2 will take a plane or x_2 is a musician. For all x, if x_2 works, then x_2 is driving a car. Therefore there is at least one x for which x_2 will play squash.
exists x: P(x) -> Q(x). forall x: R(x) or ~S(x). forall x: T(x) -> Q(x). forall x: P(x) or S(x). forall x: R(x) -> T(x). Therefore exists x: Q(x).