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