Fig. REF b shows the run times to solve the UBC SATLIB [1]} instances using different professional SAT solvers and the sIM. We solve each instance 100 times to obtain enough statistics. We compare our results with award-winning solvers from the SAT 2020 competition, namely Kissat, Plingeling, and Cryptominisat [2]}, [3]}. These conflict-driven clause learning (CDCL) solvers attempt to find the exact solution that satisfies all of the clauses. All these solvers are executed on the same Linux machine having a flagship Intel Core i9-10900 Processor running at up to 5.20 GHz. Time to solve all the clauses (100% solution) is reported as \(\rm Kissat_{100}\) , \(\rm Plingeling_{100}\) , and, \(\rm Crypto_{100}\)  respectively. We have used linear simulated annealing in the sIM to report the time to solve all the clauses, labeled as \(\rm sIM_{100}\)  in Fig. REF .
