BetaFormulaTask

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def apply(formula: Conjunction, age: Int, eliminatedConstants: Set[ConstantTerm], vocabulary: Vocabulary, settings: GoalSettings): BetaFormulaTask

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def doSplit(selectedConjunct: Conjunction, otherConjuncts: Conjunction, remainingCompoundFormulas: CompoundFormulas, goal: Goal, ptf: ProofTreeFactory): ProofTree

Split a conjunction selectedConjunct & otherConjuncts in the antecedent

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

final def getClass(): Class[_]

def hashCode(): Int

def isCoveredFormula(f: Conjunction): Boolean

Return true if f is a formula that can be handled by this task

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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