Translate the following inference to logic notation: There is at least one x for which x_6 will take a plane. For all x, if x_6 takes a plane, then x_6 is poor. For all x, x_6 is not poor or x_6 will sleep. Therefore there is at least one x for which x_6 will play squash or x_6 will sleep.
exists x: P(x). forall x: P(x) -> Q(x). forall x: ~Q(x) or R(x). Therefore exists x: S(x) or R(x).