Translate the following inference to logic notation: There is at least one x for which x_11 will not take a plane. For all x, x_11 will go running or x_11 will not take a plane. For all x, x_11 will climb a mountain if and only if x_11 will go running. For all x, if x_11 goes running, then x_11 is taking a plane. Therefore there is at least one x for which x_11 will not climb a mountain.
exists x: ~P(x). forall x: Q(x) or ~P(x). forall x: R(x) <-> Q(x). forall x: Q(x) -> P(x). Therefore exists x: ~R(x).