BinaryCertificate

abstract val localAssumedFormulas: Set[CertFormula]

abstract val localProvidedFormulas: Seq[Set[CertFormula]]

Formulae that are introduced into the antecedent by this rule application (one set for each subproof).

abstract def update(newSubCerts: Seq[Certificate]): Certificate

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def apply(i: Int): Certificate

final def asInstanceOf[T0]: T0

lazy val assumedFormulas: Set[CertFormula]

Formulae that the proof assumes to be present on this branch (i.e., premisses of rules applied in the proof).

def clone(): AnyRef

val closingConstraint: Conjunction

The constraint resulting from this proof

lazy val constants: Set[ConstantTerm]

Set of constants occurring in this certificate.

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

lazy val inferenceCount: Int

final def isInstanceOf[T0]: Boolean

def iterator: Iterator[Certificate]

val leftChild: Certificate

def length: Int

val localBoundConstants: Set[ConstantTerm]

Constants bound by the root operator of the certificate.

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

val order: TermOrder

val rightChild: Certificate

def size: Int

def subCertificates: IndexedSeq[Certificate]

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

lazy val theoryAxioms: Set[CertFormula]

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit