diff options
author | Andrew Reynolds <andrew.j.reynolds@gmail.com> | 2019-12-01 15:56:17 -0600 |
---|---|---|
committer | GitHub <noreply@github.com> | 2019-12-01 15:56:17 -0600 |
commit | 14aa8974b6eeae70b255976ebb9c76fd4aa04c03 (patch) | |
tree | 992c9b9ef1de1d7539856cd2e761269020ddf085 /src/proof/proof_manager.cpp | |
parent | ca31b2c1eb2a3c9e26013f55e4049b667404ac4e (diff) | |
parent | 9bf87b8b5572bbfc110018081b28ad0a88b8a619 (diff) |
Merge branch 'master' into fixRefCountZerofixRefCountZero
Diffstat (limited to 'src/proof/proof_manager.cpp')
-rw-r--r-- | src/proof/proof_manager.cpp | 8 |
1 files changed, 7 insertions, 1 deletions
diff --git a/src/proof/proof_manager.cpp b/src/proof/proof_manager.cpp index fa4c1ecb5..bbf5b0064 100644 --- a/src/proof/proof_manager.cpp +++ b/src/proof/proof_manager.cpp @@ -579,9 +579,13 @@ void LFSCProof::toStream(std::ostream& out) const CodeTimer skeletonProofTimer{ ProofManager::currentPM()->getStats().d_skeletonProofTraceTime}; Assert(!d_satProof->proofConstructed()); + + // Here we give our SAT solver a chance to flesh out the resolution proof. + // It proves bottom from a set of clauses. d_satProof->constructProof(); - // collecting leaf clauses in resolution proof + // We ask the SAT solver which clauses are used in that proof. + // For a resolution proof, these are the leaves of the tree. d_satProof->collectClausesUsed(used_inputs, used_lemmas); IdToSatClause::iterator it2; @@ -672,6 +676,8 @@ void LFSCProof::toStream(std::ostream& out) const } } + // From the clauses, compute the atoms (atomic theory predicates in + // assertions and lemmas). d_cnfProof->collectAtomsForClauses(used_inputs, atoms); d_cnfProof->collectAtomsForClauses(used_lemmas, atoms); |