Translate the following inference to logic notation: Barbara is not sleeping. For all x, x_9 will make tea or x_9 is a cashier. For all x, x_9 is not a cashier or x_9 will go running. For all x, x_9 will not make tea. Therefore Barbara is running.
~P(a). forall x: Q(x) or R(x). forall x: ~R(x) or S(x). forall x: ~Q(x). Therefore S(a).