Translate the following inference to logic notation: For all x, x_5 will not drive a car. For all x, if x_5 were sad, then x_5 is driving a car. For all x, x_5 is sad or x_5 is a carpenter. Therefore for all x, x_5 is a carpenter or x_5 will work.
forall x: ~P(x). forall x: Q(x) -> P(x). forall x: Q(x) or R(x). Therefore forall x: R(x) or S(x).