ReduceWithEqs

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def addEquations(furtherEqs: Map[Term, LinearCombination]): ReduceWithEqs

def apply(conj: PredConj, logger: ComputationLogger): PredConj

def apply(conj: PredConj): PredConj

def apply(conj: InEqConj, logger: ComputationLogger): InEqConj

def apply(conj: InEqConj): InEqConj

def apply(conj: NegEquationConj, logger: ComputationLogger): NegEquationConj

def apply(conj: NegEquationConj): NegEquationConj

def apply(conj: EquationConj): EquationConj

def apply(lc: LinearCombination, terms: Buffer[(IdealInt, LinearCombination)]): LinearCombination

def apply(lc: LinearCombination): LinearCombination

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

final def getClass(): Class[_]

def hashCode(): Int

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def passQuantifiers(num: Int): ReduceWithEqs

Create a ReduceWithEqs that can be used underneath num binders.

def pseudoReduce(lc: LinearCombination): LinearCombination

Same as apply(lc:LinearCombination), but also multiply <cocde>lc with integers in case this allows to eliminate the leading term (pseudo-division). It is ensured that the resulting LinearCombination has a positive leading coefficient

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

def toString(): String

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

final def wait(arg0: Long): Unit

final def wait(): Unit

def finalize(): Unit