Translate the following inference to logic notation: For all x, if y_2 cooks, then y_2 is a server. For all x, y_2 is a server or y_2 is a bartender. For all x, if y_2 were a server, then y_2 is cooking. There is at least one x for which y_2 will not read a book. For all x, if y_2 cooks, then y_2 is reading a book. Therefore there is at least one x for which y_2 is a bartender.
forall x: P(x) -> Q(x). forall x: Q(x) or R(x). forall x: Q(x) -> P(x). exists x: ~S(x). forall x: P(x) -> S(x). Therefore exists x: R(x).