Translate the following inference to logic notation: For all x, x_15 is not an electrician. For all x, x_15 is an electrician if and only if x_15 is a bartender. For all x, x_15 will drive a car or x_15 is a bartender. There is at least one x for which x_15 will not drive a car or x_15 will read a book. For all x, if x_15 were a janitor, then x_15 is not reading a book. Therefore there is at least one x for which x_15 is not a janitor.
forall x: ~P(x). forall x: P(x) <-> Q(x). forall x: R(x) or Q(x). exists x: ~R(x) or S(x). forall x: T(x) -> ~S(x). Therefore exists x: ~T(x).