Translate the following inference to logic notation: For all x, x_5 will make tea. For all x, x_5 is not poor. For all x, x_5 is poor or x_5 will go running. Therefore Linda is running.
forall x: P(x). forall x: ~Q(x). forall x: Q(x) or R(x). Therefore R(a).