Datasets:
Update README.md
Browse files
README.md
CHANGED
@@ -70,12 +70,12 @@ Each problem contains the following fields:
|
|
70 |
- `informal_problem`: The problem in natural language (including LaTeX).
|
71 |
- `informal_answer`: The ground-truth answer in natural language (including LaTeX).
|
72 |
- `informal_solution`: A step-by-step solution in natural language (including LaTeX).
|
73 |
-
- `header`: Code that should be executed before initializing the formal problem, e.g., `open`s. If `null`, `open BigOperators Real Nat Topology` should be used.
|
74 |
- `intros`: Independent variables $V$ and hypotheses $\Phi$. $V=\{v_i\}_{i=1}^n$ is the set of variables independent to the queriable $a$. $\Phi = \{\phi_i\}_{i=1}^p$ is the set of propositions that depend on $V$ (whose all free variables are included in $V$), consisting of conditions that can be used to deduce the answer.
|
75 |
- `outros`: Conclusions $\Psi = \{\psi_i\}_{i=1}^q$ is the set of propositions which depend on $V \cup \{a\}$, consisting of conclusions that should be satisfied.
|
76 |
- `formal_answer`: The ground-truth answer in formal language (Lean 4).
|
77 |
- `formal_answer_type`: The type of the ground-truth answer in formal language (Lean 4).
|
78 |
-
- `metainfo`: Meta-information of the problem.
|
79 |
|
80 |
## References
|
81 |
[1] Moura, Leonardo de, and Sebastian Ullrich. "The Lean 4 theorem prover and programming language." Automated Deduction–CADE 28: 28th International Conference on Automated Deduction, Virtual Event, July 12–15, 2021, Proceedings 28. Springer International Publishing, 2021.
|
|
|
70 |
- `informal_problem`: The problem in natural language (including LaTeX).
|
71 |
- `informal_answer`: The ground-truth answer in natural language (including LaTeX).
|
72 |
- `informal_solution`: A step-by-step solution in natural language (including LaTeX).
|
73 |
+
- `header`: Code that should be executed before initializing the formal problem, e.g., `open`s. If `null`, `open BigOperators Real Nat Topology` should be used. (Unified in `*_format_unified.jsonl`)
|
74 |
- `intros`: Independent variables $V$ and hypotheses $\Phi$. $V=\{v_i\}_{i=1}^n$ is the set of variables independent to the queriable $a$. $\Phi = \{\phi_i\}_{i=1}^p$ is the set of propositions that depend on $V$ (whose all free variables are included in $V$), consisting of conditions that can be used to deduce the answer.
|
75 |
- `outros`: Conclusions $\Psi = \{\psi_i\}_{i=1}^q$ is the set of propositions which depend on $V \cup \{a\}$, consisting of conclusions that should be satisfied.
|
76 |
- `formal_answer`: The ground-truth answer in formal language (Lean 4).
|
77 |
- `formal_answer_type`: The type of the ground-truth answer in formal language (Lean 4).
|
78 |
+
- `metainfo`: Meta-information of the problem. (Removed in `*_format_unified.jsonl`)
|
79 |
|
80 |
## References
|
81 |
[1] Moura, Leonardo de, and Sebastian Ullrich. "The Lean 4 theorem prover and programming language." Automated Deduction–CADE 28: 28th International Conference on Automated Deduction, Virtual Event, July 12–15, 2021, Proceedings 28. Springer International Publishing, 2021.
|