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