A
BussTautology addition meta propositional vtrat_comparison SipRecSchem ceres struct SimpleLoopProblem ExistsRightRule ForallLeftRule LogicalAxiom
ACNF
ceres_schema ACNF
AGraph
acyclicGraphs
AGraphProof
proofs
ASSO
FactorialFunctionEqualityExampleProof2
ASTtoHOL
LLKFormulaParser
ASTtoHOLnormalized
LLKFormulaParser
AToken
llk llkNew
Abs
expr ast ast
Action
ProofStrategy
AdditionAssoc
Peano
AdditionBase
Peano
AdditionSucc
Peano
All
expr BabelParserCombinators ast ast
AllLeft
lkskNew
AllQuantifiedConditionalAxiomHelper
examples
AllRight
lkskNew
AllSkLeft
lkskNew
AllSkRight
lkskNew
AlternativeStandardClauseSet
clauseSets
And
expr ast ast
AndC
expr
AndEquivalenceRule
shlk
AndEquivalenceRule1
shlk
AndEquivalenceRule1Type
shlk
AndEquivalenceRule2
shlk
AndEquivalenceRule2Type
shlk
AndEquivalenceRule3
shlk
AndEquivalenceRule3Type
shlk
AndLeft
lkskNew
AndLeft1Rule
lkOld
AndLeft1RuleType
lkOld
AndLeft2Rule
lkOld
AndLeft2RuleType
lkOld
AndLeftEquivalenceRule1
shlk
AndLeftEquivalenceRule2
shlk
AndLeftEquivalenceRule3
shlk
AndLeftMacroRule
lk
AndLeftRule
lk lkOld
AndLeftTactic
tactics
AndRight
lkskNew
AndRightEquivalenceRule1
shlk
AndRightEquivalenceRule2
shlk
AndRightEquivalenceRule3
shlk
AndRightRule
lk lkOld
AndRightRuleType
lkOld
AndRightTactic
tactics
Ant
BussTautology proofs
Antecedent
FormulaLocation
AnyFormula
gaptic
App
expr BabelParserCombinators ast ast
Apps
expr
ArbitraryAGraph
acyclicGraphs
ArbitraryTree
trees
ArrType
ast
Assign
hoare
Atom
BabelParserCombinators DIMACS SExpressionParser InferenceParser
AtomMatch
shlk
AtomicExpansion
lk lkOld
AuxiliaryFormulas
base
Ax1
UniformAssociativity3ExampleProof
Axiom
lk lkOld lksk lkskNew
a
inductionExamples atp_instances poset4_example poset_example tbillc LankfordSolverInstance App ArrType Sequence
aTerm
schema
ab
LankfordSolverInstance
abbreviate
ReforestState
ablength
LankfordSolverInstance
abs
LatexReplacementParser LLKASTParser LatexReplacementParser
absOrAtomWeq
LLKASTParser
absmap
Robinson2RalWithAbstractions
abstractTerm
replacementContext
abstracted_constants_map
nTape
acnf
nTape
acyclicGraphs
ds
add
dbTRS DeltaTable dbTRSclauseSetTerm dbTRSsTermN fo2SubstDB resolutionProofSchemaDB
add0
inductionExamples
addAllAxioms
UniformAssociativity3ExampleProof
addAxioms1
SketchSplit
addAxioms2
SketchSplit
addChangeListener
ProofNodeInfo
addDefinitions
FileParser
addEquationalAxioms
VeriT
addInputClauses1
Splitting
addInputClauses2
Splitting
addProofs
FileParser
addS
inductionExamples
addSeqList
FileParser
addSymmetry
expansion
addTermTree
FileParser
addTrees
FileParser
addVectors
MathHelperFunctions
addition
hoare
adjustOrientation
DrawSingleSequentInference
alength
LankfordSolverInstance
allL
TacticCommands
allR
TacticCommands
allResults
collectExperimentResults
allTestCases
RegressionTests
allformula
LLKASTParser Prover9TermParserA
allformula_
LatexReplacementParser LLKASTParser LatexReplacementParser Prover9TermParserA
allgreatereqzero
Vector
allgreaterzero
Vector
allpab
tbillc
alpha
FactorialFunctionEqualityExampleProof2 SipGrammar SimpleInductionProof
alphaEquals
LambdaExpression
alphaVar
SimpleInductionProblem
alternations
A Dual EmptyPlusJunction EmptyTimesJunction Plus Struct Times A Dual EmptyPlusJunction EmptyTimesJunction Plus Struct Times
ancestors
FormulaOccurrence
and
LeanCoPParser TPTPParser VeriTParser
andFormula
VeriTParser
andL
TacticCommands
andNSchemaF
RemoveEqRulesFromGroundSchemaProof
andR
TacticCommands
andThen
Tactical
and_neg
VeriTParser
and_pos
VeriTParser
anotherfunction
applySchemaSubstitution2
ant
nonVarSclause
antLabel
Axiom
antecedent
AToken RToken AToken RToken Sequent
antecedentPanel
DrawExpansionSequent
antiUnifier
grammars
antiUnifier1
grammars
anyeqzero
Vector
anyless
Vector
anylesseqzero
Vector
anylesszero
Vector
app
prio
appOrAtomWeq
LatexReplacementParser LLKASTParser LatexReplacementParser
appassoc
lists
appendPostfix
TPTPHOLExporter
apply
GPL MaxSATMethod beautifySolution improveSolutionLK sehsToVTRATG vtratgToSEHS AllQuantifiedConditionalAxiomHelper BussTautology FactorialFunctionEqualityExampleProof FactorialFunctionEqualityExampleProof2 LinearEqExampleProof LinearExampleProof PQPairs Permutations PigeonHolePrinciple ProofSequence SquareDiagonalExampleProof SquareEdges2DimExampleProof SquareEdgesExampleProof SumExampleProof SumOfOnesExampleProof SumOfOnesF2ExampleProof SumOfOnesFExampleProof UniformAssociativity3ExampleProof equation_example 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 expressionSize FOLFunctionArgs FOLFunctionName FOLPosition FOLSubTerms Numeral TseitinCNF changeTypeIn getArityOfConstants isFOLFunction isFOLPrenexPi1 isFOLPrenexSigma1 reduceHolToFol replaceAbstractions toAbbreviatedString undoReplaceAbstractions freeVariables CNFn CNFp HOLPosition SkolemFunctions atoms containsQuantifier containsQuantifierOnLogicalLevel containsStrongQuantifier containsWeakQuantifier dualize existsclosure freeHOVariables instantiate isAtom isExtendedAtom isLogicalConstant isNeg isPrenex isReflexivity lcomp normalizeFreeVariables numOfAtoms removeAllQuantifiers removeNeg removeQuantifiers simplify structuralCNF toAbbreviatedString toNNF toPrettyString Vector univclosure variablesAll variablesEx isInVNF longNormalForm rename replacementContext BigAnd BigOr BiggerThan IndexedPredicate IntConst IntVar Pred SchemaAtom SchemaFunction SchemaSubTerms SchemaSubstitution Succ aTerm fo2Var foConst foTerm foVar fowVar indexedFOVar indexedOmegaVar isAtom isSAtom leq lessThan sAtom sIndTerm sTerm sTermRewriteSys sims toIntegerTerm unfoldSFormula unfoldSINDTerm unfoldSTerm subTerms syntacticMGU syntacticMatching toImplications toVNF variables BabelSignature MapBabelSignature readDIMACS readDRUP readWDIMACS writeDIMACS writeWDIMACS IvyParser IvyToRobinson ProofToLatexExporter UnicodeToLatex exportLabelledSequentListLatex exportSequentListLatex LFun SExpressionParser HybridLatexExporter HybridLatexParser exportLLK loadLLK parseLLKExp parseLLKFormula toLLKString toLatexString LLKExporter LLKProofParser exportLLK loadLLK parseLLKExp parseLLKFormula hof hot sig toLLKString toLatexString PutPlusTogether backToInt maketogether CNFtoSet ClauseSetToCNF getPLinks TPTPHOLExporter SmtLibExporter Match XMLProofDatabaseParser RecSchemGenLangFormula RecSchemTemplate RecursionScheme Rule antiUnifier antiUnifier1 atoms canonicalVars ComputeGrammars findMinimalGrammar findMinimalSipGrammar findMinimalVectGrammar minimizeGrammar minimizeRecursionScheme minimizeSipGrammar minimizeVectGrammar preOrderTraversal qbupForRecSchem recSchemToVTRATG stableProofGrammar stableProofVectGrammar stableSipGrammar stableTerms stsSubsumedByAU subsetAUs takeN Context InductiveType Sort FOTheory OccConnector Sequent A CERES CharacteristicClauseSet DeleteRedundantSequents DeleteReduntantFOfromSequent DeleteTautology PlusN Projections SimplifyStruct Times coloredStructString extractStruct structToExpressionTree CharacteristicSequentSet DeleteTautology Projections StandardClauseSet ceres_omega extractStructFromLKsk ACNF contractionNormalForm renameIndexedVarInProjection renameVar CharacteristicSequentSet GroundingProjectionTerm PStructToExpressionTree PTimesC PWeakC ProjectionTermCreators ProjectionTermToSetOfProofs RelevantCC RemoveArrowRules UnfoldProjectionTerm GroundingProjections InstantiateResSchema IntVarSubstitution ParseResSchema ParseResSchemaDavid ResDeductionToLKTree ResolutionProofSchema applySubToSclauseOrSclauseTerm clauseSchema clauseSetTerm dbTRSclauseSchema dbTRSclauseSetTerm dbTRSsTermN deComposeSClause fo2VarSubstitution nonVarSclause rTerm replace resolutionDeduction sClauseComposition sClauseVar sClauseVarSubstitution sTermN sclPlus sclTermVar sclTermVarSubstitution sclTimes unfoldGroundAtom unfoldResolutionProofSchema unfoldSTermN unfoldSchemaClause unfoldSclauseTerm unfoldingAtomsInResTerm AlternativeStandardClauseSet SimplifyStruct getAllAxioms getAncAx getListOfFOccsInStruct printCutAncs proofProfile renameCLsymbols pAxiomTerm pPlus pProofLinkTerm pTimes pUnary DeleteRedundantSequents DeleteReduntantFOfromSequent DeleteTautology Projections PlusN Times coloredStructString cutConfToString cutOccConfigToCutConfig groundStruct structToExpressionTree unfoldGroundStruct DrupProof DrupToResolutionProof Epsilon EpsilonC ExpansionProofToEpsilon epsilonize ETMerge 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 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 ExtractInterpolant ForallLeftBlock ForallLeftRule ForallRightBlock ForallRightRule ImpLeftRule ImpRightMacroRule ImpRightRule Interpolate LKToExpansionProof LKToLKsk LKToLKsk2 LKVisitor NaturalNumberInductionRule NegLeftRule NegRightRule OrLeftRule OrRightMacroRule OrRightRule ParamodulationLeftRule ParamodulationRightRule ReductiveCutElimination TransRule WeakeningContractionMacroRule WeakeningLeftMacroRule WeakeningMacroRule WeakeningRightMacroRule cleanStructuralRules consoleString containsEqualityReasoning cutFormulas cutsNumber eliminateTheoryAxioms extractRecSchem freeVariablesLK groundFreeVarsLK isRegular lkNew2Old lkOld2New makeInductionExplicit moveStrongQuantifierRulesDown printProofStats proofFromInstances quantRulesNumber regularize rulesNumber skolemize solvePropositional strongQuantRulesNumber weakQuantRulesNumber AndLeft1Rule AndLeft2Rule AndLeftRule AndRightRule AtomicExpansion Axiom CleanStructuralRules CloneLKProof ContractionLeftMacroRule ContractionLeftRule ContractionMacroRule ContractionRightMacroRule ContractionRightRule CutRule DefinitionLeftRule DefinitionRightRule EquationLeft1Rule EquationLeft2Rule EquationLeftMacroRule EquationLeftRule EquationRight1Rule EquationRight2Rule EquationRightMacroRule EquationRightRule EquationVerifier ExistsLeftRule ExistsRightBlock ExistsRightRule ExtractInterpolant ForallLeftBlock ForallLeftRule ForallRightBlock ForallRightRule ImpLeftRule ImpRightRule InductionRule Interpolate LKToExpansionProof LKToLKsk NegLeftRule NegRightRule OrLeftRule OrRight1Rule OrRight2Rule OrRightRule ReductiveCutElim TransRule WeakeningContractionMacroRule WeakeningLeftMacroRule WeakeningLeftRule WeakeningMacroRule WeakeningRightMacroRule WeakeningRightRule applySubstitution OccSequent createContext contLeftNumber contRightNumber containsEqualityReasoning cutformulaExtraction deleteTautologies eliminateDefinitions getAncestors getAuxFormulas getCutAncestors getCutsAsProofs getStatistics getTypeInformation map_proof printProofStats quantRulesNumber regularize replaceSubproof rule_isomorphic rulesNumber simpleUnitResolutionNormalization skolemize subsumedClausesRemoval weakQuantRulesNumber Axiom ExistsSkLeftRule ExistsSkRightRule ForallSkLeftRule ForallSkRightRule LKskToExpansionProof LabelledOccSequent EmptyLabel WeakeningLeftRule WeakeningRightRule applySubstitution eliminateDefinitions rule_isomorphic LKskToExpansionProof applySubstitution Factor Flip MguFactor MguResolution PCNF Paramodulation Robinson2RalWithAbstractions RobinsonToExpansionProof RobinsonToLK RobinsonToRal containedVariables containsEquationalReasoning eliminateSplitting expansionProofFromInstances extractRecSchemFromResProof findDerivationViaResolution fixDerivation matchingModEq forgetfulPropParam forgetfulPropResolve groundInstancesFromResolutionProof mapInputClauses numberOfLogicalInferencesRes simplifyResolutionProof tautologifyInitialUnitClauses AndEquivalenceRule AndEquivalenceRule1 AndEquivalenceRule2 AndEquivalenceRule3 AndLeftEquivalenceRule1 AndLeftEquivalenceRule2 AndLeftEquivalenceRule3 AndRightEquivalenceRule1 AndRightEquivalenceRule2 AndRightEquivalenceRule3 AtomMatch CloneLKProof2 ExistsHyperLeftRule ExistsHyperRightRule FOSchemaProofLinkRule ForallHyperLeftRule ForallHyperRightRule OrEquivalenceRule1 OrEquivalenceRule2 OrEquivalenceRule3 OrLeftEquivalenceRule1 OrLeftEquivalenceRule2 OrLeftEquivalenceRule3 OrRightEquivalenceRule1 OrRightEquivalenceRule2 OrRightEquivalenceRule3 RemoveEqRulesFromGroundSchemaProof SchemaProofLinkRule StepMinusOne TermEquivalenceRule1 TermLeftEquivalenceRule1 TermRightEquivalenceRule1 applySchemaSubstitution applySchemaSubstitution2 checkProofLinks checkProofLinks1 cloneMySol cloneMyTerm defineremove equalforms equalterms foldLeftRule foldRightRule foldRule genterm getName isIndexSort iterateOnFormula printSchemaProof rewriterulereplace sContractionLeftRule sContractionRightRule sCutRule trsArrowLeftRule trsArrowRightRule trsArrowRule RefutationSketchToRobinson DrawSequent LatexLabel PopupMenu RGBColorChooser prooftool groundFreeVariables FindFormulaH RunOnProofSequence canonicalSolution decodeSipGrammar findConseq hSolveQBUP qbupForRecSchem simplePi1RecSchemTempl renameConstantsToFi termRenaming typeRenaming loadProof parseMethod runOutOfProcess HashMultiset ArbitraryAGraph BinaryAGraph LeafAGraph UnaryAGraph EdgeGraph EmptyGraph UnionGraph VertexGraph ArbitraryTree BinaryTree LeafTree UnaryTree withTimeout glob help runProcess time withTempFile
applyConsole
PStructToExpressionTree
applyImpl
LemmaMacros
applyOption
Paramodulation
applyRCC
cutOccConfigToCutConfig
applyRec
ArbitraryAGraph ArbitraryTree
applySchemaSubstitution
shlk
applySchemaSubstitution2
shlk
applySubToSclauseOrSclauseTerm
clauseSchema
applySubstitution
FOLAtomClosedUnderFOLSub FOLTermClosedUnderFOLSub Substitutable LKProofSubstitutable lkOld lksk lkskNew
applyToLabel
DestructTactic WeakeningLeftTactic WeakeningRightTactic
apply_
Projections
apply_conditional_equality
UniformAssociativity3ExampleProof
appnil
lists
apprev
lists
appth
lists
arg
App
args
App GTFun ResolutionProofSchema clauseSchema clauseSetTerm ETDefinition
arguments
ETDefinedAtom
arithmetic
formats
arity
expr TipConstructor
array_init
hoare
arrowType
TypeParsers
asFOLSubstitution
Substitution
asTactic
Tactical
asVectTratGrammarProduction
TratGrammar
asciiUnquotName
BabelExporter
ask
BenchmarkRecordingSession ExternalSmtlibProgram SmtlibSession
assert
IncrementalProvingSession FakeIncrementalSession SmtlibSession
assertedFormulas
FakeIncrementalSession
assign
ProgramParserA
assignment
evalCodeSnippetsInLatex
assoc
inductionExamples
assoc2ES
prototype
assocES
prototype RunOnProofSequence
assoc_mul_axiom
FactorialFunctionEqualityExampleProof
associatedSip
SimpleLoopProblem
ast
babel llkNew
asymm
proof
at
root ChainTactic
atMost
CountingFormulas naive thresholds
atom
PigeonHolePrinciple LeanCoPParser LatexReplacementParser LLKASTParser LatexReplacementParser Prover9TermParserA TPTPParser rTerm ETAtom ETDefinedAtom Axiom TautologyClause
atom1
LLKASTParser Prover9TermParserA
atom2
LLKASTParser Prover9TermParserA
atomDefs
ExpansionProof
atomWeq
LLKASTParser Prover9TermParserA
atomregexp
LLKASTParser
atoms
hol grammars
atomsymb
LatexReplacementParser LLKASTParser LatexReplacementParser Prover9TermParserA
atomsymb2
LatexReplacementParser LatexReplacementParser
atp_instances
poset
aux
DefinitionLeftRule DefinitionRightRule EqualityLeftRule EqualityRightRule EqualityRule ExistsLeftRule ExistsRightRule ForallLeftRule ForallRightRule NegLeftRule NegRightRule LKQuantifierException ElimEx AuxiliaryFormulas LKUnaryRuleCreationException AllLeft AllRight AllSkLeft AllSkRight Equality ExLeft ExRight ExSkLeft ExSkRight NegLeft NegRight
aux1
pTimes AndLeftRule AndRightRule ContractionLeftRule ContractionRightRule ContractionRule CutRule ImpLeftRule ImpRightRule OrLeftRule OrRightRule LKBinaryRuleCreationException AndLeft AndRight ContractionLeft ContractionRight Cut ImpLeft ImpRight OrLeft OrRight
aux2
pTimes AndLeftRule AndRightRule ContractionLeftRule ContractionRightRule ContractionRule CutRule ImpLeftRule ImpRightRule OrLeftRule OrRightRule LKBinaryRuleCreationException AndLeft AndRight ContractionLeft ContractionRight Cut ImpLeft ImpRight OrLeft OrRight
auxFOccs
Times
auxFormula
EqualityRule ExistsLeftRule ForallRightRule Equality RalPara Paramodulation
auxFormula_
Equality RalPara Paramodulation
auxFormulas
SequentProof
auxInConclusion
EqualityRule
auxIndices
IvyResolutionProof SequentProof AndLeftRule AndRightRule ContractionRule CutRule DefinitionLeftRule DefinitionRightRule EqualityRule ExistsLeftRule ExistsRightRule ForallLeftRule ForallRightRule 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 Factor InitialClause Instance Paramodulation Resolution Splitting RefutationSketch DrawSequentProof
auxiliaries
DrawSingleSequentInference
auxl
pUnary
auxsyms
TseitinCNF
avg_inst_per_form
findNonTrivialTSTPExamples
avg_ts_size
findNonTrivialTSTPExamples
awayFrom
rename
ax2_ax
UniformAssociativity3ExampleProof
axformula
TokenToLKConverter TokenToLKConverter
axiom
RecSchemTemplate RecursionScheme TratGrammar VectTratGrammar ReforestState SketchAxiom
axiomBot
TacticCommands
axiomLog
TacticCommands
axiomRefl
TacticCommands
axiomTop
TacticCommands
axiomVect
VectTratGrammar
axioms
proof ExtendedProofDatabase ProofDatabase FOTheory SubsumptionTheory
axioms_prove_sequent
TokenToLKConverter TokenToLKConverter