Head

GCC Code Coverage Report

Directory:	.		Exec	Total	Coverage
File:	src/theory/quantifiers/sygus/sygus_explain.cpp	Lines:	157	164	95.7 %
Date:	2021-09-07	Branches:	292	786	37.2 %


/******************************************************************************
 * 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.
 * ****************************************************************************
 *
 * Implementation of techniques for sygus explanations.
 */

#include "theory/quantifiers/sygus/sygus_explain.h"

#include "expr/dtype.h"
#include "expr/dtype_cons.h"
#include "smt/logic_exception.h"
#include "theory/datatypes/sygus_datatype_utils.h"
#include "theory/datatypes/theory_datatypes_utils.h"
#include "theory/quantifiers/sygus/sygus_invariance.h"
#include "theory/quantifiers/sygus/term_database_sygus.h"

using namespace cvc5::kind;
using namespace std;

namespace cvc5 {
namespace theory {
namespace quantifiers {

void TermRecBuild::addTerm(Node n)
{
  d_term.push_back(n);
  std::vector<Node> currc;
  d_kind.push_back(n.getKind());
  if (n.getMetaKind() == kind::metakind::PARAMETERIZED)
  {
    currc.push_back(n.getOperator());
    d_has_op.push_back(true);
  }
  else
  {
    d_has_op.push_back(false);
  }
  for (unsigned i = 0; i < n.getNumChildren(); i++)
  {
    currc.push_back(n[i]);
  }
  d_children.push_back(currc);
}

void TermRecBuild::init(Node n)
{
  Assert(d_term.empty());
  addTerm(n);
}

void TermRecBuild::push(unsigned p)
{
  Assert(!d_term.empty());
  unsigned curr = d_term.size() - 1;
  Assert(d_pos.size() == curr);
  Assert(d_pos.size() + 1 == d_children.size());
  Assert(p < d_term[curr].getNumChildren());
  addTerm(d_term[curr][p]);
  d_pos.push_back(p);
}

void TermRecBuild::pop()
{
  Assert(!d_pos.empty());
  d_pos.pop_back();
  d_kind.pop_back();
  d_has_op.pop_back();
  d_children.pop_back();
  d_term.pop_back();
}

void TermRecBuild::replaceChild(unsigned i, Node r)
{
  Assert(!d_term.empty());
  unsigned curr = d_term.size() - 1;
  unsigned o = d_has_op[curr] ? 1 : 0;
  d_children[curr][i + o] = r;
}

Node TermRecBuild::getChild(unsigned i)
{
  unsigned curr = d_term.size() - 1;
  unsigned o = d_has_op[curr] ? 1 : 0;
  return d_children[curr][i + o];
}

Node TermRecBuild::build(unsigned d)
{
  Assert(d_pos.size() + 1 == d_term.size());
  Assert(d < d_term.size());
  int p = d < d_pos.size() ? d_pos[d] : -2;
  std::vector<Node> children;
  unsigned o = d_has_op[d] ? 1 : 0;
  for (unsigned i = 0; i < d_children[d].size(); i++)
  {
    Node nc;
    if (p + o == i)
    {
      nc = build(d + 1);
    }
    else
    {
      nc = d_children[d][i];
    }
    children.push_back(nc);
  }
  return NodeManager::currentNM()->mkNode(d_kind[d], children);
}

void SygusExplain::getExplanationForEquality(Node n,
                                             Node vn,
                                             std::vector<Node>& exp)
{
  std::map<unsigned, bool> cexc;
  getExplanationForEquality(n, vn, exp, cexc);
}

void SygusExplain::getExplanationForEquality(Node n,
                                             Node vn,
                                             std::vector<Node>& exp,
                                             std::map<unsigned, bool>& cexc)
{
  // since builtin types occur in grammar, types are comparable but not
  // necessarily equal
  Assert(n.getType().isComparableTo(n.getType()));
  if (n == vn)
  {
    return;
  }
  TypeNode tn = n.getType();
  if (!tn.isDatatype())
  {
    // sygus datatype fields that are not sygus datatypes are treated as
    // abstractions only, hence we disregard this field
    return;
  }
  Assert(vn.getKind() == kind::APPLY_CONSTRUCTOR);
  const DType& dt = tn.getDType();
  int i = datatypes::utils::indexOf(vn.getOperator());
  Node tst = datatypes::utils::mkTester(n, i, dt);
  exp.push_back(tst);
  for (unsigned j = 0; j < vn.getNumChildren(); j++)
  {
    if (cexc.find(j) == cexc.end())
    {
      Node sel = NodeManager::currentNM()->mkNode(
          kind::APPLY_SELECTOR_TOTAL, dt[i].getSelectorInternal(tn, j), n);
      getExplanationForEquality(sel, vn[j], exp);
    }
  }
}

Node SygusExplain::getExplanationForEquality(Node n, Node vn)
{
  std::map<unsigned, bool> cexc;
  return getExplanationForEquality(n, vn, cexc);
}

Node SygusExplain::getExplanationForEquality(Node n,
                                             Node vn,
                                             std::map<unsigned, bool>& cexc)
{
  std::vector<Node> exp;
  getExplanationForEquality(n, vn, exp, cexc);
  Assert(!exp.empty());
  return exp.size() == 1 ? exp[0]
                         : NodeManager::currentNM()->mkNode(kind::AND, exp);
}

// we have ( n = vn => eval( n ) = bvr ) ^ vn != vnr , returns exp such that exp
// => ( eval( n ) = bvr ^ vn != vnr )
void SygusExplain::getExplanationFor(TermRecBuild& trb,
                                     Node n,
                                     Node vn,
                                     std::vector<Node>& exp,
                                     std::map<TypeNode, int>& var_count,
                                     SygusInvarianceTest& et,
                                     Node vnr,
                                     Node& vnr_exp,
                                     int& sz)
{
  Assert(vnr.isNull() || vn != vnr);
  Assert(n.getType().isComparableTo(vn.getType()));
  TypeNode ntn = n.getType();
  if (!ntn.isDatatype())
  {
    // SyGuS datatype fields that are not sygus datatypes are treated as
    // abstractions only, hence we disregard this field. It is important
    // that users of this method pay special attention to any constants,
    // otherwise the explanation n.eqNode(vn) is necessary here. For example,
    // any lemma schema that blocks the current value of an enumerator should
    // not make any assumptions about the value of the arguments of its any
    // constant constructors, since their explanation is not included here.
    return;
  }
  Assert(vn.getKind() == APPLY_CONSTRUCTOR);
  Assert(vnr.isNull() || vnr.getKind() == APPLY_CONSTRUCTOR);
  std::map<unsigned, bool> cexc;
  // for each child,
  // check whether replacing that child by a fresh variable
  // also satisfies the invariance test.
  for (unsigned i = 0; i < vn.getNumChildren(); i++)
  {
    TypeNode xtn = vn[i].getType();
    Node x = d_tdb->getFreeVarInc(xtn, var_count);
    trb.replaceChild(i, x);
    Node nvn = trb.build();
    Assert(nvn.getKind() == kind::APPLY_CONSTRUCTOR);
    if (et.is_invariant(d_tdb, nvn, x))
    {
      cexc[i] = true;
      // we are tracking term size if positive
      if (sz >= 0)
      {
        int s = datatypes::utils::getSygusTermSize(vn[i]);
        sz = sz - s;
      }
    }
    else
    {
      // revert
      trb.replaceChild(i, vn[i]);
    }
  }
  const DType& dt = ntn.getDType();
  int cindex = datatypes::utils::indexOf(vn.getOperator());
  Assert(cindex >= 0 && cindex < (int)dt.getNumConstructors());
  Node tst = datatypes::utils::mkTester(n, cindex, dt);
  exp.push_back(tst);
  // if the operator of vn is different than vnr, then disunification obligation
  // is met
  if (!vnr.isNull())
  {
    if (vnr.getOperator() != vn.getOperator())
    {
      vnr = Node::null();
      vnr_exp = NodeManager::currentNM()->mkConst(true);
    }
  }
  for (unsigned i = 0; i < vn.getNumChildren(); i++)
  {
    Node sel = NodeManager::currentNM()->mkNode(
        kind::APPLY_SELECTOR_TOTAL, dt[cindex].getSelectorInternal(ntn, i), n);
    Node vnr_c = vnr.isNull() ? vnr : (vn[i] == vnr[i] ? Node::null() : vnr[i]);
    if (cexc.find(i) == cexc.end())
    {
      trb.push(i);
      Node vnr_exp_c;
      getExplanationFor(
          trb, sel, vn[i], exp, var_count, et, vnr_c, vnr_exp_c, sz);
      trb.pop();
      if (!vnr_c.isNull())
      {
        Assert(!vnr_exp_c.isNull());
        if (vnr_exp_c.isConst() || vnr_exp.isNull())
        {
          // recursively satisfied the disunification obligation
          if (vnr_exp_c.isConst())
          {
            // was successful, don't consider further
            vnr = Node::null();
          }
          vnr_exp = vnr_exp_c;
        }
      }
    }
    else
    {
      // if excluded, we may need to add the explanation for this
      if (vnr_exp.isNull() && !vnr_c.isNull())
      {
        vnr_exp = getExplanationForEquality(sel, vnr[i]);
      }
    }
  }
}

void SygusExplain::getExplanationFor(Node n,
                                     Node vn,
                                     std::vector<Node>& exp,
                                     SygusInvarianceTest& et,
                                     Node vnr,
                                     unsigned& sz)
{
  std::map<TypeNode, int> var_count;
  return getExplanationFor(n, vn, exp, et, vnr, var_count, sz);
}

void SygusExplain::getExplanationFor(Node n,
                                     Node vn,
                                     std::vector<Node>& exp,
                                     SygusInvarianceTest& et,
                                     Node vnr,
                                     std::map<TypeNode, int>& var_count,
                                     unsigned& sz)
{
  // naive :
  // return getExplanationForEquality( n, vn, exp );

  // set up the recursion object;
  TermRecBuild trb;
  trb.init(vn);
  Node vnr_exp;
  int sz_use = sz;
  getExplanationFor(trb, n, vn, exp, var_count, et, vnr, vnr_exp, sz_use);
  Assert(sz_use >= 0);
  sz = sz_use;
  Assert(vnr.isNull() || !vnr_exp.isNull());
  if (!vnr_exp.isNull() && !vnr_exp.isConst())
  {
    exp.push_back(vnr_exp.negate());
  }
}

void SygusExplain::getExplanationFor(Node n,
                                     Node vn,
                                     std::vector<Node>& exp,
                                     SygusInvarianceTest& et,
                                     bool strict)
{
  std::map<TypeNode, int> var_count;
  getExplanationFor(n, vn, exp, et, var_count, strict);
}

void SygusExplain::getExplanationFor(Node n,
                                     Node vn,
                                     std::vector<Node>& exp,
                                     SygusInvarianceTest& et,
                                     std::map<TypeNode, int>& var_count,
                                     bool strict)
{
  if (!strict)
  {
    // check if it is invariant over the entire node
    TypeNode vtn = vn.getType();
    Node x = d_tdb->getFreeVarInc(vtn, var_count);
    if (et.is_invariant(d_tdb, x, x))
    {
      return;
    }
    var_count[vtn]--;
  }
  int sz = -1;
  TermRecBuild trb;
  trb.init(vn);
  Node vnr;
  Node vnr_exp;
  getExplanationFor(trb, n, vn, exp, var_count, et, vnr, vnr_exp, sz);
}

}  // namespace quantifiers
}  // namespace theory
}  // namespace cvc5


Generated by: GCOVR (Version 3.2)

Line	Exec	Source
1		/******************************************************************************
2		* Top contributors (to current version):
3		* Andrew Reynolds, Aina Niemetz
4		*
5		* This file is part of the cvc5 project.
6		*
7		* Copyright (c) 2009-2021 by the authors listed in the file AUTHORS
8		* in the top-level source directory and their institutional affiliations.
9		* All rights reserved. See the file COPYING in the top-level source
10		* directory for licensing information.
11		* ****************************************************************************
12		*
13		* Implementation of techniques for sygus explanations.
14		*/
15
16		#include "theory/quantifiers/sygus/sygus_explain.h"
17
18		#include "expr/dtype.h"
19		#include "expr/dtype_cons.h"
20		#include "smt/logic_exception.h"
21		#include "theory/datatypes/sygus_datatype_utils.h"
22		#include "theory/datatypes/theory_datatypes_utils.h"
23		#include "theory/quantifiers/sygus/sygus_invariance.h"
24		#include "theory/quantifiers/sygus/term_database_sygus.h"
25
26		using namespace cvc5::kind;
27		using namespace std;
28
29		namespace cvc5 {
30		namespace theory {
31		namespace quantifiers {
32
33	63044	void TermRecBuild::addTerm(Node n)
34		{
35	63044	d_term.push_back(n);
36	126088	std::vector<Node> currc;
37	63044	d_kind.push_back(n.getKind());
38	63044	if (n.getMetaKind() == kind::metakind::PARAMETERIZED)
39		{
40	63020	currc.push_back(n.getOperator());
41	63020	d_has_op.push_back(true);
42		}
43		else
44		{
45	24	d_has_op.push_back(false);
46		}
47	113353	for (unsigned i = 0; i < n.getNumChildren(); i++)
48		{
49	50309	currc.push_back(n[i]);
50		}
51	63044	d_children.push_back(currc);
52	63044	}
53
54	14584	void TermRecBuild::init(Node n)
55		{
56	14584	Assert(d_term.empty());
57	14584	addTerm(n);
58	14584	}
59
60	48460	void TermRecBuild::push(unsigned p)
61		{
62	48460	Assert(!d_term.empty());
63	48460	unsigned curr = d_term.size() - 1;
64	48460	Assert(d_pos.size() == curr);
65	48460	Assert(d_pos.size() + 1 == d_children.size());
66	48460	Assert(p < d_term[curr].getNumChildren());
67	48460	addTerm(d_term[curr][p]);
68	48460	d_pos.push_back(p);
69	48460	}
70
71	48460	void TermRecBuild::pop()
72		{
73	48460	Assert(!d_pos.empty());
74	48460	d_pos.pop_back();
75	48460	d_kind.pop_back();
76	48460	d_has_op.pop_back();
77	48460	d_children.pop_back();
78	48460	d_term.pop_back();
79	48460	}
80
81	98733	void TermRecBuild::replaceChild(unsigned i, Node r)
82		{
83	98733	Assert(!d_term.empty());
84	98733	unsigned curr = d_term.size() - 1;
85	98733	unsigned o = d_has_op[curr] ? 1 : 0;
86	98733	d_children[curr][i + o] = r;
87	98733	}
88
89		Node TermRecBuild::getChild(unsigned i)
90		{
91		unsigned curr = d_term.size() - 1;
92		unsigned o = d_has_op[curr] ? 1 : 0;
93		return d_children[curr][i + o];
94		}
95
96	81391	Node TermRecBuild::build(unsigned d)
97		{
98	81391	Assert(d_pos.size() + 1 == d_term.size());
99	81391	Assert(d < d_term.size());
100	81391	int p = d < d_pos.size() ? d_pos[d] : -2;
101	162782	std::vector<Node> children;
102	81391	unsigned o = d_has_op[d] ? 1 : 0;
103	326397	for (unsigned i = 0; i < d_children[d].size(); i++)
104		{
105	490012	Node nc;
106	245006	if (p + o == i)
107		{
108	31118	nc = build(d + 1);
109		}
110		else
111		{
112	213888	nc = d_children[d][i];
113		}
114	245006	children.push_back(nc);
115		}
116	162782	return NodeManager::currentNM()->mkNode(d_kind[d], children);
117		}
118
119	30009	void SygusExplain::getExplanationForEquality(Node n,
120		Node vn,
121		std::vector<Node>& exp)
122		{
123	60018	std::map<unsigned, bool> cexc;
124	30009	getExplanationForEquality(n, vn, exp, cexc);
125	30009	}
126
127	30334	void SygusExplain::getExplanationForEquality(Node n,
128		Node vn,
129		std::vector<Node>& exp,
130		std::map<unsigned, bool>& cexc)
131		{
132		// since builtin types occur in grammar, types are comparable but not
133		// necessarily equal
134	30334	Assert(n.getType().isComparableTo(n.getType()));
135	30334	if (n == vn)
136		{
137	367	return;
138		}
139	60301	TypeNode tn = n.getType();
140	30334	if (!tn.isDatatype())
141		{
142		// sygus datatype fields that are not sygus datatypes are treated as
143		// abstractions only, hence we disregard this field
144	367	return;
145		}
146	29967	Assert(vn.getKind() == kind::APPLY_CONSTRUCTOR);
147	29967	const DType& dt = tn.getDType();
148	29967	int i = datatypes::utils::indexOf(vn.getOperator());
149	59934	Node tst = datatypes::utils::mkTester(n, i, dt);
150	29967	exp.push_back(tst);
151	48858	for (unsigned j = 0; j < vn.getNumChildren(); j++)
152		{
153	18891	if (cexc.find(j) == cexc.end())
154		{
155		Node sel = NodeManager::currentNM()->mkNode(
156	37782	kind::APPLY_SELECTOR_TOTAL, dt[i].getSelectorInternal(tn, j), n);
157	18891	getExplanationForEquality(sel, vn[j], exp);
158		}
159		}
160		}
161
162	325	Node SygusExplain::getExplanationForEquality(Node n, Node vn)
163		{
164	650	std::map<unsigned, bool> cexc;
165	650	return getExplanationForEquality(n, vn, cexc);
166		}
167
168	325	Node SygusExplain::getExplanationForEquality(Node n,
169		Node vn,
170		std::map<unsigned, bool>& cexc)
171		{
172	650	std::vector<Node> exp;
173	325	getExplanationForEquality(n, vn, exp, cexc);
174	325	Assert(!exp.empty());
175	425	return exp.size() == 1 ? exp[0]
176	750	: NodeManager::currentNM()->mkNode(kind::AND, exp);
177		}
178
179		// we have ( n = vn => eval( n ) = bvr ) ^ vn != vnr , returns exp such that exp
180		// => ( eval( n ) = bvr ^ vn != vnr )
181	63044	void SygusExplain::getExplanationFor(TermRecBuild& trb,
182		Node n,
183		Node vn,
184		std::vector<Node>& exp,
185		std::map<TypeNode, int>& var_count,
186		SygusInvarianceTest& et,
187		Node vnr,
188		Node& vnr_exp,
189		int& sz)
190		{
191	63044	Assert(vnr.isNull() \|\| vn != vnr);
192	63044	Assert(n.getType().isComparableTo(vn.getType()));
193	126028	TypeNode ntn = n.getType();
194	63044	if (!ntn.isDatatype())
195		{
196		// SyGuS datatype fields that are not sygus datatypes are treated as
197		// abstractions only, hence we disregard this field. It is important
198		// that users of this method pay special attention to any constants,
199		// otherwise the explanation n.eqNode(vn) is necessary here. For example,
200		// any lemma schema that blocks the current value of an enumerator should
201		// not make any assumptions about the value of the arguments of its any
202		// constant constructors, since their explanation is not included here.
203	60	return;
204		}
205	62984	Assert(vn.getKind() == APPLY_CONSTRUCTOR);
206	62984	Assert(vnr.isNull() \|\| vnr.getKind() == APPLY_CONSTRUCTOR);
207	125968	std::map<unsigned, bool> cexc;
208		// for each child,
209		// check whether replacing that child by a fresh variable
210		// also satisfies the invariance test.
211	113257	for (unsigned i = 0; i < vn.getNumChildren(); i++)
212		{
213	100546	TypeNode xtn = vn[i].getType();
214	100546	Node x = d_tdb->getFreeVarInc(xtn, var_count);
215	50273	trb.replaceChild(i, x);
216	100546	Node nvn = trb.build();
217	50273	Assert(nvn.getKind() == kind::APPLY_CONSTRUCTOR);
218	50273	if (et.is_invariant(d_tdb, nvn, x))
219		{
220	1813	cexc[i] = true;
221		// we are tracking term size if positive
222	1813	if (sz >= 0)
223		{
224	189	int s = datatypes::utils::getSygusTermSize(vn[i]);
225	189	sz = sz - s;
226		}
227		}
228		else
229		{
230		// revert
231	48460	trb.replaceChild(i, vn[i]);
232		}
233		}
234	62984	const DType& dt = ntn.getDType();
235	62984	int cindex = datatypes::utils::indexOf(vn.getOperator());
236	62984	Assert(cindex >= 0 && cindex < (int)dt.getNumConstructors());
237	125968	Node tst = datatypes::utils::mkTester(n, cindex, dt);
238	62984	exp.push_back(tst);
239		// if the operator of vn is different than vnr, then disunification obligation
240		// is met
241	62984	if (!vnr.isNull())
242		{
243	3073	if (vnr.getOperator() != vn.getOperator())
244		{
245	1690	vnr = Node::null();
246	1690	vnr_exp = NodeManager::currentNM()->mkConst(true);
247		}
248		}
249	113257	for (unsigned i = 0; i < vn.getNumChildren(); i++)
250		{
251		Node sel = NodeManager::currentNM()->mkNode(
252	100546	kind::APPLY_SELECTOR_TOTAL, dt[cindex].getSelectorInternal(ntn, i), n);
253	100546	Node vnr_c = vnr.isNull() ? vnr : (vn[i] == vnr[i] ? Node::null() : vnr[i]);
254	50273	if (cexc.find(i) == cexc.end())
255		{
256	48460	trb.push(i);
257	96920	Node vnr_exp_c;
258	48460	getExplanationFor(
259		trb, sel, vn[i], exp, var_count, et, vnr_c, vnr_exp_c, sz);
260	48460	trb.pop();
261	48460	if (!vnr_c.isNull())
262		{
263	1380	Assert(!vnr_exp_c.isNull());
264	1380	if (vnr_exp_c.isConst() \|\| vnr_exp.isNull())
265		{
266		// recursively satisfied the disunification obligation
267	1380	if (vnr_exp_c.isConst())
268		{
269		// was successful, don't consider further
270	1380	vnr = Node::null();
271		}
272	1380	vnr_exp = vnr_exp_c;
273		}
274		}
275		}
276		else
277		{
278		// if excluded, we may need to add the explanation for this
279	1813	if (vnr_exp.isNull() && !vnr_c.isNull())
280		{
281	4	vnr_exp = getExplanationForEquality(sel, vnr[i]);
282		}
283		}
284		}
285		}
286
287		void SygusExplain::getExplanationFor(Node n,
288		Node vn,
289		std::vector<Node>& exp,
290		SygusInvarianceTest& et,
291		Node vnr,
292		unsigned& sz)
293		{
294		std::map<TypeNode, int> var_count;
295		return getExplanationFor(n, vn, exp, et, vnr, var_count, sz);
296		}
297
298	1693	void SygusExplain::getExplanationFor(Node n,
299		Node vn,
300		std::vector<Node>& exp,
301		SygusInvarianceTest& et,
302		Node vnr,
303		std::map<TypeNode, int>& var_count,
304		unsigned& sz)
305		{
306		// naive :
307		// return getExplanationForEquality( n, vn, exp );
308
309		// set up the recursion object;
310	3386	TermRecBuild trb;
311	1693	trb.init(vn);
312	3386	Node vnr_exp;
313	1693	int sz_use = sz;
314	1693	getExplanationFor(trb, n, vn, exp, var_count, et, vnr, vnr_exp, sz_use);
315	1693	Assert(sz_use >= 0);
316	1693	sz = sz_use;
317	1693	Assert(vnr.isNull() \|\| !vnr_exp.isNull());
318	1693	if (!vnr_exp.isNull() && !vnr_exp.isConst())
319		{
320	3	exp.push_back(vnr_exp.negate());
321		}
322	1693	}
323
324	7919	void SygusExplain::getExplanationFor(Node n,
325		Node vn,
326		std::vector<Node>& exp,
327		SygusInvarianceTest& et,
328		bool strict)
329		{
330	15838	std::map<TypeNode, int> var_count;
331	7919	getExplanationFor(n, vn, exp, et, var_count, strict);
332	7919	}
333
334	15477	void SygusExplain::getExplanationFor(Node n,
335		Node vn,
336		std::vector<Node>& exp,
337		SygusInvarianceTest& et,
338		std::map<TypeNode, int>& var_count,
339		bool strict)
340		{
341	15477	if (!strict)
342		{
343		// check if it is invariant over the entire node
344	12530	TypeNode vtn = vn.getType();
345	12530	Node x = d_tdb->getFreeVarInc(vtn, var_count);
346	7558	if (et.is_invariant(d_tdb, x, x))
347		{
348	2586	return;
349		}
350	4972	var_count[vtn]--;
351		}
352	12891	int sz = -1;
353	25782	TermRecBuild trb;
354	12891	trb.init(vn);
355	25782	Node vnr;
356	25782	Node vnr_exp;
357	12891	getExplanationFor(trb, n, vn, exp, var_count, et, vnr, vnr_exp, sz);
358		}
359
360		} // namespace quantifiers
361		} // namespace theory
362	29502	} // namespace cvc5