# Predicting Lemmas in Generalization of IC3

arXiv: https://arxiv.org/abs/2411.12749 · HTML: https://mlsanity.com/paper/2411.12749/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 4 Nov 2024.

## Built on by (most cited first, 2 of 2)

- [Deeply Optimizing the SAT Solver for the IC3 Algorithm](https://mlsanity.com/paper/2501.18612/) (2025)
- [IC3-Evolve: Proof-/Witness-Gated Offline LLM-Driven Heuristic Evolution for IC3 Hardware Model Checking](https://mlsanity.com/paper/2604.03232/) (2026)

## Abstract (arXiv)

The IC3 algorithm, also known as PDR, has made a significant impact in the field of safety model checking in recent years due to its high efficiency, scalability, and completeness. The most crucial component of IC3 is inductive generalization, which involves dropping variables one by one and is often the most time-consuming step. In this paper, we propose a novel approach to predict a possible minimal lemma before dropping variables by utilizing the counterexample to propagation (CTP). By leveraging this approach, we can avoid dropping variables if predict successfully. The comprehensive evaluation demonstrates a commendable success rate in lemma prediction and a significant performance improvement achieved by our proposed method.