Translate the following inference to logic notation: There is at least one x for which x_2 will play squash. For all x, x_2 will not make tea. For all x, x_2 will make tea or x_2 will sleep. Therefore there is at least one x for which x_2 will sleep and x_2 will play squash.
exists x: P(x). forall x: ~Q(x). forall x: Q(x) or R(x). Therefore exists x: R(x) and P(x).