Translate the following inference to logic notation: For all x, if x were happy, then x is an office clerk. For all x, x will read a book. For all x, if x were happy, then x is not reading a book. For all x, if x were an office clerk, then x is happy. Therefore for all x, x is not an office clerk.
forall x: P(x) -> Q(x). forall x: R(x). forall x: P(x) -> ~R(x). forall x: Q(x) -> P(x). Therefore forall x: ~Q(x).