Translate the following inference to logic notation: For all x, z_1 will not drive a car. For all x, z_1 is a soldier or z_1 is bored. For all x, z_1 will drive a car if and only if z_1 is a soldier. Therefore for all x, z_1 is bored.
forall x: ~P(x). forall x: Q(x) or R(x). forall x: P(x) <-> Q(x). Therefore forall x: R(x).