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

README.md

@@ -18,7 +18,6 @@ dataset_info:
   - {name: statement, dtype: string}
   - {name: proof, dtype: string}
   - {name: type, dtype: string}
-  - {name: kind, dtype: string}
   - {name: symbolic_name, dtype: string}
   - {name: library, dtype: string}
   - {name: filename, dtype: string}
@@ -30,7 +29,6 @@ dataset_info:
   - {name: has_proof, dtype: bool}
   - {name: source_url, dtype: string}
   - {name: commit, dtype: string}
-  - {name: content_level, dtype: string}
   splits:
   - {name: train, num_examples: 19736}
   config_name: default
@@ -56,11 +54,10 @@ Structured dataset of definitions and theorems from the Coq standard library.
 
 | Column | Type | Description |
 |--------|------|-------------|
-| fact | string | Verbatim declaration: statement followed by proof where present |
-| statement | string | Verbatim statement (keyword through the closing period) |
-| proof | string | Verbatim proof block (`Proof. ... Qed.`/`Defined.`), empty if none |
-| type | string | Raw declaration keyword |
-| kind | string | Normalized kind |
+| fact | string | Complete verbatim declaration (keyword, signature, and body/proof) |
+| statement | string | Signature with the leading keyword removed (verbatim slice) |
+| proof | string | Verbatim proof/body, empty if none |
+| type | string | Declaration keyword |
 | symbolic_name | string | Declaration identifier |
 | library | string | Sub-library |
 | filename | string | Repository-relative source path |
@@ -72,7 +69,6 @@ Structured dataset of definitions and theorems from the Coq standard library.
 | has_proof | bool | Whether a proof block was captured |
 | source_url | string | Upstream repository |
 | commit | string | Upstream commit extracted |
-| content_level | string | `statement+proof` |
 
 ## Statistics
 
@@ -116,13 +112,10 @@ Structured dataset of definitions and theorems from the Coq standard library.
 
 ```coq
 #[local]
-Lemma minus_plus_simpl_l_reverse_stt n m p : n - m = p + n - (p + m).
-Proof.
- now rewrite Nat.sub_add_distr, Nat.add_comm, Nat.add_sub.
-Qed.
+Definition gt_n_S_stt : forall n m, n > m -> S n > S m := fun n m Hgt => proj1 (Nat.succ_lt_mono m n) Hgt.
 ```
 
-- kind: theorem | symbolic_name: `minus_plus_simpl_l_reverse_stt` | theories/Arith/Arith_base.v:287
+- type: Definition | symbolic_name: `gt_n_S_stt` | theories/Arith/Arith_base.v:137
 
 ## Use
 

data/train-00000-of-00001.parquet

@@ -1,3 +1,3 @@
 version https://git-lfs.github.com/spec/v1
-oid sha256:20f387d3ca4bb9cad3c9e8feb54aa0418da6fa6b51b47be3be96f494c490e883
-size 4095204
+oid sha256:45097cec2dcbc8ba8585b5b91827e63f6fc4cd57db6503b8d121f559063b9d99
+size 4057563