Translate the following inference to logic notation: There is at least one x for which if x_3 were fast, then x_3 is drinking water. For all x, if x_3 drinks water, then x_3 is fast. For all x, if x_3 plays a game, then x_3 is drinking water. For all x, if x_3 drinks water, then x_3 is playing a game. Therefore there is at least one x for which if x_3 plays a game, then x_3 is fast.
exists x: P(x) -> Q(x). forall x: Q(x) -> P(x). forall x: R(x) -> Q(x). forall x: Q(x) -> R(x). Therefore exists x: R(x) -> P(x).