Translate the following inference to logic notation: For all x, x_20 is an office clerk. For all x, x_20 will read a book or x_20 will not make tea. There is at least one x for which if x_20 reads a book, then x_20 is working. For all x, x_20 will play a game if and only if x_20 will read a book. For all x, x_20 will make tea or x_20 will play a game. Therefore there is at least one x for which x_20 is an office clerk and x_20 will work.
forall x: P(x). forall x: Q(x) or ~R(x). exists x: Q(x) -> S(x). forall x: T(x) <-> Q(x). forall x: R(x) or T(x). Therefore exists x: P(x) and S(x).