Translate the following inference to logic notation: For all x, x_10 will not play tennis. For all x, x_10 will not drink water or x_10 is sad. There is at least one x for which x_10 will drink water or x_10 is happy. For all x, x_10 will play tennis or x_10 is not happy. Therefore there is at least one x for which x_10 is sad.
forall x: ~P(x). forall x: ~Q(x) or R(x). exists x: Q(x) or S(x). forall x: P(x) or ~S(x). Therefore exists x: R(x).