SAT is the problem of determining whether there exists an assignment of truth values to variables in a Boolean formula that satisfies the formula. The formula is typically given in conjunctive normal form (CNF), which consists of a conjunction of clauses where each clause is a disjunction of literals (variables or their negations).