Translate the following inference to logic notation: There is at least one x for which x will drive a car. For all x, x is a lawyer. For all x, if x drives a car, then x is playing a game. For all x, if x plays a game, then x is a mechanic. Therefore some lawyers are mechanics.
exists x: P(x). forall x: Q(x). forall x: P(x) -> R(x). forall x: R(x) -> S(x). Therefore exists x: Q(x) and S(x).