Translate the following inference to logic notation: There is at least one x for which x_18 is not poor. For all x, if x_18 writes a letter, then x_18 is climbing a mountain. For all x, if x_18 climbs a mountain, then x_18 is writing a letter. For all x, x_18 will cook or x_18 will write a letter. For all x, if x_18 cooks, then x_18 is climbing a mountain. For all x, x_18 is poor or x_18 is a janitor. Therefore there is at least one x for which x_18 will climb a mountain and x_18 is a janitor.
exists x: ~P(x). forall x: Q(x) -> R(x). forall x: R(x) -> Q(x). forall x: S(x) or Q(x). forall x: S(x) -> R(x). forall x: P(x) or T(x). Therefore exists x: R(x) and T(x).