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

README.md

@@ -14,7 +14,6 @@ size_categories:
   - 1K<n<10K
 dataset_info:
   features:
-  - {name: fact, dtype: string}
   - {name: statement, dtype: string}
   - {name: proof, dtype: string}
   - {name: type, dtype: string}
@@ -54,16 +53,15 @@ Structured dataset of definitions and theorems from the Coq standard library.
 
 | 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 |
@@ -110,16 +108,18 @@ Structured dataset of definitions and theorems from the Coq standard library.
 
 ## Example
 
-```coq
-gt_pred_stt : forall n m, m > S n -> pred m > n := fun n m Hgt => proj1 (Nat.lt_succ_lt_pred n m) Hgt.
+```
+gt_pred_stt : forall n m, m > S n -> pred m > n
+:= fun n m Hgt => proj1 (Nat.lt_succ_lt_pred n m) Hgt.
 ```
 
 - type: Definition | symbolic_name: `gt_pred_stt` | theories/Arith/Arith_base.v:150
 
 ## 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:5d192dbf8a8097fcd91ae2929d62520453376d5b402e2e3b069e1e1c037e2563
-size 3990803
+oid sha256:b286a0fbb6280e669c50c9fd2d938e028f49a7a66cc10e5f05c8bbd0e3761be1
+size 2312729