Head

GCC Code Coverage Report

Directory:	.		Exec	Total	Coverage
File:	src/theory/arith/theory_arith.cpp	Lines:	133	146	91.1 %
Date:	2021-08-17	Branches:	168	386	43.5 %


/******************************************************************************
 * Top contributors (to current version):
 *   Andrew Reynolds, Tim King, Alex Ozdemir
 *
 * 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.
 * ****************************************************************************
 *
 * Arithmetic theory.
 */

#include "theory/arith/theory_arith.h"

#include "options/smt_options.h"
#include "proof/proof_checker.h"
#include "proof/proof_rule.h"
#include "smt/smt_statistics_registry.h"
#include "theory/arith/arith_rewriter.h"
#include "theory/arith/equality_solver.h"
#include "theory/arith/infer_bounds.h"
#include "theory/arith/nl/nonlinear_extension.h"
#include "theory/arith/theory_arith_private.h"
#include "theory/ext_theory.h"
#include "theory/rewriter.h"
#include "theory/theory_model.h"

using namespace std;
using namespace cvc5::kind;

namespace cvc5 {
namespace theory {
namespace arith {

TheoryArith::TheoryArith(Env& env, OutputChannel& out, Valuation valuation)
    : Theory(THEORY_ARITH, env, out, valuation),
      d_ppRewriteTimer(smtStatisticsRegistry().registerTimer(
          "theory::arith::ppRewriteTimer")),
      d_astate(env, valuation),
      d_im(*this, d_astate, d_pnm),
      d_ppre(getSatContext(), d_pnm),
      d_bab(d_astate, d_im, d_ppre, d_pnm),
      d_eqSolver(nullptr),
      d_internal(new TheoryArithPrivate(
          *this, getSatContext(), getUserContext(), d_bab, d_pnm)),
      d_nonlinearExtension(nullptr),
      d_opElim(d_pnm, getLogicInfo()),
      d_arithPreproc(d_astate, d_im, d_pnm, d_opElim),
      d_rewriter(d_opElim)
{
  // currently a cyclic dependency to TheoryArithPrivate
  d_astate.setParent(d_internal);
  // indicate we are using the theory state object and inference manager
  d_theoryState = &d_astate;
  d_inferManager = &d_im;

  if (options::arithEqSolver())
  {
    d_eqSolver.reset(new EqualitySolver(d_astate, d_im));
  }
}

TheoryArith::~TheoryArith(){
  delete d_internal;
}

TheoryRewriter* TheoryArith::getTheoryRewriter() { return &d_rewriter; }

ProofRuleChecker* TheoryArith::getProofChecker()
{
  return d_internal->getProofChecker();
}

bool TheoryArith::needsEqualityEngine(EeSetupInfo& esi)
{
  // if the equality solver is enabled, then it is responsible for setting
  // up the equality engine
  if (d_eqSolver != nullptr)
  {
    return d_eqSolver->needsEqualityEngine(esi);
  }
  // otherwise, the linear arithmetic solver is responsible for setting up
  // the equality engine
  return d_internal->needsEqualityEngine(esi);
}
void TheoryArith::finishInit()
{
  if (getLogicInfo().isTheoryEnabled(THEORY_ARITH)
      && getLogicInfo().areTranscendentalsUsed())
  {
    // witness is used to eliminate square root
    d_valuation.setUnevaluatedKind(kind::WITNESS);
    // we only need to add the operators that are not syntax sugar
    d_valuation.setUnevaluatedKind(kind::EXPONENTIAL);
    d_valuation.setUnevaluatedKind(kind::SINE);
    d_valuation.setUnevaluatedKind(kind::PI);
  }
  // only need to create nonlinear extension if non-linear logic
  const LogicInfo& logicInfo = getLogicInfo();
  if (logicInfo.isTheoryEnabled(THEORY_ARITH) && !logicInfo.isLinear())
  {
    d_nonlinearExtension.reset(
        new nl::NonlinearExtension(*this, d_astate, d_equalityEngine, d_pnm));
  }
  if (d_eqSolver != nullptr)
  {
    d_eqSolver->finishInit();
  }
  // finish initialize in the old linear solver
  d_internal->finishInit();
}

void TheoryArith::preRegisterTerm(TNode n)
{
  if (d_nonlinearExtension != nullptr)
  {
    d_nonlinearExtension->preRegisterTerm(n);
  }
  d_internal->preRegisterTerm(n);
}

void TheoryArith::notifySharedTerm(TNode n) { d_internal->notifySharedTerm(n); }

TrustNode TheoryArith::ppRewrite(TNode atom, std::vector<SkolemLemma>& lems)
{
  CodeTimer timer(d_ppRewriteTimer, /* allow_reentrant = */ true);
  Debug("arith::preprocess") << "arith::preprocess() : " << atom << endl;

  if (atom.getKind() == kind::EQUAL)
  {
    return d_ppre.ppRewriteEq(atom);
  }
  Assert(Theory::theoryOf(atom) == THEORY_ARITH);
  // Eliminate operators. Notice we must do this here since other
  // theories may generate lemmas that involve non-standard operators. For
  // example, quantifier instantiation may use TO_INTEGER terms; SyGuS may
  // introduce non-standard arithmetic terms appearing in grammars.
  // call eliminate operators. In contrast to expandDefinitions, we eliminate
  // *all* extended arithmetic operators here, including total ones.
  return d_arithPreproc.eliminate(atom, lems, false);
}

Theory::PPAssertStatus TheoryArith::ppAssert(
    TrustNode tin, TrustSubstitutionMap& outSubstitutions)
{
  return d_internal->ppAssert(tin, outSubstitutions);
}

void TheoryArith::ppStaticLearn(TNode n, NodeBuilder& learned)
{
  d_internal->ppStaticLearn(n, learned);
}

bool TheoryArith::preCheck(Effort level)
{
  Trace("arith-check") << "TheoryArith::preCheck " << level << std::endl;
  return d_internal->preCheck(level);
}

void TheoryArith::postCheck(Effort level)
{
  Trace("arith-check") << "TheoryArith::postCheck " << level << std::endl;
  // check with the non-linear solver at last call
  if (level == Theory::EFFORT_LAST_CALL)
  {
    if (d_nonlinearExtension != nullptr)
    {
      d_nonlinearExtension->check(level);
    }
    return;
  }
  // otherwise, check with the linear solver
  if (d_internal->postCheck(level))
  {
    // linear solver emitted a conflict or lemma, return
    return;
  }

  if (Theory::fullEffort(level))
  {
    if (d_nonlinearExtension != nullptr)
    {
      d_nonlinearExtension->check(level);
    }
    else if (d_internal->foundNonlinear())
    {
      // set incomplete
      d_im.setIncomplete(IncompleteId::ARITH_NL_DISABLED);
    }
  }
}

bool TheoryArith::preNotifyFact(
    TNode atom, bool pol, TNode fact, bool isPrereg, bool isInternal)
{
  Trace("arith-check") << "TheoryArith::preNotifyFact: " << fact
                       << ", isPrereg=" << isPrereg
                       << ", isInternal=" << isInternal << std::endl;
  // We do not assert to the equality engine of arithmetic in the standard way,
  // hence we return "true" to indicate we are finished with this fact.
  bool ret = true;
  if (d_eqSolver != nullptr)
  {
    // the equality solver may indicate ret = false, after which the assertion
    // will be asserted to the equality engine in the default way.
    ret = d_eqSolver->preNotifyFact(atom, pol, fact, isPrereg, isInternal);
  }
  // we also always also notify the internal solver
  d_internal->preNotifyFact(atom, pol, fact);
  return ret;
}

bool TheoryArith::needsCheckLastEffort() {
  if (d_nonlinearExtension != nullptr)
  {
    return d_nonlinearExtension->needsCheckLastEffort();
  }
  return false;
}

TrustNode TheoryArith::explain(TNode n)
{
  if (d_eqSolver != nullptr)
  {
    // if the equality solver has an explanation for it, use it
    TrustNode texp = d_eqSolver->explain(n);
    if (!texp.isNull())
    {
      return texp;
    }
  }
  return d_internal->explain(n);
}

void TheoryArith::propagate(Effort e) {
  d_internal->propagate(e);
}

bool TheoryArith::collectModelInfo(TheoryModel* m,
                                   const std::set<Node>& termSet)
{
  // this overrides behavior to not assert equality engine
  return collectModelValues(m, termSet);
}

bool TheoryArith::collectModelValues(TheoryModel* m,
                                     const std::set<Node>& termSet)
{
  // get the model from the linear solver
  std::map<Node, Node> arithModel;
  d_internal->collectModelValues(termSet, arithModel);
  // Double check that the model from the linear solver respects integer types,
  // if it does not, add a branch and bound lemma. This typically should never
  // be necessary, but is needed in rare cases.
  bool addedLemma = false;
  bool badAssignment = false;
  for (const std::pair<const Node, Node>& p : arithModel)
  {
    if (p.first.getType().isInteger() && !p.second.getType().isInteger())
    {
      Assert(false) << "TheoryArithPrivate generated a bad model value for "
                       "integer variable "
                    << p.first << " : " << p.second;
      // must branch and bound
      TrustNode lem =
          d_bab.branchIntegerVariable(p.first, p.second.getConst<Rational>());
      if (d_im.trustedLemma(lem, InferenceId::ARITH_BB_LEMMA))
      {
        addedLemma = true;
      }
      badAssignment = true;
    }
  }
  if (addedLemma)
  {
    // we had to add a branch and bound lemma since the linear solver assigned
    // a non-integer value to an integer variable.
    return false;
  }
  // this would imply that linear arithmetic's model failed to satisfy a branch
  // and bound lemma
  AlwaysAssert(!badAssignment)
      << "Bad assignment from TheoryArithPrivate::collectModelValues, and no "
         "branching lemma was sent";

  // if non-linear is enabled, intercept the model, which may repair its values
  if (d_nonlinearExtension != nullptr)
  {
    // Non-linear may repair values to satisfy non-linear constraints (see
    // documentation for NonlinearExtension::interceptModel).
    d_nonlinearExtension->interceptModel(arithModel, termSet);
  }
  // We are now ready to assert the model.
  for (const std::pair<const Node, Node>& p : arithModel)
  {
    // maps to constant of comparable type
    Assert(p.first.getType().isComparableTo(p.second.getType()));
    if (m->assertEquality(p.first, p.second, true))
    {
      continue;
    }
    // If we failed to assert an equality, it is likely due to theory
    // combination, namely the repaired model for non-linear changed
    // an equality status that was agreed upon by both (linear) arithmetic
    // and another theory. In this case, we must add a lemma, or otherwise
    // we would terminate with an invalid model. Thus, we add a splitting
    // lemma of the form ( x = v V x != v ) where v is the model value
    // assigned by the non-linear solver to x.
    if (d_nonlinearExtension != nullptr)
    {
      Node eq = p.first.eqNode(p.second);
      Node lem = NodeManager::currentNM()->mkNode(kind::OR, eq, eq.negate());
      bool added = d_im.lemma(lem, InferenceId::ARITH_SPLIT_FOR_NL_MODEL);
      AlwaysAssert(added) << "The lemma was already in cache. Probably there is something wrong with theory combination...";
    }
    return false;
  }
  return true;
}

void TheoryArith::notifyRestart(){
  d_internal->notifyRestart();
}

void TheoryArith::presolve(){
  d_internal->presolve();
  if (d_nonlinearExtension != nullptr)
  {
    d_nonlinearExtension->presolve();
  }
}

EqualityStatus TheoryArith::getEqualityStatus(TNode a, TNode b) {
  return d_internal->getEqualityStatus(a,b);
}

Node TheoryArith::getModelValue(TNode var) {
  return d_internal->getModelValue( var );
}

std::pair<bool, Node> TheoryArith::entailmentCheck(TNode lit)
{
  ArithEntailmentCheckParameters def;
  def.addLookupRowSumAlgorithms();
  ArithEntailmentCheckSideEffects ase;
  std::pair<bool, Node> res = d_internal->entailmentCheck(lit, def, ase);
  return res;
}
eq::ProofEqEngine* TheoryArith::getProofEqEngine()
{
  return d_im.getProofEqEngine();
}

}  // namespace arith
}  // 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, Alex Ozdemir
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		* Arithmetic theory.
14		*/
15
16		#include "theory/arith/theory_arith.h"
17
18		#include "options/smt_options.h"
19		#include "proof/proof_checker.h"
20		#include "proof/proof_rule.h"
21		#include "smt/smt_statistics_registry.h"
22		#include "theory/arith/arith_rewriter.h"
23		#include "theory/arith/equality_solver.h"
24		#include "theory/arith/infer_bounds.h"
25		#include "theory/arith/nl/nonlinear_extension.h"
26		#include "theory/arith/theory_arith_private.h"
27		#include "theory/ext_theory.h"
28		#include "theory/rewriter.h"
29		#include "theory/theory_model.h"
30
31		using namespace std;
32		using namespace cvc5::kind;
33
34		namespace cvc5 {
35		namespace theory {
36		namespace arith {
37
38	9850	TheoryArith::TheoryArith(Env& env, OutputChannel& out, Valuation valuation)
39		: Theory(THEORY_ARITH, env, out, valuation),
40	9850	d_ppRewriteTimer(smtStatisticsRegistry().registerTimer(
41	19700	"theory::arith::ppRewriteTimer")),
42		d_astate(env, valuation),
43		d_im(*this, d_astate, d_pnm),
44		d_ppre(getSatContext(), d_pnm),
45		d_bab(d_astate, d_im, d_ppre, d_pnm),
46		d_eqSolver(nullptr),
47		d_internal(new TheoryArithPrivate(
48	9850	*this, getSatContext(), getUserContext(), d_bab, d_pnm)),
49		d_nonlinearExtension(nullptr),
50		d_opElim(d_pnm, getLogicInfo()),
51		d_arithPreproc(d_astate, d_im, d_pnm, d_opElim),
52	39400	d_rewriter(d_opElim)
53		{
54		// currently a cyclic dependency to TheoryArithPrivate
55	9850	d_astate.setParent(d_internal);
56		// indicate we are using the theory state object and inference manager
57	9850	d_theoryState = &d_astate;
58	9850	d_inferManager = &d_im;
59
60	9850	if (options::arithEqSolver())
61		{
62	39	d_eqSolver.reset(new EqualitySolver(d_astate, d_im));
63		}
64	9850	}
65
66	29550	TheoryArith::~TheoryArith(){
67	9850	delete d_internal;
68	19700	}
69
70	9850	TheoryRewriter* TheoryArith::getTheoryRewriter() { return &d_rewriter; }
71
72	3766	ProofRuleChecker* TheoryArith::getProofChecker()
73		{
74	3766	return d_internal->getProofChecker();
75		}
76
77	9850	bool TheoryArith::needsEqualityEngine(EeSetupInfo& esi)
78		{
79		// if the equality solver is enabled, then it is responsible for setting
80		// up the equality engine
81	9850	if (d_eqSolver != nullptr)
82		{
83	39	return d_eqSolver->needsEqualityEngine(esi);
84		}
85		// otherwise, the linear arithmetic solver is responsible for setting up
86		// the equality engine
87	9811	return d_internal->needsEqualityEngine(esi);
88		}
89	9850	void TheoryArith::finishInit()
90		{
91	19700	if (getLogicInfo().isTheoryEnabled(THEORY_ARITH)
92	9850	&& getLogicInfo().areTranscendentalsUsed())
93		{
94		// witness is used to eliminate square root
95	4191	d_valuation.setUnevaluatedKind(kind::WITNESS);
96		// we only need to add the operators that are not syntax sugar
97	4191	d_valuation.setUnevaluatedKind(kind::EXPONENTIAL);
98	4191	d_valuation.setUnevaluatedKind(kind::SINE);
99	4191	d_valuation.setUnevaluatedKind(kind::PI);
100		}
101		// only need to create nonlinear extension if non-linear logic
102	9850	const LogicInfo& logicInfo = getLogicInfo();
103	9850	if (logicInfo.isTheoryEnabled(THEORY_ARITH) && !logicInfo.isLinear())
104		{
105	10292	d_nonlinearExtension.reset(
106	5146	new nl::NonlinearExtension(*this, d_astate, d_equalityEngine, d_pnm));
107		}
108	9850	if (d_eqSolver != nullptr)
109		{
110	39	d_eqSolver->finishInit();
111		}
112		// finish initialize in the old linear solver
113	9850	d_internal->finishInit();
114	9850	}
115
116	788601	void TheoryArith::preRegisterTerm(TNode n)
117		{
118	788601	if (d_nonlinearExtension != nullptr)
119		{
120	390164	d_nonlinearExtension->preRegisterTerm(n);
121		}
122	788602	d_internal->preRegisterTerm(n);
123	788600	}
124
125	573583	void TheoryArith::notifySharedTerm(TNode n) { d_internal->notifySharedTerm(n); }
126
127	782000	TrustNode TheoryArith::ppRewrite(TNode atom, std::vector<SkolemLemma>& lems)
128		{
129	1564000	CodeTimer timer(d_ppRewriteTimer, /* allow_reentrant = */ true);
130	782000	Debug("arith::preprocess") << "arith::preprocess() : " << atom << endl;
131
132	782000	if (atom.getKind() == kind::EQUAL)
133		{
134	30336	return d_ppre.ppRewriteEq(atom);
135		}
136	751664	Assert(Theory::theoryOf(atom) == THEORY_ARITH);
137		// Eliminate operators. Notice we must do this here since other
138		// theories may generate lemmas that involve non-standard operators. For
139		// example, quantifier instantiation may use TO_INTEGER terms; SyGuS may
140		// introduce non-standard arithmetic terms appearing in grammars.
141		// call eliminate operators. In contrast to expandDefinitions, we eliminate
142		// all extended arithmetic operators here, including total ones.
143	751670	return d_arithPreproc.eliminate(atom, lems, false);
144		}
145
146	11658	Theory::PPAssertStatus TheoryArith::ppAssert(
147		TrustNode tin, TrustSubstitutionMap& outSubstitutions)
148		{
149	11658	return d_internal->ppAssert(tin, outSubstitutions);
150		}
151
152	105233	void TheoryArith::ppStaticLearn(TNode n, NodeBuilder& learned)
153		{
154	105233	d_internal->ppStaticLearn(n, learned);
155	105233	}
156
157	1601306	bool TheoryArith::preCheck(Effort level)
158		{
159	1601306	Trace("arith-check") << "TheoryArith::preCheck " << level << std::endl;
160	1601306	return d_internal->preCheck(level);
161		}
162
163	1601306	void TheoryArith::postCheck(Effort level)
164		{
165	1601306	Trace("arith-check") << "TheoryArith::postCheck " << level << std::endl;
166		// check with the non-linear solver at last call
167	1601306	if (level == Theory::EFFORT_LAST_CALL)
168		{
169	3013	if (d_nonlinearExtension != nullptr)
170		{
171	3013	d_nonlinearExtension->check(level);
172		}
173	3013	return;
174		}
175		// otherwise, check with the linear solver
176	1598293	if (d_internal->postCheck(level))
177		{
178		// linear solver emitted a conflict or lemma, return
179	53209	return;
180		}
181
182	1545084	if (Theory::fullEffort(level))
183		{
184	60558	if (d_nonlinearExtension != nullptr)
185		{
186	34112	d_nonlinearExtension->check(level);
187		}
188	26446	else if (d_internal->foundNonlinear())
189		{
190		// set incomplete
191		d_im.setIncomplete(IncompleteId::ARITH_NL_DISABLED);
192		}
193		}
194		}
195
196	5692569	bool TheoryArith::preNotifyFact(
197		TNode atom, bool pol, TNode fact, bool isPrereg, bool isInternal)
198		{
199	11385138	Trace("arith-check") << "TheoryArith::preNotifyFact: " << fact
200	5692569	<< ", isPrereg=" << isPrereg
201	5692569	<< ", isInternal=" << isInternal << std::endl;
202		// We do not assert to the equality engine of arithmetic in the standard way,
203		// hence we return "true" to indicate we are finished with this fact.
204	5692569	bool ret = true;
205	5692569	if (d_eqSolver != nullptr)
206		{
207		// the equality solver may indicate ret = false, after which the assertion
208		// will be asserted to the equality engine in the default way.
209	5263	ret = d_eqSolver->preNotifyFact(atom, pol, fact, isPrereg, isInternal);
210		}
211		// we also always also notify the internal solver
212	5692569	d_internal->preNotifyFact(atom, pol, fact);
213	5692569	return ret;
214		}
215
216	18808	bool TheoryArith::needsCheckLastEffort() {
217	18808	if (d_nonlinearExtension != nullptr)
218		{
219	10088	return d_nonlinearExtension->needsCheckLastEffort();
220		}
221	8720	return false;
222		}
223
224	23867	TrustNode TheoryArith::explain(TNode n)
225		{
226	23867	if (d_eqSolver != nullptr)
227		{
228		// if the equality solver has an explanation for it, use it
229	50	TrustNode texp = d_eqSolver->explain(n);
230	25	if (!texp.isNull())
231		{
232		return texp;
233		}
234		}
235	23867	return d_internal->explain(n);
236		}
237
238	2535527	void TheoryArith::propagate(Effort e) {
239	2535527	d_internal->propagate(e);
240	2535527	}
241
242	14564	bool TheoryArith::collectModelInfo(TheoryModel* m,
243		const std::set<Node>& termSet)
244		{
245		// this overrides behavior to not assert equality engine
246	14564	return collectModelValues(m, termSet);
247		}
248
249	14564	bool TheoryArith::collectModelValues(TheoryModel* m,
250		const std::set<Node>& termSet)
251		{
252		// get the model from the linear solver
253	29128	std::map<Node, Node> arithModel;
254	14564	d_internal->collectModelValues(termSet, arithModel);
255		// Double check that the model from the linear solver respects integer types,
256		// if it does not, add a branch and bound lemma. This typically should never
257		// be necessary, but is needed in rare cases.
258	14564	bool addedLemma = false;
259	14564	bool badAssignment = false;
260	255997	for (const std::pair<const Node, Node>& p : arithModel)
261		{
262	241433	if (p.first.getType().isInteger() && !p.second.getType().isInteger())
263		{
264		Assert(false) << "TheoryArithPrivate generated a bad model value for "
265		"integer variable "
266		<< p.first << " : " << p.second;
267		// must branch and bound
268		TrustNode lem =
269		d_bab.branchIntegerVariable(p.first, p.second.getConst<Rational>());
270		if (d_im.trustedLemma(lem, InferenceId::ARITH_BB_LEMMA))
271		{
272		addedLemma = true;
273		}
274		badAssignment = true;
275		}
276		}
277	14564	if (addedLemma)
278		{
279		// we had to add a branch and bound lemma since the linear solver assigned
280		// a non-integer value to an integer variable.
281		return false;
282		}
283		// this would imply that linear arithmetic's model failed to satisfy a branch
284		// and bound lemma
285	14564	AlwaysAssert(!badAssignment)
286		<< "Bad assignment from TheoryArithPrivate::collectModelValues, and no "
287		"branching lemma was sent";
288
289		// if non-linear is enabled, intercept the model, which may repair its values
290	14564	if (d_nonlinearExtension != nullptr)
291		{
292		// Non-linear may repair values to satisfy non-linear constraints (see
293		// documentation for NonlinearExtension::interceptModel).
294	8938	d_nonlinearExtension->interceptModel(arithModel, termSet);
295		}
296		// We are now ready to assert the model.
297	254544	for (const std::pair<const Node, Node>& p : arithModel)
298		{
299		// maps to constant of comparable type
300	239982	Assert(p.first.getType().isComparableTo(p.second.getType()));
301	239982	if (m->assertEquality(p.first, p.second, true))
302		{
303	239980	continue;
304		}
305		// If we failed to assert an equality, it is likely due to theory
306		// combination, namely the repaired model for non-linear changed
307		// an equality status that was agreed upon by both (linear) arithmetic
308		// and another theory. In this case, we must add a lemma, or otherwise
309		// we would terminate with an invalid model. Thus, we add a splitting
310		// lemma of the form ( x = v V x != v ) where v is the model value
311		// assigned by the non-linear solver to x.
312	2	if (d_nonlinearExtension != nullptr)
313		{
314	4	Node eq = p.first.eqNode(p.second);
315	4	Node lem = NodeManager::currentNM()->mkNode(kind::OR, eq, eq.negate());
316	2	bool added = d_im.lemma(lem, InferenceId::ARITH_SPLIT_FOR_NL_MODEL);
317	2	AlwaysAssert(added) << "The lemma was already in cache. Probably there is something wrong with theory combination...";
318		}
319	2	return false;
320		}
321	14562	return true;
322		}
323
324	1696	void TheoryArith::notifyRestart(){
325	1696	d_internal->notifyRestart();
326	1696	}
327
328	15201	void TheoryArith::presolve(){
329	15201	d_internal->presolve();
330	15201	if (d_nonlinearExtension != nullptr)
331		{
332	6404	d_nonlinearExtension->presolve();
333		}
334	15201	}
335
336	779974	EqualityStatus TheoryArith::getEqualityStatus(TNode a, TNode b) {
337	779974	return d_internal->getEqualityStatus(a,b);
338		}
339
340	2852	Node TheoryArith::getModelValue(TNode var) {
341	2852	return d_internal->getModelValue( var );
342		}
343
344	6591	std::pair<bool, Node> TheoryArith::entailmentCheck(TNode lit)
345		{
346	13182	ArithEntailmentCheckParameters def;
347	6591	def.addLookupRowSumAlgorithms();
348	13182	ArithEntailmentCheckSideEffects ase;
349	6591	std::pair<bool, Node> res = d_internal->entailmentCheck(lit, def, ase);
350	13182	return res;
351		}
352		eq::ProofEqEngine* TheoryArith::getProofEqEngine()
353		{
354		return d_im.getProofEqEngine();
355		}
356
357		} // namespace arith
358		} // namespace theory
359	29337	} // namespace cvc5