Translate the following inference to logic notation: For all x, if x_12 were fast, then x_12 is a doctor. For all x, if x_12 goes running, then x_12 is a doctor. There is at least one x for which x_12 is fast or x_12 will go running. For all x, x_12 is not a doctor or x_12 is bored. Therefore there is at least one x for which x_12 is curious or x_12 is bored.
forall x: P(x) -> Q(x). forall x: R(x) -> Q(x). exists x: P(x) or R(x). forall x: ~Q(x) or S(x). Therefore exists x: T(x) or S(x).