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