Translate the following inference to logic notation: For all x, if x_11 were a carpenter, then x_11 is not a cashier. For all x, if x_11 sleeps, then x_11 is driving a car. For all x, x_11 is a cashier. For all x, x_11 is a carpenter if and only if x_11 is curious. For all x, x_11 is curious if and only if x_11 will drive a car. For all x, if x_11 drives a car, then x_11 is sleeping. Therefore for all x, x_11 will not sleep.
forall x: P(x) -> ~Q(x). forall x: R(x) -> S(x). forall x: Q(x). forall x: P(x) <-> T(x). forall x: T(x) <-> S(x). forall x: S(x) -> R(x). Therefore forall x: ~R(x).