Translate the following inference to logic notation: There is at least one x for which if x_8 were a bartender, then x_8 is taking a plane. For all x, x_8 is a doctor. For all x, if x_8 takes a plane, then x_8 is not a doctor. For all x, if x_8 takes a plane, then x_8 is reading a book. For all x, if x_8 reads a book, then x_8 is a bartender. Therefore there is at least one x for which x_8 will not read a book.
exists x: P(x) -> Q(x). forall x: R(x). forall x: Q(x) -> ~R(x). forall x: Q(x) -> S(x). forall x: S(x) -> P(x). Therefore exists x: ~S(x).