Searched refs:isIntegerThm (Results 1 – 6 of 6) sorted by relevance
137 Theorem isIntegerThm(const Expr& e);233 bool isInteger(const Expr& e) { return !(isIntegerThm(e).isNull()); } in isInteger()
140 Theorem isIntegerThm(const Expr& e);189 bool isInteger(const Expr& e) { return !(isIntegerThm(e).isNull()); } in isInteger()
161 Theorem isIntegerThm(const Expr& e);261 (isReal(e.getType()) ? false : !(isIntegerThm(e).isNull())); } in isInteger()
760 Theorem isIntx(isIntegerThm(x)); in processSimpleIntEq()818 Theorem isIntLHS = isIntegerThm(x); in processSimpleIntEq()823 isIntRHS.push_back(isIntegerThm(v)); in processSimpleIntEq()1730 Theorem isIntLHS(isIntegerThm(theIneq[0])); in projectInequalities()1731 Theorem isIntRHS(isIntegerThm(theIneq[1])); in projectInequalities()1832 Theorem isIntx(isIntegerThm(x)); in normalizeProjectIneqs()1833 Theorem isIntBeta(isIntegerThm(ineq1[0])); in normalizeProjectIneqs()2423 Theorem isInta(isIntegerThm(alpha)); in processFiniteInterval()2424 Theorem isIntt(isIntegerThm(t)); in processFiniteInterval()2664 bool intConstraint = !isIntegerThm(lhs).isNull() && !isIntegerThm(rhs).isNull(); in checkSat()[all …]
68 Theorem TheoryArith3::isIntegerThm(const Expr& e) { in isIntegerThm() function in TheoryArith3780 Theorem isIntx(isIntegerThm(x)); in processSimpleIntEq()838 Theorem isIntLHS = isIntegerThm(x); in processSimpleIntEq()843 isIntRHS.push_back(isIntegerThm(v)); in processSimpleIntEq()1362 Theorem isIntLHS(isIntegerThm(theIneq[0])); in projectInequalities()1363 Theorem isIntRHS(isIntegerThm(theIneq[1])); in projectInequalities()1459 Theorem isIntx(isIntegerThm(x)); in normalizeProjectIneqs()1460 Theorem isIntBeta(isIntegerThm(ineq1[0])); in normalizeProjectIneqs()1461 Theorem isIntAlpha(isIntegerThm(ineq2[1])); in normalizeProjectIneqs()1967 Theorem isInta(isIntegerThm(alpha)); in processFiniteInterval()[all …]
68 Theorem TheoryArithNew::isIntegerThm(const Expr& e) { in isIntegerThm() function in TheoryArithNew525 Theorem isIntx(isIntegerThm(x)); in processSimpleIntEq()535 Theorem isIntx(isIntegerThm(x)); in processSimpleIntEq()594 Theorem isIntLHS = isIntegerThm(x); in processSimpleIntEq()599 isIntRHS.push_back(isIntegerThm(v)); in processSimpleIntEq()609 isIntRHS.push_back(isIntegerThm(v)); in processSimpleIntEq()1218 Theorem isInta(isIntegerThm(alpha)); in processFiniteInterval()1219 Theorem isIntt(isIntegerThm(t)); in processFiniteInterval()1550 Theorem isIntConstraintThm = isIntegerThm(constr[1]); in rafineIntegerConstraints()