#include <theory_arith_old.h>

Inherits CVC3::TheoryArith.

Collaboration diagram for CVC3::TheoryArithOld:

[legend]

List of all members.

Classes

class DifferenceLogicGraph
class FreeConst
Data class for the strongest free constant in separation inqualities. More...
struct GraphEdge
class Ineq
Private class for an inequality in the Fourier-Motzkin database. More...
class VarOrderGraph

Public Member Functions

void separateMonomial (const Expr &e, Expr &c, Expr &var)
Separate monomial e = c*p1*...*pn into c and 1*p1*...*pn.
bool isInteger (const Expr &e)
Check the term t for integrality (return bool)
TheoryArithOld (TheoryCore *core)
~TheoryArithOld ()
ArithProofRules * createProofRulesOld ()
void addSharedTerm (const Expr &e)
Notify theory of a new shared term.
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.
Cardinality finiteTypeInfo (Expr &e, Unsigned &n, bool enumerate, bool computeSize)
Compute information related to finiteness of types.
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.
void tryPropagate (const Expr &x, const Expr &y, const DifferenceLogicGraph::EdgeInfo &x_y_edge, int kind)
void addMultiplicativeSignSplit (const Theorem &case_split_thm)
bool addPairToArithOrder (const Expr &smaller, const Expr &bigger)
bool nonlinearSignSplit () const
bool isNonlinearEq (const Expr &e)
bool isNonlinearSumTerm (const Expr &term)
bool isPowersEquality (const Expr &nonlinearEq, Expr &power1, Expr &power2)
bool isPowerEquality (const Expr &nonlinearEq, Rational &constant, Expr &power1)

Private Types

enum BoundsQueryType { QueryWithCacheLeaves, QueryWithCacheLeavesAndConstrainedComputation, QueryWithCacheAll }
typedef ExprMap< std::set
< std::pair< Rational, Expr > > > AtomsMap

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()
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.
bool pickIntEqMonomial (const Expr &right, Expr &isolated, bool &nonlin)
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.
bool addToBuffer (const Theorem &thm, bool priority=false)
Add an inequality to the input buffer. See also d_buffer.
Expr computeNormalFactor (const Expr &rhs, bool normalizeConstants)
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)
void getFactors (const Expr &e, std::set< Expr > &factors)
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)
Rational currentMaxCoefficient (Expr var)
void fixCurrentMaxCoefficient (Expr variable, Rational max)
void selectSmallestByCoefficient (const std::vector< Expr > &input, std::vector< Expr > &output)
Theorem rafineInequalityToInteger (const Theorem &thm)
Theorem checkIntegerEquality (const Theorem &thm)
Theorem inequalityToFind (const Theorem &inequalityThm, bool normalizeRHS)
int extractTermsFromInequality (const Expr &inequality, Rational &c1, Expr &t1, Rational &c2, Expr &t2)
void registerAtom (const Expr &e)
Theory-specific registration of atoms.
int termDegree (const Expr &e)
bool canPickEqMonomial (const Expr &right)
bool isBounded (const Expr &t, BoundsQueryType queryType=QueryWithCacheLeaves)
bool hasLowerBound (const Expr &t, BoundsQueryType queryType=QueryWithCacheLeaves)
bool hasUpperBound (const Expr &t, BoundsQueryType queryType=QueryWithCacheLeaves)
bool isConstrained (const Expr &t, bool intOnly=true, BoundsQueryType queryType=QueryWithCacheLeaves)
bool isConstrainedAbove (const Expr &t, BoundsQueryType queryType=QueryWithCacheLeaves)
bool isConstrainedBelow (const Expr &t, BoundsQueryType queryType=QueryWithCacheLeaves)
DifferenceLogicGraph::EpsRational getUpperBound (const Expr &t, BoundsQueryType queryType=QueryWithCacheLeaves)
DifferenceLogicGraph::EpsRational getLowerBound (const Expr &t, BoundsQueryType queryType=QueryWithCacheLeaves)
int computeTermBounds ()

Private Attributes

CDList< Theorem > d_diseq
CDO< size_t > d_diseqIdx
CDMap< Expr, bool > diseqSplitAlready
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_0
Buffer of input inequalities (high priority)
CDList< Theorem > d_buffer_1
Buffer of input inequalities (one variable)
CDList< Theorem > d_buffer_2
Buffer of input inequalities (small constraints)
CDList< Theorem > d_buffer_3
Buffer of input inequalities (big constraint)
CDO< size_t > d_bufferIdx_0
Buffer index of the next unprocessed inequality.
CDO< size_t > d_bufferIdx_1
Buffer index of the next unprocessed inequality.
CDO< size_t > d_bufferIdx_2
Buffer index of the next unprocessed inequality.
CDO< size_t > d_bufferIdx_3
Buffer index of the next unprocessed inequality.
CDO< size_t > diff_logic_size
Number of queries that are just difference logic.
const int * d_bufferThres
Threshold when the buffer must be processed.
const bool * d_splitSign
const int * d_grayShadowThres
Threshold on gray shadow size (ignore it and set incomplete)
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)
CDList< Expr > d_sharedTermsList
CDMap< Expr, bool > d_sharedVars
Set of shared integer variables (i-leaves)
VarOrderGraph d_graph
ExprMap< Rational > maxCoefficientLeft
ExprMap< Rational > maxCoefficientRight
ExprMap< Rational > fixedMaxCoefficient
CDMap< Expr, Theorem > bufferedInequalities
CDMap< Expr, Rational > termLowerBound
CDMap< Expr, Theorem > termLowerBoundThm
CDMap< Expr, Rational > termUpperBound
CDMap< Expr, Theorem > termUpperBoundThm
CDMap< Expr, Expr > alreadyProjected
CDMap< Expr, bool > dontBuffer
CDO< bool > diffLogicOnly
AtomsMap formulaAtomLowerBound
AtomsMap formulaAtomUpperBound
ExprMap< bool > formulaAtoms
DifferenceLogicGraph diffLogicGraph
Expr zero
CDO< unsigned > shared_index_1
CDO< unsigned > shared_index_2
std::vector< Theorem > multiplicativeSignSplits
CDMap< Expr,
DifferenceLogicGraph::EpsRational > termUpperBounded
CDMap< Expr,
DifferenceLogicGraph::EpsRational > termLowerBounded
CDMap< Expr, bool > termConstrainedBelow
CDMap< Expr, bool > termConstrainedAbove

Friends

std::ostream & operator<< (std::ostream &os, const FreeConst &fc)
Printing.
std::ostream & operator<< (std::ostream &os, const Ineq &ineq)
Printing.

Detailed Description

Definition at line 30 of file theory_arith_old.h.

Member Typedef Documentation

typedef ExprMap< std::set< std::pair<Rational, Expr> > > CVC3::TheoryArithOld::AtomsMap [private]

Definition at line 445 of file theory_arith_old.h.

Member Enumeration Documentation

enum CVC3::TheoryArithOld::BoundsQueryType [private]

Enumerator:

QueryWithCacheLeaves	Query the bounds/constrained using cache for leaves
QueryWithCacheLeavesAndConstrainedComputation	Query the bounds/constrained using cashe for leaves, but also see if the value is constrained
QueryWithCacheAll	Query the bounds/constrained by only querying the cache, don't try to figure it out

Definition at line 910 of file theory_arith_old.h.

Constructor & Destructor Documentation

TheoryArithOld::TheoryArithOld ( TheoryCore * core )

Definition at line 2225 of file theory_arith_old.cpp.

References createProofRulesOld(), d_buffer_0, d_buffer_1, d_buffer_2, d_buffer_3, d_bufferIdx_1, d_bufferIdx_2, d_bufferIdx_3, d_diseq, CVC3::TheoryArith::d_intType, CVC3::TheoryArith::d_kinds, CVC3::TheoryArith::d_realType, d_rules, CVC3::DARK_SHADOW, diffLogicGraph, CVC3::DIVIDE, CVC3::GE, CVC3::Theory::getCommonRules(), CVC3::Theory::getEM(), CVC3::Theorem::getExpr(), 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::TheoryArith::rat(), RATIONAL_EXPR, CVC3::REAL, CVC3::REAL_CONST, CVC3::Theory::registerTheory(), CVC3::TheoryArithOld::DifferenceLogicGraph::setArith(), CVC3::TheoryArithOld::DifferenceLogicGraph::setRules(), CVC3::SUBRANGE, CVC3::UMINUS, CVC3::CommonProofRules::varIntroSkolem(), and zero.

TheoryArithOld::~TheoryArithOld ( )

Definition at line 2339 of file theory_arith_old.cpp.

References CVC3::ExprMap< Data >::begin(), d_inequalitiesLeftDB, d_inequalitiesRightDB, CVC3::TheoryArith::d_kinds, d_rules, CVC3::ExprMap< Data >::end(), and CVC3::Theory::unregisterTheory().

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 70 of file theory_arith_old.cpp.

References CVC3::Expr::getType(), CVC3::IS_INTEGER, CVC3::isInt(), and CVC3::isReal().

Referenced by canPickEqMonomial(), checkIntegerEquality(), computeTermBounds(), isConstrained(), isInteger(), rafineInequalityToInteger(), and rewrite().

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 81 of file theory_arith_old.cpp.

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

Referenced by rewrite().

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

Extract the free constant from an inequality.

Definition at line 98 of file theory_arith_old.cpp.

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

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 116 of file theory_arith_old.cpp.

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

bool TheoryArithOld::kidsCanonical ( const Expr & e ) [private]

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

Definition at line 186 of file theory_arith_old.cpp.

References CVC3::Expr::arity(), std::endl(), and IF_DEBUG.

Theorem TheoryArithOld::canon ( const Expr & e ) [private, virtual]

Canonize the expression e, assuming, all children are canonical.

Implements CVC3::TheoryArith.

Definition at line 218 of file theory_arith_old.cpp.

References CVC3::Expr::arity(), DebugAssert, CVC3::DIVIDE, CVC3::Expr::getKind(), CVC3::Theorem::getRHS(), CVC3::isRational(), CVC3::MINUS, CVC3::MULT, CVC3::PLUS, CVC3::POW, CVC3::Expr::toString(), TRACE, and CVC3::UMINUS.

Referenced by rewrite(), and tryPropagate().

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 371 of file theory_arith_old.cpp.

References DebugAssert, CVC3::Theorem::getRHS(), CVC3::Expr::hasFind(), CVC3::Expr::toString(), and TRACE.

Referenced by 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 191 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 401 of file theory_arith_old.cpp.

References CVC3::Expr::arity(), DebugAssert, CVC3::Theorem::getExpr(), CVC3::Expr::getOp(), and CVC3::Theorem::toString().

Referenced by rafineInequalityToInteger().

Theorem TheoryArithOld::canonPredEquiv ( const Theorem & thm ) [private]

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

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

Definition at line 417 of file theory_arith_old.cpp.

References CVC3::Expr::arity(), DebugAssert, CVC3::Expr::getOp(), CVC3::Theorem::getRHS(), and CVC3::Theorem::toString().

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

Theorem TheoryArithOld::doSolve ( const Theorem & thm ) [private]

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

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

translate e to the form e' = 0
if (e'.isRational()) then {if e' != 0 return false else true}
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 447 of file theory_arith_old.cpp.

References DebugAssert, FatalAssert, CVC3::Theorem::getExpr(), CVC3::Expr::getRational(), CVC3::Expr::isFalse(), CVC3::isMult(), CVC3::isPow(), CVC3::Expr::isRational(), CVC3::isRational(), CVC3::Theorem::isRewrite(), CVC3::Expr::isTrue(), MiniSat::right(), CVC3::ArithException::toString(), CVC3::Theorem::toString(), and 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 434 of file theory_arith_old.cpp.

bool TheoryArithOld::pickIntEqMonomial	(	const Expr &	right,
		Expr &	isolated,
		bool &	nonlin
	)		`[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 563 of file theory_arith_old.cpp.

References CVC3::abs(), CVC3::Expr::arity(), CVC3::Expr::begin(), DebugAssert, CVC3::Expr::end(), CVC3::isMult(), CVC3::isPlus(), CVC3::isRational(), MiniSat::min(), and CVC3::Expr::toString().

Theorem TheoryArithOld::processRealEq ( const Theorem & eqn ) [private]

processes equalities with 1 or more vars of type REAL

input is 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 "var = e''" Theorem.

Definition at line 615 of file theory_arith_old.cpp.

References CVC3::Expr::arity(), DebugAssert, EQ, CVC3::Theorem::getExpr(), CVC3::Theorem::getLHS(), CVC3::Expr::getRational(), CVC3::Theorem::getRHS(), CVC3::isMult(), CVC3::isPlus(), CVC3::isRational(), CVC3::Expr::isRational(), CVC3::isReal(), MiniSat::left(), MiniSat::right(), CVC3::Expr::toString(), CVC3::Theorem::toString(), and TRACE.

Theorem TheoryArithOld::processIntEq ( const Theorem & eqn ) [private]

processes equalities whose vars are all of type INT

input is 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 "var = e''" Theorem and some associated equations in solved form.

Definition at line 869 of file theory_arith_old.cpp.

References CVC3::Expr::arity(), DebugAssert, CVC3::Theorem::getExpr(), CVC3::Expr::isAnd(), CVC3::Expr::isBoolConst(), CVC3::Expr::isFalse(), CVC3::Theorem::isRewrite(), CVC3::Expr::toString(), and TRACE.

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 739 of file theory_arith_old.cpp.

References CVC3::Expr::arity(), CVC3::Expr::begin(), DebugAssert, CVC3::Expr::end(), EQ, CVC3::Theorem::getExpr(), CVC3::Theorem::getLHS(), CVC3::Expr::getRational(), CVC3::Theorem::getRHS(), CVC3::Expr::isAnd(), isIntx(), CVC3::isMult(), CVC3::Theorem::isNull(), CVC3::isPlus(), CVC3::isPow(), CVC3::Expr::isRational(), CVC3::Theorem::isRewrite(), MiniSat::right(), CVC3::Theorem::toString(), CVC3::Expr::toString(), and TRACE.

void TheoryArithOld::processBuffer ( ) [private]

Process inequalities in the buffer.

Definition at line 1037 of file theory_arith_old.cpp.

References CVC3::Expr::begin(), DebugAssert, CVC3::Expr::end(), CVC3::Theorem::getExpr(), CVC3::Expr::isFalse(), CVC3::isIneq(), CVC3::isPlus(), CVC3::Expr::isTrue(), CVC3::Expr::toString(), and TRACE.

Referenced by assertFact(), and checkSat().

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

Take an inequality and isolate a variable.

Definition at line 1497 of file theory_arith_old.cpp.

References DebugAssert, CVC3::Theorem::getExpr(), CVC3::Expr::getKind(), CVC3::Expr::getRational(), CVC3::isLE(), CVC3::isLT(), CVC3::isMult(), CVC3::isPlus(), CVC3::Expr::isRational(), CVC3::isRational(), MiniSat::right(), CVC3::Theorem::toString(), CVC3::Expr::toString(), and TRACE.

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

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

Definition at line 1141 of file theory_arith_old.cpp.

References CVC3::ExprMap< Data >::end(), CVC3::ExprMap< Data >::find(), CVC3::Expr::getType(), CVC3::Expr::isRational(), CVC3::Rational::toString(), and TRACE.

void TheoryArithOld::updateStats ( const Expr & monomial ) [private]

Update the statistics counters for the monomial.

Definition at line 1187 of file theory_arith_old.cpp.

References CVC3::Expr::getRational().

bool TheoryArithOld::addToBuffer	(	const Theorem &	thm,
		bool	priority = `false`
	)		`[private]`

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

Definition at line 1239 of file theory_arith_old.cpp.

References CVC3::Expr::arity(), CVC3::Expr::begin(), CVC3::CDMap< Key, Data, HashFcn >::end(), CVC3::Expr::end(), CVC3::CDMap< Key, Data, HashFcn >::find(), CVC3::Theorem::getExpr(), CVC3::Expr::getKind(), CVC3::Expr::getRational(), CVC3::Theorem::getRHS(), CVC3::isMult(), CVC3::isPlus(), CVC3::isPow(), CVC3::isRational(), CVC3::LE, CVC3::LT, CVC3::Expr::toString(), and TRACE.

Referenced by assertFact().

Expr TheoryArithOld::computeNormalFactor	(	const Expr &	rhs,
		bool	normalizeConstants
	)		`[private]`

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

Definition at line 1577 of file theory_arith_old.cpp.

References CVC3::abs(), CVC3::Expr::arity(), CVC3::Rational::getDenominator(), CVC3::Rational::getNumerator(), CVC3::Expr::getRational(), CVC3::isMult(), CVC3::isPlus(), CVC3::MULT, and RATIONAL_EXPR.

Referenced by 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 3063 of file theory_arith_old.cpp.

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

Referenced by inequalityToFind(), 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 3139 of file theory_arith_old.cpp.

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

Expr TheoryArithOld::pickMonomial ( const Expr & right ) [private]

Definition at line 2015 of file theory_arith_old.cpp.

References CVC3::Expr::begin(), DebugAssert, CVC3::Expr::end(), CVC3::int2string(), CVC3::isPlus(), CVC3::Expr::toString(), and TRACE.

void TheoryArithOld::getFactors	(	const Expr &	e,
		std::set< Expr > &	factors
	)		`[private]`

Definition at line 705 of file theory_arith_old.cpp.

References CVC3::Expr::arity(), CVC3::Expr::begin(), DebugAssert, CVC3::Expr::end(), CVC3::Expr::getKind(), CVC3::Expr::getRational(), CVC3::isIntegerConst(), CVC3::MULT, CVC3::POW, RATIONAL_EXPR, and CVC3::Expr::toString().

Referenced by rewrite().

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 1682 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::Expr::toString(), and TRACE.

Referenced by findRationalBound(), getLowerBound(), getUpperBound(), isConstrainedAbove(), and isConstrainedBelow().

bool CVC3::TheoryArithOld::isInteger ( const Expr & e ) [inline]

Check the term t for integrality (return bool)

Definition at line 258 of file theory_arith_old.h.

References CVC3::Expr::getType(), CVC3::isInt(), isIntegerThm(), CVC3::Theorem::isNull(), and CVC3::isReal().

Referenced by assertFact(), assignVariables(), computeType(), isPowerEquality(), print(), processFiniteIntervals(), solve(), and update().

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

Definition at line 1621 of file theory_arith_old.cpp.

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

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 1637 of file theory_arith_old.cpp.

References CVC3::Expr::begin(), CVC3::Expr::end(), and CVC3::Expr::isTerm().

bool TheoryArithOld::isStale ( const Ineq & ineq ) [private]

Check if the inequality is "stale" or subsumed.

Definition at line 1649 of file theory_arith_old.cpp.

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

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

void TheoryArithOld::assignVariables ( std::vector< Expr > & v ) [private]

Definition at line 2900 of file theory_arith_old.cpp.

References CVC3::Theory::assignValue(), CVC3::TheoryArithOld::DifferenceLogicGraph::computeModel(), d_graph, diffLogicGraph, diffLogicOnly, findBounds(), CVC3::Theory::findExpr(), CVC3::TheoryArithOld::DifferenceLogicGraph::getValuation(), CVC3::Theory::inconsistent(), CVC3::Rational::isInteger(), isInteger(), CVC3::Expr::isRational(), CVC3::TheoryArith::rat(), CVC3::TheoryArithOld::VarOrderGraph::selectSmallest(), and TRACE.

Referenced by computeModelBasic().

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

Definition at line 2828 of file theory_arith_old.cpp.

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

Referenced by findBounds().

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

Definition at line 2849 of file theory_arith_old.cpp.

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

Referenced by assignVariables().

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

Definition at line 1820 of file theory_arith_old.cpp.

References CVC3::Expr::arity(), DebugAssert, CVC3::Theorem::getExpr(), CVC3::GRAY_SHADOW, IF_DEBUG, CVC3::isInt(), isIntx(), CVC3::isLE(), CVC3::isLT(), CVC3::isMult(), CVC3::Theorem::isNull(), CVC3::Expr::isOr(), CVC3::isPlus(), CVC3::Expr::isRational(), CVC3::isRational(), MiniSat::right(), CVC3::Expr::toString(), and TRACE.

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 912 of file theory_arith_old.cpp.

References CVC3::ExprMap< Data >::begin(), DebugAssert, CVC3::ExprMap< Data >::end(), CVC3::Theorem::getExpr(), IF_DEBUG, TRACE, and TRACE_MSG.

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 966 of file theory_arith_old.cpp.

References CVC3::Expr::arity(), CVC3::ExprMap< Data >::empty(), CVC3::ExprMap< Data >::end(), CVC3::ExprMap< Data >::find(), CVC3::Theorem::getRHS(), and TRACE.

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 1017 of file theory_arith_old.cpp.

References DebugAssert, CVC3::ExprMap< Data >::empty(), CVC3::Theorem::getExpr(), CVC3::Theorem::getRHS(), CVC3::Theorem::isRewrite(), and CVC3::Expr::toString().

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 2355 of file theory_arith_old.cpp.

References CVC3::Expr::begin(), CVC3::Expr::end(), and 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 2369 of file theory_arith_old.cpp.

References DebugAssert, CVC3::Theorem::getExpr(), CVC3::Expr::getRational(), CVC3::isLE(), CVC3::isMult(), CVC3::isPlus(), CVC3::Expr::isRational(), CVC3::isRational(), and CVC3::Expr::toString().

Referenced by 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 2428 of file theory_arith_old.cpp.

References d_inequalitiesLeftDB, d_inequalitiesRightDB, CVC3::ExprMap< Data >::end(), CVC3::ExprMap< Data >::find(), 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 2454 of file theory_arith_old.cpp.

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

ArithProofRules * TheoryArithOld::createProofRulesOld ( )

Definition at line 44 of file arith_theorem_producer_old.cpp.

Referenced by TheoryArithOld().

void TheoryArithOld::addSharedTerm ( const Expr & e ) [virtual]

Notify theory of a new shared term.

When a term e associated with theory i occurs as a child of an expression associated with theory j, the framework calls i->addSharedTerm(e) and j->addSharedTerm(e)

Implements CVC3::TheoryArith.

Definition at line 2468 of file theory_arith_old.cpp.

References d_sharedTerms, d_sharedTermsList, CVC3::CDMap< Key, Data, HashFcn >::end(), CVC3::CDMap< Key, Data, HashFcn >::find(), and CVC3::CDList< T >::push_back().

Referenced by update().

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 2477 of file theory_arith_old.cpp.

References addToBuffer(), CVC3::Expr::addToNotify(), d_buffer_0, d_buffer_1, d_buffer_2, d_buffer_3, d_bufferIdx_0, d_bufferIdx_1, d_bufferIdx_2, d_bufferIdx_3, d_bufferThres, d_diseq, d_grayShadowThres, d_inModelCreation, d_rules, DebugAssert, diffLogicOnly, CVC3::Theory::enqueueFact(), CVC3::ArithProofRules::expandDarkShadow(), CVC3::ArithProofRules::expandGrayShadow(), CVC3::ArithProofRules::expandGrayShadow0(), CVC3::Theorem::getExpr(), CVC3::Expr::getRational(), CVC3::ArithProofRules::grayShadowConst(), IF_DEBUG, CVC3::int2string(), CVC3::IS_INTEGER, CVC3::isDarkShadow(), CVC3::Expr::isEq(), CVC3::Expr::isFalse(), CVC3::isGrayShadow(), isInteger(), CVC3::ArithProofRules::IsIntegerElim(), CVC3::isIntPred(), CVC3::isLE(), CVC3::isLT(), CVC3::isMult(), CVC3::Expr::isNot(), CVC3::Expr::isRational(), multiplicativeSignSplits, processBuffer(), CVC3::CDList< T >::push_back(), CVC3::Theory::setIncomplete(), CVC3::Theory::setInconsistent(), CVC3::CDList< T >::size(), CVC3::ArithProofRules::splitGrayShadow(), CVC3::ArithProofRules::splitGrayShadowSmall(), CVC3::Expr::toString(), and TRACE.

void TheoryArithOld::refineCounterExample ( ) [virtual]

Process disequalities from the arrangement for model generation.

Implements CVC3::TheoryArith.

Definition at line 2795 of file theory_arith_old.cpp.

References CVC3::Theory::addSplitter(), CVC3::CDMap< Key, Data, HashFcn >::begin(), d_inModelCreation, d_sharedTerms, DebugAssert, CVC3::CDMap< Key, Data, HashFcn >::end(), CVC3::Expr::eqExpr(), CVC3::Theory::findExpr(), CVC3::Theory::getBaseType(), CVC3::Expr::getType(), CVC3::isReal(), CVC3::Theory::simplifyExpr(), CVC3::Type::toString(), CVC3::Expr::toString(), and 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 2951 of file theory_arith_old.cpp.

References assignVariables(), d_inModelCreation, CVC3::Theory::findExpr(), and 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 2974 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 2678 of file theory_arith_old.cpp.

References computeTermBounds(), d_buffer_0, d_buffer_1, d_buffer_2, d_buffer_3, d_diseq, d_diseqIdx, d_inModelCreation, d_rules, DebugAssert, diseqSplitAlready, CVC3::ArithProofRules::diseqToIneq(), CVC3::CDMap< Key, Data, HashFcn >::end(), std::endl(), CVC3::Theory::enqueueFact(), CVC3::Theory::find(), CVC3::CDMap< Key, Data, HashFcn >::find(), CVC3::Theorem::getExpr(), getLowerBound(), CVC3::Theorem::getRHS(), getUpperBound(), CVC3::Expr::hasFind(), IF_DEBUG, CVC3::Theory::inconsistent(), isConstrained(), CVC3::Expr::isRational(), processBuffer(), CVC3::CDList< T >::size(), CVC3::Expr::toString(), and 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 3145 of file theory_arith_old.cpp.

Referenced by checkIntegerEquality(), and rafineInequalityToInteger().

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 3424 of file theory_arith_old.cpp.

References CVC3::Expr::addToNotify(), CVC3::Expr::arity(), DebugAssert, CVC3::int2string(), CVC3::isIneq(), CVC3::isLE(), CVC3::isLT(), CVC3::Expr::isNot(), CVC3::isRational(), CVC3::Expr::isTerm(), CVC3::Expr::toString(), and 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 3459 of file theory_arith_old.cpp.

References addSharedTerm(), CVC3::Expr::addToNotify(), alreadyProjected, CVC3::Theory::assertEqualities(), bufferedInequalities, d_sharedTerms, DebugAssert, dontBuffer, CVC3::CDMap< Key, Data, HashFcn >::end(), CVC3::Theory::enqueueFact(), CVC3::Theory::falseExpr(), CVC3::CDMap< Key, Data, HashFcn >::find(), CVC3::Theory::find(), CVC3::Theory::findExpr(), CVC3::Theory::getCommonRules(), CVC3::Theorem::getExpr(), CVC3::Expr::getKind(), CVC3::Theorem::getLHS(), CVC3::Expr::getRational(), CVC3::Theorem::getRHS(), CVC3::Expr::hasFind(), IF_DEBUG, CVC3::Theory::iffMP(), CVC3::Theory::inconsistent(), CVC3::IS_INTEGER, CVC3::Expr::isAtomic(), CVC3::Expr::isEq(), CVC3::isIneq(), isInteger(), CVC3::isRational(), CVC3::Expr::isRational(), CVC3::Theory::setInconsistent(), CVC3::Theory::simplify(), CVC3::Theory::substitutivityRule(), CVC3::Theory::symmetryRule(), CVC3::Expr::toString(), 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 3616 of file theory_arith_old.cpp.

References DebugAssert, doSolve(), CVC3::Theorem::getLHS(), CVC3::Theorem::getRHS(), 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 3690 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 3742 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().

Cardinality TheoryArithOld::finiteTypeInfo	(	Expr &	e,
		Unsigned &	n,
		bool	enumerate,
		bool	computeSize
	)		`[virtual]`

Compute information related to finiteness of types.

Used by the TypeComputer defined in TheoryCore (theories should not call this funtion directly -- they should use the methods in Type instead). Each theory should implement this if it contains any types that could be non-infinite.

1. Returns Cardinality of the type (finite, infinite, or unknown) 2. If cardinality = finite and enumerate is true, sets e to the nth element of the type if it can sets e to NULL if n is out of bounds or if unable to compute nth element 3. If cardinality = finite and computeSize is true, sets n to the size of the type if it can sets n to 0 otherwise

Implements CVC3::TheoryArith.

Definition at line 3766 of file theory_arith_old.cpp.

References CVC3::CARD_FINITE, CVC3::CARD_INFINITE, CVC3::Expr::getKind(), CVC3::Expr::getRational(), CVC3::Rational::getUnsigned(), CVC3::TheoryArith::rat(), and CVC3::SUBRANGE.

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 3794 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::ExprManager::getKindName(), CVC3::Expr::getRational(), CVC3::Expr::getType(), CVC3::GRAY_SHADOW, CVC3::GT, CVC3::IS_INTEGER, isInteger(), CVC3::Rational::isInteger(), CVC3::Expr::isRational(), CVC3::LE, CVC3::LT, CVC3::MINUS, CVC3::MULT, CVC3::PLUS, CVC3::POW, RATIONAL_EXPR, CVC3::REAL_CONST, CVC3::Expr::setType(), CVC3::Expr::toString(), CVC3::Type::toString(), and CVC3::UMINUS.

Type TheoryArithOld::computeBaseType ( const Type & tp ) [virtual]

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

Implements CVC3::TheoryArith.

Definition at line 3877 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 3644 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, RATIONAL_EXPR, CVC3::Expr::toString(), and 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 3672 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 3886 of file theory_arith_old.cpp.

References CVC3::Expr::andExpr(), CVC3::Expr::arity(), CVC3::Theory::computeTCC(), DebugAssert, CVC3::DIVIDE, CVC3::Expr::getKind(), 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 4021 of file theory_arith_old.cpp.

References CVC3::Expr::arity(), CVC3::Expr::begin(), CVC3::DARK_SHADOW, CVC3::DIVIDE, CVC3::Expr::end(), std::endl(), CVC3::GE, CVC3::Rational::getInt(), CVC3::Expr::getKind(), CVC3::Expr::getRational(), CVC3::GRAY_SHADOW, CVC3::GT, CVC3::INT, CVC3::IS_INTEGER, CVC3::isInt(), CVC3::Rational::isInteger(), isInteger(), CVC3::isRational(), 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::Expr::printAST(), CVC3::TheoryArith::printRational(), CVC3::push(), RATIONAL_EXPR, CVC3::REAL, CVC3::REAL_CONST, CVC3::SIMPLIFY_LANG, CVC3::SMTLIB_LANG, CVC3::SMTLIB_V2_LANG, CVC3::space(), CVC3::SPASS_LANG, CVC3::SUBRANGE, CVC3::Expr::toString(), CVC3::TPTP_LANG, and CVC3::UMINUS.

Expr TheoryArithOld::parseExprOp ( const Expr & e ) [virtual]

Theory-specific parsing implemented by the DP.

Implements CVC3::TheoryArith.

Definition at line 3902 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(), 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(), NULL_KIND, CVC3::Theory::parseExpr(), CVC3::PLUS, CVC3::plusExpr(), CVC3::POSINF, CVC3::POW, CVC3::powExpr(), RAW_LIST, CVC3::REAL, CVC3::SMTLIB_LANG, CVC3::SMTLIB_V2_LANG, CVC3::SUBRANGE, CVC3::Expr::toString(), CVC3::UMINUS, and CVC3::uminusExpr().

Rational TheoryArithOld::currentMaxCoefficient ( Expr var ) [private]

Returns the current maximal coefficient of the variable.

Parameters:

var	the variable.

Definition at line 1946 of file theory_arith_old.cpp.

References CVC3::ExprMap< Data >::end(), CVC3::ExprMap< Data >::find(), CVC3::Expr::getType(), CVC3::Rational::toString(), CVC3::Expr::toString(), and TRACE.

void TheoryArithOld::fixCurrentMaxCoefficient	(	Expr	variable,
		Rational	max
	)		`[private]`

Fixes the current max coefficient to be used in the ordering. If the maximal coefficient changes in the future, it will not be used in the ordering.

Parameters:

variable	the variable
max	the value to set it to

Definition at line 1978 of file theory_arith_old.cpp.

References CVC3::max().

void TheoryArithOld::selectSmallestByCoefficient	(	const std::vector< Expr > &	input,
		std::vector< Expr > &	output
	)		`[private]`

Among given input variables, select the smallest ones with respect to the coefficients.

Definition at line 1982 of file theory_arith_old.cpp.

Theorem TheoryArithOld::rafineInequalityToInteger ( const Theorem & thm ) [private]

Given an inequality theorem check if it is on integers and get rid of the non-integer constants.

Definition at line 3022 of file theory_arith_old.cpp.

References CVC3::Expr::arity(), canonPred(), canonPredEquiv(), d_rules, DebugAssert, CVC3::Theorem::getExpr(), CVC3::Theorem::getRHS(), CVC3::Theory::iffMP(), CVC3::isIneq(), isIntegerThm(), CVC3::Theorem::isNull(), CVC3::isPlus(), CVC3::isRational(), CVC3::Theorem::isRewrite(), CVC3::plusExpr(), CVC3::ArithProofRules::rafineStrictInteger(), rewrite(), TRACE, and CVC3::Theory::transitivityRule().

Referenced by normalize().

Theorem TheoryArithOld::checkIntegerEquality ( const Theorem & thm ) [private]

Given an equality theorem check if it is on integers with a non-integer constant. If yes, return a theorem 0 = 1

Definition at line 2982 of file theory_arith_old.cpp.

References CVC3::Expr::arity(), d_rules, DebugAssert, EQ, CVC3::Theorem::getExpr(), CVC3::Expr::getKind(), CVC3::Expr::getRational(), CVC3::Theorem::getRHS(), CVC3::Theory::iffMP(), CVC3::ArithProofRules::intEqualityRationalConstant(), CVC3::Rational::isInteger(), isIntegerThm(), CVC3::Theorem::isNull(), CVC3::isPlus(), CVC3::isRational(), CVC3::Theorem::isRewrite(), CVC3::plusExpr(), rewrite(), TRACE, and CVC3::Theory::transitivityRule().

Referenced by normalize().

Theorem TheoryArithOld::inequalityToFind	(	const Theorem &	inequalityThm,
		bool	normalizeRHS
	)		`[private]`

Takes an inequality theorem and substitutes the rhs for it's find. It also get's normalized.

Definition at line 4682 of file theory_arith_old.cpp.

References CVC3::Theorem::getExpr(), CVC3::Theorem::getRHS(), CVC3::Theory::iffMP(), CVC3::int2string(), CVC3::isRational(), normalize(), CVC3::Theory::simplify(), CVC3::Theory::substitutivityRule(), CVC3::Expr::toString(), TRACE, and CVC3::Theory::transitivityRule().

int TheoryArithOld::extractTermsFromInequality	(	const Expr &	inequality,
		Rational &	c1,
		Expr &	t1,
		Rational &	c2,
		Expr &	t2
	)		`[private]`

Take inequality of the form 0 op t and extract the c1, t1, c2 and t2, such that c1 <= t1 and t2 <= c2, where c1 and c2 are constants, and t1 and t2 are either sums of monomials or a monomial.

Returns:: the number of variables in terms t1 and t2

Definition at line 1194 of file theory_arith_old.cpp.

References DebugAssert, CVC3::Expr::getString(), CVC3::isIneq(), CVC3::isPlus(), CVC3::isRational(), CVC3::multExpr(), CVC3::plusExpr(), CVC3::Rational::toString(), CVC3::Expr::toString(), and TRACE.

Referenced by registerAtom().

void TheoryArithOld::registerAtom ( const Expr & e ) [private, virtual]

Theory-specific registration of atoms.

If a theory wants to implement its own theory propagation, it should implement this method and use it to collect all atoms that the core is interested in. If the theory can deduce the atom or its negation, it should do so (using enqueueFact).

Reimplemented from CVC3::Theory.

Definition at line 4731 of file theory_arith_old.cpp.

References d_rules, CVC3::CDMap< Key, Data, HashFcn >::end(), CVC3::Theory::enqueueFact(), extractTermsFromInequality(), CVC3::CDMap< Key, Data, HashFcn >::find(), formulaAtomLowerBound, formulaAtoms, formulaAtomUpperBound, CVC3::Theory::getCommonRules(), CVC3::Theorem::getExpr(), CVC3::Expr::getKind(), CVC3::Expr::getRational(), CVC3::ArithProofRules::implyNegatedInequality(), CVC3::ArithProofRules::implyWeakerInequality(), CVC3::ExprMap< Data >::insert(), CVC3::Expr::isAbsAtomicFormula(), CVC3::isIneq(), CVC3::LE, CVC3::LT, termLowerBound, termLowerBoundThm, termUpperBound, termUpperBoundThm, CVC3::Rational::toString(), CVC3::Expr::toString(), and TRACE.

int TheoryArithOld::termDegree ( const Expr & e ) [private]

Definition at line 5403 of file theory_arith_old.cpp.

References CVC3::Expr::arity(), CVC3::Rational::getInt(), CVC3::Expr::getRational(), CVC3::Theory::isLeaf(), CVC3::isMult(), and CVC3::isPow().

bool TheoryArithOld::canPickEqMonomial ( const Expr & right ) [private]

Definition at line 5414 of file theory_arith_old.cpp.

References CVC3::abs(), CVC3::Expr::arity(), CVC3::Expr::begin(), DebugAssert, CVC3::Expr::end(), isIntegerThm(), CVC3::Theory::isLeaf(), CVC3::Theory::isLeafIn(), and CVC3::isMult().

Referenced by rewrite().

bool TheoryArithOld::isBounded	(	const Expr &	t,
		BoundsQueryType	queryType = `QueryWithCacheLeaves`
	)		`[private]`

Check if the term is bounded. If the term is non-linear, just returns false.

Definition at line 5455 of file theory_arith_old.cpp.

References hasLowerBound(), hasUpperBound(), CVC3::Expr::toString(), and TRACE.

bool CVC3::TheoryArithOld::hasLowerBound	(	const Expr &	t,
		BoundsQueryType	queryType = `QueryWithCacheLeaves`
	)		`[inline, private]`

Definition at line 923 of file theory_arith_old.h.

References getLowerBound(), and CVC3::TheoryArithOld::DifferenceLogicGraph::EpsRational::isFinite().

Referenced by isBounded().

bool CVC3::TheoryArithOld::hasUpperBound	(	const Expr &	t,
		BoundsQueryType	queryType = `QueryWithCacheLeaves`
	)		`[inline, private]`

Definition at line 924 of file theory_arith_old.h.

References getUpperBound(), and CVC3::TheoryArithOld::DifferenceLogicGraph::EpsRational::isFinite().

Referenced by isBounded().

bool TheoryArithOld::isConstrained	(	const Expr &	t,
		bool	intOnly = `true`,
		BoundsQueryType	queryType = `QueryWithCacheLeaves`
	)		`[private]`

Definition at line 5868 of file theory_arith_old.cpp.

References isConstrainedAbove(), isConstrainedBelow(), isIntegerThm(), CVC3::Theorem::isNull(), CVC3::Expr::toString(), and TRACE.

Referenced by checkSat(), and computeTermBounds().

bool TheoryArithOld::isConstrainedAbove	(	const Expr &	t,
		BoundsQueryType	queryType = `QueryWithCacheLeaves`
	)		`[private]`

bool TheoryArithOld::isConstrainedBelow	(	const Expr &	t,
		BoundsQueryType	queryType = `QueryWithCacheLeaves`
	)		`[private]`

TheoryArithOld::DifferenceLogicGraph::EpsRational TheoryArithOld::getUpperBound	(	const Expr &	t,
		BoundsQueryType	queryType = `QueryWithCacheLeaves`
	)		`[private]`

Check if the term is bounded from above. If the term is non-linear, just returns false.

Definition at line 5460 of file theory_arith_old.cpp.

References CVC3::Expr::arity(), CVC3::CDMap< Key, Data, HashFcn >::end(), CVC3::CDMap< Key, Data, HashFcn >::find(), getLowerBound(), CVC3::Expr::getRational(), isConstrainedAbove(), CVC3::TheoryArithOld::DifferenceLogicGraph::EpsRational::isFinite(), CVC3::Theory::isLeaf(), CVC3::isMult(), isNonlinearSumTerm(), CVC3::isPlus(), CVC3::Expr::isRational(), CVC3::TheoryArithOld::DifferenceLogicGraph::EpsRational::PlusInfinity, QueryWithCacheAll, QueryWithCacheLeaves, QueryWithCacheLeavesAndConstrainedComputation, separateMonomial(), termConstrainedAbove, termUpperBounded, CVC3::TheoryArithOld::DifferenceLogicGraph::EpsRational::toString(), CVC3::Rational::toString(), CVC3::Expr::toString(), TRACE, and CVC3::TheoryArithOld::DifferenceLogicGraph::EpsRational::Zero.

Referenced by checkSat(), computeTermBounds(), getLowerBound(), and hasUpperBound().

TheoryArithOld::DifferenceLogicGraph::EpsRational TheoryArithOld::getLowerBound	(	const Expr &	t,
		BoundsQueryType	queryType = `QueryWithCacheLeaves`
	)		`[private]`

Check if the term is bouned from below. If the term is non-linear, just return false.

Definition at line 5532 of file theory_arith_old.cpp.

References CVC3::Expr::arity(), CVC3::CDMap< Key, Data, HashFcn >::end(), CVC3::CDMap< Key, Data, HashFcn >::find(), CVC3::Expr::getRational(), getUpperBound(), isConstrainedBelow(), CVC3::TheoryArithOld::DifferenceLogicGraph::EpsRational::isFinite(), CVC3::Theory::isLeaf(), CVC3::isMult(), isNonlinearSumTerm(), CVC3::isPlus(), CVC3::Expr::isRational(), CVC3::TheoryArithOld::DifferenceLogicGraph::EpsRational::MinusInfinity, QueryWithCacheAll, QueryWithCacheLeaves, QueryWithCacheLeavesAndConstrainedComputation, separateMonomial(), termConstrainedBelow, termLowerBounded, CVC3::TheoryArithOld::DifferenceLogicGraph::EpsRational::toString(), CVC3::Rational::toString(), CVC3::Expr::toString(), TRACE, and CVC3::TheoryArithOld::DifferenceLogicGraph::EpsRational::Zero.

Referenced by checkSat(), computeTermBounds(), getUpperBound(), and hasLowerBound().

int TheoryArithOld::computeTermBounds ( ) [private]

See whether and which terms are bounded.

Definition at line 5604 of file theory_arith_old.cpp.

Referenced by checkSat().

void TheoryArithOld::tryPropagate	(	const Expr &	x,
		const Expr &	y,
		const DifferenceLogicGraph::EdgeInfo &	x_y_edge,
		int	kind
	)

void TheoryArithOld::addMultiplicativeSignSplit ( const Theorem & case_split_thm ) [virtual]

Reimplemented from CVC3::TheoryArith.

Definition at line 5263 of file theory_arith_old.cpp.

References multiplicativeSignSplits.

bool TheoryArithOld::addPairToArithOrder	(	const Expr &	smaller,
		const Expr &	bigger
	)		`[virtual]`

Record that smaller should be smaller than bigger in the variable order. Should be implemented in decision procedures that support it.

Reimplemented from CVC3::TheoryArith.

Definition at line 5267 of file theory_arith_old.cpp.

References CVC3::TheoryArithOld::VarOrderGraph::addEdge(), d_graph, FatalAssert, CVC3::Expr::getType(), CVC3::isInt(), CVC3::isReal(), CVC3::TheoryArithOld::VarOrderGraph::lessThan(), CVC3::Expr::toString(), and TRACE.

bool CVC3::TheoryArithOld::nonlinearSignSplit ( ) const [inline]

Definition at line 953 of file theory_arith_old.h.

References d_splitSign.

bool TheoryArithOld::isNonlinearEq ( const Expr & e )

Check if equation is nonlinear. An equation is nonlinear if there is at least one nonlinear term in the sum on either side of the equation.

Definition at line 5292 of file theory_arith_old.cpp.

References CVC3::Expr::arity(), DebugAssert, CVC3::Expr::isEq(), isNonlinearSumTerm(), and CVC3::Expr::toString().

Referenced by findRationalBound(), and rewrite().

bool TheoryArithOld::isNonlinearSumTerm ( const Expr & term )

Check if a sum term is nonlinear

Definition at line 5279 of file theory_arith_old.cpp.

References CVC3::Expr::arity(), CVC3::Theory::isLeaf(), CVC3::isMult(), and CVC3::isPow().

Referenced by getLowerBound(), getUpperBound(), isConstrainedAbove(), isConstrainedBelow(), isNonlinearEq(), and rewrite().

bool TheoryArithOld::isPowersEquality	(	const Expr &	nonlinearEq,
		Expr &	power1,
		Expr &	power2
	)

Check if the equality is of the form c + power1^n - power2^n = 0;

Definition at line 5313 of file theory_arith_old.cpp.

References CVC3::Expr::arity(), DebugAssert, CVC3::Expr::getRational(), CVC3::Expr::isEq(), CVC3::isMult(), CVC3::isPlus(), CVC3::isPow(), CVC3::isRational(), and CVC3::Expr::toString().

Referenced by rewrite().

bool TheoryArithOld::isPowerEquality	(	const Expr &	nonlinearEq,
		Rational &	constant,
		Expr &	power1
	)

Check if the equality is of the form c - x^n = 0

Definition at line 5369 of file theory_arith_old.cpp.

References CVC3::Expr::arity(), DebugAssert, CVC3::Expr::getRational(), CVC3::Expr::isEq(), isInteger(), CVC3::isMult(), CVC3::isPlus(), CVC3::isPow(), CVC3::isRational(), and CVC3::Expr::toString().

Referenced by rewrite().

Friends And Related Function Documentation

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

Printing.

Definition at line 46 of file theory_arith_old.cpp.

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

Printing.

Definition at line 56 of file theory_arith_old.cpp.

Member Data Documentation

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

Definition at line 31 of file theory_arith_old.h.

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

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

Definition at line 32 of file theory_arith_old.h.

Referenced by checkSat().

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

Definition at line 33 of file theory_arith_old.h.

Referenced by checkSat().

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

Definition at line 34 of file theory_arith_old.h.

Referenced by assertFact(), checkIntegerEquality(), checkSat(), normalize(), rafineInequalityToInteger(), registerAtom(), rewrite(), TheoryArithOld(), tryPropagate(), and ~TheoryArithOld().

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

Definition at line 35 of file theory_arith_old.h.

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

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

Database of inequalities with a variable isolated on the right.

Definition at line 78 of file theory_arith_old.h.

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

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

Database of inequalities with a variable isolated on the left.

Definition at line 81 of file theory_arith_old.h.

Referenced by computeTermBounds(), findBounds(), processFiniteIntervals(), 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 91 of file theory_arith_old.h.

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

Buffer of input inequalities (high priority)

Is the problem only difference logic

Definition at line 99 of file theory_arith_old.h.

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

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

Buffer of input inequalities (one variable)

Definition at line 100 of file theory_arith_old.h.

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

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

Buffer of input inequalities (small constraints)

Definition at line 101 of file theory_arith_old.h.

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

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

Buffer of input inequalities (big constraint)

Definition at line 102 of file theory_arith_old.h.

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

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

Buffer index of the next unprocessed inequality.

Definition at line 104 of file theory_arith_old.h.

Referenced by assertFact().

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

Buffer index of the next unprocessed inequality.

Definition at line 105 of file theory_arith_old.h.

Referenced by assertFact(), and TheoryArithOld().

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

Buffer index of the next unprocessed inequality.

Definition at line 106 of file theory_arith_old.h.

Referenced by assertFact(), and TheoryArithOld().

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

Buffer index of the next unprocessed inequality.

Definition at line 107 of file theory_arith_old.h.

Referenced by assertFact(), and TheoryArithOld().

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

Number of queries that are just difference logic.

Definition at line 109 of file theory_arith_old.h.

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

Threshold when the buffer must be processed.

Definition at line 111 of file theory_arith_old.h.

Referenced by assertFact().

const bool* CVC3::TheoryArithOld::d_splitSign [private]

Definition at line 113 of file theory_arith_old.h.

Referenced by nonlinearSignSplit().

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

Threshold on gray shadow size (ignore it and set incomplete)

Definition at line 115 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 121 of file theory_arith_old.h.

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 125 of file theory_arith_old.h.

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

Set of shared terms (for counterexample generation)

Definition at line 128 of file theory_arith_old.h.

Referenced by addSharedTerm(), refineCounterExample(), and update().

CDList<Expr> CVC3::TheoryArithOld::d_sharedTermsList [private]

Definition at line 129 of file theory_arith_old.h.

Referenced by addSharedTerm().

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

Set of shared integer variables (i-leaves)

Definition at line 132 of file theory_arith_old.h.

VarOrderGraph CVC3::TheoryArithOld::d_graph [private]

Definition at line 155 of file theory_arith_old.h.

Referenced by addPairToArithOrder(), assignVariables(), and computeTermBounds().

ExprMap<Rational> CVC3::TheoryArithOld::maxCoefficientLeft [private]

Map from variables to the maximal (by absolute value) of one of it's coefficients

Definition at line 350 of file theory_arith_old.h.

ExprMap<Rational> CVC3::TheoryArithOld::maxCoefficientRight [private]

Definition at line 351 of file theory_arith_old.h.

ExprMap<Rational> CVC3::TheoryArithOld::fixedMaxCoefficient [private]

Map from variables to the fixed value of one of it's coefficients

Definition at line 354 of file theory_arith_old.h.

CDMap<Expr, Theorem> CVC3::TheoryArithOld::bufferedInequalities [private]

Keep the expressions that are already in the buffer

Definition at line 390 of file theory_arith_old.h.

Referenced by update().

CDMap<Expr, Rational> CVC3::TheoryArithOld::termLowerBound [private]

Strict lower bounds on terms, so that we don't add inequalities to the buffer

Definition at line 393 of file theory_arith_old.h.

Referenced by registerAtom().

CDMap<Expr, Theorem> CVC3::TheoryArithOld::termLowerBoundThm [private]

Definition at line 394 of file theory_arith_old.h.

Referenced by registerAtom().

CDMap<Expr, Rational> CVC3::TheoryArithOld::termUpperBound [private]

Strict upper bounds on terms, so that we don't add inequalities to the buffer

Definition at line 396 of file theory_arith_old.h.

Referenced by registerAtom().

CDMap<Expr, Theorem> CVC3::TheoryArithOld::termUpperBoundThm [private]

Definition at line 397 of file theory_arith_old.h.

Referenced by registerAtom().

CDMap<Expr, Expr> CVC3::TheoryArithOld::alreadyProjected [private]

Which inequalities have already been projected (on which monomial).

if we get an update of an inequality that's not been projected, we don't care it will get projected (it's find)
when projecting, project the finds, not the originals
when done projecting add here, both original and the find

Definition at line 406 of file theory_arith_old.h.

Referenced by update().

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

Sometimes we know an inequality is in the buffer (as a find of something) and we don't want it in the buffer, but we do want to pre-process it, so we put it here.

Definition at line 413 of file theory_arith_old.h.

Referenced by update().

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

Are we doing only difference logic?

Definition at line 418 of file theory_arith_old.h.

Referenced by assertFact(), assignVariables(), and computeTermBounds().

AtomsMap CVC3::TheoryArithOld::formulaAtomLowerBound [private]

Map from terms to their lower bound (and the original formula expression)

Definition at line 448 of file theory_arith_old.h.

Referenced by registerAtom(), and tryPropagate().

AtomsMap CVC3::TheoryArithOld::formulaAtomUpperBound [private]

Map from terms to their upper bound (and the original formula expression)