Translate the following inference to logic notation: For all x, if x_9 reads a book, then x_9 is not cooking. For all x, x_9 will read a book or x_9 will play tennis. For all x, x_9 will cook. For all x, x_9 will work. Therefore Thomas is working.
forall x: P(x) -> ~Q(x). forall x: P(x) or R(x). forall x: Q(x). forall x: S(x). Therefore S(a).