Translate the following inference to logic notation: For all x, x_9 will write a letter. For all x, x_9 is not a server. For all x, x_9 is a server or x_9 will read a book. For all x, if x_9 writes a letter, then x_9 is a carpenter. Therefore Patricia is a carpenter.
forall x: P(x). forall x: ~Q(x). forall x: Q(x) or R(x). forall x: P(x) -> S(x). Therefore S(a).