Triple
T35417547
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | CADE ATP System Competition |
E1023683
|
entity |
| Predicate | instanceOf |
P0
|
FINISHED |
| Object | automated theorem proving competition |
C64284
|
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: automated theorem proving competition Context triple: [CADE ATP System Competition, instanceOf, automated theorem proving competition]
-
A.
SMT solver competition
An SMT solver competition is an organized event where different Satisfiability Modulo Theories solvers are benchmarked and compared on standardized problem sets to evaluate and advance the state of the art in automated reasoning.
-
B.
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.
-
C.
automated theorem proving technique
An automated theorem proving technique is a systematic, algorithmic method used by computer programs to derive logical conclusions and verify the validity of mathematical or logical statements without human intervention.
-
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. chosen
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.