Translate the following inference to logic notation: For all x, if x_10 were curious, then x_10 is a carpenter. For all x, x_10 is curious or x_10 will sleep. For all x, if x_10 were a carpenter, then x_10 is running. There is at least one x for which if x_10 sleeps, then x_10 is running. Therefore there is at least one x for which x_10 will go running or x_10 will work.
forall x: P(x) -> Q(x). forall x: P(x) or R(x). forall x: Q(x) -> S(x). exists x: R(x) -> S(x). Therefore exists x: S(x) or T(x).