Translate the following inference to logic notation: For all x, if x_10 sleeps, then x_5 is running. For all x, if x_5 goes running, then x_5 is curious. For all x, if x_10 were a lawyer, then x_5 is running. For all x, x_10 will sleep or x_10 is a lawyer. Therefore Jennifer is curious.
forall x: P(x) -> Q(x). forall x: Q(x) -> R(x). forall x: S(x) -> Q(x). forall x: P(x) or S(x). Therefore R(a).