This invention provides a 3-SAT completeness
solver supporting CDCL non-temporally sequential
backtracking. The completeness
solver includes: a content-addressable memory-propagation unit (
CAM) for single-word matching using
CAM, performing word propagation and decision operations in a word watch loop, and generating a structured implication graph; an implication graph caching unit, connected at one end to the
CAM and at the other to an in-memory computation
learning unit, for storing the structural information of the structured implication graph; and an in-memory computation
learning unit for performing conflict-driven clause learning CDCL based on the structural information of the structured implication graph, thereby achieving completeness analysis with non-temporally sequential
backtracking. This invention enables completeness analysis of SAT problems using CDCL non-temporally sequential
backtracking, fully utilizing the inherent structural characteristics of SAT problems, and providing an efficient completeness solution for complex SAT problems in practical applications.