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

README.md

@@ -15,7 +15,6 @@ size_categories:
   - 10K<n<100K
 dataset_info:
   features:
-  - {name: fact, dtype: string}
   - {name: statement, dtype: string}
   - {name: proof, dtype: string}
   - {name: type, dtype: string}
@@ -55,16 +54,15 @@ Declarations from RedPRL, a cubical/computational type theory system.
 
 | Column | Type | Description |
 |--------|------|-------------|
-| 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 |
+| statement | string | Declaration signature/claim with the leading keyword removed (verbatim slice); the full declaration minus its proof |
+| proof | string | Verbatim proof/body, empty if the declaration has none |
 | type | string | Declaration keyword |
 | symbolic_name | string | Declaration identifier |
 | library | string | Sub-library |
 | filename | string | Repository-relative source path |
 | imports | list[string] | File-level `Require`/`Import` modules |
 | deps | list[string] | Intra-corpus identifiers referenced |
-| docstring | string | Preceding documentation comment, null if absent |
+| docstring | string | Preceding documentation comment, empty if absent |
 | line_start | int | First source line |
 | line_end | int | Last source line |
 | has_proof | bool | Whether a proof block was captured |
@@ -89,8 +87,9 @@ Declarations from RedPRL, a cubical/computational type theory system.
 
 ## Example
 
-```coq
-Test(#l:lvl) : (Category (++#l)) by {
+```
+Test(#l:lvl) : (Category (++#l))
+by {
   { ob = `(U #l)
   , hom = lam ty/a ty/b => `(-> ty/a ty/b)
   , idn = lam ty/a x => `x
@@ -106,8 +105,9 @@ Test(#l:lvl) : (Category (++#l)) by {
 
 ## Use
 
-Statement and proof are available both joined (`fact`) and split (`statement`, `proof`) for
-proof-term modeling, autoformalization, retrieval, and dependency analysis via `deps`.
+Each declaration is split into a `statement` (signature/claim) and a `proof` (body) that are disjoint
+and together form the complete declaration, for proof modeling, autoformalization, retrieval, and
+dependency analysis via `deps`.
 
 ## Citation
 

data/train-00000-of-00001.parquet

@@ -1,3 +1,3 @@
 version https://git-lfs.github.com/spec/v1
-oid sha256:18adfc6e70529e0a04270d38de09838cb5e91a4ed627391fb92541866e1f7f67
-size 61621
+oid sha256:1870a22d7e20a4ff3982e3a3bbe2a3613a63f6ff25b925bf46d1da51685c6df0
+size 36085