Translate the following inference to logic notation: There is at least one x for which if x_17 were a server, then x_17 is writing a letter. For all x, x_17 is a doctor if and only if x_17 will go running. For all x, x_17 will read a book if and only if x_17 is a doctor. For all x, x_17 will not write a letter. For all x, x_17 will go running if and only if x_17 is a server. Therefore there is at least one x for which x_17 will not read a book.
exists x: P(x) -> Q(x). forall x: R(x) <-> S(x). forall x: T(x) <-> R(x). forall x: ~Q(x). forall x: S(x) <-> P(x). Therefore exists x: ~T(x).