Head

GCC Code Coverage Report

Directory:	.		Exec	Total	Coverage
File:	src/theory/ext_theory.cpp	Lines:	163	251	64.9 %
Date:	2021-11-06	Branches:	283	725	39.0 %


/******************************************************************************
 * Top contributors (to current version):
 *   Andrew Reynolds, Tim King
 *
 * 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.
 * ****************************************************************************
 *
 * Extended theory interface.
 *
 * This implements a generic module, used by theory solvers, for performing
 * "context-dependent simplification", as described in Reynolds et al
 * "Designing Theory Solvers with Extensions", FroCoS 2017.
 */

#include "theory/ext_theory.h"

#include "base/check.h"
#include "smt/smt_statistics_registry.h"
#include "theory/output_channel.h"
#include "theory/quantifiers_engine.h"
#include "theory/rewriter.h"
#include "theory/substitutions.h"

using namespace std;

namespace cvc5 {
namespace theory {

const char* toString(ExtReducedId id)
{
  switch (id)
  {
    case ExtReducedId::SR_CONST: return "SR_CONST";
    case ExtReducedId::REDUCTION: return "REDUCTION";
    case ExtReducedId::ARITH_SR_ZERO: return "ARITH_SR_ZERO";
    case ExtReducedId::ARITH_SR_LINEAR: return "ARITH_SR_LINEAR";
    case ExtReducedId::STRINGS_SR_CONST: return "STRINGS_SR_CONST";
    case ExtReducedId::STRINGS_NEG_CTN_DEQ: return "STRINGS_NEG_CTN_DEQ";
    case ExtReducedId::STRINGS_POS_CTN: return "STRINGS_POS_CTN";
    case ExtReducedId::STRINGS_CTN_DECOMPOSE: return "STRINGS_CTN_DECOMPOSE";
    case ExtReducedId::STRINGS_REGEXP_INTER: return "STRINGS_REGEXP_INTER";
    case ExtReducedId::STRINGS_REGEXP_INTER_SUBSUME:
      return "STRINGS_REGEXP_INTER_SUBSUME";
    case ExtReducedId::STRINGS_REGEXP_INCLUDE: return "STRINGS_REGEXP_INCLUDE";
    case ExtReducedId::STRINGS_REGEXP_INCLUDE_NEG:
      return "STRINGS_REGEXP_INCLUDE_NEG";
    default: return "?ExtReducedId?";
  }
}

std::ostream& operator<<(std::ostream& out, ExtReducedId id)
{
  out << toString(id);
  return out;
}

bool ExtTheoryCallback::getCurrentSubstitution(
    int effort,
    const std::vector<Node>& vars,
    std::vector<Node>& subs,
    std::map<Node, std::vector<Node> >& exp)
{
  return false;
}
bool ExtTheoryCallback::isExtfReduced(
    int effort, Node n, Node on, std::vector<Node>& exp, ExtReducedId& id)
{
  id = ExtReducedId::SR_CONST;
  return n.isConst();
}
bool ExtTheoryCallback::getReduction(int effort,
                                    Node n,
                                    Node& nr,
                                    bool& isSatDep)
{
  return false;
}

ExtTheory::ExtTheory(Env& env, ExtTheoryCallback& p, TheoryInferenceManager& im)
    : EnvObj(env),
      d_parent(p),
      d_im(im),
      d_ext_func_terms(context()),
      d_extfExtReducedIdMap(context()),
      d_ci_inactive(userContext()),
      d_has_extf(context()),
      d_lemmas(userContext()),
      d_pp_lemmas(userContext())
{
  d_true = NodeManager::currentNM()->mkConst(true);
}

// Gets all leaf terms in n.
std::vector<Node> ExtTheory::collectVars(Node n)
{
  std::vector<Node> vars;
  std::set<Node> visited;
  std::vector<Node> worklist;
  worklist.push_back(n);
  while (!worklist.empty())
  {
    Node current = worklist.back();
    worklist.pop_back();
    if (current.isConst() || visited.count(current) > 0)
    {
      continue;
    }
    visited.insert(current);
    // Treat terms not belonging to this theory as leaf
    // note : chould include terms not belonging to this theory
    // (commented below)
    if (current.getNumChildren() > 0)
    {
      worklist.insert(worklist.end(), current.begin(), current.end());
    }
    else
    {
      vars.push_back(current);
    }
  }
  return vars;
}

Node ExtTheory::getSubstitutedTerm(int effort,
                                   Node term,
                                   std::vector<Node>& exp)
{
  std::vector<Node> terms;
  terms.push_back(term);
  std::vector<Node> sterms;
  std::vector<std::vector<Node> > exps;
  getSubstitutedTerms(effort, terms, sterms, exps);
  Assert(sterms.size() == 1);
  Assert(exps.size() == 1);
  exp.insert(exp.end(), exps[0].begin(), exps[0].end());
  return sterms[0];
}

// do inferences
void ExtTheory::getSubstitutedTerms(int effort,
                                    const std::vector<Node>& terms,
                                    std::vector<Node>& sterms,
                                    std::vector<std::vector<Node> >& exp)
{
  Trace("extt-debug") << "getSubstitutedTerms for " << terms.size() << " / "
                      << d_ext_func_terms.size() << " extended functions."
                      << std::endl;
  if (!terms.empty())
  {
    // all variables we need to find a substitution for
    std::vector<Node> vars;
    std::vector<Node> sub;
    std::map<Node, std::vector<Node> > expc;
    for (const Node& n : terms)
    {
      // do substitution, rewrite
      std::map<Node, ExtfInfo>::iterator iti = d_extf_info.find(n);
      Assert(iti != d_extf_info.end());
      for (const Node& v : iti->second.d_vars)
      {
        if (std::find(vars.begin(), vars.end(), v) == vars.end())
        {
          vars.push_back(v);
        }
      }
    }
    bool useSubs = d_parent.getCurrentSubstitution(effort, vars, sub, expc);
    // get the current substitution for all variables
    Assert(!useSubs || vars.size() == sub.size());
    for (const Node& n : terms)
    {
      Node ns = n;
      std::vector<Node> expn;
      if (useSubs)
      {
        // do substitution
        ns = n.substitute(vars.begin(), vars.end(), sub.begin(), sub.end());
        if (ns != n)
        {
          // build explanation: explanation vars = sub for each vars in FV(n)
          std::map<Node, ExtfInfo>::iterator iti = d_extf_info.find(n);
          Assert(iti != d_extf_info.end());
          for (const Node& v : iti->second.d_vars)
          {
            std::map<Node, std::vector<Node> >::iterator itx = expc.find(v);
            if (itx != expc.end())
            {
              for (const Node& e : itx->second)
              {
                if (std::find(expn.begin(), expn.end(), e) == expn.end())
                {
                  expn.push_back(e);
                }
              }
            }
          }
        }
        Trace("extt-debug") << "  have " << n << " == " << ns
                            << ", exp size=" << expn.size() << "." << std::endl;
      }
      // add to vector
      sterms.push_back(ns);
      exp.push_back(expn);
    }
  }
}

bool ExtTheory::doInferencesInternal(int effort,
                                     const std::vector<Node>& terms,
                                     std::vector<Node>& nred,
                                     bool batch,
                                     bool isRed)
{
  if (batch)
  {
    bool addedLemma = false;
    if (isRed)
    {
      for (const Node& n : terms)
      {
        Node nr;
        // note: could do reduction with substitution here
        bool satDep = false;
        if (!d_parent.getReduction(effort, n, nr, satDep))
        {
          nred.push_back(n);
        }
        else
        {
          if (!nr.isNull() && n != nr)
          {
            Node lem = NodeManager::currentNM()->mkNode(kind::EQUAL, n, nr);
            if (sendLemma(lem, InferenceId::EXTT_SIMPLIFY, true))
            {
              Trace("extt-lemma")
                  << "ExtTheory : reduction lemma : " << lem << std::endl;
              addedLemma = true;
            }
          }
          markReduced(n, ExtReducedId::REDUCTION, satDep);
        }
      }
    }
    else
    {
      std::vector<Node> sterms;
      std::vector<std::vector<Node> > exp;
      getSubstitutedTerms(effort, terms, sterms, exp);
      std::map<Node, unsigned> sterm_index;
      NodeManager* nm = NodeManager::currentNM();
      for (unsigned i = 0, size = terms.size(); i < size; i++)
      {
        bool processed = false;
        if (sterms[i] != terms[i])
        {
          Node sr = rewrite(sterms[i]);
          // ask the theory if this term is reduced, e.g. is it constant or it
          // is a non-extf term.
          ExtReducedId id;
          if (d_parent.isExtfReduced(effort, sr, terms[i], exp[i], id))
          {
            processed = true;
            markReduced(terms[i], id);
            // We have exp[i] => terms[i] = sr, convert this to a clause.
            // This ensures the proof infrastructure can process this as a
            // normal theory lemma.
            Node eq = terms[i].eqNode(sr);
            Node lem = eq;
            if (!exp[i].empty())
            {
              std::vector<Node> eei;
              for (const Node& e : exp[i])
              {
                eei.push_back(e.negate());
              }
              eei.push_back(eq);
              lem = nm->mkNode(kind::OR, eei);
            }

            Trace("extt-debug") << "ExtTheory::doInferences : infer : " << eq
                                << " by " << exp[i] << std::endl;
            Trace("extt-debug") << "...send lemma " << lem << std::endl;
            if (sendLemma(lem, InferenceId::EXTT_SIMPLIFY))
            {
              Trace("extt-lemma")
                  << "ExtTheory : substitution + rewrite lemma : " << lem
                  << std::endl;
              addedLemma = true;
            }
          }
          else
          {
            // check if we have already reduced this
            std::map<Node, unsigned>::iterator itsi = sterm_index.find(sr);
            if (itsi == sterm_index.end())
            {
              sterm_index[sr] = i;
            }
            else
            {
              // unsigned j = itsi->second;
              // note : can add (non-reducing) lemma :
              //   exp[j] ^ exp[i] => sterms[i] = sterms[j]
            }

            Trace("extt-nred") << "Non-reduced term : " << sr << std::endl;
          }
        }
        else
        {
          Trace("extt-nred") << "Non-reduced term : " << sterms[i] << std::endl;
        }
        if (!processed)
        {
          nred.push_back(terms[i]);
        }
      }
    }
    return addedLemma;
  }
  // non-batch
  std::vector<Node> nnred;
  if (terms.empty())
  {
    for (NodeBoolMap::iterator it = d_ext_func_terms.begin();
         it != d_ext_func_terms.end();
         ++it)
    {
      if ((*it).second && !isContextIndependentInactive((*it).first))
      {
        std::vector<Node> nterms;
        nterms.push_back((*it).first);
        if (doInferencesInternal(effort, nterms, nnred, true, isRed))
        {
          return true;
        }
      }
    }
  }
  else
  {
    for (const Node& n : terms)
    {
      std::vector<Node> nterms;
      nterms.push_back(n);
      if (doInferencesInternal(effort, nterms, nnred, true, isRed))
      {
        return true;
      }
    }
  }
  return false;
}

bool ExtTheory::sendLemma(Node lem, InferenceId id, bool preprocess)
{
  if (preprocess)
  {
    if (d_pp_lemmas.find(lem) == d_pp_lemmas.end())
    {
      d_pp_lemmas.insert(lem);
      d_im.lemma(lem, id);
      return true;
    }
  }
  else
  {
    if (d_lemmas.find(lem) == d_lemmas.end())
    {
      d_lemmas.insert(lem);
      d_im.lemma(lem, id);
      return true;
    }
  }
  return false;
}

bool ExtTheory::doInferences(int effort,
                             const std::vector<Node>& terms,
                             std::vector<Node>& nred,
                             bool batch)
{
  if (!terms.empty())
  {
    return doInferencesInternal(effort, terms, nred, batch, false);
  }
  return false;
}

bool ExtTheory::doInferences(int effort, std::vector<Node>& nred, bool batch)
{
  std::vector<Node> terms = getActive();
  return doInferencesInternal(effort, terms, nred, batch, false);
}

bool ExtTheory::doReductions(int effort,
                             const std::vector<Node>& terms,
                             std::vector<Node>& nred,
                             bool batch)
{
  if (!terms.empty())
  {
    return doInferencesInternal(effort, terms, nred, batch, true);
  }
  return false;
}

bool ExtTheory::doReductions(int effort, std::vector<Node>& nred, bool batch)
{
  const std::vector<Node> terms = getActive();
  return doInferencesInternal(effort, terms, nred, batch, true);
}

// Register term.
void ExtTheory::registerTerm(Node n)
{
  if (d_extf_kind.find(n.getKind()) != d_extf_kind.end())
  {
    if (d_ext_func_terms.find(n) == d_ext_func_terms.end())
    {
      Trace("extt-debug") << "Found extended function : " << n << std::endl;
      d_ext_func_terms[n] = true;
      d_has_extf = n;
      d_extf_info[n].d_vars = collectVars(n);
    }
  }
}

// mark reduced
void ExtTheory::markReduced(Node n, ExtReducedId rid, bool satDep)
{
  Trace("extt-debug") << "Mark reduced " << n << std::endl;
  registerTerm(n);
  Assert(d_ext_func_terms.find(n) != d_ext_func_terms.end());
  d_ext_func_terms[n] = false;
  d_extfExtReducedIdMap[n] = rid;
  if (!satDep)
  {
    d_ci_inactive[n] = rid;
  }

  // update has_extf
  if (d_has_extf.get() == n)
  {
    for (NodeBoolMap::iterator it = d_ext_func_terms.begin();
         it != d_ext_func_terms.end();
         ++it)
    {
      // if not already reduced
      if ((*it).second && !isContextIndependentInactive((*it).first))
      {
        d_has_extf = (*it).first;
      }
    }
  }
}

bool ExtTheory::isContextIndependentInactive(Node n) const
{
  ExtReducedId rid = ExtReducedId::UNKNOWN;
  return isContextIndependentInactive(n, rid);
}

bool ExtTheory::isContextIndependentInactive(Node n, ExtReducedId& rid) const
{
  NodeExtReducedIdMap::iterator it = d_ci_inactive.find(n);
  if (it != d_ci_inactive.end())
  {
    rid = it->second;
    return true;
  }
  return false;
}

void ExtTheory::getTerms(std::vector<Node>& terms)
{
  for (NodeBoolMap::iterator it = d_ext_func_terms.begin();
       it != d_ext_func_terms.end();
       ++it)
  {
    terms.push_back((*it).first);
  }
}

bool ExtTheory::hasActiveTerm() const { return !d_has_extf.get().isNull(); }

bool ExtTheory::isActive(Node n) const
{
  ExtReducedId rid = ExtReducedId::UNKNOWN;
  return isActive(n, rid);
}

bool ExtTheory::isActive(Node n, ExtReducedId& rid) const
{
  NodeBoolMap::const_iterator it = d_ext_func_terms.find(n);
  if (it != d_ext_func_terms.end())
  {
    if ((*it).second)
    {
      return !isContextIndependentInactive(n, rid);
    }
    NodeExtReducedIdMap::const_iterator itr = d_extfExtReducedIdMap.find(n);
    Assert(itr != d_extfExtReducedIdMap.end());
    rid = itr->second;
    return false;
  }
  return false;
}

// get active
std::vector<Node> ExtTheory::getActive() const
{
  std::vector<Node> active;
  for (NodeBoolMap::iterator it = d_ext_func_terms.begin();
       it != d_ext_func_terms.end();
       ++it)
  {
    // if not already reduced
    if ((*it).second && !isContextIndependentInactive((*it).first))
    {
      active.push_back((*it).first);
    }
  }
  return active;
}

std::vector<Node> ExtTheory::getActive(Kind k) const
{
  std::vector<Node> active;
  for (NodeBoolMap::iterator it = d_ext_func_terms.begin();
       it != d_ext_func_terms.end();
       ++it)
  {
    // if not already reduced
    if ((*it).first.getKind() == k && (*it).second
        && !isContextIndependentInactive((*it).first))
    {
      active.push_back((*it).first);
    }
  }
  return active;
}

}  // namespace theory
}  // namespace cvc5


Generated by: GCOVR (Version 3.2)

Line	Exec	Source
1		/******************************************************************************
2		* Top contributors (to current version):
3		* Andrew Reynolds, Tim King
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		* Extended theory interface.
14		*
15		* This implements a generic module, used by theory solvers, for performing
16		* "context-dependent simplification", as described in Reynolds et al
17		* "Designing Theory Solvers with Extensions", FroCoS 2017.
18		*/
19
20		#include "theory/ext_theory.h"
21
22		#include "base/check.h"
23		#include "smt/smt_statistics_registry.h"
24		#include "theory/output_channel.h"
25		#include "theory/quantifiers_engine.h"
26		#include "theory/rewriter.h"
27		#include "theory/substitutions.h"
28
29		using namespace std;
30
31		namespace cvc5 {
32		namespace theory {
33
34		const char* toString(ExtReducedId id)
35		{
36		switch (id)
37		{
38		case ExtReducedId::SR_CONST: return "SR_CONST";
39		case ExtReducedId::REDUCTION: return "REDUCTION";
40		case ExtReducedId::ARITH_SR_ZERO: return "ARITH_SR_ZERO";
41		case ExtReducedId::ARITH_SR_LINEAR: return "ARITH_SR_LINEAR";
42		case ExtReducedId::STRINGS_SR_CONST: return "STRINGS_SR_CONST";
43		case ExtReducedId::STRINGS_NEG_CTN_DEQ: return "STRINGS_NEG_CTN_DEQ";
44		case ExtReducedId::STRINGS_POS_CTN: return "STRINGS_POS_CTN";
45		case ExtReducedId::STRINGS_CTN_DECOMPOSE: return "STRINGS_CTN_DECOMPOSE";
46		case ExtReducedId::STRINGS_REGEXP_INTER: return "STRINGS_REGEXP_INTER";
47		case ExtReducedId::STRINGS_REGEXP_INTER_SUBSUME:
48		return "STRINGS_REGEXP_INTER_SUBSUME";
49		case ExtReducedId::STRINGS_REGEXP_INCLUDE: return "STRINGS_REGEXP_INCLUDE";
50		case ExtReducedId::STRINGS_REGEXP_INCLUDE_NEG:
51		return "STRINGS_REGEXP_INCLUDE_NEG";
52		default: return "?ExtReducedId?";
53		}
54		}
55
56		std::ostream& operator<<(std::ostream& out, ExtReducedId id)
57		{
58		out << toString(id);
59		return out;
60		}
61
62		bool ExtTheoryCallback::getCurrentSubstitution(
63		int effort,
64		const std::vector<Node>& vars,
65		std::vector<Node>& subs,
66		std::map<Node, std::vector<Node> >& exp)
67		{
68		return false;
69		}
70		bool ExtTheoryCallback::isExtfReduced(
71		int effort, Node n, Node on, std::vector<Node>& exp, ExtReducedId& id)
72		{
73		id = ExtReducedId::SR_CONST;
74		return n.isConst();
75		}
76		bool ExtTheoryCallback::getReduction(int effort,
77		Node n,
78		Node& nr,
79		bool& isSatDep)
80		{
81		return false;
82		}
83
84	24968	ExtTheory::ExtTheory(Env& env, ExtTheoryCallback& p, TheoryInferenceManager& im)
85		: EnvObj(env),
86		d_parent(p),
87		d_im(im),
88		d_ext_func_terms(context()),
89		d_extfExtReducedIdMap(context()),
90	24968	d_ci_inactive(userContext()),
91		d_has_extf(context()),
92	24968	d_lemmas(userContext()),
93	74904	d_pp_lemmas(userContext())
94		{
95	24968	d_true = NodeManager::currentNM()->mkConst(true);
96	24968	}
97
98		// Gets all leaf terms in n.
99	18835	std::vector<Node> ExtTheory::collectVars(Node n)
100		{
101	18835	std::vector<Node> vars;
102	37670	std::set<Node> visited;
103	37670	std::vector<Node> worklist;
104	18835	worklist.push_back(n);
105	252429	while (!worklist.empty())
106		{
107	195249	Node current = worklist.back();
108	116797	worklist.pop_back();
109	116797	if (current.isConst() \|\| visited.count(current) > 0)
110		{
111	38345	continue;
112		}
113	78452	visited.insert(current);
114		// Treat terms not belonging to this theory as leaf
115		// note : chould include terms not belonging to this theory
116		// (commented below)
117	78452	if (current.getNumChildren() > 0)
118		{
119	50183	worklist.insert(worklist.end(), current.begin(), current.end());
120		}
121		else
122		{
123	28269	vars.push_back(current);
124		}
125		}
126	37670	return vars;
127		}
128
129		Node ExtTheory::getSubstitutedTerm(int effort,
130		Node term,
131		std::vector<Node>& exp)
132		{
133		std::vector<Node> terms;
134		terms.push_back(term);
135		std::vector<Node> sterms;
136		std::vector<std::vector<Node> > exps;
137		getSubstitutedTerms(effort, terms, sterms, exps);
138		Assert(sterms.size() == 1);
139		Assert(exps.size() == 1);
140		exp.insert(exp.end(), exps[0].begin(), exps[0].end());
141		return sterms[0];
142		}
143
144		// do inferences
145	41956	void ExtTheory::getSubstitutedTerms(int effort,
146		const std::vector<Node>& terms,
147		std::vector<Node>& sterms,
148		std::vector<std::vector<Node> >& exp)
149		{
150	83912	Trace("extt-debug") << "getSubstitutedTerms for " << terms.size() << " / "
151	83912	<< d_ext_func_terms.size() << " extended functions."
152	41956	<< std::endl;
153	41956	if (!terms.empty())
154		{
155		// all variables we need to find a substitution for
156	9892	std::vector<Node> vars;
157	9892	std::vector<Node> sub;
158	9892	std::map<Node, std::vector<Node> > expc;
159	41542	for (const Node& n : terms)
160		{
161		// do substitution, rewrite
162	36596	std::map<Node, ExtfInfo>::iterator iti = d_extf_info.find(n);
163	36596	Assert(iti != d_extf_info.end());
164	97714	for (const Node& v : iti->second.d_vars)
165		{
166	61118	if (std::find(vars.begin(), vars.end(), v) == vars.end())
167		{
168	26874	vars.push_back(v);
169		}
170		}
171		}
172	4946	bool useSubs = d_parent.getCurrentSubstitution(effort, vars, sub, expc);
173		// get the current substitution for all variables
174	4946	Assert(!useSubs \|\| vars.size() == sub.size());
175	41542	for (const Node& n : terms)
176		{
177	73192	Node ns = n;
178	73192	std::vector<Node> expn;
179	36596	if (useSubs)
180		{
181		// do substitution
182	23173	ns = n.substitute(vars.begin(), vars.end(), sub.begin(), sub.end());
183	23173	if (ns != n)
184		{
185		// build explanation: explanation vars = sub for each vars in FV(n)
186	6691	std::map<Node, ExtfInfo>::iterator iti = d_extf_info.find(n);
187	6691	Assert(iti != d_extf_info.end());
188	19168	for (const Node& v : iti->second.d_vars)
189		{
190	12477	std::map<Node, std::vector<Node> >::iterator itx = expc.find(v);
191	12477	if (itx != expc.end())
192		{
193	14812	for (const Node& e : itx->second)
194		{
195	7406	if (std::find(expn.begin(), expn.end(), e) == expn.end())
196		{
197	7406	expn.push_back(e);
198		}
199		}
200		}
201		}
202		}
203	46346	Trace("extt-debug") << " have " << n << " == " << ns
204	23173	<< ", exp size=" << expn.size() << "." << std::endl;
205		}
206		// add to vector
207	36596	sterms.push_back(ns);
208	36596	exp.push_back(expn);
209		}
210		}
211	41956	}
212
213	41956	bool ExtTheory::doInferencesInternal(int effort,
214		const std::vector<Node>& terms,
215		std::vector<Node>& nred,
216		bool batch,
217		bool isRed)
218		{
219	41956	if (batch)
220		{
221	41956	bool addedLemma = false;
222	41956	if (isRed)
223		{
224		for (const Node& n : terms)
225		{
226		Node nr;
227		// note: could do reduction with substitution here
228		bool satDep = false;
229		if (!d_parent.getReduction(effort, n, nr, satDep))
230		{
231		nred.push_back(n);
232		}
233		else
234		{
235		if (!nr.isNull() && n != nr)
236		{
237		Node lem = NodeManager::currentNM()->mkNode(kind::EQUAL, n, nr);
238		if (sendLemma(lem, InferenceId::EXTT_SIMPLIFY, true))
239		{
240		Trace("extt-lemma")
241		<< "ExtTheory : reduction lemma : " << lem << std::endl;
242		addedLemma = true;
243		}
244		}
245		markReduced(n, ExtReducedId::REDUCTION, satDep);
246		}
247		}
248		}
249		else
250		{
251	83912	std::vector<Node> sterms;
252	83912	std::vector<std::vector<Node> > exp;
253	41956	getSubstitutedTerms(effort, terms, sterms, exp);
254	83912	std::map<Node, unsigned> sterm_index;
255	41956	NodeManager* nm = NodeManager::currentNM();
256	78552	for (unsigned i = 0, size = terms.size(); i < size; i++)
257		{
258	36596	bool processed = false;
259	36596	if (sterms[i] != terms[i])
260		{
261	13382	Node sr = rewrite(sterms[i]);
262		// ask the theory if this term is reduced, e.g. is it constant or it
263		// is a non-extf term.
264		ExtReducedId id;
265	6691	if (d_parent.isExtfReduced(effort, sr, terms[i], exp[i], id))
266		{
267	5665	processed = true;
268	5665	markReduced(terms[i], id);
269		// We have exp[i] => terms[i] = sr, convert this to a clause.
270		// This ensures the proof infrastructure can process this as a
271		// normal theory lemma.
272	11330	Node eq = terms[i].eqNode(sr);
273	11330	Node lem = eq;
274	5665	if (!exp[i].empty())
275		{
276	11330	std::vector<Node> eei;
277	11719	for (const Node& e : exp[i])
278		{
279	6054	eei.push_back(e.negate());
280		}
281	5665	eei.push_back(eq);
282	5665	lem = nm->mkNode(kind::OR, eei);
283		}
284
285	11330	Trace("extt-debug") << "ExtTheory::doInferences : infer : " << eq
286	5665	<< " by " << exp[i] << std::endl;
287	5665	Trace("extt-debug") << "...send lemma " << lem << std::endl;
288	5665	if (sendLemma(lem, InferenceId::EXTT_SIMPLIFY))
289		{
290	3188	Trace("extt-lemma")
291	1594	<< "ExtTheory : substitution + rewrite lemma : " << lem
292	1594	<< std::endl;
293	1594	addedLemma = true;
294		}
295		}
296		else
297		{
298		// check if we have already reduced this
299	1026	std::map<Node, unsigned>::iterator itsi = sterm_index.find(sr);
300	1026	if (itsi == sterm_index.end())
301		{
302	782	sterm_index[sr] = i;
303		}
304		else
305		{
306		// unsigned j = itsi->second;
307		// note : can add (non-reducing) lemma :
308		// exp[j] ^ exp[i] => sterms[i] = sterms[j]
309		}
310
311	1026	Trace("extt-nred") << "Non-reduced term : " << sr << std::endl;
312		}
313		}
314		else
315		{
316	29905	Trace("extt-nred") << "Non-reduced term : " << sterms[i] << std::endl;
317		}
318	36596	if (!processed)
319		{
320	30931	nred.push_back(terms[i]);
321		}
322		}
323		}
324	41956	return addedLemma;
325		}
326		// non-batch
327		std::vector<Node> nnred;
328		if (terms.empty())
329		{
330		for (NodeBoolMap::iterator it = d_ext_func_terms.begin();
331		it != d_ext_func_terms.end();
332		++it)
333		{
334		if ((it).second && !isContextIndependentInactive((it).first))
335		{
336		std::vector<Node> nterms;
337		nterms.push_back((*it).first);
338		if (doInferencesInternal(effort, nterms, nnred, true, isRed))
339		{
340		return true;
341		}
342		}
343		}
344		}
345		else
346		{
347		for (const Node& n : terms)
348		{
349		std::vector<Node> nterms;
350		nterms.push_back(n);
351		if (doInferencesInternal(effort, nterms, nnred, true, isRed))
352		{
353		return true;
354		}
355		}
356		}
357		return false;
358		}
359
360	5665	bool ExtTheory::sendLemma(Node lem, InferenceId id, bool preprocess)
361		{
362	5665	if (preprocess)
363		{
364		if (d_pp_lemmas.find(lem) == d_pp_lemmas.end())
365		{
366		d_pp_lemmas.insert(lem);
367		d_im.lemma(lem, id);
368		return true;
369		}
370		}
371		else
372		{
373	5665	if (d_lemmas.find(lem) == d_lemmas.end())
374		{
375	1594	d_lemmas.insert(lem);
376	1594	d_im.lemma(lem, id);
377	1594	return true;
378		}
379		}
380	4071	return false;
381		}
382
383		bool ExtTheory::doInferences(int effort,
384		const std::vector<Node>& terms,
385		std::vector<Node>& nred,
386		bool batch)
387		{
388		if (!terms.empty())
389		{
390		return doInferencesInternal(effort, terms, nred, batch, false);
391		}
392		return false;
393		}
394
395	41956	bool ExtTheory::doInferences(int effort, std::vector<Node>& nred, bool batch)
396		{
397	83912	std::vector<Node> terms = getActive();
398	83912	return doInferencesInternal(effort, terms, nred, batch, false);
399		}
400
401		bool ExtTheory::doReductions(int effort,
402		const std::vector<Node>& terms,
403		std::vector<Node>& nred,
404		bool batch)
405		{
406		if (!terms.empty())
407		{
408		return doInferencesInternal(effort, terms, nred, batch, true);
409		}
410		return false;
411		}
412
413		bool ExtTheory::doReductions(int effort, std::vector<Node>& nred, bool batch)
414		{
415		const std::vector<Node> terms = getActive();
416		return doInferencesInternal(effort, terms, nred, batch, true);
417		}
418
419		// Register term.
420	791798	void ExtTheory::registerTerm(Node n)
421		{
422	791798	if (d_extf_kind.find(n.getKind()) != d_extf_kind.end())
423		{
424	174244	if (d_ext_func_terms.find(n) == d_ext_func_terms.end())
425		{
426	18835	Trace("extt-debug") << "Found extended function : " << n << std::endl;
427	18835	d_ext_func_terms[n] = true;
428	18835	d_has_extf = n;
429	18835	d_extf_info[n].d_vars = collectVars(n);
430		}
431		}
432	791798	}
433
434		// mark reduced
435	155409	void ExtTheory::markReduced(Node n, ExtReducedId rid, bool satDep)
436		{
437	155409	Trace("extt-debug") << "Mark reduced " << n << std::endl;
438	155409	registerTerm(n);
439	155409	Assert(d_ext_func_terms.find(n) != d_ext_func_terms.end());
440	155409	d_ext_func_terms[n] = false;
441	155409	d_extfExtReducedIdMap[n] = rid;
442	155409	if (!satDep)
443		{
444		d_ci_inactive[n] = rid;
445		}
446
447		// update has_extf
448	155409	if (d_has_extf.get() == n)
449		{
450	227894	for (NodeBoolMap::iterator it = d_ext_func_terms.begin();
451	227894	it != d_ext_func_terms.end();
452		++it)
453		{
454		// if not already reduced
455	218977	if ((it).second && !isContextIndependentInactive((it).first))
456		{
457	80595	d_has_extf = (*it).first;
458		}
459		}
460		}
461	155409	}
462
463	931659	bool ExtTheory::isContextIndependentInactive(Node n) const
464		{
465	931659	ExtReducedId rid = ExtReducedId::UNKNOWN;
466	931659	return isContextIndependentInactive(n, rid);
467		}
468
469	1336051	bool ExtTheory::isContextIndependentInactive(Node n, ExtReducedId& rid) const
470		{
471	1336051	NodeExtReducedIdMap::iterator it = d_ci_inactive.find(n);
472	1336051	if (it != d_ci_inactive.end())
473		{
474		rid = it->second;
475		return true;
476		}
477	1336051	return false;
478		}
479
480	4881	void ExtTheory::getTerms(std::vector<Node>& terms)
481		{
482	42325	for (NodeBoolMap::iterator it = d_ext_func_terms.begin();
483	42325	it != d_ext_func_terms.end();
484		++it)
485		{
486	37444	terms.push_back((*it).first);
487		}
488	4881	}
489
490		bool ExtTheory::hasActiveTerm() const { return !d_has_extf.get().isNull(); }
491
492	404392	bool ExtTheory::isActive(Node n) const
493		{
494	404392	ExtReducedId rid = ExtReducedId::UNKNOWN;
495	404392	return isActive(n, rid);
496		}
497
498	404392	bool ExtTheory::isActive(Node n, ExtReducedId& rid) const
499		{
500	404392	NodeBoolMap::const_iterator it = d_ext_func_terms.find(n);
501	404392	if (it != d_ext_func_terms.end())
502		{
503	404392	if ((*it).second)
504		{
505	404392	return !isContextIndependentInactive(n, rid);
506		}
507		NodeExtReducedIdMap::const_iterator itr = d_extfExtReducedIdMap.find(n);
508		Assert(itr != d_extfExtReducedIdMap.end());
509		rid = itr->second;
510		return false;
511		}
512		return false;
513		}
514
515		// get active
516	127230	std::vector<Node> ExtTheory::getActive() const
517		{
518	127230	std::vector<Node> active;
519	1423149	for (NodeBoolMap::iterator it = d_ext_func_terms.begin();
520	1423149	it != d_ext_func_terms.end();
521		++it)
522		{
523		// if not already reduced
524	1295919	if ((it).second && !isContextIndependentInactive((it).first))
525		{
526	849529	active.push_back((*it).first);
527		}
528		}
529	127230	return active;
530		}
531
532	10650	std::vector<Node> ExtTheory::getActive(Kind k) const
533		{
534	10650	std::vector<Node> active;
535	38317	for (NodeBoolMap::iterator it = d_ext_func_terms.begin();
536	38317	it != d_ext_func_terms.end();
537		++it)
538		{
539		// if not already reduced
540	62986	if ((it).first.getKind() == k && (it).second
541	56869	&& !isContextIndependentInactive((*it).first))
542		{
543	1535	active.push_back((*it).first);
544		}
545		}
546	10650	return active;
547		}
548
549		} // namespace theory
550	31137	} // namespace cvc5