ModPlugin

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

object NEEDS_SPLITTING extends Exception

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def computeModel(goal: Goal): Seq[Action]

Apply this procedure to the given goal in model-generation mode.

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

final def getClass(): Class[_]

def goalState(goal: Goal): proof.theoryPlugins.Plugin.GoalState.Value

From a theory procedure, determine in which state a given goal is.

def handleGoal(goal: Goal): Seq[Action]

Apply this plugin to the given goal.

def hasImpliedIneqConstraints(c: ConstantTerm, lower: IdealInt, upper: IdealInt, ineqs: InEqConj): Boolean

Check whether all inequalities present for the given constants are already implied by the type

def hashCode(): Int

def interfaceConstants(goal: Goal, consideredPredicates: Set[Predicate], theoryPredicates: Set[Predicate]): Set[ConstantTerm]

Find constants that occur both in atoms constructed using predicates from consideredPredicates and in atoms constructed using predicates not in theoryPredicates.

def interfaceConstants(goal: Goal, theoryPredicates: Set[Predicate]): Set[ConstantTerm]

Find constants that occur both in atoms constructed using theory predicates and in atoms constructed using non-theory predicates.

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

implicit def richActionSeq(acts: Seq[Action]): RichActionSeq

An implicit function to simplify cascading of possible actions.

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