Translate the following inference to logic notation: For all x, x_3 is an office clerk. There is at least one x for which x_3 will not write a letter or x_3 is rich. For all x, if x_3 were an office clerk, then x_3 is writing a letter. Therefore there is at least one x for which x_3 is poor or x_3 is rich.
forall x: P(x). exists x: ~Q(x) or R(x). forall x: P(x) -> Q(x). Therefore exists x: S(x) or R(x).