Translate the following inference to logic notation: For all x, x_9 will not make tea or x_9 is rich. Robert is not listening to a song. For all x, x_9 will sleep or x_9 will make tea. For all x, x_9 will not sleep. Therefore Robert is rich.
forall x: ~P(x) or Q(x). ~R(a). forall x: S(x) or P(x). forall x: ~S(x). Therefore Q(a).