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
|
/******************************************************************************
* Top contributors (to current version):
* Andrew Reynolds, Morgan Deters, Aina Niemetz
*
* 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.
* ****************************************************************************
*
* Implementation of quantifier utilities
*/
#include "theory/quantifiers/quant_util.h"
#include "theory/quantifiers/term_util.h"
using namespace cvc5::kind;
namespace cvc5 {
namespace theory {
QuantifiersUtil::QuantifiersUtil(Env& env) : EnvObj(env) {}
QuantPhaseReq::QuantPhaseReq( Node n, bool computeEq ){
initialize( n, computeEq );
}
void QuantPhaseReq::initialize( Node n, bool computeEq ){
std::map< Node, int > phaseReqs2;
computePhaseReqs( n, false, phaseReqs2 );
for( std::map< Node, int >::iterator it = phaseReqs2.begin(); it != phaseReqs2.end(); ++it ){
if( it->second==1 ){
d_phase_reqs[ it->first ] = true;
}else if( it->second==-1 ){
d_phase_reqs[ it->first ] = false;
}
}
Debug("inst-engine-phase-req") << "Phase requirements for " << n << ":" << std::endl;
//now, compute if any patterns are equality required
if( computeEq ){
for( std::map< Node, bool >::iterator it = d_phase_reqs.begin(); it != d_phase_reqs.end(); ++it ){
Debug("inst-engine-phase-req") << " " << it->first << " -> " << it->second << std::endl;
if( it->first.getKind()==EQUAL ){
if( quantifiers::TermUtil::hasInstConstAttr(it->first[0]) ){
if( !quantifiers::TermUtil::hasInstConstAttr(it->first[1]) ){
d_phase_reqs_equality_term[ it->first[0] ] = it->first[1];
d_phase_reqs_equality[ it->first[0] ] = it->second;
Debug("inst-engine-phase-req") << " " << it->first[0] << ( it->second ? " == " : " != " ) << it->first[1] << std::endl;
}
}else if( quantifiers::TermUtil::hasInstConstAttr(it->first[1]) ){
d_phase_reqs_equality_term[ it->first[1] ] = it->first[0];
d_phase_reqs_equality[ it->first[1] ] = it->second;
Debug("inst-engine-phase-req") << " " << it->first[1] << ( it->second ? " == " : " != " ) << it->first[0] << std::endl;
}
}
}
}
}
void QuantPhaseReq::computePhaseReqs( Node n, bool polarity, std::map< Node, int >& phaseReqs ){
bool newReqPol = false;
bool newPolarity;
if( n.getKind()==NOT ){
newReqPol = true;
newPolarity = !polarity;
}else if( n.getKind()==OR || n.getKind()==IMPLIES ){
if( !polarity ){
newReqPol = true;
newPolarity = false;
}
}else if( n.getKind()==AND ){
if( polarity ){
newReqPol = true;
newPolarity = true;
}
}else{
int val = polarity ? 1 : -1;
if( phaseReqs.find( n )==phaseReqs.end() ){
phaseReqs[n] = val;
}else if( val!=phaseReqs[n] ){
phaseReqs[n] = 0;
}
}
if( newReqPol ){
for( int i=0; i<(int)n.getNumChildren(); i++ ){
if( n.getKind()==IMPLIES && i==0 ){
computePhaseReqs( n[i], !newPolarity, phaseReqs );
}else{
computePhaseReqs( n[i], newPolarity, phaseReqs );
}
}
}
}
void QuantPhaseReq::getPolarity(
Node n, size_t child, bool hasPol, bool pol, bool& newHasPol, bool& newPol)
{
if( n.getKind()==AND || n.getKind()==OR || n.getKind()==SEP_STAR ){
newHasPol = hasPol;
newPol = pol;
}else if( n.getKind()==IMPLIES ){
newHasPol = hasPol;
newPol = child==0 ? !pol : pol;
}else if( n.getKind()==NOT ){
newHasPol = hasPol;
newPol = !pol;
}else if( n.getKind()==ITE ){
newHasPol = (child!=0) && hasPol;
newPol = pol;
}else if( n.getKind()==FORALL ){
newHasPol = (child==1) && hasPol;
newPol = pol;
}else{
newHasPol = false;
newPol = false;
}
}
void QuantPhaseReq::getEntailPolarity(
Node n, size_t child, bool hasPol, bool pol, bool& newHasPol, bool& newPol)
{
if( n.getKind()==AND || n.getKind()==OR || n.getKind()==SEP_STAR ){
newHasPol = hasPol && pol!=( n.getKind()==OR );
newPol = pol;
}else if( n.getKind()==IMPLIES ){
newHasPol = hasPol && !pol;
newPol = child==0 ? !pol : pol;
}else if( n.getKind()==NOT ){
newHasPol = hasPol;
newPol = !pol;
}else{
newHasPol = false;
newPol = false;
}
}
} // namespace theory
} // namespace cvc5
|
