IntervalProp

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def boundsAsInequalities(order: TermOrder): IndexedSeq[LinearCombination]

Represent all lower and upper bounds as inequalities, sorted in descending order.

def clone(): AnyRef

def derivedNewBounds: Boolean

Could any bounds be derived that were not already known from the input?

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

final def getClass(): Class[_]

def hashCode(): Int

def impliedEquations(order: TermOrder): IndexedSeq[LinearCombination]

Extract equalities that are implied by the derived lower and upper bounds, sorted in descending order.

final def isInstanceOf[T0]: Boolean

def lowerBounds: Map[Term, IdealInt]

All derived lower bounds of VariableTerm and ConstantTerm.

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

def updatedBoundsAsInequalities(order: TermOrder): IndexedSeq[LinearCombination]

Represent lower and upper bounds that were not already present in the input as inequalities, sorted in descending order.

def upperBounds: Map[Term, IdealInt]

All derived upper bounds of VariableTerm and ConstantTerm.

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

final def wait(): Unit

def finalize(): Unit