Translate the following inference to logic notation: There is at least one x for which x_18 is a writer or x_18 is a bartender. For all x, if x_18 were a writer, then x_18 is a server. For all x, if x_18 were a bartender, then x_18 is a police officer. For all x, x_18 will read a book. For all x, x_18 is a police officer if and only if x_18 is a server. Therefore there is at least one x for which x_18 will read a book.
exists x: P(x) or Q(x). forall x: P(x) -> R(x). forall x: Q(x) -> S(x). forall x: T(x). forall x: S(x) <-> R(x). Therefore exists x: T(x).