IterativeClauseMatcher

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

object Matchable extends Enumeration

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def convertQuantifiers(c: Conjunction, config: PredicateMatchConfig): Conjunction

Convert all quantifiers that cannot be handled using e-matching to existential quantifiers (for which Skolem symbols can be introduced)

def empty(matchAxioms: Boolean, config: PredicateMatchConfig): IterativeClauseMatcher

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def isMatchable(c: Conjunction, config: PredicateMatchConfig): IterativeClauseMatcher.Matchable.Value

def isMatchableRec(c: Conjunction, config: PredicateMatchConfig): Boolean

Determine whether all quantifiers in the given formula can be handled using matching or using Skolemisation.

def matchedPredicatesRec(c: Conjunction, config: PredicateMatchConfig): Set[Predicate]

Determine the set of predicates that are matched in some quantified expression

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def pullOutTriggers(c: Conjunction, config: PredicateMatchConfig): Conjunction

Make sure that, when applying e-matching, either all or none of the quantifiers in a quantified expressions are instantiated.

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