Translate the following inference to logic notation: For all x, if x_10 writes a letter, then x_10 is making tea. For all x, x_10 will write a letter. For all x, x_10 will listen to a song or x_10 is a server. There is at least one x for which x_10 will not listen to a song. Therefore there is at least one x for which x_10 is a server and x_10 will make tea.
forall x: P(x) -> Q(x). forall x: P(x). forall x: R(x) or S(x). exists x: ~R(x). Therefore exists x: S(x) and Q(x).