Translate the following inference to logic notation: For all x, if x_2 goes running, then x_2 is bored. For all x, x_2 will go running if and only if x_2 will drink water. For all x, if x_2 were bored, then x_2 is drinking water. Therefore for all x, if x_2 goes running, then x_2 is drinking water.
forall x: P(x) -> Q(x). forall x: P(x) <-> R(x). forall x: Q(x) -> R(x). Therefore forall x: P(x) -> R(x).