Translate the following inference to logic notation: For all x, if x_1 takes a plane, then x_1 is a server. For all x, if x_1 were a server, then x_1 is drinking water. There is at least one x for which if x_1 drinks water, then x_1 is taking a plane. Therefore there is at least one x for which if x_1 drinks water, then x_1 is a server.
forall x: P(x) -> Q(x). forall x: Q(x) -> R(x). exists x: R(x) -> P(x). Therefore exists x: R(x) -> Q(x).