Translate the following inference to logic notation: For all x, if z_1 plays squash, then z_1 is an office clerk. There is at least one x for which if z_1 takes a plane, then z_1 is playing squash. For all x, if z_1 sleeps, then z_1 is a politician. For all x, if z_1 were a politician, then z_1 is taking a plane. Therefore there is at least one x for which if z_1 sleeps, then z_1 is an office clerk.
forall x: P(x) -> Q(x). exists x: R(x) -> P(x). forall x: S(x) -> T(x). forall x: T(x) -> R(x). Therefore exists x: S(x) -> Q(x).