abstract:Nowadays Boolean Satisfiability (SAT) solvers are much more effective in practical applications include AI planning, Bioinformatics, Software test pattern generation, Software package dependencies, Hardware and Software model checking, and cryptography. The Boolean Satisfiability problem (SAT) is one of the most studied NP-Complete problems because of its significance in both theoretical research and practical applications.