Translate the following inference to logic notation: For all x, if x_9 makes tea, then x_9 is drinking water. For all x, if x_9 were a soldier, then x_9 is making tea. There is at least one x for which if x_9 were a politician, then x_9 is a soldier. For all x, if x_9 drinks water, then x_9 is a politician. Therefore there is at least one x for which if x_9 makes tea, then x_9 is drinking water.
forall x: P(x) -> Q(x). forall x: R(x) -> P(x). exists x: S(x) -> R(x). forall x: Q(x) -> S(x). Therefore exists x: P(x) -> Q(x).