Translate the following inference to logic notation: For all x, if x_9 plays a game, then x_9 is sad. For all x, if x_9 were sad, then x_9 is playing a game. For all x, x_9 will drink water or x_9 will play a game. For all x, if x_9 drinks water, then x_9 is sad. Therefore for all x, x_9 is sad or x_9 is a mechanic.
forall x: P(x) -> Q(x). forall x: Q(x) -> P(x). forall x: R(x) or P(x). forall x: R(x) -> Q(x). Therefore forall x: Q(x) or S(x).