Ident
BabelParserCombinators ast
IfElse
hoare
IgnoreMetrics
logging
Imp
expr ast ast
ImpC
expr
ImpL1
resolution
ImpL2
resolution
ImpLeft
lksk
ImpLeftRule
lk
ImpLeftTactic
tactics
ImpR
resolution
ImpRight
lksk
ImpRightMacroRule
lk
ImpRightRule
lk
ImpRightTactic
tactics
Impl
BabelParserCombinators
ImplicitStandardStrategy
BetaReduction
IncludeDirective
tptp
IncompleteLemma
gaptic
IncrementalProver
provers
IncrementalProvingSession
provers
IndexOrFormula
ConvenienceConstructor
InductionCase
lk
InductionRule
lk
InductionTactic
tactics
InductiveType
Context
Inference
InferenceParser
InferenceParser
SPASS
InferenceRule
impl
InfixRel
BabelParserCombinators
InfixRelSym
BabelParserCombinators
InfoItem
tptp
InitialClause
ivy resolution
InitialSequent
lk lksk
Innermost
StrategyOuterInner
Input
resolution
InputCls
EscargotState
InsertTactic
tactics
Instance
Viper
InstanceLanguage
stableSipGrammar
InstanceTermEncoding
expansion
Instances
VeriTParser
Instantiate
ivy
Interpolate
lk
InterpolationException
lk
Interpretation
models
IsConst
babel
IsVar
babel
IvyParser
ivy
IvyResolutionProof
ivy
IvyToResolution
conversion
i
Digram RigidTrigram
iTypeDef
Context
iatom
Prover9TermParserA
iatom1
LLKASTParser
iatom2
LLKASTParser LatexReplacementParser
iatom3
LLKASTParser
id
Flip InitialClause Instantiate IvyResolutionProof NewSymbol Paramodulation Propositional Resolution
ident
prio
idx
TypeVar RalAllF RalAllT RalAndF RalAndT1 RalAndT2 RalBottomT RalExF RalExT RalImpF1 RalImpF2 RalImpT RalNegF RalNegT RalOrF1 RalOrF2 RalOrT RalTopF AllL AllR AndL AndR1 AndR2 AvatarNegNonGroundComp BottomR DefIntro ExL ExR ImpL1 ImpL2 ImpR NegL NegR OrL1 OrL2 OrR PropositionalResolutionRule TopL
idx1
RalFactor Factor Resolution
idx2
RalFactor Factor Resolution
ifBranch
IfElse
ifElse
ProgramParserA
ifNecessary
Subst
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 AvatarAbsurd AvatarComponentElim Factor InitialClause Paramod PropositionalResolutionRule Resolution Subst SketchAxiom SketchComponentElim SketchComponentIntro SketchInference SketchSplitCombine
impConclusion
ImpLeftRule ImpRightRule
impL
TacticCommands
impPremise
ImpLeftRule ImpRightRule
impR
TacticCommands
impl
prio LeanCoPParser escargot
implFormula
VeriTParser
implication
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
include
TptpParser TacticCommands
incompleteImpl
LemmaMacros
indFormIsQuantified
SimpleInductionProof
indTy
InductionCase InductionRule
index
OpenAssumption FocusTactical Cls
indexOf
Sequent
indexOfInAnt
Sequent
indexOfInSuc
Sequent
indexOfOption
Sequent
indexOfPol
Sequent
indexVar
ForLoop
indices
Sequent AvatarComponentElim
indices1
RalCut
indices2
RalCut
indicesSequent
Sequent
indicesWhere
Sequent
indicesWherePol
Sequent
indigo
Rainbow
inducedDefinitions
AvatarComponent AvatarGeneralNonGroundComp AvatarGroundComp
induction
examples TacticCommands
inductionFormula
SimpleInductionProof
inductionPrinciple
makeInductionExplicit
induction_start
UniformAssociativity3ExampleProof
induction_steps
FactorialFunctionEqualityExampleProof
infer
ast
inference
UnprovableSketchInference
inferenceComputation
EscargotState
inferences
LeanCoPParser EscargotState
infiniteSubset
prime
infixRel
BabelExporter prio
infix_formula
TptpParser
info
LeanCoPParser Viper Logger
infoMessage
ProofToolViewer
init
DrawSingleSequentInference ProofNodeInfo ProofWeighter
initSunburstDialog
SequentProofViewer
initialGoal
ProofState
initialize
DrawExpansionTree DrawList DrawSequentProof DrawStruct
innerRule
VeriTParser
input
LeanCoPParser SExpressionParser TptpParser VeriTParser InferenceParser
inputFileName
dumpTermset
inputMessage
ProofToolViewer
input_proof
AnalysisWithCeresOmega
inputs
TptpFile
insert
TacticCommands
insertAt
Sequent
insertion
InsertTactic
inside
Viper
inst2
nTape4 nTape5 nTape5Arith
inst3
nTape4 nTape5
inst4
nTape4 nTape5
instFormula
SkolemQuantResolutionRule WeakQuantResolutionRule
instanceGrammar
SipGrammar
instanceLanguages
findsip sip_comparison
instanceNumber
ViperOptions
instanceProofs
sip_comparison
instanceProver
ViperOptions
instanceSeq
addition array_init
instanceSequent
SimpleInductionProblem SimpleLoopProblem
instanceSequents
findsip
instanceSize
ViperOptions
instanceTermType
InstanceTermEncoding
instance_per_formula
findNonTrivialTSTPExamples
instances
instprover ETQuantifier ETSkolemQuantifier ETStrongQuantifier ETWeakQuantifier
instantiate
hol SipGrammar
instantiateOnce
ExistsRightTactic ForallLeftTactic
instantiateRS
grammars
instantiatedSolutionCondition
SolutionStructure
instantiatedSolutionConditions
SolutionStructure
instprover
examples
integer
LeanCoPParser TptpParser
interesting
findNonTrivialTSTPExamples
interpret
Interpretation
interpretAtom
Interpretation MapBasedInterpretation
intersect
Sequent
intersectionOpen
prime
introOnly
AvatarComponent AvatarNegNonGroundComp
introducedDefinitions
AvatarComponentElim AvatarComponentIntro DefIntro ResolutionProof
inv
OccConnector
inventSources
TptpProofParser
invert
ceres_omega
irratProblem
epsilon
irratProof
epsilon
isActive
EscargotState
isAnt
Ant SequentIndex Suc
isAtom
hol
isCutFree
ReductiveCutElimination
isDefined
LambdaPosition
isDefinedAt
FOLExpression LambdaExpression Sequent
isEmpty
LambdaPosition FOLPosition HOLPosition Sequent
isExtendedAtom
hol
isFOLFunction
fol
isFOLPrenexPi1
fol
isFOLPrenexSigma1
fol
isFinished
ProofState
isIdentity
Substitution
isInVNF
expr
isInjectiveRenaming
Substitution
isInstalled
TipSmtParser EProver LeanCoP ExternalMaxSATSolver Metis Prover9 Prover9Importer ExternalSATSolver PicoSAT CVC4 Z3 SPASS Vampire VeriT ExternalProgram
isLogicalConstant
hol
isNeg
hol
isPrefixOf
HOLPosition
isPrenex
hol
isProof
ResolutionProof
isReductive
Superposition
isRedundant
RedundancyRule ForwardSubsumption ReflModEqDeletion ReflexivityDeletion TautologyDeletion
isReflexivity
hol
isRegular
lk
isRenaming
Substitution
isSchematic
SimpleInductionProof
isSolved
SimpleInductionProof
isSubMultisetOf
Sequent
isSubsetOf
Sequent
isSubterm
RecSchemTemplate
isSubtermC
RecSchemTemplate
isSuc
Ant SequentIndex Suc
isTaut
Sequent
isTimeout
Step
isUnquotNameChar
BabelLexical
isUnsat
VeriTParser Prover SATSolver
isValid
BasicProver EquationalProver SolutionStructure IncrementalProver Prover ResolutionProver LeanCoP DrupSolver SATSolver VeriT
isVar
BabelSignature IsConst IsVar VarConst InferenceParser
is_demodulation
Paramodulation
iterateTerm
Utils
ivy
formats
ivyFileReader
FileParser
ivy_escape_table
IvyParser
ivy_varname
undoHol2Fol