Why is this expression (A and ¬A |= C) entailed?

Hopefully I am posting this in the right place, I am currently in a course of knowledge representation, and I came across an exercise about entailment:
$$A\land\neg A\vDash C\,.$$

I would argue that this expression is not entail, but it is actually entailed, but I don't see how, can you help me figure out why?

The statement $X\vDash Y$ means "every assignment to the variables that makes $X$ true also makes $Y$ true." Or to put it another way, "There is no assignment of variables that makes $X$ true but fails to make $Y$ true." Well, there's no assignment of variables that makes $A\land\neg A$ true, so there's certianly no assignment that makes $A\land\neg A$ true and also makes $C$ false. So $A\land\neg A\vDash C$ is a true statement.

False entails anything is a rule, analogous to false implies anything.

StackExchange Computer Science Q#90749, answer score: 10