Re-extract: full statement+proof, normalized schema, provenance

README.md

@@ -54,7 +54,7 @@ Structured declarations from Duper - a proof-producing superposition theorem pro
 
 | Column | Type | Description |
 |--------|------|-------------|
-| fact | string | Complete verbatim declaration (keyword, signature, and body/proof) |
+| fact | string | Verbatim declaration with the leading keyword removed: signature and body/proof joined |
 | statement | string | Signature with the leading keyword removed (verbatim slice) |
 | proof | string | Verbatim proof/body, empty if none |
 | type | string | Declaration keyword |
@@ -98,7 +98,7 @@ Structured declarations from Duper - a proof-producing superposition theorem pro
 ## Example
 
 ```coq
-def backwardSimplify (givenClause : Clause) : ProverM Unit := do
+backwardSimplify (givenClause : Clause) : ProverM Unit := do
   trace[duper.prover.saturate] "backward simplify with {givenClause}"
   let backwardSimpRules ← backwardSimpRules
   for i in [0 : backwardSimpRules.size] do
@@ -106,7 +106,7 @@ def backwardSimplify (givenClause : Clause) : ProverM Unit := do
     simpRule givenClause
 ```
 
-- type: def | symbolic_name: `backwardSimplify` | Duper/BackwardSimplification.lean:27
+- type: def | symbolic_name: `Duper.ProverM.backwardSimplify` | Duper/BackwardSimplification.lean:27
 
 ## Use
 

data/train-00000-of-00001.parquet

@@ -1,3 +1,3 @@
 version https://git-lfs.github.com/spec/v1
-oid sha256:c3192228a423b40322d52ebc8c5c77553a069250c86973169d0eaebe14fc6f70
-size 705701
+oid sha256:1b8237e07898034e87c58e0d7540fdc2cb7d285d03db64b3ba1d910fc3f9da4e
+size 792727