Recently,local search method has been successfully applied to solve large scale SAT problem,but it will fail to find solution when an original SAT problem instance is unsatisfiable.MSRA(multi-stage search rearrangement algorithm)is just proposed to overcome the incompleteness of local search method.Properly speaking,MSRA is based on the'separate and conquer"strategy and is the integration of several algorithms While solving the SAT problem,MSRA is more efficient than a single method,such as local search and backtracking method.Since the satisfiability of a SAT problem instance can be estimated by the strength of constrained conditions,the authors could find a more efficient strategy to solve the instance.