Translate the following inference to logic notation: For all x, if x works, then x is reading a book. For all x, if x plays a game, then x is working. For all x, x will not work. For all x, if x reads a book, then x is playing a game. Therefore for all x, x will not read a book.
forall x: P(x) -> Q(x). forall x: R(x) -> P(x). forall x: ~P(x). forall x: Q(x) -> R(x). Therefore forall x: ~Q(x).