Definition A formula is said to be inconsistent (or unsatisfiable) if and only if it is false under all its interpretations. A formula is said to be consistent (or satisfiable) if and only if it is not inconsistent.
ref: Symbolic Logic and Mechanical Theorem Proving (Computer Science and Applied Mathematics) 1st Edition,
by Chin-Liang Chang, Richard Char-Tung Lee, p. 11