Translate the following inference to logic notation: For all x, if x_3 sleeps, then x_3 is listening to a song. For all x, if x_3 works, then x_3 is listening to a song. For all x, if x_3 plays a game, then x_3 is working. For all x, x_3 will not make tea or x_3 will sleep. For all x, x_3 will make tea or x_3 will play a game. Therefore for all x, x_3 will listen to a song.
forall x: P(x) -> Q(x). forall x: R(x) -> Q(x). forall x: S(x) -> R(x). forall x: ~T(x) or P(x). forall x: T(x) or S(x). Therefore forall x: Q(x).