Translate the following inference to logic notation: For all x, if x_14 makes tea, then x_14 is playing tennis. If Barbara climbs a mountain, then Sarah is not playing tennis. For all x, if x_14 goes running, then x_14 is playing tennis. For all x, x_14 will make tea. Therefore Barbara is not climbing a mountain.
forall x: P(x) -> Q(x). p -> ~Q(a). forall x: R(x) -> Q(x). forall x: P(x). Therefore ~p.