Translate the following inference to logic notation: For all x, if x_14 sleeps, then x_14 is making tea. If James drives a car, then Joseph is sleeping. For all x, x_14 is not a politician. For all x, if x_14 makes tea, then x_14 is sleeping. For all x, x_14 will make tea if and only if x_14 is a politician. Therefore James is not driving a car.
forall x: P(x) -> Q(x). p -> P(a). forall x: ~R(x). forall x: Q(x) -> P(x). forall x: Q(x) <-> R(x). Therefore ~p.