Satisfiability (SAT) is a fundamental problem in computer science and mathematical logic. It involves determining whether there exists an assignment of truth values (true or false) to variables in a logical formula that makes the entire formula true. SAT problems are often expressed in propositional logic, where the formula consists of variables combined using logical operators like AND, OR, and NOT. The significance of SAT lies in its applications across various fields, including artificial intelligence, verification of software, and combinatorial optimization. The Boolean satisfiability problem is the first problem that was proven to be NP-complete, which means that it is as hard as the hardest problems in the class of NP problems.