Translate the following inference to logic notation: For all x, if x_8 were an electrician, then x_8 is making tea. There is at least one x for which x_8 will not make tea or x_8 will listen to a song. For all x, x_8 will make tea or x_8 is not rich. For all x, x_8 is rich or x_8 is an electrician. Therefore there is at least one x for which x_8 will play a game or x_8 will listen to a song.
forall x: P(x) -> Q(x). exists x: ~Q(x) or R(x). forall x: Q(x) or ~S(x). forall x: S(x) or P(x). Therefore exists x: T(x) or R(x).