Translate the following inference to logic notation: There is at least one x for which if x_11 were a bartender, then x_11 is running. For all x, if x_11 were a taxi driver, then x_11 is an electrician. For all x, x_11 is a sailor or x_11 is not an electrician. For all x, if x_11 goes running, then x_11 is a taxi driver. Therefore there is at least one x for which if x_11 were a bartender, then x_11 is a sailor.
exists x: P(x) -> Q(x). forall x: R(x) -> S(x). forall x: T(x) or ~S(x). forall x: Q(x) -> R(x). Therefore exists x: P(x) -> T(x).