Translate the following inference to logic notation: For all x, z_1 is bored or z_1 is not a scientist. For all x, z_1 is a scientist or z_1 will cook. For all x, if z_1 cooks, then z_1 is bored. Therefore for all x, z_1 is bored.
forall x: P(x) or ~Q(x). forall x: Q(x) or R(x). forall x: R(x) -> P(x). Therefore forall x: P(x).