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