Translate the following inference to logic notation: For all x, x_11 will read a book and x_11 will go running. For all x, if x_11 were happy, then x_11 is reading a book. For all x, x_11 is not happy. For all x, if x_11 reads a book, then x_11 is happy. Therefore for all x, x_11 will play squash.
forall x: P(x) and Q(x). forall x: R(x) -> P(x). forall x: ~R(x). forall x: P(x) -> R(x). Therefore forall x: S(x).