summaryrefslogtreecommitdiff
path: root/src
diff options
context:
space:
mode:
authorAndrew Reynolds <andrew.j.reynolds@gmail.com>2019-11-18 19:08:08 -0600
committerGitHub <noreply@github.com>2019-11-18 19:08:08 -0600
commitaf1279b8c5cbe5ebe78300d9d0cae4fda4500446 (patch)
tree3eabd78b5163075e5b4dcd00d0370a8a8f339bca /src
parent752a3bcf3aabb1d85101186c3f185289cde534b8 (diff)
parent7ac4aac015e69a6f377c5254c600bea386d58577 (diff)
Merge branch 'master' into fix3475fix3475
Diffstat (limited to 'src')
-rw-r--r--src/proof/proof_manager.cpp8
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);
generated by cgit on debian on lair
contact matthew@masot.net with questions or feedback