A
BussTautology addition meta propositional vtrat_comparison SipRecSchem ceres SimpleLoopProblem ExistsRightRule ForallLeftRule LogicalAxiom
ASSO
FactorialFunctionEqualityExampleProof2
ASTtoHOL
LLKFormulaParser
ASTtoHOLnormalized
LLKFormulaParser
AToken
llk
Abs
expr ast ast
AdditionAssoc
Peano
AdditionBase
Peano
AdditionSucc
Peano
All
expr BabelParserCombinators ast ast
AllL
resolution
AllLeft
lksk
AllQuantifiedConditionalAxiomHelper
examples
AllR
resolution
AllRight
lksk
AllSkLeft
lksk
AllSkRight
lksk
AnalysisWithCeresOmega
ceres_omega
And
expr ast ast
AndC
expr
AndL
resolution
AndLeft
lksk
AndLeftMacroRule
lk
AndLeftRule
lk
AndLeftTactic
tactics
AndR1
resolution
AndR2
resolution
AndRight
lksk
AndRightRule
lk
AndRightTactic
tactics
AnnotatedFormula
tptp
Ant
BussTautology proofs
AnyFormula
gaptic
App
expr BabelParserCombinators ast ast
Apps
expr
ArrType
ast
Assign
hoare
Atom
BabelParserCombinators DIMACS SExpressionParser InferenceParser
AtomicExpansion
lk
AvatarAbsurd
resolution
AvatarComponent
resolution
AvatarComponentElim
resolution
AvatarComponentIntro
resolution
AvatarGeneralNonGroundComp
resolution
AvatarGroundComp
resolution
AvatarNegNonGroundComp
resolution
AvatarNonGroundComp
resolution
AvatarSplit
resolution
AvatarSplitting
StandardInferences
Ax1
UniformAssociativity3ExampleProof
Axiom
lk lksk
a
tbillc App ArrType Sequence
abbrev
Clausifier
abbreviate
ReforestState
abs
LLKASTParser LatexReplacementParser
absOrAtomWeq
LLKASTParser
absmap
Resolution2RalWithAbstractions
abstractTerm
replacementContext
abstracted_constants_map
AnalysisWithCeresOmega
acnf
AnalysisWithCeresOmega
addAllAxioms
UniformAssociativity3ExampleProof
addChangeListener
ProofNodeInfo
addEquationalAxioms
VeriT
addPol
ExpansionTreePrettyPrinter
addSymmetry
expansion
addition
hoare
adjustOrientation
DrawSingleSequentInference
allL
TacticCommands
allR
TacticCommands
allResults
collectExperimentResults
allTestCases
RegressionTests
allformula
LLKASTParser Prover9TermParserA
allformula_
LLKASTParser LatexReplacementParser Prover9TermParserA
allpab
tbillc
alpha
FactorialFunctionEqualityExampleProof2 SipGrammar SimpleInductionProof
alphaEquals
LambdaExpression
alphaVar
SimpleInductionProblem
alpha_numeric
TptpParser
alternations
A Dual EmptyPlusJunction EmptyTimesJunction Plus Struct Times
and
LeanCoPParser VeriTParser
andFormula
VeriTParser
andL
TacticCommands
andR
TacticCommands
andThen
Tactical
and_formula_part
TptpParser
and_neg
VeriTParser
and_pos
VeriTParser
annotated_formula
TptpParser
annotations
AnnotatedFormula TptpParser tptpToString
antLabel
Axiom
antecedent
AToken RToken Sequent
antecedentPanel
DrawExpansionSequent
app
prio
appOrAtomWeq
LLKASTParser LatexReplacementParser
appassoc
lists
appendPostfix
TPTPHOLExporter
apply
GPL MaxSATMethod beautifySolution improveSolutionLK sehsToVTRATG vtratgToSEHS AllQuantifiedConditionalAxiomHelper BussTautology CountingEquivalence FactorialFunctionEqualityExampleProof FactorialFunctionEqualityExampleProof2 LinearEqExampleProof LinearExampleProof PQPairs Permutations PigeonHolePrinciple ProofSequence SquareDiagonalExampleProof SquareEdges2DimExampleProof SquareEdgesExampleProof SumExampleProof SumOfOnesExampleProof SumOfOnesF2ExampleProof SumOfOnesFExampleProof UniformAssociativity3ExampleProof nTape4 nTape5 nTape5Arith philsci tbillc Abs Block App Apps BinaryPropConnectiveHelper Const Eq EqC FOLAtom FOLAtomConst FOLConst FOLExpression FOLFunction FOLFunctionConst FOLHeadType FOLSubstitution FOLVar FunctionType HOLAtom HOLAtomConst HOLFunction HOLPartialAtom Block LambdaExpression LambdaPosition MatchingAlgorithm MonoidalBinaryPropConnectiveHelper nAry MonomorphicLogicalC NullaryPropConnectiveHelper QuantifierC QuantifierHelper Block Substitution TermReplacement UnaryPropConnectiveHelper Var arity baseTypes clauseSubsumption constants containedNames expressionSize FOLFunctionArgs FOLFunctionName FOLPosition FOLSubTerms Numeral TseitinCNF changeTypeIn getArityOfConstants isFOLFunction isFOLPrenexPi1 isFOLPrenexSigma1 reduceHolToFol replaceAbstractions undoReplaceAbstractions freeVariables CNFn CNFp HOLPosition SkolemFunctions atoms containsQuantifier containsQuantifierOnLogicalLevel containsStrongQuantifier containsWeakQuantifier dualize existsclosure fastStructuralCNF freeHOVariables instantiate isAtom isExtendedAtom isLogicalConstant isNeg isPrenex isReflexivity lcomp normalizeFreeVariables numOfAtoms removeAllQuantifiers removeNeg removeQuantifiers simplify toNNF univclosure variablesAll variablesEx isInVNF longNormalForm rename replacementContext subTerms syntacticMGU syntacticMatching toImplications toVNF variables BabelSignature MapBabelSignature readDIMACS readDRUP readWDIMACS writeDIMACS writeWDIMACS IvyParser IvyToResolution ProofToLatexExporter UnicodeToLatex LFun SExpressionParser EquationVerifier LLKExporter LLKProofParser exportLLK loadLLK parseLLKExp parseLLKFormula hof hot sig toLLKString toLatexString GeneralColon GeneralList TPTPFOLExporter TPTPHOLExporter TptpTerm resolutionToTptp resolveIncludes tptpProblemToResolution SmtLibExporter RecSchemGenLangFormula RecSchemTemplate RecursionScheme Rule atoms canonicalVars findMinimalGrammar findMinimalSipGrammar findMinimalVectGrammar instantiateRS leastGeneralGeneralization leastGeneralGeneralization1 minimizeGrammar minimizeRecursionScheme minimizeSipGrammar minimizeVectGrammar preOrderTraversal recSchemToVTRATG stableProofGrammar stableProofVectGrammar stableSipGrammar stableTerms stsSubsumedByLGG subsetLGGs takeN Context InductiveType Sort FOTheory OccConnector Sequent A CERES CharacteristicClauseSet DeleteTautology PlusN Projections SimplifyStruct Times coloredStructString deleteTautologies extractStruct simpleUnitResolutionNormalization subsumedClausesRemoval CharacteristicSequentSet DeleteTautology Projections StandardClauseSet ceres_omega extractStructFromLKsk DrupProof DrupToResolutionProof Epsilon EpsilonC ExpansionProofToEpsilon epsilonize ETMerge ETStrongQuantifierBlock ETWeakQuantifierBlock ExpansionProofToLK ExpansionProofWithCut ExpansionTree FOLInstanceTermEncoding InstanceTermEncoding addSymmetry cleanStructureET eigenVariablesET eliminateCutsET eliminateDefsET eliminateMerges extractInstances formulaToExpansionTree freeVariablesET generalizeET generatedUpperSetInPO groundTerms linearizeStrictPartialOrder minimalExpansionSequent minimalExpansionSequents numberOfInstancesET replaceAtHOLPosition replaceAtLambdaPosition replaceWithContext IncompleteLemma Lemma NewLabel NewLabels OpenAssumption ProofState Tactic Tactical AndLeftTactic AndRightTactic BottomAxiomTactic ChainTactic CutTactic DecomposeTactic DestructTactic EqualityTactic EscargotTactic ExistsLeftTactic ExistsRightTactic FocusTactical ForallLeftTactic ForallRightTactic ImpLeftTactic ImpRightTactic InductionTactic InsertTactic LogicalAxiomTactic NegLeftTactic NegRightTactic OrLeftTactic OrRightTactic PropTactic Prover9Tactic ReflexivityAxiomTactic RenameTactic RepeatTactic RewriteTactic SkipTactical TopAxiomTactic UnfoldTactic WeakeningLeftTactic WeakeningRightTactic Assign ForLoop Sequence mapVariableNames substVariables unrollLoop usedVariables weakestPrecondition AndLeftMacroRule AndLeftRule AndRightRule AtomicExpansion Axiom ContractionLeftMacroRule ContractionLeftRule ContractionMacroRule ContractionRightMacroRule ContractionRightRule CutRule DefinitionElimination DefinitionLeftRule DefinitionRightRule DefinitionRule EqualityLeftMacroRule EqualityLeftRule EqualityRightMacroRule EqualityRightRule ExchangeLeftMacroRule ExchangeRightMacroRule ExistsLeftBlock ExistsLeftRule ExistsRightBlock ExistsRightRule ExistsSkLeftRule ExtractInterpolant ForallLeftBlock ForallLeftRule ForallRightBlock ForallRightRule ForallSkRightRule ImpLeftRule ImpRightMacroRule ImpRightRule Interpolate LKToExpansionProof LKToLKsk LKToLKsk2 LKVisitor NaturalNumberInductionRule NegLeftRule NegRightRule OrLeftRule OrRightMacroRule OrRightRule ParamodulationLeftRule ParamodulationRightRule ReductiveCutElimination TransRule WeakeningContractionMacroRule WeakeningLeftMacroRule WeakeningMacroRule WeakeningRightMacroRule cleanCuts cleanStructuralRules consoleString containsEqualityReasoning cutFormulas cutsNumber eliminateTheoryAxioms extractRecSchem freeVariablesLK groundFreeVarsLK isRegular makeInductionExplicit moveStrongQuantifierRulesDown printProofStats proofFromInstances quantRulesNumber regularize rulesNumber skolemize skolemizeInferences solvePropositional strongQuantRulesNumber weakQuantRulesNumber LKskToExpansionProof applySubstitution Block AvatarComponentElim AvatarNonGroundComp DefinitionFormula AvatarSplit ExpansionToResolutionProof Factor Flip MguFactor MguResolution PCNF Resolution Resolution2RalWithAbstractions ResolutionToExpansionProof ResolutionToLKProof ResolutionToRal containedVariables containsEquationalReasoning eliminateSplitting expansionProofFromInstances extractRecSchemFromResProof findDerivationViaResolution fixDerivation matchingModEq forgetfulPropParam forgetfulPropResolve mapInputClauses numberOfLogicalInferencesRes simplifyResolutionProof structuralCNF tautologifyInitialUnitClauses RefutationSketchToResolution DrawSequent LatexLabel PopupMenu RGBColorChooser prooftool BinaryInferenceRule InferenceRule RedundancyRule SimplificationRule AvatarSplitting BackwardSubsumption BackwardUnitRewriting Clausification Factoring ForwardUnitRewriting OrderedResolution Superposition UnifyingEqualityResolution groundFreeVariables termRenaming typeRenaming FindFormulaH RunOnProofSequence canonicalRsLHS canonicalSolution decodeSipGrammar findConseq hSolveQBUP homogenizeRS qbupForRecSchem simplePi1RecSchemTempl loadProof parseMethod runOutOfProcess glob help runProcess time withTempFile withTimeout
applyImpl
LemmaMacros
applySubstitution
FOLAtomClosedUnderFOLSub FOLTermClosedUnderFOLSub Substitutable rulesClosedUnderSubstitution LKProofSubstitutable lksk
applyToLabel
DestructTactic WeakeningLeftTactic WeakeningRightTactic
apply_
Projections
apply_conditional_equality
UniformAssociativity3ExampleProof
appnil
lists
apprev
lists
appth
lists
arg
App
args
App ETDefinition
arguments
TptpParser ETDefinedAtom
arity
expr TipConstructor
array_init
hoare
asCNF
ExpansionToResolutionProof
asDerivation
ResolutionToLKProof
asFOLSubstitution
Substitution
asTactic
Tactical
asVectTratGrammarProduction
TratGrammar
asciiUnquotName
BabelExporter
ask
BenchmarkRecordingSession ExternalSmtlibProgram SmtlibSession
assert
IncrementalProvingSession FakeIncrementalSession SmtlibSession
assertedFormulas
FakeIncrementalSession
assertion
AvatarComponent AvatarGroundComp AvatarNegNonGroundComp AvatarNonGroundComp Cls
assertions
AvatarAbsurd AvatarComponentElim AvatarComponentIntro ResolutionProof
assign
ProgramParserA
assignment
evalCodeSnippetsInLatex
assoc2ES
prototype
assocES
prototype RunOnProofSequence
assoc_mul_axiom
FactorialFunctionEqualityExampleProof
associatedSip
SimpleLoopProblem
assumptions
TipProblem TipSmtParser
ast
babel llk
asymm
proof
at
root ChainTactic
atMost
CountingFormulas naive thresholds
atom
PigeonHolePrinciple LeanCoPParser LLKASTParser LatexReplacementParser Prover9TermParserA ETAtom ETDefinedAtom Axiom AvatarGeneralNonGroundComp AvatarGroundComp AvatarNegNonGroundComp AvatarNonGroundComp
atom1
LLKASTParser Prover9TermParserA
atom2
LLKASTParser Prover9TermParserA
atomDefs
ExpansionProof
atomWeq
LLKASTParser Prover9TermParserA
atomic_formula
TptpParser
atomic_word
TptpParser tptpToString
atomregexp
LLKASTParser
atoms
hol grammars
atomsymb
LLKASTParser LatexReplacementParser Prover9TermParserA
atomsymb2
LatexReplacementParser
aux
DefinitionLeftRule DefinitionRightRule EqualityLeftRule EqualityRightRule EqualityRule ExistsLeftRule ExistsRightRule ExistsSkLeftRule ForallLeftRule ForallRightRule ForallSkRightRule NegLeftRule NegRightRule SkolemQuantifierRule AllLeft AllRight AllSkLeft AllSkRight Equality ExLeft ExRight ExSkLeft ExSkRight NegLeft NegRight
aux1
AndLeftRule AndRightRule ContractionLeftRule ContractionRightRule ContractionRule CutRule ImpLeftRule ImpRightRule OrLeftRule OrRightRule AndLeft AndRight ContractionLeft ContractionRight Cut ImpLeft ImpRight OrLeft OrRight
aux2
AndLeftRule AndRightRule ContractionLeftRule ContractionRightRule ContractionRule CutRule ImpLeftRule ImpRightRule OrLeftRule OrRightRule AndLeft AndRight ContractionLeft ContractionRight Cut ImpLeft ImpRight OrLeft OrRight
auxFormula
EqualityRule ExistsLeftRule ForallRightRule SkolemQuantifierRule Equality RalPara Paramod
auxFormula_
Equality RalPara
auxFormulas
SequentProof
auxIdx
Paramod
auxInConclusion
EqualityRule
auxIndices
IvyResolutionProof SequentProof AndLeftRule AndRightRule ContractionRule CutRule DefinitionLeftRule DefinitionRightRule EqualityRule ExistsLeftRule ExistsRightRule ExistsSkLeftRule ForallLeftRule ForallRightRule ForallSkRightRule ImpLeftRule ImpRightRule InductionRule InitialSequent NegLeftRule NegRightRule OrLeftRule OrRightRule WeakeningLeftRule WeakeningRightRule AllLeft AllRight AllSkLeft AllSkRight AndLeft AndRight ContractionLeft ContractionRight Cut Equality ExLeft ExRight ExSkLeft ExSkRight ImpLeft ImpRight InitialSequent NegLeft NegRight OrLeft OrRight WeakeningLeft WeakeningRight RalCut RalFactor RalInitial RalPara RalSub AvatarAbsurd AvatarComponentElim Factor InitialClause Paramod PropositionalResolutionRule Resolution Subst RefutationSketch DrawSequentProof
auxiliaries
DrawSingleSequentInference
auxsyms
TseitinCNF
avatarComponentsAreReplaceable
resolution
avatarModel
EscargotState
avg_inst_per_form
findNonTrivialTSTPExamples
avg_ts_size
findNonTrivialTSTPExamples
awayFrom
rename
ax2_ax
UniformAssociativity3ExampleProof
axformula
TokenToLKConverter
axiom
RecSchemTemplate RecursionScheme TratGrammar VectTratGrammar ReforestState SketchAxiom
axiomBot
TacticCommands
axiomLog
TacticCommands
axiomRefl
TacticCommands
axiomTop
TacticCommands
axiomVect
VectTratGrammar
axioms
proof ExtendedProofDatabase FOTheory SubsumptionTheory
axioms_prove_sequent
TokenToLKConverter