Translate the following inference to logic notation: There is at least one x for which if x_7 were happy, then x_7 is taking a plane. For all x, if x_7 takes a plane, then x_7 is driving a car. For all x, x_7 will not drive a car. For all x, if x_7 were a lawyer, then x_7 is happy. Therefore there is at least one x for which x_7 is not a lawyer.
exists x: P(x) -> Q(x). forall x: Q(x) -> R(x). forall x: ~R(x). forall x: S(x) -> P(x). Therefore exists x: ~S(x).