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
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
|
/********************* */
/*! \file theory_quantifiers.cpp
** \verbatim
** Top contributors (to current version):
** Andrew Reynolds, Morgan Deters, Tim King
** This file is part of the CVC4 project.
** Copyright (c) 2009-2020 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.\endverbatim
**
** \brief Implementation of the theory of quantifiers
**
** Implementation of the theory of quantifiers.
**/
#include "theory/quantifiers/theory_quantifiers.h"
#include "base/check.h"
#include "expr/kind.h"
#include "expr/proof_node_manager.h"
#include "options/quantifiers_options.h"
#include "theory/quantifiers/ematching/instantiation_engine.h"
#include "theory/quantifiers/fmf/model_engine.h"
#include "theory/quantifiers/quantifiers_attributes.h"
#include "theory/quantifiers/quantifiers_rewriter.h"
#include "theory/quantifiers/term_database.h"
#include "theory/quantifiers/term_util.h"
#include "theory/quantifiers_engine.h"
#include "theory/valuation.h"
using namespace std;
using namespace CVC4;
using namespace CVC4::kind;
using namespace CVC4::context;
using namespace CVC4::theory;
using namespace CVC4::theory::quantifiers;
TheoryQuantifiers::TheoryQuantifiers(Context* c,
context::UserContext* u,
OutputChannel& out,
Valuation valuation,
const LogicInfo& logicInfo,
ProofNodeManager* pnm)
: Theory(THEORY_QUANTIFIERS, c, u, out, valuation, logicInfo, pnm)
{
out.handleUserAttribute( "fun-def", this );
out.handleUserAttribute( "sygus", this );
out.handleUserAttribute("quant-name", this);
out.handleUserAttribute("sygus-synth-grammar", this);
out.handleUserAttribute( "sygus-synth-fun-var-list", this );
out.handleUserAttribute( "quant-inst-max-level", this );
out.handleUserAttribute( "quant-elim", this );
out.handleUserAttribute( "quant-elim-partial", this );
ProofChecker* pc = pnm != nullptr ? pnm->getChecker() : nullptr;
if (pc != nullptr)
{
// add the proof rules
d_qChecker.registerTo(pc);
}
}
TheoryQuantifiers::~TheoryQuantifiers() {
}
void TheoryQuantifiers::finishInit()
{
// quantifiers are not evaluated in getModelValue
TheoryModel* tm = d_valuation.getModel();
Assert(tm != nullptr);
tm->setUnevaluatedKind(EXISTS);
tm->setUnevaluatedKind(FORALL);
// witness is used in several instantiation strategies
tm->setUnevaluatedKind(WITNESS);
}
void TheoryQuantifiers::preRegisterTerm(TNode n) {
if (n.getKind() != FORALL)
{
return;
}
Debug("quantifiers-prereg") << "TheoryQuantifiers::preRegisterTerm() " << n << endl;
// Preregister the quantified formula.
// This initializes the modules used for handling n in this user context.
getQuantifiersEngine()->preRegisterQuantifier(n);
Debug("quantifiers-prereg")
<< "TheoryQuantifiers::preRegisterTerm() done " << n << endl;
}
void TheoryQuantifiers::presolve() {
Debug("quantifiers-presolve") << "TheoryQuantifiers::presolve()" << endl;
if( getQuantifiersEngine() ){
getQuantifiersEngine()->presolve();
}
}
void TheoryQuantifiers::ppNotifyAssertions(
const std::vector<Node>& assertions) {
Trace("quantifiers-presolve")
<< "TheoryQuantifiers::ppNotifyAssertions" << std::endl;
if (getQuantifiersEngine()) {
getQuantifiersEngine()->ppNotifyAssertions(assertions);
}
}
bool TheoryQuantifiers::collectModelInfo(TheoryModel* m)
{
for(assertions_iterator i = facts_begin(); i != facts_end(); ++i) {
if ((*i).d_assertion.getKind() == kind::NOT)
{
Debug("quantifiers::collectModelInfo")
<< "got quant FALSE: " << (*i).d_assertion[0] << endl;
if (!m->assertPredicate((*i).d_assertion[0], false))
{
return false;
}
}
else
{
Debug("quantifiers::collectModelInfo") << "got quant TRUE : " << *i << endl;
if (!m->assertPredicate(*i, true))
{
return false;
}
}
}
return true;
}
void TheoryQuantifiers::check(Effort e) {
if (done() && !fullEffort(e)) {
return;
}
TimerStat::CodeTimer checkTimer(d_checkTime);
Trace("quantifiers-check") << "quantifiers::check(" << e << ")" << std::endl;
while(!done()) {
Node assertion = get();
Trace("quantifiers-assert") << "quantifiers::assert(): " << assertion << std::endl;
switch(assertion.getKind()) {
case kind::FORALL:
getQuantifiersEngine()->assertQuantifier(assertion, true);
break;
case kind::INST_CLOSURE:
getQuantifiersEngine()->addTermToDatabase( assertion[0], false, true );
if( !options::lteRestrictInstClosure() ){
getQuantifiersEngine()->getMasterEqualityEngine()->addTerm( assertion[0] );
}
break;
case kind::EQUAL:
//do nothing
break;
case kind::NOT:
{
switch( assertion[0].getKind()) {
case kind::FORALL:
getQuantifiersEngine()->assertQuantifier(assertion[0], false);
break;
case kind::EQUAL:
//do nothing
break;
case kind::INST_CLOSURE:
default: Unhandled() << assertion[0].getKind(); break;
}
}
break;
default: Unhandled() << assertion.getKind(); break;
}
}
// call the quantifiers engine to check
getQuantifiersEngine()->check( e );
}
void TheoryQuantifiers::setUserAttribute(const std::string& attr, Node n, std::vector<Node> node_values, std::string str_value){
QuantAttributes::setUserAttribute( attr, n, node_values, str_value );
}
|
