The satisfiability problem (SAT) is a well-known computational problem in computer science that involves determining whether a given Boolean formula can be satisfied by assigning truth values to its variables. Adiabatic quantum optimization, on the other hand, is a promising approach to solving optimization problems using quantum computers. In this field, the goal is to