SPASS automated theorem prover
E1023684
automated theorem prover
first-order logic theorem prover
software system
superposition-based theorem prover
SPASS automated theorem prover is a first-order logic theorem proving system known for its use of superposition calculus and its application in automated reasoning and formal verification.
All labels observed (1)
| Label | Occurrences |
|---|---|
| SPASS automated theorem prover canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T13166227 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: SPASS automated theorem prover Context triple: [Vampire automated theorem prover, relatedTo, SPASS automated theorem prover]
-
A.
Vampire automated theorem prover
Vampire automated theorem prover is a high-performance first-order logic reasoning system widely used in automated deduction and formal verification research.
-
B.
First-Order Logic and Automated Theorem Proving
"First-Order Logic and Automated Theorem Proving" is a foundational textbook that systematically introduces first-order logic while presenting key methods and algorithms used in automated theorem proving.
-
C.
Handbook of Automated Reasoning
The "Handbook of Automated Reasoning" is a comprehensive reference work that surveys the theories, methods, and tools used in the field of automated theorem proving and formal reasoning in computer science and logic.
-
D.
"The Complexity of Theorem-Proving Procedures"
"The Complexity of Theorem-Proving Procedures" is Stephen Cook’s landmark 1971 paper that introduced the concept of NP-completeness and proved the Boolean satisfiability problem (SAT) to be NP-complete, laying the foundation for modern computational complexity theory.
-
E.
Boyer–Moore theorem prover
The Boyer–Moore theorem prover is an influential automated reasoning system for first-order logic and recursive function theory, notable for pioneering techniques in mechanical proof and program verification.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: SPASS automated theorem prover Target entity description: SPASS automated theorem prover is a first-order logic theorem proving system known for its use of superposition calculus and its application in automated reasoning and formal verification.
-
A.
Vampire automated theorem prover
Vampire automated theorem prover is a high-performance first-order logic reasoning system widely used in automated deduction and formal verification research.
-
B.
First-Order Logic and Automated Theorem Proving
"First-Order Logic and Automated Theorem Proving" is a foundational textbook that systematically introduces first-order logic while presenting key methods and algorithms used in automated theorem proving.
-
C.
Handbook of Automated Reasoning
The "Handbook of Automated Reasoning" is a comprehensive reference work that surveys the theories, methods, and tools used in the field of automated theorem proving and formal reasoning in computer science and logic.
-
D.
"The Complexity of Theorem-Proving Procedures"
"The Complexity of Theorem-Proving Procedures" is Stephen Cook’s landmark 1971 paper that introduced the concept of NP-completeness and proved the Boolean satisfiability problem (SAT) to be NP-complete, laying the foundation for modern computational complexity theory.
-
E.
Boyer–Moore theorem prover
The Boyer–Moore theorem prover is an influential automated reasoning system for first-order logic and recursive function theory, notable for pioneering techniques in mechanical proof and program verification.
- F. None of above. chosen
Statements (49)
| Predicate | Object |
|---|---|
| instanceOf |
automated theorem prover
ⓘ
first-order logic theorem prover ⓘ software system ⓘ superposition-based theorem prover ⓘ |
| applicationDomain |
automated reasoning
ⓘ
formal verification ⓘ knowledge representation and reasoning ⓘ mathematical logic ⓘ |
| basedOn | superposition calculus ⓘ |
| feature |
output of formal proofs
ⓘ
refutational completeness for first-order logic with equality (under certain conditions) ⓘ search strategies for clause selection ⓘ support for automated proof generation ⓘ support for equality reasoning ⓘ term ordering mechanisms ⓘ |
| fullName | SPASS automated theorem prover NERFINISHED ⓘ |
| goal | automate reasoning in first-order logic with equality ⓘ |
| hasProperty |
can be integrated into verification toolchains
ⓘ
can be used as a backend prover ⓘ implements advanced search strategies ⓘ implements redundancy elimination techniques ⓘ implements simplification techniques for clauses ⓘ supports equality reasoning via superposition ⓘ |
| inferenceRule |
equality reasoning rules
ⓘ
resolution ⓘ superposition ⓘ |
| logicType | first-order logic ⓘ |
| method |
equational reasoning
ⓘ
resolution-style inference ⓘ term rewriting ⓘ |
| output |
diagnostic information about proof search
ⓘ
formal refutations ⓘ proof objects ⓘ |
| relatedTo |
automated deduction
ⓘ
formal methods ⓘ model checking (via integration in workflows) ⓘ other superposition-based provers ⓘ |
| supports | first-order clause logic ⓘ |
| supportsTask |
model generation (limited)
ⓘ
proof search ⓘ satisfiability checking in first-order logic ⓘ theorem proving ⓘ |
| usedFor |
benchmarking of theorem proving techniques
ⓘ
research in automated deduction ⓘ verification of communication protocols ⓘ verification of hardware systems ⓘ verification of security properties ⓘ verification of software systems ⓘ |
| uses | superposition calculus ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: SPASS automated theorem prover Description of subject: SPASS automated theorem prover is a first-order logic theorem proving system known for its use of superposition calculus and its application in automated reasoning and formal verification.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.