Translate the following inference to logic notation: For all x, if x_14 drives a car, then x_14 is a musician. For all x, if x_14 were a bartender, then x_14 is running. There is at least one x for which x_14 is a musician if and only if x_14 is a bartender. For all x, if x_14 were a musician, then x_14 is driving a car. Therefore there is at least one x for which if x_14 drives a car, then x_14 is running.
forall x: P(x) -> Q(x). forall x: R(x) -> S(x). exists x: Q(x) <-> R(x). forall x: Q(x) -> P(x). Therefore exists x: P(x) -> S(x).