Translate the following inference to logic notation: For all x, z will not write a letter. For all x, if z were poor, then z is making tea. For all x, if z writes a letter, then z is poor. For all x, if z makes tea, then z is writing a letter. Therefore for all x, z will not make tea.
forall x: ~P(x). forall x: Q(x) -> R(x). forall x: P(x) -> Q(x). forall x: R(x) -> P(x). Therefore forall x: ~R(x).