From 6341581d4b6797e8a9169a2ad88638987da255a4 Mon Sep 17 00:00:00 2001 From: Andrew Reynolds Date: Thu, 17 Sep 2020 16:57:05 -0500 Subject: [PATCH] (proof-new) Fixes for theory engine proof generator (#5087) Fixes an issue where conflicts stored in the theory engine proof generator where expecting to be (=> F false) instead of (not F). --- src/theory/theory_engine_proof_generator.cpp | 67 +++++++++++++++++--- src/theory/theory_engine_proof_generator.h | 2 + 2 files changed, 59 insertions(+), 10 deletions(-) diff --git a/src/theory/theory_engine_proof_generator.cpp b/src/theory/theory_engine_proof_generator.cpp index 2ac1236f8..f817aadd0 100644 --- a/src/theory/theory_engine_proof_generator.cpp +++ b/src/theory/theory_engine_proof_generator.cpp @@ -22,14 +22,27 @@ TheoryEngineProofGenerator::TheoryEngineProofGenerator(ProofNodeManager* pnm, context::UserContext* u) : d_pnm(pnm), d_proofs(u) { + d_false = NodeManager::currentNM()->mkConst(false); } theory::TrustNode TheoryEngineProofGenerator::mkTrustExplain( TNode lit, Node exp, std::shared_ptr lpf) { - theory::TrustNode trn = theory::TrustNode::mkTrustPropExp(lit, exp, this); - Node p = trn.getProven(); - Assert(p.getKind() == IMPLIES && p.getNumChildren() == 2); + Node p; + theory::TrustNode trn; + if (lit == d_false) + { + // propagation of false is a conflict + trn = theory::TrustNode::mkTrustConflict(exp, this); + p = trn.getProven(); + Assert(p.getKind() == NOT); + } + else + { + trn = theory::TrustNode::mkTrustPropExp(lit, exp, this); + p = trn.getProven(); + Assert(p.getKind() == IMPLIES && p.getNumChildren() == 2); + } // should not already be proven NodeLazyCDProofMap::iterator it = d_proofs.find(p); if (it == d_proofs.end()) @@ -42,33 +55,67 @@ theory::TrustNode TheoryEngineProofGenerator::mkTrustExplain( std::shared_ptr TheoryEngineProofGenerator::getProofFor(Node f) { - // should only ask this generator for proofs of implications - Assert(f.getKind() == IMPLIES && f.getNumChildren() == 2); + Trace("tepg-debug") << "TheoryEngineProofGenerator::getProofFor: " << f + << std::endl; NodeLazyCDProofMap::iterator it = d_proofs.find(f); if (it == d_proofs.end()) { + Trace("tepg-debug") << "...null" << std::endl; return nullptr; } std::shared_ptr lcp = (*it).second; // finalize it via scope std::vector scopeAssumps; - if (f[0].getKind() == AND) + // should only ask this generator for proofs of implications, or conflicts + Node exp; + Node conclusion; + if (f.getKind() == IMPLIES && f.getNumChildren() == 2) { - for (const Node& fc : f[0]) + exp = f[0]; + conclusion = f[1]; + } + else if (f.getKind() == NOT) + { + exp = f[0]; + conclusion = d_false; + } + else + { + Unhandled() << "TheoryEngineProofGenerator::getProofFor: unexpected fact " + << f << std::endl; + return nullptr; + } + // get the assumptions to assume in a scope + if (exp.getKind() == AND) + { + for (const Node& fc : exp) { scopeAssumps.push_back(fc); } } else { - scopeAssumps.push_back(f[0]); + scopeAssumps.push_back(exp); } - Node conclusion = f[1]; - + Trace("tepg-debug") << "...get proof body" << std::endl; // get the proof for conclusion std::shared_ptr pfb = lcp->getProofFor(conclusion); + Trace("tepg-debug") << "...mkScope" << std::endl; // call the scope method of proof node manager std::shared_ptr pf = d_pnm->mkScope(pfb, scopeAssumps); + + if (pf->getResult() != f) + { + std::stringstream serr; + serr << "TheoryEngineProofGenerator::getProofFor: Proof: " << std::endl; + serr << *pf << std::endl; + serr << "TheoryEngineProofGenerator::getProofFor: unexpected return proof" + << std::endl; + serr << " Expected: " << f << std::endl; + serr << " Got: " << pf->getResult() << std::endl; + Unhandled() << serr.str(); + } + Trace("tepg-debug") << "...finished" << std::endl; return pf; } diff --git a/src/theory/theory_engine_proof_generator.h b/src/theory/theory_engine_proof_generator.h index a551e79b2..45927b4c7 100644 --- a/src/theory/theory_engine_proof_generator.h +++ b/src/theory/theory_engine_proof_generator.h @@ -71,6 +71,8 @@ class TheoryEngineProofGenerator : public ProofGenerator ProofNodeManager* d_pnm; /** Map from formulas to lazy CD proofs */ NodeLazyCDProofMap d_proofs; + /** The false node */ + Node d_false; }; } // namespace CVC4 -- 2.30.2