Translate the following inference to logic notation: For all x, x_9 will not write a letter. For all x, x_9 will write a letter or x_9 is a bartender. Thomas is not a server. For all x, x_9 is not a bartender or x_9 will go running. Therefore Thomas is running.
forall x: ~P(x). forall x: P(x) or Q(x). ~R(a). forall x: ~Q(x) or S(x). Therefore S(a).