Translate the following inference to logic notation: For all x, if x_1 drives a car, then x_1 is a mechanic. For all x, x_1 will drive a car. Therefore for all x, x_1 is a mechanic or x_1 is a server.
forall x: P(x) -> Q(x). forall x: P(x). Therefore forall x: Q(x) or R(x).