Translate the following inference to logic notation: Joseph is driving a car. Linda is not running. For all x, if y works, then y is running. For all x, if y goes running, then y is working. Therefore Linda is not working and Joseph is driving a car.
p. ~P(a). forall x: Q(x) -> P(x). forall x: P(x) -> Q(x). Therefore ~Q(a) and p.