Translate the following inference to logic notation: For all x, x_10 is a janitor or x_10 is a server. For all x, x_10 is an office clerk or x_10 is not a server. For all x, if x_10 were an office clerk, then x_10 is playing tennis. There is at least one x for which if x_10 were a janitor, then x_10 is taking a plane. For all x, if x_10 plays tennis, then x_10 is taking a plane. Therefore there is at least one x for which x_10 will take a plane.
forall x: P(x) or Q(x). forall x: R(x) or ~Q(x). forall x: R(x) -> S(x). exists x: P(x) -> T(x). forall x: S(x) -> T(x). Therefore exists x: T(x).