blob: 526ea8dbbde967024f5b2633e51a4879f88dc6e5 (
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
|
/********************* */
/*! \file skolemization_manager.cpp
**/
#include "proof/skolemization_manager.h"
namespace CVC4 {
void SkolemizationManager::registerSkolem(Node disequality, Node skolem) {
Debug("pf::pm") << "SkolemizationManager: registerSkolem: disequality = " << disequality << ", skolem = " << skolem << std::endl;
if (isSkolem(skolem)) {
Assert(d_skolemToDisequality[skolem] == disequality);
return;
}
d_disequalityToSkolem[disequality] = skolem;
d_skolemToDisequality[skolem] = disequality;
}
bool SkolemizationManager::hasSkolem(Node disequality) {
return (d_disequalityToSkolem.find(disequality) != d_disequalityToSkolem.end());
}
Node SkolemizationManager::getSkolem(Node disequality) {
Debug("pf::pm") << "SkolemizationManager: getSkolem( ";
Assert (d_disequalityToSkolem.find(disequality) != d_disequalityToSkolem.end());
Debug("pf::pm") << disequality << " ) = " << d_disequalityToSkolem[disequality] << std::endl;
return d_disequalityToSkolem[disequality];
}
Node SkolemizationManager::getDisequality(Node skolem) {
Assert (d_skolemToDisequality.find(skolem) != d_skolemToDisequality.end());
return d_skolemToDisequality[skolem];
}
bool SkolemizationManager::isSkolem(Node skolem) {
return (d_skolemToDisequality.find(skolem) != d_skolemToDisequality.end());
}
void SkolemizationManager::clear() {
Debug("pf::pm") << "SkolemizationManager: clear" << std::endl;
d_disequalityToSkolem.clear();
d_skolemToDisequality.clear();
}
std::hash_map<Node, Node, NodeHashFunction>::const_iterator SkolemizationManager::begin() {
return d_disequalityToSkolem.begin();
}
std::hash_map<Node, Node, NodeHashFunction>::const_iterator SkolemizationManager::end() {
return d_disequalityToSkolem.end();
}
} /* CVC4 namespace */
|