A
BussTautology struct SimpleLoopProblem ExistsRightRule ForallLeftRule LogicalAxiom
ABase
SumOfOnesExampleProof
ACNF
ceres ACNF
ACNFDialog
prooftool
AFactorF
ral
AFactorFType
ral
AFactorT
ral
AFactorTType
ral
AGraph
acyclicGraphs
AGraphProof
proofs
ASSO
FactorialFunctionEqualityExampleProof2
ASTtoHOL
HLKHOLParser
ASTtoHOLnormalized
HLKHOLParser
ASuc
SumOfOnesExampleProof
AToken
llk
About
prooftool
Abs
expr ast
AbstractMethodError
scala
Action
ProofStrategy
Add
ds
AddGuidedClausesCommand
guided
AddGuidedInitialClauseCommand
guided
AddGuidedResolventCommand
guided
AddRemove
ds
All
expr ast
AllFRalType
ral
AllFType
andrews
AllQuantifiedConditionalAxiomHelper
examples
AllTRalType
ral
AllTType
andrews
AlternativeStandardClauseSet
clauseSets
And
expr ast
AndC
expr
AndEquivalenceRule
shlk
AndEquivalenceRule1
shlk
AndEquivalenceRule1Type
shlk
AndEquivalenceRule2
shlk
AndEquivalenceRule2Type
shlk
AndEquivalenceRule3
shlk
AndEquivalenceRule3Type
shlk
AndF
andrews ral
AndFRalType
ral
AndFType
andrews
AndLeft1Rule
lk
AndLeft1RuleType
lk
AndLeft2Rule
lk
AndLeft2RuleType
lk
AndLeftEquivalenceRule1
shlk
AndLeftEquivalenceRule2
shlk
AndLeftEquivalenceRule3
shlk
AndLeftRule
lk lkNew
AndRightEquivalenceRule1
shlk
AndRightEquivalenceRule2
shlk
AndRightEquivalenceRule3
shlk
AndRightRule
lk lkNew
AndRightRuleType
lk
AndT1
ral
AndT1RalType
ral
AndT2
ral
AndT2RalType
ral
AndTL
andrews
AndTLType
andrews
AndTR
andrews
AndTRType
andrews
Ant
BussTautology base
Antecedent
FormulaLocation
AnyRef
scala
App
expr ast
AppliedSubstitution
resolution
ApplyOnAllPolarizedLiteralPairsCommand
sequents
Apps
expr
ArbitraryAGraph
acyclicGraphs
ArbitraryAxiom
lkNew
ArbitraryInference
RefutationSketch
ArbitraryTree
trees
Arity
expr
ArrayIndexOutOfBoundsException
scala
Ass
LinearEqExampleProof
Assign
hoare
Atom
lisp
AtomMatch
shlk
AtomicExpansion
lk
AuxiliaryFormulas
base
Ax1
UniformAssociativity3ExampleProof
Axiom
lk lkNew lksk RefutationSketch
a
LinearEqExampleProof SquareEdges2DimExampleProof LankfordSolverInstance Sequence SimpleBackwardSubsumptionCommand SimpleForwardSubsumptionCommand
a1
AndLeftRule ContractionLeftRule ContractionRightRule OrRightRule
a2
AndLeftRule ContractionLeftRule ContractionRightRule OrRightRule
aSx
InductionRule
aTerm
schema
aX
InductionRule
aZero
InductionRule
ab
LankfordSolverInstance
ablength
LankfordSolverInstance
abs
HOLASTParser LatexReplacementParser SimpleHOLParser
absOrAtomWeq
HOLASTParser
acyclicGraphs
ds
add
dbTRS dbTRSclauseSetTerm dbTRSsTermN fo2SubstDB resolutionProofSchemaDB DeltaTable BFSAlgorithm SearchAlgorithm
addAllAxioms
UniformAssociativity3ExampleProof
addChangeListener
ProofNodeInfo
addClause
Refinement
addDefinitions
FileParser
addElem
SetNode
addListener
ListenerManager
addProofs
FileParser
addSeqList
FileParser
addSequent
SimpleManager SubsumptionManager
addSymmetry
expansionTrees
addTermTree
FileParser
addToAntecedent
Sequent
addToSuccedent
Sequent
addTrees
FileParser
addVectors
MathHelperFunctions
add_pmap
NameReplacement RenameResproof
adjustOrientation
DrawSingleSequentInference
alength
LankfordSolverInstance
alg
simpleUnitResolutionNormalization subsumedClausesRemoval subsumedClausesRemovalHOL ClauseFactorCommand FactorCommand ParamodulationCommand ResolveCommand SimpleSubsumptionCommand
algebraic
ds
algorithms
gapt
allformula
HOLASTParser Prover9TermParserA
allformula_
HOLASTParser LatexReplacementParser Prover9TermParserA
allgreatereqzero
Vector
allgreaterzero
Vector
alpha
FactorialFunctionEqualityExampleProof2 SipGrammar SimpleInductionProof
alphaEquals
LambdaExpression
alphaVar
SimpleInductionProblem
alternations
A Dual EmptyPlusJunction EmptyTimesJunction Plus Struct Times
ancestors
FormulaOccurrence
ancoccmatcher
InstantiateElimination
and
LeanCoPParser SimpleFOLParser SimpleHOLParser TPTPParser VeriTParser
andFormula
VeriTParser
andNSchemaF
RemoveEqRulesFromGroundSchemaProof
and_neg
VeriTParser
and_pos
VeriTParser
andrews
resolution
anotherfunction
applySchemaSubstitution2
ant
nonVarSclause
antecedent
AToken RToken Sequent ExtendedHerbrandSequent
antecedentPanel
DrawExpansionSequent
antecedent_alpha
ExtendedHerbrandSequent
antiUnificator
grammars
anyeqzero
Vector
anyless
Vector
anylesseqzero
Vector
anylesszero
Vector
appOrAtomWeq
HOLASTParser LatexReplacementParser
appendPostfix
TPTPHOLExporter
apply
DefinitionElimination NameReplacement TermReplacement GenerateRobinson2Ral MaxSATsolve Robinson2LK buildACNF buildProofWithCut compressExpansionSequent compressExpansionTree computeCanonicalSolutions computeGrammars computeGroundProjections computeProjections css cutIntro definitionElimination deleteEquationalTautologies deleteTautologies eliminateCuts eliminateInstaces equation_example exportLLK exportLabelledSequentListLatex exportLatex exportSequentListLatex exportTHF exportTPTP exportVeriT exportXML extractInterpolant extractStruct extractTerms findDefinitions format fsequent2sequent generateExtendedHerbrandSequent help loadLLK loadLeanCoPProof loadPrime loadProofDB loadProofs loadProver9LKProof loadProver9Proof loadSLK loadVeriTProof miniSATprove miniSATsolve minimalExpansionSequents minimizeSolution normalizeSub parseFOL parseHOL parseLISP parseLLKExp parseLLKFormula parseProver9 philsci printProofStats prooftool proveProp prover9 refuteClauseList refuteFOL refuteFOLI removeSubsumed replay simplifyStruct structToClausesList structToLabelledClausesList tbillc time toClauses unfoldProof unitResolve GPL AllQuantifiedConditionalAxiomHelper BussTautology FactorialFunctionEqualityExampleProof FactorialFunctionEqualityExampleProof2 LinearEqExampleProof LinearExampleProof PQPairs PigeonHolePrinciple ProofSequence SquareDiagonalExampleProof SquareEdges2DimExampleProof SquareEdgesExampleProof SumExampleProof SumOfOnesExampleProof SumOfOnesF2ExampleProof SumOfOnesFExampleProof UniformAssociativity3ExampleProof -> Abs App Apps Arity BinaryPropConnectiveHelper Const Eq EqC FOLAtom FOLConst FOLExpression FOLFunction FOLHeadType FOLVar FunctionType HOLAtom HOLFunction LambdaExpression LambdaPosition MonoidalBinaryPropConnectiveHelper nAry MonomorphicLogicalC NullaryPropConnectiveHelper QuantifierC QuantifierHelper Block StringExtractor StringSymbol Substitution Type UnaryPropConnectiveHelper Var VariantSymbol constants expressionSize FOLFunctionArgs FOLFunctionName FOLPosition FOLSubTerms FOLSubstitution changeTypeIn getArityOfConstants isFOLFunction isFOLPrenexPi1 isFOLPrenexSigma1 reduceHolToFol replaceAbstractions toAbbreviatedString undoReplaceAbstractions freeVariables getRenaming CNFn CNFp HOLPosition atoms containsQuantifier containsQuantifierOnLogicalLevel containsStrongQuantifier dualize existsclosure freeHOVariables instantiate isAtom isExtendedAtom isLogicalConstant isNeg isPrenex isReflexivity lcomp normalizeFreeVariables numOfAtoms removeAllQuantifiers removeNeg removeQuantifiers simplify toAbbreviatedString toNNF toPrettyString Vector univclosure variablesAll variablesEx isInVNF longNormalForm rename 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 toImplications toVNF variables readDIMACS writeDIMACS IvyParser IvyToRobinson ProofToLatexExporter IntPosition ListReader SExpressionParser HybridLatexExporter toLLKString toLatexString PutPlusTogether backToInt maketogether CNFtoSet ClauseSetToCNF getPLinks TPTPHOLExporter SmtLibExporter Match XMLExporter saveXML antiUnificator atoms findMinimalGrammar findMinimalSipGrammar findMinimalVectGrammar minimizeGrammar minimizeSipGrammar minimizeVectGrammar nfsSubsumedByAU normalForms normalFormsProofGrammar normalFormsProofVectGrammar normalFormsSipGrammar takeN termSize ACNF contractionNormalForm renameIndexedVarInProjection renameVar CERES CERESR2LK GroundingProjectionTerm PStructToExpressionTree PTimesC PWeakC ProjectionTermCreators ProjectionTermToSetOfProofs RelevantCC RemoveArrowRules UnfoldProjectionTerm ceres_omega 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 CleanStructure ETAnd ETImp ETInitialNode ETNeg ETOr ETSkolemQuantifier ETStrongQuantifier ETWeakQuantifier ExpansionProofToLK ExpansionSequent MultiExpansionSequent addSymmetry compressQuantifiers decompressQuantifiers extractInstanceTerms extractInstances formulaToExpansionTree getETOfFormula getStatistics groundTerms isQuantified merge minimalExpansionSequent minimalExpansionSequents quantRulesNumber removeFromExpansionSequent replace replaceAtHOLPosition substitute toDeep toShallow Assign ForLoop Sequence mapVariableNames substVariables unrollLoop usedVariables weakestPrecondition 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 applyRecursive applyReplacement applySubstitution HOLSequent OccSequent Sequent createContext contLeftNumber contRightNumber containsEqualityReasoning ComputeGrammars MaxSATMethod MinimizeSolution TermsExtraction simpleToMultiGrammar cutformulaExtraction deleteTautologies eliminateDefinitions factoring getAncestors getAuxFormulas getCutAncestors getCutsAsProofs getStatistics getTypeInformation map_proof proofFromInstances quantRulesNumber regularize replaceSubproof rule_isomorphic rulesNumber setNormalize simpleUnitResolutionNormalization skolemize subsumedClausesRemoval subsumedClausesRemovalHOL weakQuantRulesNumber AndLeftRule AndRightRule Axiom ContractionLeftRule ContractionRightRule CutRule ExistsLeftRule ExistsRightRule ForallLeftRule ForallRightRule ImpLeftRule ImpRightRule NegLeftRule NegRightRule OrLeftRule OrRightRule prettyString Axiom ExistsSkLeftRule ExistsSkRightRule ForallSkLeftRule ForallSkRightRule LKskToExpansionProof EmptyLabel WeakeningLeftRule WeakeningRightRule applySubstitution eliminateDefinitions rule_isomorphic sequentToLabelledSequent Clause FOLClause ForgetfulParamodulate ForgetfulResolve ForgetfulResolveIndexed HOLClause InitialSequent InstantiateElimination OccClause PCNF Paramodulants ResolutionSubstitution RobinsonToExpansionProof RobinsonToLK RobinsonToRal TseitinCNF AndF AndTL AndTR Cut ExistsF ExistsT ForallF ForallT ImplFL ImplFR ImplT NotF NotT OrFL OrFR OrT Sub computeSkolemTerm containedVariables createContext factorDuplicateLiterals findDerivationViaResolution fixDerivation initialSequents mapInitialClauses numberOfResolutionsAndParamodulations AFactorF AFactorT AndF AndT1 AndT2 Cut ExistsF ExistsT ForallF ForallT ImpF1 ImpF2 ImpT InitialSequent NegF NegT OrF1 OrF2 OrT ParaF ParaT Sub Factor Formatter InitialClause Instance Paramodulation Resolution Variant createContext tautologifyInitialClauses 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 ACNFDialog About DrawSequent LatexLabel PopupMenu RGBColorChooser TextAreaDialog SearchDerivation AddGuidedClausesCommand AddGuidedInitialClauseCommand AddGuidedResolventCommand GetGuidedClausesCommand GetGuidedClausesLiterals GetGuidedClausesLiteralsPositions IsGuidedNotFoundCommand SetGuidedFoundCommand DeterministicAndCommand DeterministicMacroCommand RefinementID SimpleRefinementGetCommand OldReplayCommand PrintStateCommand ReplayCommand SetClauseWithProofCommand SetTargetClause2 ClauseFactorCommand FactorCommand ParamodulationCommand ResolveCommand SetClausesCommand SetClausesFromDataCommand VariantLiteralCommand VariantLiteralPositionCommand VariantsCommand ApplyOnAllPolarizedLiteralPairsCommand IfNotExistCommand InsertResolventCommand RefutationReachedCommand SearchForEmptyClauseCommand SetTargetClause SimpleBackwardSubsumptionCommand SimpleForwardSubsumptionCommand SubsumedTargedReachedCommand SubsumedTargedSetFromClauseSetCommand fvarInvariantMSEquality fvarInvariantMSEqualityEQ GetTwoClauses getTwoClausesFromUICommand groundFreeVariables FindFormulaH RunOnProofSequence canonicalSolution decodeSipGrammar findConseq readWDIMACS Prover9InitCommand renameConstantsToFi readSat4j HashMultiset PublishingBuffer ArbitraryAGraph BinaryAGraph LeafAGraph UnaryAGraph EdgeGraph EmptyGraph UnionGraph VertexGraph ArbitraryTree BinaryTree LeafTree UnaryTree withTimeout withTempFile
apply1
replay
applyConsole
PStructToExpressionTree
applyEq
MinimizeSolution
applyF
DrawSequent
applyFactoring
GAPScalaInteractiveShellLibrary
applyNoMerge
substitute
applyRCC
cutOccConfigToCutConfig
applyRec
ArbitraryAGraph ArbitraryTree
applyRecursive
lk
applyReplacement
lk
applySchemaSubstitution
shlk
applySchemaSubstitution2
shlk
applySubToListOfPairs
FOLUnificationAlgorithm
applySubToSclauseOrSclauseTerm
clauseSchema
applySubstitution
lk lksk
applyWithoutMerge
ETWeakQuantifier
apply_
IvyParser ForgetfulResolve
apply_conditional_equality
UniformAssociativity3ExampleProof
ar
SubsumptionDSEvent PublishingBufferEvent
arg
App
args
App ResolutionProofSchema clauseSchema clauseSetTerm
arithmetic
formats
arrowType
Parsers
as
PCNF
asGraphViz
Formatter
asGraphVizString
format
asHumanReadableString
format Formatter
asTex
format Formatter
asVectTratGrammarProduction
TratGrammar
asXml
format Formatter
ass
SumExampleProof
ass_inst
SumExampleProof
ass_inst_inst
SumExampleProof
assign
ProgramParserA
assocES
RunOnProofSequence
assoc_mul_axiom
FactorialFunctionEqualityExampleProof
associatedSip
SimpleLoopProblem
assx
SquareEdges2DimExampleProof SquareEdgesExampleProof
assx_aux
SquareEdges2DimExampleProof SquareEdgesExampleProof
assy
SquareEdges2DimExampleProof SquareEdgesExampleProof
assy_aux
SquareEdges2DimExampleProof SquareEdgesExampleProof
ast
hlk
at
root
atEnd
ListReader
atom
PigeonHolePrinciple HOLASTParser LeanCoPParser SExpressionParser LatexReplacementParser Prover9TermParserA SimpleFOLParser SimpleHOLParser TPTPParser rTerm ETAtom METAtom
atom1
HOLASTParser Prover9TermParserA
atom2
HOLASTParser Prover9TermParserA
atomWeq
HOLASTParser Prover9TermParserA
atom_map
DIMACSHelper MiniSAT
atomregexp
HOLASTParser
atoms
hol DIMACSHelper grammars
atomsymb
HOLASTParser LatexReplacementParser Prover9TermParserA
atomsymb2
LatexReplacementParser
atp
provers
aux
LKQuantifierException ElimEx AuxiliaryFormulas LKUnaryRuleCreationException EqualityRule ExistsLeftRule ExistsRightRule ForallLeftRule ForallRightRule NegLeftRule NegRightRule
aux1
pTimes LKBinaryRuleCreationException AndLeftRule AndRightRule ContractionLeftRule ContractionRightRule CutRule ImpLeftRule ImpRightRule InductionRule OrLeftRule OrRightRule
aux2
pTimes LKBinaryRuleCreationException AndLeftRule AndRightRule ContractionLeftRule ContractionRightRule CutRule ImpLeftRule ImpRightRule InductionRule OrLeftRule OrRightRule
aux3
InductionRule
auxFOccs
Times
auxFormula
EqualityRule ExistsLeftRule ExistsRightRule ForallLeftRule ForallRightRule NegLeftRule NegRightRule
auxFormulas
SequentProof
auxIndices
SequentProof AndLeftRule AndRightRule ContractionLeftRule ContractionRightRule CutRule EqualityRule ExistsLeftRule ExistsRightRule ForallLeftRule ForallRightRule ImpLeftRule ImpRightRule InductionRule InitialSequent NegLeftRule NegRightRule OrLeftRule OrRightRule WeakeningLeftRule WeakeningRightRule
aux_proof
SumOfOnesExampleProof
auxiliaries
DrawSingleSequentInference
auxl
pUnary
auxsyms
TseitinCNF
ax2_ax
UniformAssociativity3ExampleProof
axformula
TokenToLKConverter
axiom
TratGrammar VectTratGrammar
axiomVect
VectTratGrammar
axiomformulas
lkproof
axiomoccurrences
lkproof
axiomrules
lkproof
axioms
ExtendedProofDatabase ProofDatabase
axioms_prove_sequent
TokenToLKConverter