Translate the following inference to logic notation: For all x, x_13 will make tea or x_13 will read a book. For all x, if x_13 reads a book, then x_13 is sleeping. For all x, if x_13 makes tea, then x_13 is sleeping. There is at least one x for which x_13 will play tennis or x_13 will play squash. For all x, x_13 will not play tennis. Therefore there is at least one x for which x_13 will sleep and x_13 will play squash.
forall x: P(x) or Q(x). forall x: Q(x) -> R(x). forall x: P(x) -> R(x). exists x: S(x) or T(x). forall x: ~S(x). Therefore exists x: R(x) and T(x).