Triple
T11090193
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Satisfiability Modulo Theories |
E262229
|
entity |
| Predicate | hasSolver |
P55156
|
FINISHED |
| Object | Alt-Ergo |
E239176
|
NE FINISHED |
How this triple was built (2 steps)
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.
NER
Named-entity recognition
gpt-5-mini
Instruction
Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).
Input
Phrase: Alt-Ergo | Statement: [Satisfiability Modulo Theories, hasSolver, Alt-Ergo]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Alt-Ergo Context triple: [Satisfiability Modulo Theories, hasSolver, Alt-Ergo]
-
A.
HOL theorem prover
The HOL theorem prover is an interactive proof assistant for higher-order logic, widely used in formal verification of hardware, software, and mathematical theories.
-
B.
Z3 SMT solver
chosen
Z3 SMT solver is a high-performance Satisfiability Modulo Theories (SMT) solver developed at Microsoft Research, widely used in program verification, formal methods, and automated reasoning.
-
C.
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.
-
D.
Isabelle proof assistant
Isabelle proof assistant is a widely used interactive theorem prover and generic proof assistant designed for formal verification and mathematical logic, particularly known for its support of higher-order logic.
-
E.
HOL4
HOL4 is an interactive theorem prover for higher-order logic, widely used in formal verification and based on the LCF approach to ensuring soundness.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (3 batches)
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_69d6aa9a40d88190a373e2c7e48285db |
completed | April 8, 2026, 7:20 p.m. |
| NER | Named-entity recognition | batch_69d799e96ca08190838c8a04d1eb2a16 |
completed | April 9, 2026, 12:22 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69e3e7c586808190a576803b7406a49e |
completed | April 18, 2026, 8:21 p.m. |
Created at: April 8, 2026, 9:27 p.m.