Translate the following inference to logic notation: For all x, x_9 is a soldier. For all x, if x_9 drives a car, then x_9 is bored. For all x, x_9 is bored if and only if x_9 will take a plane. For all x, x_9 will take a plane or x_9 will drive a car. For all x, if x_9 were a soldier, then x_9 is sleeping. Therefore for all x, x_9 will sleep and x_9 is bored.
forall x: P(x). forall x: Q(x) -> R(x). forall x: R(x) <-> S(x). forall x: S(x) or Q(x). forall x: P(x) -> T(x). Therefore forall x: T(x) and R(x).