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