Translate the following inference to logic notation: For all x, x_4 is not curious or x_4 will play squash. For all x, if x_4 were happy, then x_4 is drinking water. There is at least one x for which if x_4 were a musician, then x_4 is drinking water. For all x, if x_4 plays squash, then x_4 is a musician. For all x, x_4 is curious or x_4 is happy. Therefore there is at least one x for which x_4 will drink water.
forall x: ~P(x) or Q(x). forall x: R(x) -> S(x). exists x: T(x) -> S(x). forall x: Q(x) -> T(x). forall x: P(x) or R(x). Therefore exists x: S(x).