Translate the following inference to logic notation: For all x, y_3 will work or y_3 will read a book. For all x, if y_3 cooks, then y_3 is rich. For all x, if y_3 works, then y_3 is cooking. For all x, if y_3 reads a book, then y_3 is cooking. Therefore John is rich.
forall x: P(x) or Q(x). forall x: R(x) -> S(x). forall x: P(x) -> R(x). forall x: Q(x) -> R(x). Therefore S(a).