Ident
BabelParserCombinators
ast
IfElse
hoare
IgnoreMetrics
logging
Imp
expr
ast
ast
ImpC
expr
ImpLeft
lkskNew
ImpLeftRule
lk
lkOld
ImpLeftRuleType
lkOld
ImpLeftTactic
tactics
ImpRight
lkskNew
ImpRightMacroRule
lk
ImpRightRule
lk
lkOld
ImpRightRuleType
lkOld
ImpRightTactic
tactics
Impl
BabelParserCombinators
ImplicitStandardStrategy
BetaReduction
IncrementalProver
provers
IncrementalProvingSession
provers
IndexOrFormula
ConvenienceConstructor
IndexedPredicate
schema
IndexedVarSymbol
schema
InductionCase
lk
InductionRule
lk
lkOld
InductionRuleType
lkOld
InductionTactic
tactics
InductiveType
Context
Inference
InferenceParser
InferenceParser
SPASS
InfixRel
BabelParserCombinators
InfixRelSym
BabelParserCombinators
InitialClause
ivy
resolution
InitialRuleType
lkOld
InitialSequent
lk
lkskNew
Innermost
StrategyOuterInner
InputClause
resolution
InputCls
EscargotLoop
InsertTactic
tactics
Instance
resolution
InstanceLanguage
stableSipGrammar
InstanceTermEncoding
expansion
Instances
VeriTParser
Instantiate
ivy
InstantiateResSchema
clauseSchema
IntConst
schema
IntVar
schema
IntVarSubstitution
clauseSchema
IntZero
schema
IntegerTerm
schema
Interpolate
lk
lkOld
InterpolationException
lk
lkOld
Interpretation
models
IsConst
babel
IsVar
babel
IvyParser
ivy
IvyResolutionProof
ivy
IvyToRobinson
conversion
i
Digram
RigidTrigram
iType
TypeParsers
iTypeDef
Context
iatom
Prover9TermParserA
iatom1
LLKASTParser
iatom2
LatexReplacementParser
LLKASTParser
LatexReplacementParser
iatom3
LLKASTParser
id
Flip
InitialClause
Instantiate
IvyResolutionProof
NewSymbol
Paramodulation
Propositional
Resolution
FormulaOccurrence
ident
prio
idx
TypeVar
RalAllF
RalAllT
RalAndF
RalAndT1
RalAndT2
RalBottomT
RalExF
RalExT
RalImpF1
RalImpF2
RalImpT
RalNegF
RalNegT
RalOrF1
RalOrF2
RalOrT
RalTopF
idx1
RalFactor
idx2
RalFactor
ifBranch
IfElse
ifElse
ProgramParserA
ifunction
Prover9TermParserA
immediateSubProofs
Flip
InitialClause
Instantiate
NewSymbol
Paramodulation
Propositional
Resolution
DagProof
BinaryExpansionTree
ETAtom
ETBottom
ETDefinedAtom
ETTop
ETWeakQuantifier
ETWeakening
UnaryExpansionTree
BinaryLKProof
InductionRule
InitialSequent
UnaryLKProof
BinaryRule
InitialSequent
UnaryRule
RalCut
RalFactor
RalInitial
RalPara
RalSub
Factor
InitialClause
Instance
Paramodulation
Resolution
Splitting
SketchAxiom
SketchInference
SketchSplit
impConclusion
ImpLeftRule
ImpRightRule
impL
TacticCommands
impPremise
ImpLeftRule
ImpRightRule
impR
TacticCommands
impl
prio
LeanCoPParser
TPTPParser
implFormula
VeriTParser
implication
LatexReplacementParser
LLKASTParser
LatexReplacementParser
Prover9TermParserA
implicitLeft
ImplicitStandardStrategy
implicitOuter
ImplicitStandardStrategy
implies
VeriTParser
implies_neg1
VeriTParser
implies_neg2
VeriTParser
implies_pos
VeriTParser
imports
CLIMain
improveSolutionLK
cutintro
in
->
RewriteTactic
UnfoldTacticHelper
ExternalSmtlibProgram
inResolutionProof
Search
inTreeProof
Search
incBinary
LKStats
incCuts
LKStats
incUnary
LKStats
include
TacticCommands
indFormIsQuantified
SimpleInductionProof
indTy
InductionCase
InductionRule
indVarPlusIndConst
StepMinusOne
index
IndexedVarSymbol
pProofLinkTerm
OpenAssumption
FocusTactical
Cls
indexInES
ProjectionFromEndSequent
indexOf
Sequent
indexOfInAnt
Sequent
indexOfInSuc
Sequent
indexOfOption
Sequent
indexOfPol
Sequent
indexType
TypeParsers
indexVar
ForLoop
indexedFOVar
schema
indexedOmegaVar
schema
indices
Sequent
SchemaProofLink
indices1
RalCut
indices2
RalCut
indicesSequent
Sequent
indicesWhere
Sequent
indigo
Rainbow
induction
examples
TacticCommands
inductionBase
inductionExamples
inductionBase1
inductionExamples
inductionBase2
inductionExamples
inductionBase3
inductionExamples
inductionBase4
inductionExamples
inductionBase5
inductionExamples
inductionExamples
examples
inductionFormula
SimpleInductionProof
inductionPrinciple
makeInductionExplicit
inductionProof
inductionExamples
inductionProver
provers
inductionStep
inductionExamples
inductionStep1
inductionExamples
inductionStep2
inductionExamples
inductionStep3
inductionExamples
inductionStep4
inductionExamples
inductionStep5
inductionExamples
induction_start
UniformAssociativity3ExampleProof
induction_steps
FactorialFunctionEqualityExampleProof
infer
ast
inference
UnprovableSketchInference
inferenceComputation
EscargotLoop
inferences
LeanCoPParser
infiniteSubset
prime
infixRel
BabelExporter
prio
info
LeanCoPParser
Logger
infoMessage
ProofToolViewer
init
DrawSingleSequentInference
ProofNodeInfo
ProofWeighter
initSunburstDialog
SequentProofViewer
initialGoal
ProofState
initialize
DrawExpansionTree
DrawList
DrawProof
DrawResolutionProof
DrawSequentProof
DrawTree
innerRule
VeriTParser
input
LeanCoPParser
SExpressionParser
VeriTParser
InferenceParser
inputClauses
Factor
InputClause
Instance
Paramodulation
ReflexivityClause
Resolution
ResolutionProof
Splitting
TautologyClause
inputFileName
dumpTermset
inputMessage
ProofToolViewer
input_proof
nTape
insert
TacticCommands
insertAt
Sequent
insertion
InsertTactic
inst
ExtendedHerbrandSequent
inst2
nTape4
nTape5
nTape5Arith
inst3
nTape4
nTape5
inst4
nTape4
nTape5
instanceGrammar
SipGrammar
instanceLanguages
findsip
sip_comparison
instanceProofs
sip_comparison
instanceSeq
addition
array_init
instanceSequent
SimpleInductionProblem
SimpleLoopProblem
instanceSequents
findsip
instanceTermType
InstanceTermEncoding
instance_per_formula
findNonTrivialTSTPExamples
instances
instprover
ETQuantifier
ETSkolemQuantifier
ETStrongQuantifier
ETWeakQuantifier
instantiate
hol
SipGrammar
instantiateOnce
ExistsRightTactic
ForallLeftTactic
instprover
examples
int
GTInt
intTermMinusOne
StepMinusOne
intTermPlus
StepMinusOne
integer
LeanCoPParser
TPTPParser
interesting
findNonTrivialTSTPExamples
interpret
Interpretation
interpretAtom
Interpretation
MapBasedInterpretation
intersect
Sequent
intersectionOpen
prime
inv
OccConnector
inventSources
TptpProofParser
invert
ceres_omega
skolemize
invertCycles
XMLUtils
irratProblem
epsilon
irratProof
epsilon
isAncestorOf
FormulaOccurrence
isAnt
Ant
SequentIndex
Suc
isAtom
hol
schema
isCutFree
ReductiveCutElimination
ReductiveCutElim
isDefined
LambdaPosition
isDefinedAt
FOLExpression
LambdaExpression
Sequent
isDescendantOf
FormulaOccurrence
isEmpty
LambdaPosition
FOLPosition
HOLPosition
Sequent
isExtendedAtom
hol
isFOLFunction
fol
isFOLPrenexPi1
fol
isFOLPrenexSigma1
fol
isFOccInAxiom
getAllAxioms
isFinished
ProofState
isIdentity
Substitution
isInVNF
expr
isIndexSort
shlk
isInjectiveRenaming
Substitution
isInstalled
EProver
LeanCoP
ExternalMaxSATSolver
Prover9
Prover9Importer
ExternalSATSolver
PicoSAT
CVC4
Z3
SPASS
Vampire
VeriT
ExternalProgram
isLogicalConstant
hol
isNeg
hol
isPrefixOf
HOLPosition
isPrenex
hol
isRedStruct
proofProfile
isReflModE
EscargotLoop
isReflexivity
hol
RichOccSequent
isRegular
lk
isRenaming
Substitution
isSAtom
schema
isSchematic
SimpleInductionProof
isSolved
SimpleInductionProof
isSubMultisetOf
Sequent
isSubsetOf
Sequent
isSubsumedByWorkedOff
EscargotLoop
isSubterm
RecSchemTemplate
isSubtermC
RecSchemTemplate
isSuc
Ant
SequentIndex
Suc
isTaut
Sequent
RichOccSequent
isTimeout
Step
isTree
ArbitraryTree
isUnquotNameChar
BabelLexical
isUnsat
VeriTParser
Prover
SATSolver
isValid
IncrementalProver
Prover
ResolutionProver
BasicProver
EquationalProver
LeanCoP
DrupSolver
SATSolver
VeriT
isVar
BabelSignature
IsConst
IsVar
VarConst
InferenceParser
is_demodulation
Paramodulation
iterateOnFormula
shlk
iterateTerm
Utils
iterator
dbTRS
sTermDB
ProjectionTermDB
fo2SubstDB
resolutionProofSchemaDB
SchemaProofDB
HashMultiset
ivy
formats
ivyFileReader
FileParser
ivy_escape_table
IvyParser
ivy_varname
undoHol2Fol