Triple
T35417587
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | SPASS |
E1023684
|
entity |
| Predicate | instanceOf |
P0
|
FINISHED |
| Object | first-order logic theorem prover |
C26938
|
CONCEPT FINISHED |
How this triple was built (1 step)
Every LLM step that produced this triple, in pipeline order — named-entity classification, the disambiguation choices (the exact options shown, with the pick highlighted), and the generated description. The batch + timestamp of each is in the Provenance table below.
CD
Concept disambiguation
gpt-5-mini-2025-08-07
Target class: first-order logic theorem prover Context triple: [SPASS, instanceOf, first-order logic theorem prover]
-
A.
higher-order logic theorem prover
A higher-order logic theorem prover is a software system that automatically or interactively checks, derives, and manipulates logical statements and proofs in a logic where functions and predicates can take other functions and predicates as arguments.
-
B.
theorem prover
chosen
A theorem prover is a software system or algorithm that automatically or semi-automatically checks the validity of logical statements by deriving conclusions from axioms and inference rules.
-
C.
framework in automated theorem proving
A framework in automated theorem proving is a structured environment of algorithms, data structures, and interfaces that coordinates the representation of logical formulas, the application of inference rules, and the management of proof search to automatically derive or verify theorems.
-
D.
interactive theorem prover
An interactive theorem prover is a software system that assists users in the formalization and step-by-step verification of mathematical proofs or program properties through human-guided logical reasoning.
-
E.
pioneer in automated theorem proving
A pioneer in automated theorem proving is an individual who makes foundational contributions to the theory, design, or implementation of systems that enable computers to automatically generate and verify mathematical proofs.
- F. None of above.
Provenance (1 batch)
The batch behind each pipeline step, in order, with when it ran. Timestamps are batch-level — stages were processed in waves, so the object chain (NER → NED1 → NEDg → NED2) reads in order, but predicate / elicitation batches can sit in a different wave.
| Step | Stage | Batch ID | Status | When |
|---|---|---|---|---|
| creating | Elicitation | batch_69f76df54bac8190bd0d3b0eb35cda5f |
completed | May 3, 2026, 3:47 p.m. |
Created at: May 3, 2026, 4:03 p.m.