Translate the following inference to logic notation: There is at least one x for which x_5 will play tennis. For all x, if x_5 were happy, then x_5 is sleeping. For all x, if x_5 goes running, then x_5 is sleeping. For all x, x_5 is a musician or x_5 is happy. For all x, if x_5 were a musician, then x_5 is running. Therefore there is at least one x for which x_5 will sleep and x_5 will play tennis.
exists x: P(x). forall x: Q(x) -> R(x). forall x: S(x) -> R(x). forall x: T(x) or Q(x). forall x: T(x) -> S(x). Therefore exists x: R(x) and P(x).