CVC3::TheoryArithOld Class Reference

#include <theory_arith_old.h>

Inheritance diagram for CVC3::TheoryArithOld:

[legend]Collaboration diagram for CVC3::TheoryArithOld:

[legend]List of all members.

Public Member Functions

• void separateMonomial (const Expr &e, Expr &c, Expr &var)

  Separate monomial e = c*p1*...*pn into c and 1*p1*...*pn.
  

• TheoryArithOld (TheoryCore *core)
• ~TheoryArithOld ()
• ArithProofRules * createProofRulesOld ()
• void addSharedTerm (const Expr &e)
• void assertFact (const Theorem &e)

  Assert a new fact to the decision procedure.
  

• void refineCounterExample ()

  Process disequalities from the arrangement for model generation.
  

• void computeModelBasic (const std::vector< Expr > &v)

  Assign concrete values to basic-type variables in v.
  

• void computeModel (const Expr &e, std::vector< Expr > &vars)

  Compute the value of a compound variable from the more primitive ones.
  

• void checkSat (bool fullEffort)

  Check for satisfiability in the theory.
  

• Theorem rewrite (const Expr &e)

  Theory-specific rewrite rules.
  

• void setup (const Expr &e)

  Set up the term e for call-backs when e or its children change.
  

• void update (const Theorem &e, const Expr &d)

  Notify a theory of a new equality.
  

• Theorem solve (const Theorem &e)

  An optional solver.
  

• void checkAssertEqInvariant (const Theorem &e)

  A debug check used by the primary solver.
  

• void checkType (const Expr &e)

  Check that e is a valid Type expr.
  

• void computeType (const Expr &e)

  Compute and store the type of e.
  

• Type computeBaseType (const Type &t)

  Compute the base type of the top-level operator of an arbitrary type.
  

• void computeModelTerm (const Expr &e, std::vector< Expr > &v)

  Add variables from 'e' to 'v' for constructing a concrete model.
  

• Expr computeTypePred (const Type &t, const Expr &e)

  Theory specific computation of the subtyping predicate for type t applied to the expression e.
  

• Expr computeTCC (const Expr &e)

  Compute and cache the TCC of e.
  

• ExprStream & print (ExprStream &os, const Expr &e)

  Theory-specific pretty-printing.
  

• Expr parseExprOp (const Expr &e)

  Theory-specific parsing implemented by the DP.
  

Private Member Functions

• Theorem isIntegerThm (const Expr &e)

  Check the term t for integrality.
  

• Theorem isIntegerDerive (const Expr &isIntE, const Theorem &thm)

  A helper method for isIntegerThm().
  

• bool isInteger (const Expr &e)

  Check the term t for integrality (return bool).
  

• const Rational & freeConstIneq (const Expr &ineq, bool varOnRHS)

  Extract the free constant from an inequality.
  

• const FreeConst & updateSubsumptionDB (const Expr &ineq, bool varOnRHS, bool &subsumed)

  Update the free constant subsumption database with new inequality.
  

• bool kidsCanonical (const Expr &e)

  Check if the kids of e are fully simplified and canonized (for debugging).
  

• Theorem canon (const Expr &e)

  Canonize the expression e, assuming all children are canonical.
  

• Theorem canonSimplify (const Expr &e)

  Canonize and reduce e w.r.t. union-find database; assume all children are canonical.
  

• Theorem canonSimplify (const Theorem &thm)

  Composition of canonSimplify(const Expr&) by transitivity: take e0 = e1, canonize and simplify e1 to e2, return e0 = e2.
  

• Theorem canonPred (const Theorem &thm)

  Canonize predicate (x = y, x < y, etc.).
  

• Theorem canonPredEquiv (const Theorem &thm)
• Theorem doSolve (const Theorem &e)

  Solve an equation and return an equivalent Theorem in the solved form.
  

• Theorem canonConjunctionEquiv (const Theorem &thm)

  takes in a conjunction equivalence Thm and canonizes it.
  

• Expr pickIntEqMonomial (const Expr &right)

  picks the monomial with the smallest abs(coeff) from the input
  

• Theorem processRealEq (const Theorem &eqn)

  processes equalities with 1 or more vars of type REAL
  

• Theorem processIntEq (const Theorem &eqn)

  processes equalities whose vars are all of type INT
  

• Theorem processSimpleIntEq (const Theorem &eqn)

  One step of INT equality processing (aux. method for processIntEq()).
  

• void processBuffer ()

  Process inequalities in the buffer.
  

• Theorem isolateVariable (const Theorem &inputThm, bool &e1)

  Take an inequality and isolate a variable.
  

• void updateStats (const Rational &c, const Expr &var)

  Update the statistics counters for the variable with a coeff. c.
  

• void updateStats (const Expr &monomial)

  Update the statistics counters for the monomial.
  

• void addToBuffer (const Theorem &thm)

  Add an inequality to the input buffer. See also d_buffer.
  

• Expr computeNormalFactor (const Expr &rhs)

  Given a canonized term, compute a factor to make all coefficients integer and relatively prime.
  

• Theorem normalize (const Expr &e)

  Normalize an equation (make all coefficients rel. prime integers).
  

• Theorem normalize (const Theorem &thm)

  Normalize an equation (make all coefficients rel. prime integers).
  

• Expr pickMonomial (const Expr &right)
• bool lessThanVar (const Expr &isolatedVar, const Expr &var2)
• bool isStale (const Expr &e)

  Check if the term expression is "stale".
  

• bool isStale (const Ineq &ineq)

  Check if the inequality is "stale" or subsumed.
  

• void projectInequalities (const Theorem &theInequality, bool isolatedVarOnRHS)
• void assignVariables (std::vector< Expr > &v)
• void findRationalBound (const Expr &varSide, const Expr &ratSide, const Expr &var, Rational &r)
• bool findBounds (const Expr &e, Rational &lub, Rational &glb)
• Theorem normalizeProjectIneqs (const Theorem &ineqThm1, const Theorem &ineqThm2)
• Theorem solvedForm (const std::vector< Theorem > &solvedEqs)

  Take a system of equations and turn it into a solved form.
  

• Theorem substAndCanonize (const Expr &t, ExprMap< Theorem > &subst)

  Substitute all vars in term 't' according to the substitution 'subst' and canonize the result.
  

• Theorem substAndCanonize (const Theorem &eq, ExprMap< Theorem > &subst)

  Substitute all vars in the RHS of the equation 'eq' of the form (x = t) according to the substitution 'subst', and canonize the result.
  

• void collectVars (const Expr &e, std::vector< Expr > &vars, std::set< Expr > &cache)

  Traverse 'e' and push all the i-leaves into 'vars' vector.
  

• void processFiniteInterval (const Theorem &alphaLEax, const Theorem &bxLEbeta)

  Check if alpha <= ax & bx <= beta is a finite interval for integer var 'x', and assert the corresponding constraint.
  

• void processFiniteIntervals (const Expr &x)

  For an integer var 'x', find and process all constraints A <= ax <= A+c.
  

• void setupRec (const Expr &e)

  Recursive setup for isolated inequalities (and other new expressions).
  

Private Attributes

• CDList< Theorem > d_diseq
• CDO< size_t > d_diseqIdx
• ArithProofRules * d_rules
• CDO< bool > d_inModelCreation
• ExprMap< CDList< Ineq > * > d_inequalitiesRightDB

  Database of inequalities with a variable isolated on the right.
  

• ExprMap< CDList< Ineq > * > d_inequalitiesLeftDB

  Database of inequalities with a variable isolated on the left.
  

• CDMap< Expr, FreeConst > d_freeConstDB

  Mapping of inequalities to the largest/smallest free constant.
  

• CDList< Theorem > d_buffer

  Buffer of input inequalities.
  

• CDO< size_t > d_bufferIdx

  Buffer index of the next unprocessed inequality.
  

• const int * d_bufferThres

  Threshold when the buffer must be processed.
  

• CDMap< Expr, int > d_countRight

  Mapping of a variable to the number of inequalities where the variable would be isolated on the right.
  

• CDMap< Expr, int > d_countLeft

  Mapping of a variable to the number of inequalities where the variable would be isolated on the left.
  

• CDMap< Expr, bool > d_sharedTerms

  Set of shared terms (for counterexample generation).
  

• CDMap< Expr, bool > d_sharedVars

  Set of shared integer variables (i-leaves).
  

• VarOrderGraph d_graph

Friends

• std::ostream & operator<< (std::ostream &os, const FreeConst &fc)

  Printing.
  

• std::ostream & operator<< (std::ostream &os, const Ineq &ineq)

  Printing.
  

Classes

• class FreeConst

  Data class for the strongest free constant in separation inqualities. More...
  

• class Ineq

  Private class for an inequality in the Fourier-Motzkin database. More...
  

• class VarOrderGraph

---

Detailed Description

Definition at line 28 of file theory_arith_old.h.

---

Constructor & Destructor Documentation

TheoryArithOld::TheoryArithOld

(

TheoryCore *

core

)

Definition at line 1559 of file theory_arith_old.cpp.

References createProofRulesOld(), d_buffer, d_bufferIdx, d_diseq, CVC3::TheoryArith::d_intType, CVC3::TheoryArith::d_realType, d_rules, CVC3::DARK_SHADOW, CVC3::DIVIDE, CVC3::GE, CVC3::Theory::getEM(), CVC3::GRAY_SHADOW, CVC3::GT, IF_DEBUG, CVC3::INT, CVC3::INTDIV, CVC3::IS_INTEGER, CVC3::LE, CVC3::LT, CVC3::MINUS, CVC3::MOD, CVC3::MULT, CVC3::NEGINF, CVC3::ExprManager::newKind(), CVC3::PLUS, CVC3::POSINF, CVC3::POW, CVC3::RATIONAL_EXPR, CVC3::REAL, CVC3::REAL_CONST, CVC3::Theory::registerTheory(), CVC3::ContextObj::setName(), CVC3::SUBRANGE, and CVC3::UMINUS.

TheoryArithOld::~TheoryArithOld

(

)

Definition at line 1636 of file theory_arith_old.cpp.

References d_inequalitiesLeftDB, d_inequalitiesRightDB, and d_rules.

---

Member Function Documentation

Theorem TheoryArithOld::isIntegerThm

(

const Expr &

e

)

[private]

Check the term t for integrality.

Returns:

a theorem of IS_INTEGER(t) or Null.

Definition at line 68 of file theory_arith_old.cpp.

References CVC3::Expr::getType(), CVC3::IS_INTEGER, isIntegerDerive(), CVC3::isReal(), and CVC3::Theory::typePred().

Referenced by isInteger(), normalizeProjectIneqs(), processFiniteInterval(), processSimpleIntEq(), and projectInequalities().

Theorem TheoryArithOld::isIntegerDerive	(	const Expr &	isIntE,
		const Theorem &	thm
	)			[private]

A helper method for isIntegerThm().

Check if IS_INTEGER(e) is easily derivable from the given 'thm'

Definition at line 76 of file theory_arith_old.cpp.

References CVC3::Expr::arity(), CVC3::Theory::getCommonRules(), CVC3::Theorem::getExpr(), CVC3::Expr::isAnd(), and CVC3::Theorem::isNull().

Referenced by isIntegerThm(), and rewrite().

bool CVC3::TheoryArithOld::isInteger

(

const Expr &

e

)

[inline, private]

Check the term t for integrality (return bool).

Definition at line 129 of file theory_arith_old.h.

References isIntegerThm(), and CVC3::Theorem::isNull().

Referenced by assignVariables(), computeType(), doSolve(), pickIntEqMonomial(), processFiniteInterval(), processFiniteIntervals(), processRealEq(), and solve().

const Rational & TheoryArithOld::freeConstIneq	(	const Expr &	ineq,
		bool	varOnRHS
	)			[private]

Extract the free constant from an inequality.

Definition at line 93 of file theory_arith_old.cpp.

References DebugAssert, CVC3::isIneq(), CVC3::PLUS, CVC3::RATIONAL_EXPR, and CVC3::Expr::toString().

Referenced by isStale().

const TheoryArithOld::FreeConst & TheoryArithOld::updateSubsumptionDB	(	const Expr &	ineq,
		bool	varOnRHS,
		bool &	subsumed
	)			[private]

Update the free constant subsumption database with new inequality.

Returns:

a reference to the max/min constant.

Also, sets 'subsumed' argument to true if the inequality is subsumed by an existing inequality.

Definition at line 111 of file theory_arith_old.cpp.

References CVC3::Expr::arity(), CVC3::Expr::begin(), d_freeConstDB, DebugAssert, CVC3::Expr::end(), CVC3::CDOmap< Key, Data, HashFcn >::get(), CVC3::TheoryArithOld::FreeConst::getConst(), CVC3::Expr::getRational(), CVC3::isLE(), CVC3::isLT(), CVC3::isPlus(), CVC3::isRational(), CVC3::leExpr(), CVC3::plusExpr(), CVC3::TheoryArith::rat(), CVC3::TheoryArithOld::FreeConst::strict(), CVC3::Expr::toString(), and CVC3::TRACE.

Referenced by projectInequalities().

bool TheoryArithOld::kidsCanonical

(

const Expr &

e

)

[private]

Check if the kids of e are fully simplified and canonized (for debugging).

Definition at line 180 of file theory_arith_old.cpp.

References CVC3::Expr::arity(), canon(), CVC3::debugger, std::endl(), CVC3::Debug::getOS(), IF_DEBUG, and CVC3::Theory::isLeaf().

Referenced by canon(), and canonSimplify().

Theorem TheoryArithOld::canon

(

const Expr &

e

)

[private, virtual]

Canonize the expression e, assuming all children are canonical.

Implements CVC3::TheoryArith.

Definition at line 212 of file theory_arith_old.cpp.

References CVC3::Expr::arity(), CVC3::ArithProofRules::canonDivide(), CVC3::ArithProofRules::canonMult(), CVC3::ArithProofRules::canonPlus(), CVC3::ArithProofRules::canonPowConst(), CVC3::TheoryArith::canonThm(), d_rules, DebugAssert, CVC3::DIVIDE, CVC3::Expr::getKind(), CVC3::Theorem::getRHS(), CVC3::isRational(), kidsCanonical(), CVC3::MINUS, CVC3::ArithProofRules::minusToPlus(), CVC3::MULT, CVC3::PLUS, CVC3::POW, CVC3::Theory::reflexivityRule(), CVC3::Theory::substitutivityRule(), CVC3::Expr::toString(), CVC3::TRACE, CVC3::Theory::transitivityRule(), CVC3::UMINUS, and CVC3::ArithProofRules::uMinusToMult().

Referenced by canonSimplify(), isolateVariable(), kidsCanonical(), processFiniteInterval(), and rewrite().

Theorem TheoryArithOld::canonSimplify

(

const Expr &

e

)

[private]

Canonize and reduce e w.r.t. union-find database; assume all children are canonical.

Definition at line 360 of file theory_arith_old.cpp.

References canon(), DebugAssert, CVC3::Theory::find(), CVC3::Theorem::getRHS(), CVC3::Expr::hasFind(), kidsCanonical(), CVC3::Theory::leavesAreSimp(), CVC3::Theory::simplifyExpr(), CVC3::Expr::toString(), CVC3::TRACE, and CVC3::Theory::transitivityRule().

Referenced by canonPred(), canonPredEquiv(), and canonSimplify().

Theorem CVC3::TheoryArithOld::canonSimplify

(

const Theorem &

thm

)

[inline, private]

Composition of canonSimplify(const Expr&) by transitivity: take e0 = e1, canonize and simplify e1 to e2, return e0 = e2.

Definition at line 150 of file theory_arith_old.h.

References canonSimplify(), CVC3::Theorem::getRHS(), and CVC3::Theory::transitivityRule().

Theorem TheoryArithOld::canonPred

(

const Theorem &

thm

)

[private]

Canonize predicate (x = y, x < y, etc.).

accepts a theorem, canonizes it, applies iffMP and substituvity to derive the canonized thm

Definition at line 390 of file theory_arith_old.cpp.

References CVC3::Expr::arity(), canonSimplify(), DebugAssert, CVC3::Theorem::getExpr(), CVC3::Theory::iffMP(), CVC3::Theory::substitutivityRule(), and CVC3::Theorem::toString().

Referenced by addToBuffer(), doSolve(), isolateVariable(), normalizeProjectIneqs(), processFiniteInterval(), processRealEq(), processSimpleIntEq(), and projectInequalities().

Theorem TheoryArithOld::canonPredEquiv

(

const Theorem &

thm

)

[private]

Canonize predicate like canonPred except that the input theorem is an equivalent transformation.

Definition at line 404 of file theory_arith_old.cpp.

References CVC3::Expr::arity(), canonSimplify(), DebugAssert, CVC3::Theorem::getRHS(), CVC3::Theory::substitutivityRule(), CVC3::Theorem::toString(), and CVC3::Theory::transitivityRule().

Referenced by normalize(), and rewrite().

Theorem TheoryArithOld::doSolve

(

const Theorem &

thm

)

[private]

Solve an equation and return an equivalent Theorem in the solved form.

Psuedo-code for doSolve. (Input is an equation) (output is a Theorem)

1. translate e to the form e' = 0
2. if (e'.isRational()) then {if e' != 0 return false else true}
3. a for loop checks if all the variables are integers.
   • if not isolate a suitable real variable and call processRealEq().
   • if all variables are integers then isolate suitable variable and call processIntEq().

Definition at line 432 of file theory_arith_old.cpp.

References canonPred(), CVC3::ArithProofRules::constPredicate(), CVC3::Debug::counter(), d_rules, DebugAssert, CVC3::debugger, CVC3::Theorem::getExpr(), IF_DEBUG, CVC3::Theory::iffMP(), isInteger(), CVC3::isRational(), CVC3::Theorem::isRewrite(), normalize(), processIntEq(), processRealEq(), MiniSat::right(), CVC3::ArithProofRules::rightMinusLeft(), CVC3::Theory::setIncomplete(), CVC3::Theory::symmetryRule(), CVC3::Theorem::toString(), and CVC3::TRACE.

Referenced by solve().

Theorem TheoryArithOld::canonConjunctionEquiv

(

const Theorem &

thm

)

[private]

takes in a conjunction equivalence Thm and canonizes it.

accepts an equivalence theorem whose RHS is a conjunction, canonizes it, applies iffMP and substituvity to derive the canonized thm

Definition at line 419 of file theory_arith_old.cpp.

Expr TheoryArithOld::pickIntEqMonomial

(

const Expr &

right

)

[private]

picks the monomial with the smallest abs(coeff) from the input

pick a monomial for the input equation. This function is used only if the equation is an integer equation. Choose the monomial with the smallest absolute value of coefficient.

Definition at line 489 of file theory_arith_old.cpp.

References DebugAssert, isInteger(), CVC3::isMult(), CVC3::isPlus(), CVC3::isRational(), MiniSat::min(), and MiniSat::right().

Referenced by processSimpleIntEq().

Theorem TheoryArithOld::processRealEq

(

const Theorem &

eqn

)

[private]

processes equalities with 1 or more vars of type REAL

input is e1=e2<==>0=e' Theorem and some of the vars in e' are of type REAL. isolate one of them and send back to framework. output is "e1=e2 <==> var = e''" Theorem.

Definition at line 521 of file theory_arith_old.cpp.

References canonPred(), d_rules, DebugAssert, CVC3::EQ, CVC3::Theory::getBaseType(), CVC3::Theorem::getLHS(), CVC3::Theorem::getRHS(), CVC3::Theory::iffMP(), isInteger(), CVC3::Theory::isLeaf(), CVC3::Theory::isLeafIn(), CVC3::isMult(), CVC3::isPlus(), CVC3::isRational(), CVC3::isReal(), MiniSat::left(), CVC3::ArithProofRules::multEqn(), CVC3::ArithProofRules::plusPredicate(), CVC3::TheoryArith::rat(), MiniSat::right(), CVC3::Theorem::toString(), and CVC3::TRACE.

Referenced by doSolve().

Theorem TheoryArithOld::processIntEq

(

const Theorem &

eqn

)

[private]

processes equalities whose vars are all of type INT

input is e1=e2<==>0=e' Theorem and all of the vars in e' are of type INT. isolate one of them and send back to framework. output is "e1=e2 <==> var = e''" Theorem and some associated equations in solved form.

Definition at line 743 of file theory_arith_old.cpp.

References CVC3::CommonProofRules::andElim(), CVC3::Expr::arity(), DebugAssert, CVC3::Theory::getCommonRules(), CVC3::Theorem::getExpr(), CVC3::Expr::isAnd(), CVC3::Expr::isFalse(), CVC3::Theorem::isRewrite(), processSimpleIntEq(), solvedForm(), CVC3::Expr::toString(), and CVC3::TRACE.

Referenced by doSolve().

Theorem TheoryArithOld::processSimpleIntEq

(

const Theorem &

eqn

)

[private]

One step of INT equality processing (aux. method for processIntEq()).

Parameters:

eqn

is a single equation 0 = e

Returns:

an equivalent Theorem (x = t AND 0 = e'), or just x = t

Definition at line 608 of file theory_arith_old.cpp.

References CVC3::CommonProofRules::andIntro(), CVC3::Expr::arity(), CVC3::Expr::begin(), canonPred(), d_rules, DebugAssert, CVC3::Expr::end(), CVC3::EQ, CVC3::ArithProofRules::eqElimIntRule(), CVC3::Theory::getCommonRules(), CVC3::Theorem::getExpr(), CVC3::Theorem::getLHS(), CVC3::Expr::getRational(), CVC3::Theorem::getRHS(), CVC3::Theory::iffMP(), CVC3::ArithProofRules::intVarEqnConst(), isIntegerThm(), isIntx(), CVC3::isMult(), CVC3::isPlus(), CVC3::Expr::isRational(), CVC3::Theorem::isRewrite(), CVC3::ArithProofRules::multEqn(), pickIntEqMonomial(), CVC3::ArithProofRules::plusPredicate(), CVC3::TheoryArith::rat(), MiniSat::right(), separateMonomial(), CVC3::CommonProofRules::skolemize(), CVC3::Theory::symmetryRule(), CVC3::Expr::toString(), and CVC3::TRACE.

Referenced by processIntEq().

void TheoryArithOld::processBuffer

(

)

[private]

Process inequalities in the buffer.

Definition at line 906 of file theory_arith_old.cpp.

References d_buffer, d_bufferIdx, DebugAssert, CVC3::Theorem::getExpr(), CVC3::Theory::inconsistent(), isolateVariable(), CVC3::isPlus(), isStale(), CVC3::Expr::isTrue(), projectInequalities(), CVC3::Theory::setInconsistent(), and CVC3::Expr::toString().

Referenced by assertFact(), and checkSat().

Theorem TheoryArithOld::isolateVariable	(	const Theorem &	inputThm,
		bool &	e1
	)			[private]

Take an inequality and isolate a variable.

Definition at line 976 of file theory_arith_old.cpp.

References canon(), canonPred(), computeNormalFactor(), CVC3::ArithProofRules::constPredicate(), d_rules, DebugAssert, CVC3::Theorem::getExpr(), CVC3::Expr::getKind(), CVC3::Expr::getRational(), CVC3::Theorem::getRHS(), CVC3::Theory::iffMP(), CVC3::isLE(), CVC3::isLT(), CVC3::isMult(), CVC3::isPlus(), CVC3::isRational(), CVC3::ArithProofRules::multIneqn(), pickMonomial(), CVC3::ArithProofRules::plusPredicate(), CVC3::TheoryArith::rat(), MiniSat::right(), CVC3::Theorem::toString(), CVC3::Expr::toString(), and CVC3::TRACE.

Referenced by processBuffer().

void TheoryArithOld::updateStats	(	const Rational &	c,
		const Expr &	var
	)			[private]

Update the statistics counters for the variable with a coeff. c.

Definition at line 931 of file theory_arith_old.cpp.

References d_countLeft, d_countRight, CVC3::Rational::toString(), and CVC3::TRACE.

Referenced by addToBuffer(), and updateStats().

void TheoryArithOld::updateStats

(

const Expr &

monomial

)

[private]

Update the statistics counters for the monomial.

Definition at line 944 of file theory_arith_old.cpp.

References CVC3::Expr::getRational(), separateMonomial(), and updateStats().

void TheoryArithOld::addToBuffer

(

const Theorem &

thm

)

[private]

Add an inequality to the input buffer. See also d_buffer.

Definition at line 952 of file theory_arith_old.cpp.

References CVC3::Expr::begin(), canonPred(), d_buffer, d_rules, CVC3::Expr::end(), CVC3::Theorem::getExpr(), CVC3::Theory::iffMP(), CVC3::isPlus(), CVC3::isRational(), CVC3::ArithProofRules::rightMinusLeft(), CVC3::TRACE, and updateStats().

Referenced by assertFact(), and projectInequalities().

Expr TheoryArithOld::computeNormalFactor

(

const Expr &

rhs

)

[private]

Given a canonized term, compute a factor to make all coefficients integer and relatively prime.

Definition at line 1046 of file theory_arith_old.cpp.

References CVC3::Rational::getDenominator(), CVC3::Rational::getNumerator(), CVC3::isMult(), CVC3::isPlus(), CVC3::MULT, CVC3::TheoryArith::rat(), CVC3::RATIONAL_EXPR, and MiniSat::right().

Referenced by isolateVariable(), and normalize().

Theorem TheoryArithOld::normalize

(

const Expr &

e

)

[private]

Normalize an equation (make all coefficients rel. prime integers).

accepts a rewrite theorem over eqn|ineqn and normalizes it and returns a theorem to that effect. assumes e is non-trivial i.e. e is not '0=const' or 'const=0' or '0 <= const' etc.

Definition at line 2091 of file theory_arith_old.cpp.

References canonPredEquiv(), computeNormalFactor(), d_rules, DebugAssert, CVC3::EQ, CVC3::GE, CVC3::Expr::getKind(), CVC3::GT, CVC3::Expr::isEq(), CVC3::isIneq(), CVC3::isRational(), CVC3::LE, CVC3::LT, CVC3::ArithProofRules::multEqn(), CVC3::ArithProofRules::multIneqn(), CVC3::Theory::reflexivityRule(), CVC3::Expr::toString(), and CVC3::TRACE.

Referenced by doSolve(), normalize(), and rewrite().

Theorem TheoryArithOld::normalize

(

const Theorem &

thm

)

[private]

Normalize an equation (make all coefficients rel. prime integers).

accepts a rewrite theorem over eqn|ineqn and normalizes it and returns a theorem to that effect.

Definition at line 2154 of file theory_arith_old.cpp.

References CVC3::Theorem::getRHS(), normalize(), and CVC3::Theory::transitivityRule().

Expr TheoryArithOld::pickMonomial

(

const Expr &

right

)

[private]

Definition at line 1400 of file theory_arith_old.cpp.

References CVC3::TheoryArithOld::VarOrderGraph::addEdge(), d_countLeft, d_countRight, d_graph, DebugAssert, CVC3::isPlus(), lessThanVar(), MiniSat::right(), CVC3::TheoryArithOld::VarOrderGraph::selectLargest(), separateMonomial(), CVC3::Theory::theoryCore(), and CVC3::TRACE.

Referenced by isolateVariable().

void TheoryArithOld::separateMonomial	(	const Expr &	e,
		Expr &	c,
		Expr &	var
	)			[virtual]

Separate monomial e = c*p1*...*pn into c and 1*p1*...*pn.

Implements CVC3::TheoryArith.

Definition at line 1146 of file theory_arith_old.cpp.

References CVC3::Expr::arity(), DebugAssert, CVC3::Expr::getKids(), CVC3::isMult(), CVC3::isPlus(), CVC3::isRational(), CVC3::Expr::isRational(), CVC3::multExpr(), CVC3::TheoryArith::rat(), CVC3::Expr::toString(), and CVC3::TRACE.

Referenced by findRationalBound(), lessThanVar(), normalizeProjectIneqs(), pickMonomial(), processSimpleIntEq(), projectInequalities(), and updateStats().

bool TheoryArithOld::lessThanVar	(	const Expr &	isolatedVar,
		const Expr &	var2
	)			[private]

Definition at line 1088 of file theory_arith_old.cpp.

References DebugAssert, CVC3::isRational(), separateMonomial(), and CVC3::Expr::toString().

Referenced by pickMonomial().

bool TheoryArithOld::isStale

(

const Expr &

e

)

[private]

Check if the term expression is "stale".

"Stale" means it contains non-simplified subexpressions. For terms, it checks the expression's find pointer; for formulas it checks the children recursively (no caching!). So, apply it with caution, and only to simple atomic formulas (like inequality).

Definition at line 1104 of file theory_arith_old.cpp.

References CVC3::Expr::begin(), CVC3::Expr::end(), CVC3::Theory::find(), CVC3::Theorem::getRHS(), and CVC3::Expr::isTerm().

Referenced by isStale(), processBuffer(), and projectInequalities().

bool TheoryArithOld::isStale

(

const Ineq &

ineq

)

[private]

Check if the inequality is "stale" or subsumed.

Definition at line 1116 of file theory_arith_old.cpp.

References freeConstIneq(), CVC3::TheoryArithOld::FreeConst::getConst(), CVC3::TheoryArithOld::Ineq::getConst(), CVC3::Theorem::getExpr(), CVC3::TheoryArithOld::Ineq::ineq(), CVC3::isLT(), isStale(), CVC3::TheoryArithOld::FreeConst::strict(), CVC3::TRACE, and CVC3::TheoryArithOld::Ineq::varOnRHS().

void TheoryArithOld::projectInequalities	(	const Theorem &	theInequality,
		bool	isolatedVarOnRHS
	)			[private]

Definition at line 1172 of file theory_arith_old.cpp.

References addToBuffer(), canonPred(), CVC3::Debug::counter(), d_inequalitiesLeftDB, d_inequalitiesRightDB, d_rules, DebugAssert, CVC3::debugger, CVC3::ExprMap< Data >::end(), CVC3::Theory::enqueueFact(), CVC3::ExprMap< Data >::find(), CVC3::TheoryCore::getCM(), CVC3::ContextManager::getCurrentContext(), CVC3::Theorem::getExpr(), IF_DEBUG, CVC3::Theory::iffMP(), CVC3::isInt(), isIntegerThm(), CVC3::isLE(), CVC3::isLT(), CVC3::isMult(), CVC3::Theorem::isNull(), CVC3::isPow(), isStale(), CVC3::ArithProofRules::lessThanToLE(), normalizeProjectIneqs(), separateMonomial(), CVC3::Theory::setIncomplete(), CVC3::Theory::setInconsistent(), CVC3::TheoryCore::setupTerm(), CVC3::CDList< T >::size(), CVC3::Theory::theoryCore(), CVC3::Theorem::toString(), CVC3::TRACE, TRACE_MSG, and updateSubsumptionDB().

Referenced by processBuffer().

void TheoryArithOld::assignVariables

(

std::vector< Expr > &

v

)

[private]

Definition at line 2020 of file theory_arith_old.cpp.

References CVC3::Theory::assignValue(), d_graph, findBounds(), CVC3::Theory::findExpr(), CVC3::Theory::inconsistent(), CVC3::Rational::isInteger(), isInteger(), CVC3::TheoryArith::rat(), CVC3::TheoryArithOld::VarOrderGraph::selectSmallest(), and CVC3::TRACE.

Referenced by computeModelBasic().

void TheoryArithOld::findRationalBound	(	const Expr &	varSide,
		const Expr &	ratSide,
		const Expr &	var,
		Rational &	r
	)			[private]

Definition at line 1951 of file theory_arith_old.cpp.

References DebugAssert, CVC3::Theory::findExpr(), CVC3::Expr::getRational(), CVC3::isRational(), separateMonomial(), and CVC3::Expr::toString().

Referenced by findBounds().

bool TheoryArithOld::findBounds	(	const Expr &	e,
		Rational &	lub,
		Rational &	glb
	)			[private]

Definition at line 1969 of file theory_arith_old.cpp.

References d_inequalitiesLeftDB, d_inequalitiesRightDB, DebugAssert, findRationalBound(), CVC3::isLT(), MiniSat::left(), MiniSat::right(), CVC3::CDList< T >::size(), CVC3::Rational::toString(), and CVC3::TRACE.

Referenced by assignVariables().

Theorem TheoryArithOld::normalizeProjectIneqs	(	const Theorem &	ineqThm1,
		const Theorem &	ineqThm2
	)			[private]

Definition at line 1275 of file theory_arith_old.cpp.

References CVC3::Theory::addSplitter(), CVC3::Expr::arity(), canonPred(), CVC3::ArithProofRules::constPredicate(), CVC3::Debug::counter(), d_rules, CVC3::DARK_SHADOW, CVC3::ArithProofRules::darkGrayShadow2ab(), CVC3::ArithProofRules::darkGrayShadow2ba(), DebugAssert, CVC3::debugger, CVC3::Theory::enqueueFact(), CVC3::Theorem::getExpr(), CVC3::Expr::getKind(), CVC3::GRAY_SHADOW, IF_DEBUG, CVC3::Theory::iffMP(), CVC3::Expr::isAnd(), CVC3::isInt(), isIntegerThm(), isIntx(), CVC3::isLE(), CVC3::isLT(), CVC3::isMult(), CVC3::Theorem::isNull(), CVC3::isPlus(), CVC3::isRational(), CVC3::ArithProofRules::multIneqn(), processFiniteInterval(), CVC3::TheoryArith::rat(), CVC3::ArithProofRules::realShadow(), CVC3::ArithProofRules::realShadowEq(), MiniSat::right(), CVC3::ArithProofRules::rightMinusLeft(), separateMonomial(), CVC3::Theory::simplifyExpr(), CVC3::Expr::toString(), and CVC3::TRACE.

Referenced by projectInequalities().

Theorem TheoryArithOld::solvedForm

(

const std::vector< Theorem > &

solvedEqs

)

[private]

Take a system of equations and turn it into a solved form.

Takes a vector of equations and for every equation x_i=t_i substitutes t_j for x_j in t_i for all j>i. This turns the system of equations into a solved form.

Assumption: variables x_j may appear in the RHS terms t_i ONLY for i<j, but not for i>=j.

Definition at line 782 of file theory_arith_old.cpp.

References CVC3::CommonProofRules::andIntro(), CVC3::ExprMap< Data >::begin(), DebugAssert, CVC3::debugger, CVC3::ExprMap< Data >::end(), CVC3::Theory::getCommonRules(), IF_DEBUG, substAndCanonize(), CVC3::TRACE, CVC3::Debug::trace(), and TRACE_MSG.

Referenced by processIntEq().

Theorem TheoryArithOld::substAndCanonize	(	const Expr &	t,
		ExprMap< Theorem > &	subst
	)			[private]

Substitute all vars in term 't' according to the substitution 'subst' and canonize the result.

ASSUMPTION: 't' is a fully canonized arithmetic term, and every element of subst is a fully canonized equation of the form x=e, indexed by the LHS variable.

Definition at line 834 of file theory_arith_old.cpp.

References CVC3::Expr::arity(), CVC3::TheoryArith::canonThm(), CVC3::ExprMap< Data >::empty(), CVC3::ExprMap< Data >::end(), CVC3::ExprMap< Data >::find(), CVC3::Theory::isLeaf(), CVC3::Theory::reflexivityRule(), CVC3::Theory::substitutivityRule(), and CVC3::TRACE.

Referenced by solvedForm(), and substAndCanonize().

Theorem TheoryArithOld::substAndCanonize	(	const Theorem &	eq,
		ExprMap< Theorem > &	subst
	)			[private]

Substitute all vars in the RHS of the equation 'eq' of the form (x = t) according to the substitution 'subst', and canonize the result.

ASSUMPTION: 't' is a fully canonized equation of the form x = t, and so is every element of subst, indexed by the LHS variable.

Definition at line 885 of file theory_arith_old.cpp.

References DebugAssert, CVC3::ExprMap< Data >::empty(), CVC3::Theorem::getRHS(), CVC3::Theory::iffMP(), CVC3::Theorem::isRewrite(), substAndCanonize(), and CVC3::Theory::substitutivityRule().

void TheoryArithOld::collectVars	(	const Expr &	e,
		std::vector< Expr > &	vars,
		std::set< Expr > &	cache
	)			[private]

Traverse 'e' and push all the i-leaves into 'vars' vector.

Definition at line 1651 of file theory_arith_old.cpp.

References CVC3::Theory::isLeaf().

void TheoryArithOld::processFiniteInterval	(	const Theorem &	alphaLEax,
		const Theorem &	bxLEbeta
	)			[private]

Check if alpha <= ax & bx <= beta is a finite interval for integer var 'x', and assert the corresponding constraint.

Definition at line 1664 of file theory_arith_old.cpp.

References canon(), canonPred(), d_rules, DebugAssert, CVC3::Theory::enqueueFact(), CVC3::ArithProofRules::finiteInterval(), CVC3::Theorem::getExpr(), CVC3::Expr::getRational(), CVC3::Theorem::getRHS(), CVC3::Theory::iffMP(), isInteger(), isIntegerThm(), CVC3::isLE(), CVC3::isMult(), CVC3::isPlus(), CVC3::Expr::isRational(), CVC3::isRational(), CVC3::ArithProofRules::multIneqn(), CVC3::TheoryArith::rat(), CVC3::Theory::substitutivityRule(), CVC3::Theory::symmetryRule(), and CVC3::Expr::toString().

Referenced by normalizeProjectIneqs(), and processFiniteIntervals().

void TheoryArithOld::processFiniteIntervals

(

const Expr &

x

)

[private]

For an integer var 'x', find and process all constraints A <= ax <= A+c.

Definition at line 1722 of file theory_arith_old.cpp.

References d_inequalitiesLeftDB, d_inequalitiesRightDB, isInteger(), processFiniteInterval(), and CVC3::CDList< T >::size().

void TheoryArithOld::setupRec

(

const Expr &

e

)

[private]

Recursive setup for isolated inequalities (and other new expressions).

This function recursively decends expression tree without caching until it hits a node that is already setup. Be careful on what expressions you are calling it.

Definition at line 1748 of file theory_arith_old.cpp.

References CVC3::Expr::arity(), CVC3::Expr::hasFind(), CVC3::Theory::reflexivityRule(), CVC3::Expr::setFind(), and setup().

ArithProofRules * TheoryArithOld::createProofRulesOld

(

)

Definition at line 43 of file arith_theorem_producer_old.cpp.

References CVC3::Theory::theoryCore().

Referenced by TheoryArithOld().

void TheoryArithOld::addSharedTerm

(

const Expr &

e

)

[virtual]

Keep track of all finitely bounded integer variables in shared terms.

When a new shared term t is reported, all of its variables x1...xn are added to the set d_sharedVars.

For each newly added variable x, check all of its opposing inequalities, find out all the finite bounds and assert the corresponding GRAY_SHADOW constraints.

When projecting integer inequalities, the database d_sharedVars is consulted, and if the variable is in it, check the shadows for being a finite interval, and produce the additional GRAY_SHADOW constraints.

Implements CVC3::TheoryArith.

Definition at line 1777 of file theory_arith_old.cpp.

References d_sharedTerms.

void TheoryArithOld::assertFact

(

const Theorem &

e

)

[virtual]

Assert a new fact to the decision procedure.

Each fact that makes it into the core framework is assigned to exactly one theory: the theory associated with that fact. assertFact is called to inform the theory that a new fact has been assigned to the theory.

Implements CVC3::TheoryArith.

Definition at line 1794 of file theory_arith_old.cpp.

References CVC3::Theory::addSplitter(), addToBuffer(), CVC3::Debug::counter(), d_buffer, d_bufferIdx, d_bufferThres, d_diseq, d_inModelCreation, d_rules, DebugAssert, CVC3::debugger, CVC3::Theory::enqueueFact(), CVC3::ArithProofRules::expandDarkShadow(), CVC3::ArithProofRules::expandGrayShadow(), CVC3::ArithProofRules::expandGrayShadow0(), CVC3::geExpr(), CVC3::Theory::getCommonRules(), CVC3::Theorem::getExpr(), CVC3::Expr::getKind(), CVC3::Theorem::getLHS(), CVC3::Expr::getRational(), CVC3::Theorem::getRHS(), CVC3::GRAY_SHADOW, CVC3::ArithProofRules::grayShadowConst(), CVC3::gtExpr(), IF_DEBUG, CVC3::Theory::iffMP(), CVC3::isDarkShadow(), CVC3::Expr::isEq(), CVC3::Expr::isFalse(), CVC3::isGrayShadow(), CVC3::isIntPred(), CVC3::isLE(), CVC3::isLT(), CVC3::isMult(), CVC3::Expr::isNot(), CVC3::Expr::isRational(), CVC3::ArithProofRules::negatedInequality(), processBuffer(), CVC3::Theory::setInconsistent(), CVC3::Theory::simplify(), CVC3::Theory::simplifyExpr(), CVC3::ArithProofRules::splitGrayShadow(), CVC3::CommonProofRules::substitutivityRule(), CVC3::Theory::symmetryRule(), CVC3::Expr::toString(), CVC3::TRACE, and CVC3::Theory::transitivityRule().

void TheoryArithOld::refineCounterExample

(

)

[virtual]

Process disequalities from the arrangement for model generation.

Implements CVC3::TheoryArith.

Definition at line 1919 of file theory_arith_old.cpp.

References CVC3::Theory::addSplitter(), d_inModelCreation, d_sharedTerms, DebugAssert, CVC3::Theory::findExpr(), CVC3::Theory::getBaseType(), CVC3::isReal(), CVC3::Theory::simplifyExpr(), and CVC3::TRACE.

void TheoryArithOld::computeModelBasic

(

const std::vector< Expr > &

v

)

[virtual]

Assign concrete values to basic-type variables in v.

Implements CVC3::TheoryArith.

Definition at line 2054 of file theory_arith_old.cpp.

References assignVariables(), d_inModelCreation, CVC3::Theory::findExpr(), and CVC3::TRACE.

void TheoryArithOld::computeModel	(	const Expr &	e,
		std::vector< Expr > &	vars
	)			[virtual]

Compute the value of a compound variable from the more primitive ones.

The more primitive variables for e are already assigned concrete values, and are available through getModelValue().

The new value for e must be assigned using assignValue() method.

Parameters:

	e	is the compound type expression to assign a value;
	vars	are the variables actually assigned. Normally, 'e' is the only element of vars. However, e.g. in the case of uninterpreted functions, assigning 'f' means assigning all relevant applications of 'f' to constant values (f(0), f(5), etc.). Such applications might not be known before the model is constructed (they may be of the form f(x), f(y+z), etc., where x,y,z are still unassigned).

Populating 'vars' is an opportunity for a DP to change the set of top-level "variables" to assign, if needed. In particular, it may drop 'e' from the model entirely, if it is already a concrete value by itself.

Implements CVC3::TheoryArith.

Definition at line 2077 of file theory_arith_old.cpp.

References CVC3::Theory::assignValue(), DebugAssert, CVC3::Theory::findExpr(), CVC3::isRational(), CVC3::Theory::simplify(), and CVC3::Expr::toString().

void TheoryArithOld::checkSat

(

bool

fullEffort

)

[virtual]

Check for satisfiability in the theory.

Parameters:

fullEffort

when it is false, checkSat can do as much or as little work as it likes, though simple inferences and checks for consistency should be done to increase efficiency. If fullEffort is true, checkSat must check whether the set of facts given by assertFact together with the arrangement of shared terms (provided by addSharedTerm) induced by the global find database equivalence relation are satisfiable. If satisfiable, checkSat does nothing.

If satisfiability can be acheived by merging some of the shared terms, a new fact must be enqueued using enqueueFact (this fact need not be a literal). If there is no way to make things satisfiable, setInconsistent must be called.

Implements CVC3::TheoryArith.

Definition at line 1897 of file theory_arith_old.cpp.

References d_buffer, d_bufferIdx, d_diseq, d_diseqIdx, d_inModelCreation, d_rules, CVC3::ArithProofRules::diseqToIneq(), CVC3::Theory::enqueueFact(), CVC3::Theory::inconsistent(), processBuffer(), and CVC3::TRACE.

Theorem TheoryArithOld::rewrite

(

const Expr &

e

)

[virtual]

Theory-specific rewrite rules.

By default, rewrite just returns a reflexive theorem stating that the input expression is equivalent to itself. However, rewrite is allowed to return any theorem which describes how the input expression is equivalent to some new expression. rewrite should be used to perform simplifications, normalization, and any other preprocessing on theory-specific expressions that needs to be done.

Implements CVC3::TheoryArith.

Definition at line 2159 of file theory_arith_old.cpp.

References canon(), canonPredEquiv(), CVC3::ArithProofRules::constPredicate(), d_rules, CVC3::DARK_SHADOW, DebugAssert, CVC3::EQ, CVC3::ArithProofRules::flipInequality(), CVC3::GE, CVC3::Theory::getCommonRules(), CVC3::Expr::getKind(), CVC3::Theorem::getRHS(), CVC3::GRAY_SHADOW, CVC3::GT, CVC3::CommonProofRules::iffTrue(), CVC3::IS_INTEGER, CVC3::Expr::isAbsLiteral(), CVC3::Expr::isAtomic(), CVC3::Expr::isEq(), CVC3::isGE(), CVC3::isGT(), CVC3::isIneq(), isIntegerDerive(), CVC3::Theory::isLeaf(), CVC3::Theorem::isNull(), CVC3::isRational(), CVC3::Expr::isTerm(), CVC3::LE, CVC3::Theory::leavesAreSimp(), CVC3::LT, CVC3::ArithProofRules::negatedInequality(), normalize(), CVC3::NOT, CVC3::Theory::reflexivityRule(), CVC3::ArithProofRules::rightMinusLeft(), CVC3::Expr::setRewriteNormal(), CVC3::Theory::theoryOf(), CVC3::TRACE, CVC3::Theory::transitivityRule(), and CVC3::Theory::typePred().

Referenced by update().

void TheoryArithOld::setup

(

const Expr &

e

)

[virtual]

Set up the term e for call-backs when e or its children change.

setup is called once for each expression associated with the theory. It is typically used to setup theory-specific data for an expression and to add call-back information for use with update.

See also:

update

Implements CVC3::TheoryArith.

Definition at line 2284 of file theory_arith_old.cpp.

References CVC3::Expr::arity(), DebugAssert, CVC3::IS_INTEGER, CVC3::isDarkShadow(), CVC3::Expr::isEq(), CVC3::isGrayShadow(), CVC3::isLE(), CVC3::isLT(), CVC3::Expr::isNot(), CVC3::isRational(), CVC3::Expr::isTerm(), and CVC3::TRACE.

Referenced by setupRec().

void TheoryArithOld::update	(	const Theorem &	e,
		const Expr &	d
	)			[virtual]

Notify a theory of a new equality.

update is a call-back used by the notify mechanism of the core theory. It works as follows. When an equation t1 = t2 makes it into the core framework, the two find equivalence classes for t1 and t2 are merged. The result is that t2 is the new equivalence class representative and t1 is no longer an equivalence class representative. When this happens, the notify list of t1 is traversed. Notify list entries consist of a theory and an expression d. For each entry (i,d), i->update(e, d) is called, where e is the theorem corresponding to the equality t1=t2.

To add the entry (i,d) to a term t1's notify list, a call must be made to t1.addNotify(i,d). This is typically done in setup.

See also:

setup

Implements CVC3::TheoryArith.

Definition at line 2306 of file theory_arith_old.cpp.

References CVC3::Theory::assertEqualities(), CVC3::TheoryArith::canonSimp(), CVC3::Debug::counter(), DebugAssert, CVC3::debugger, CVC3::Theory::enqueueFact(), CVC3::Theory::find(), CVC3::Theory::getCommonRules(), CVC3::Theorem::getExpr(), CVC3::Theorem::getLHS(), CVC3::Theorem::getRHS(), CVC3::Expr::hasFind(), IF_DEBUG, CVC3::Theory::iffMP(), CVC3::Theory::inconsistent(), CVC3::isIneq(), CVC3::Theory::leavesAreSimp(), rewrite(), CVC3::Theory::substitutivityRule(), CVC3::Theory::symmetryRule(), CVC3::Expr::toString(), CVC3::TRACE, CVC3::Theory::transitivityRule(), and CVC3::Theory::trueExpr().

Theorem TheoryArithOld::solve

(

const Theorem &

e

)

[virtual]

An optional solver.

The solve method can be used to implement a Shostak-style solver. Since solvers do not in general combine, the following technique is used. One theory is designated as the primary solver (in our case, it is the theory of arithmetic). For each equation that enters the core framework, the primary solver is called to ensure that the equation is in solved form with respect to the primary theory.

After the primary solver, the solver for the theory associated with the equation is called. This solver can do whatever it likes, as long as the result is still in solved form with respect to the primary solver. This is a slight generalization of what is described in my (Clark)'s PhD thesis.

Implements CVC3::TheoryArith.

Definition at line 2342 of file theory_arith_old.cpp.

References DebugAssert, doSolve(), CVC3::Theorem::getLHS(), CVC3::Theorem::getRHS(), CVC3::TheoryArith::intType(), isInteger(), CVC3::Theory::isLeaf(), CVC3::Theory::isLeafIn(), CVC3::Theorem::isRewrite(), CVC3::Expr::isTerm(), and CVC3::Theory::symmetryRule().

void TheoryArithOld::checkAssertEqInvariant

(

const Theorem &

e

)

[virtual]

A debug check used by the primary solver.

Implements CVC3::TheoryArith.

Definition at line 2416 of file theory_arith_old.cpp.

References CVC3::CommonProofRules::andElim(), CVC3::Expr::arity(), CVC3::TheoryArith::canonSimp(), DebugAssert, CVC3::Theory::getCommonRules(), CVC3::Theorem::getExpr(), CVC3::Theorem::getLHS(), CVC3::Theorem::getRHS(), CVC3::Expr::hasFind(), CVC3::Expr::isFalse(), CVC3::Theory::isLeaf(), CVC3::Theory::isLeafIn(), CVC3::Theorem::isRewrite(), CVC3::Expr::isTerm(), CVC3::Theory::leavesAreSimp(), and CVC3::TheoryArith::recursiveCanonSimpCheck().

void TheoryArithOld::checkType

(

const Expr &

e

)

[virtual]

Check that e is a valid Type expr.

Implements CVC3::TheoryArith.

Definition at line 2468 of file theory_arith_old.cpp.

References CVC3::Expr::arity(), DebugAssert, CVC3::Theory::getEM(), CVC3::Expr::getKind(), CVC3::Expr::getRational(), CVC3::INT, CVC3::isIntegerConst(), CVC3::REAL, CVC3::SUBRANGE, and CVC3::Expr::toString().

void TheoryArithOld::computeType

(

const Expr &

e

)

[virtual]

Compute and store the type of e.

Parameters:

e

is the expression whose type is computed.

This function computes the type of the top-level operator of e, and recurses into children using getType(), if necessary.

Implements CVC3::TheoryArith.

Definition at line 2492 of file theory_arith_old.cpp.

References CVC3::Expr::arity(), CVC3::Theory::boolType(), CVC3::TheoryArith::d_intType, CVC3::TheoryArith::d_realType, CVC3::DARK_SHADOW, DebugAssert, CVC3::DIVIDE, CVC3::GE, CVC3::Theory::getBaseType(), CVC3::Theory::getEM(), CVC3::Expr::getKind(), CVC3::Expr::getRational(), CVC3::Expr::getType(), CVC3::GRAY_SHADOW, CVC3::GT, CVC3::IS_INTEGER, CVC3::isInt(), isInteger(), CVC3::Rational::isInteger(), CVC3::Expr::isRational(), CVC3::LE, CVC3::LT, CVC3::MINUS, CVC3::MULT, CVC3::PLUS, CVC3::POW, CVC3::RATIONAL_EXPR, CVC3::REAL_CONST, CVC3::Expr::setType(), CVC3::Expr::toString(), CVC3::Type::toString(), and CVC3::UMINUS.

Type TheoryArithOld::computeBaseType

(

const Type &

t

)

[virtual]

Compute the base type of the top-level operator of an arbitrary type.

Implements CVC3::TheoryArith.

Definition at line 2575 of file theory_arith_old.cpp.

References DebugAssert, CVC3::Type::getExpr(), CVC3::Expr::getKind(), IF_DEBUG, CVC3::INT, CVC3::REAL, CVC3::TheoryArith::realType(), CVC3::SUBRANGE, and CVC3::Type::toString().

void TheoryArithOld::computeModelTerm	(	const Expr &	e,
		std::vector< Expr > &	v
	)			[virtual]

Add variables from 'e' to 'v' for constructing a concrete model.

If e is already of primitive type, do NOT add it to v.

Implements CVC3::TheoryArith.

Definition at line 2370 of file theory_arith_old.cpp.

References CVC3::Expr::begin(), CVC3::DIVIDE, CVC3::Expr::end(), CVC3::Theory::findExpr(), CVC3::Expr::getKind(), CVC3::MULT, CVC3::PLUS, CVC3::POW, CVC3::RATIONAL_EXPR, CVC3::Expr::toString(), and CVC3::TRACE.

Expr TheoryArithOld::computeTypePred	(	const Type &	t,
		const Expr &	e
	)			[virtual]

Theory specific computation of the subtyping predicate for type t applied to the expression e.

By default returns true. Each theory needs to compute subtype predicates for the types associated with it. So, for example, the theory of records will take a record type [# f1: T1, f2: T2 #] and an expression e and will return the subtyping predicate for e, namely: computeTypePred(T1, e.f1) AND computeTypePred(T2, e.f2)

Implements CVC3::TheoryArith.

Definition at line 2398 of file theory_arith_old.cpp.

References CVC3::andExpr(), CVC3::Expr::getEM(), CVC3::Type::getExpr(), CVC3::Expr::getKind(), CVC3::INT, CVC3::IS_INTEGER, CVC3::leExpr(), CVC3::SUBRANGE, and CVC3::ExprManager::trueExpr().

Expr TheoryArithOld::computeTCC

(

const Expr &

e

)

[virtual]

Compute and cache the TCC of e.

Parameters:

e

is an expression (term or formula). This function computes the TCC of e which is true iff the expression is defined.

This function computes the TCC or predicate of the top-level operator of e, and recurses into children using getTCC(), if necessary.

The default implementation is to compute TCCs recursively for all children, and return their conjunction.

Implements CVC3::TheoryArith.

Definition at line 2584 of file theory_arith_old.cpp.

References CVC3::Expr::andExpr(), CVC3::Theory::computeTCC(), DebugAssert, CVC3::DIVIDE, and CVC3::TheoryArith::rat().

ExprStream & TheoryArithOld::print	(	ExprStream &	os,
		const Expr &	e
	)			[virtual]

Theory-specific pretty-printing.

By default, print the top node in AST, and resume pretty-printing the children. The same call e.print(os) can be used in DP-specific printers to use AST printing for the given node. In fact, it is strongly recommended to add e.print(os) as the default for all the cases/kinds that are not handled by the particular pretty-printer.

Implements CVC3::TheoryArith.

Definition at line 2711 of file theory_arith_old.cpp.

References CVC3::Expr::arity(), CVC3::DARK_SHADOW, CVC3::DIVIDE, CVC3::GE, CVC3::Expr::getKind(), CVC3::GRAY_SHADOW, CVC3::GT, CVC3::INT, CVC3::IS_INTEGER, CVC3::isInt(), CVC3::ExprStream::lang(), CVC3::LE, CVC3::LISP_LANG, CVC3::LT, CVC3::MINUS, CVC3::MULT, CVC3::NEGINF, CVC3::PLUS, CVC3::POSINF, CVC3::POW, CVC3::PRESENTATION_LANG, CVC3::Expr::print(), CVC3::TheoryArith::printRational(), CVC3::push(), CVC3::RATIONAL_EXPR, CVC3::REAL, CVC3::REAL_CONST, CVC3::SIMPLIFY_LANG, CVC3::SMTLIB_LANG, CVC3::space(), CVC3::SUBRANGE, and CVC3::UMINUS.

Expr TheoryArithOld::parseExprOp

(

const Expr &

e

)

[virtual]

Theory-specific parsing implemented by the DP.

Implements CVC3::TheoryArith.

Definition at line 2600 of file theory_arith_old.cpp.

References CVC3::Expr::arity(), CVC3::Expr::begin(), DebugAssert, CVC3::DIVIDE, CVC3::divideExpr(), CVC3::Expr::end(), CVC3::GE, CVC3::geExpr(), CVC3::Expr::getEM(), CVC3::Theory::getEM(), CVC3::ExprManager::getKind(), CVC3::Expr::getKind(), CVC3::GT, CVC3::gtExpr(), CVC3::ID, CVC3::INT, CVC3::INTDIV, CVC3::IS_INTEGER, CVC3::LE, CVC3::leExpr(), CVC3::LT, CVC3::ltExpr(), CVC3::MINUS, CVC3::minusExpr(), CVC3::MOD, CVC3::MULT, CVC3::multExpr(), CVC3::NEGINF, CVC3::ExprManager::newLeafExpr(), CVC3::NULL_KIND, CVC3::Theory::parseExpr(), CVC3::PLUS, CVC3::plusExpr(), CVC3::POSINF, CVC3::POW, CVC3::powExpr(), CVC3::RAW_LIST, CVC3::REAL, CVC3::SUBRANGE, CVC3::Expr::toString(), CVC3::TRACE, CVC3::UMINUS, and CVC3::uminusExpr().

---

Friends And Related Function Documentation

std::ostream& operator<<	(	std::ostream &	os,
		const FreeConst &	fc
	)			[friend]

Printing.

Definition at line 44 of file theory_arith_old.cpp.

std::ostream& operator<<	(	std::ostream &	os,
		const Ineq &	ineq
	)			[friend]

Printing.

Definition at line 54 of file theory_arith_old.cpp.

---

Member Data Documentation

CDList<Theorem> CVC3::TheoryArithOld::d_diseq [private]

Definition at line 29 of file theory_arith_old.h.

Referenced by assertFact(), checkSat(), and TheoryArithOld().

CDO<size_t> CVC3::TheoryArithOld::d_diseqIdx [private]

Definition at line 30 of file theory_arith_old.h.

Referenced by checkSat().

ArithProofRules* CVC3::TheoryArithOld::d_rules [private]

Definition at line 31 of file theory_arith_old.h.

Referenced by addToBuffer(), assertFact(), canon(), checkSat(), doSolve(), isolateVariable(), normalize(), normalizeProjectIneqs(), processFiniteInterval(), processRealEq(), processSimpleIntEq(), projectInequalities(), rewrite(), TheoryArithOld(), and ~TheoryArithOld().

CDO<bool> CVC3::TheoryArithOld::d_inModelCreation [private]

Definition at line 32 of file theory_arith_old.h.

Referenced by assertFact(), checkSat(), computeModelBasic(), and refineCounterExample().

ExprMap<CDList<Ineq> *> CVC3::TheoryArithOld::d_inequalitiesRightDB [private]

Database of inequalities with a variable isolated on the right.

Definition at line 73 of file theory_arith_old.h.

Referenced by findBounds(), processFiniteIntervals(), projectInequalities(), and ~TheoryArithOld().

ExprMap<CDList<Ineq> *> CVC3::TheoryArithOld::d_inequalitiesLeftDB [private]

Database of inequalities with a variable isolated on the left.

Definition at line 75 of file theory_arith_old.h.

Referenced by findBounds(), processFiniteIntervals(), projectInequalities(), and ~TheoryArithOld().

CDMap<Expr, FreeConst> CVC3::TheoryArithOld::d_freeConstDB [private]

Mapping of inequalities to the largest/smallest free constant.

The Expr is the original inequality with the free constant removed and inequality converted to non-strict (for indexing purposes). I.e. ax<c+t becomes ax<=t. This inequality is mapped to a pair<c,strict>, the smallest (largest for c+t<ax) constant among inequalities with the same 'a', 'x', and 't', and a boolean flag indicating whether the strongest inequality is strict.

Definition at line 84 of file theory_arith_old.h.

Referenced by updateSubsumptionDB().

CDList<Theorem> CVC3::TheoryArithOld::d_buffer [private]

Buffer of input inequalities.

Definition at line 86 of file theory_arith_old.h.

Referenced by addToBuffer(), assertFact(), checkSat(), processBuffer(), and TheoryArithOld().

CDO<size_t> CVC3::TheoryArithOld::d_bufferIdx [private]

Buffer index of the next unprocessed inequality.

Definition at line 87 of file theory_arith_old.h.

Referenced by assertFact(), checkSat(), processBuffer(), and TheoryArithOld().

const int* CVC3::TheoryArithOld::d_bufferThres [private]

Threshold when the buffer must be processed.

Definition at line 88 of file theory_arith_old.h.

Referenced by assertFact().

CDMap<Expr, int> CVC3::TheoryArithOld::d_countRight [private]

Mapping of a variable to the number of inequalities where the variable would be isolated on the right.

Definition at line 92 of file theory_arith_old.h.

Referenced by pickMonomial(), and updateStats().

CDMap<Expr, int> CVC3::TheoryArithOld::d_countLeft [private]

Mapping of a variable to the number of inequalities where the variable would be isolated on the left.

Definition at line 95 of file theory_arith_old.h.

Referenced by pickMonomial(), and updateStats().

CDMap<Expr, bool> CVC3::TheoryArithOld::d_sharedTerms [private]

Set of shared terms (for counterexample generation).

Definition at line 97 of file theory_arith_old.h.

Referenced by addSharedTerm(), and refineCounterExample().

CDMap<Expr, bool> CVC3::TheoryArithOld::d_sharedVars [private]

Set of shared integer variables (i-leaves).

Definition at line 99 of file theory_arith_old.h.

VarOrderGraph CVC3::TheoryArithOld::d_graph [private]

Definition at line 119 of file theory_arith_old.h.

Referenced by assignVariables(), and pickMonomial().

---

The documentation for this class was generated from the following files:

• theory_arith_old.h
• arith_theorem_producer_old.cpp
• theory_arith_old.cpp

---