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
180
181
182
183
184
185
186
|
/******************************************************************************
* Top contributors (to current version):
* Andrew Reynolds, 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.
* ****************************************************************************
*
* Generic sygus utilities.
*/
#include "theory/quantifiers/sygus/sygus_utils.h"
#include <sstream>
#include "expr/node_algorithm.h"
#include "expr/skolem_manager.h"
#include "theory/quantifiers/quantifiers_attributes.h"
#include "theory/quantifiers/sygus/sygus_grammar_cons.h"
using namespace cvc5::kind;
namespace cvc5 {
namespace theory {
namespace quantifiers {
/**
* Attribute for specifying a solution for a function-to-synthesize. This is
* used for marking certain functions that we have solved for, e.g. during
* preprocessing.
*/
struct SygusSolutionAttributeId
{
};
typedef expr::Attribute<SygusSolutionAttributeId, Node> SygusSolutionAttribute;
Node SygusUtils::mkSygusConjecture(const std::vector<Node>& fs,
Node conj,
const std::vector<Node>& iattrs)
{
Assert(!fs.empty());
NodeManager* nm = NodeManager::currentNM();
SkolemManager* sm = nm->getSkolemManager();
SygusAttribute ca;
Node sygusVar = sm->mkDummySkolem("sygus", nm->booleanType());
sygusVar.setAttribute(ca, true);
std::vector<Node> ipls{nm->mkNode(INST_ATTRIBUTE, sygusVar)};
// insert the remaining instantiation attributes
ipls.insert(ipls.end(), iattrs.begin(), iattrs.end());
Node ipl = nm->mkNode(INST_PATTERN_LIST, ipls);
Node bvl = nm->mkNode(BOUND_VAR_LIST, fs);
return nm->mkNode(FORALL, bvl, conj, ipl);
}
Node SygusUtils::mkSygusConjecture(const std::vector<Node>& fs, Node conj)
{
std::vector<Node> iattrs;
return mkSygusConjecture(fs, conj, iattrs);
}
Node SygusUtils::mkSygusConjecture(const std::vector<Node>& fs,
Node conj,
const Subs& solvedf)
{
Assert(!fs.empty());
NodeManager* nm = NodeManager::currentNM();
SkolemManager* sm = nm->getSkolemManager();
std::vector<Node> iattrs;
// take existing properties, without the previous solves
SygusSolutionAttribute ssa;
// add the current solves, which should be a superset of the previous ones
for (size_t i = 0, nsolved = solvedf.size(); i < nsolved; i++)
{
Node eq = solvedf.getEquality(i);
Node var = sm->mkDummySkolem("solved", nm->booleanType());
var.setAttribute(ssa, eq);
Node ipv = nm->mkNode(INST_ATTRIBUTE, var);
iattrs.push_back(ipv);
}
return mkSygusConjecture(fs, conj, iattrs);
}
void SygusUtils::decomposeSygusConjecture(Node q,
std::vector<Node>& fs,
std::vector<Node>& unsf,
Subs& solvedf)
{
Assert(q.getKind() == FORALL);
Assert(q.getNumChildren() == 3);
Node ipl = q[2];
Assert(ipl.getKind() == INST_PATTERN_LIST);
fs.insert(fs.end(), q[0].begin(), q[0].end());
SygusSolutionAttribute ssa;
for (const Node& ip : ipl)
{
if (ip.getKind() == INST_ATTRIBUTE)
{
Node ipv = ip[0];
// does it specify a sygus solution?
if (ipv.hasAttribute(ssa))
{
Node eq = ipv.getAttribute(ssa);
Assert(std::find(fs.begin(), fs.end(), eq[0]) != fs.end());
solvedf.addEquality(eq);
}
}
}
// add to unsolved functions
for (const Node& f : fs)
{
if (!solvedf.contains(f))
{
unsf.push_back(f);
}
}
}
Node SygusUtils::decomposeSygusBody(Node conj, std::vector<Node>& vs)
{
if (conj.getKind() == NOT && conj[0].getKind() == FORALL)
{
vs.insert(vs.end(), conj[0][0].begin(), conj[0][0].end());
return conj[0][1].negate();
}
return conj;
}
Node SygusUtils::getSygusArgumentListForSynthFun(Node f)
{
Node sfvl = f.getAttribute(SygusSynthFunVarListAttribute());
if (sfvl.isNull() && f.getType().isFunction())
{
NodeManager* nm = NodeManager::currentNM();
std::vector<TypeNode> argTypes = f.getType().getArgTypes();
// make default variable list if none was specified by input
std::vector<Node> bvs;
for (unsigned j = 0, size = argTypes.size(); j < size; j++)
{
std::stringstream ss;
ss << "arg" << j;
bvs.push_back(nm->mkBoundVar(ss.str(), argTypes[j]));
}
sfvl = nm->mkNode(BOUND_VAR_LIST, bvs);
f.setAttribute(SygusSynthFunVarListAttribute(), sfvl);
}
return sfvl;
}
void SygusUtils::getSygusArgumentListForSynthFun(Node f,
std::vector<Node>& formals)
{
Node sfvl = getSygusArgumentListForSynthFun(f);
if (!sfvl.isNull())
{
formals.insert(formals.end(), sfvl.begin(), sfvl.end());
}
}
Node SygusUtils::wrapSolutionForSynthFun(Node f, Node sol)
{
Node al = getSygusArgumentListForSynthFun(f);
if (!al.isNull())
{
sol = NodeManager::currentNM()->mkNode(LAMBDA, al, sol);
}
Assert(!expr::hasFreeVar(sol));
return sol;
}
TypeNode SygusUtils::getSygusTypeForSynthFun(Node f)
{
Node gv = f.getAttribute(SygusSynthGrammarAttribute());
if (!gv.isNull())
{
return gv.getType();
}
return TypeNode::null();
}
} // namespace quantifiers
} // namespace theory
} // namespace cvc5
|
