Translate the following inference to logic notation: For all x, if x_1 takes a plane, then x_1 is a server. There is at least one x for which if x_1 sleeps, then x_1 is playing tennis. For all x, if x_1 were a server, then x_1 is playing tennis. For all x, x_1 will sleep or x_1 will take a plane. Therefore there is at least one x for which x_1 will play tennis.
forall x: P(x) -> Q(x). exists x: R(x) -> S(x). forall x: Q(x) -> S(x). forall x: R(x) or P(x). Therefore exists x: S(x).