Translate the following inference to logic notation: There is at least one x for which if x_10 were happy, then x_10 is bored. For all x, if x_10 reads a book, then x_10 is bored. For all x, x_10 will read a book. For all x, x_10 will work. Therefore there is at least one x for which x_10 is bored and x_10 will work.
exists x: P(x) -> Q(x). forall x: R(x) -> Q(x). forall x: R(x). forall x: S(x). Therefore exists x: Q(x) and S(x).