Translate the following inference to logic notation: For all x, if x_14 were a carpenter, then x_14 is a cashier. There is at least one x for which x_14 is a cashier if and only if x_14 is bored. For all x, if x_14 were a cashier, then x_14 is driving a car. For all x, x_14 is a carpenter or x_14 is bored. Therefore there is at least one x for which x_14 will drive a car.
forall x: P(x) -> Q(x). exists x: Q(x) <-> R(x). forall x: Q(x) -> S(x). forall x: P(x) or R(x). Therefore exists x: S(x).