Translate the following inference to logic notation: For all x, x_10 is not a janitor or x_10 will climb a mountain. For all x, x_10 will cook if and only if x_10 will climb a mountain. For all x, x_10 is a writer if and only if x_10 will cook. There is at least one x for which x_10 is a janitor or x_10 is a writer. Therefore there is at least one x for which x_10 will cook.
forall x: ~P(x) or Q(x). forall x: R(x) <-> Q(x). forall x: S(x) <-> R(x). exists x: P(x) or S(x). Therefore exists x: R(x).