blob: 27bf2d28959b023e6ea4c14f25511e6ca60af3b5 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
|
/******************************************************************************
* Top contributors (to current version):
* Andrew Reynolds
*
* This file is part of the cvc5 project.
*
* Copyright (c) 2009-2021 by the authors listed in the file AUTHORS
* in the top-level source directory and their institutional affiliations.
* All rights reserved. See the file COPYING in the top-level source
* directory for licensing information.
* ****************************************************************************
*
* The theory engine proof generator.
*/
#include "cvc4_private.h"
#ifndef CVC5__THEORY_ENGINE_PROOF_GENERATOR_H
#define CVC5__THEORY_ENGINE_PROOF_GENERATOR_H
#include <memory>
#include "context/cdhashmap.h"
#include "context/context.h"
#include "expr/lazy_proof.h"
#include "expr/proof_generator.h"
#include "expr/proof_node_manager.h"
#include "theory/trust_node.h"
namespace cvc5 {
/**
* A simple proof generator class used by the theory engine. This class
* stores proofs for TheoryEngine::getExplanation.
*
* Notice that this class could be made general purpose. Its main feature is
* storing lazy proofs for facts in a context-dependent manner.
*/
class TheoryEngineProofGenerator : public ProofGenerator
{
typedef context::
CDHashMap<Node, std::shared_ptr<LazyCDProof>, NodeHashFunction>
NodeLazyCDProofMap;
public:
TheoryEngineProofGenerator(ProofNodeManager* pnm, context::UserContext* u);
~TheoryEngineProofGenerator() {}
/**
* Make trust explanation. Called when lpf has a proof of lit from free
* assumptions in exp.
*
* This stores lpf in the map d_proofs below and returns the trust node for
* this propagation, which has TrustNodeKind TrustNodeKind::PROP_EXP. If this
* explanation already exists, then the previous explanation is taken, which
* also suffices for proving the implication.
*/
theory::TrustNode mkTrustExplain(TNode lit,
Node exp,
std::shared_ptr<LazyCDProof> lpf);
/**
* Get proof for, which expects implications corresponding to explained
* propagations (=> exp lit) registered by the above method. This currently
* involves calling the mkScope method of ProofNodeManager internally, which
* returns a closed proof.
*/
std::shared_ptr<ProofNode> getProofFor(Node f) override;
/** Identify this generator (for debugging, etc..) */
std::string identify() const override;
private:
/** The proof manager, used for allocating new ProofNode objects */
ProofNodeManager* d_pnm;
/** Map from formulas to lazy CD proofs */
NodeLazyCDProofMap d_proofs;
/** The false node */
Node d_false;
};
} // namespace cvc5
#endif /* CVC5__THEORY_ENGINE_PROOF_GENERATOR_H */
|
