--- annotations_creators: - machine-generated language: - en language_creators: - expert-generated - machine-generated - other license: apache-2.0 multilinguality: - monolingual pretty_name: Premise Selection in Isabelle size_categories: - 1M 0"\n shows "congruence M (congruence (mat_inv M) H) = H"' 'state': 'proof (prove)\nusing this:\n mat_det M \\ 0\n congruence M (congruence (mat_inv M) H) =\n congruence (mat_inv M *\\<^sub>m\\<^sub>m M) H\n\ngoal (1 subgoal):\n 1. congruence M (congruence (mat_inv M) H) = H' 'step': 'by (metis mat_inv_1 mat_inv_def)' 'premise_name': 'mat_inv_l' 'premise_statement': ' mat_inv_l: fixes A :: "complex \\ complex \\ complex \\ complex" assumes "mat_det A \\ 0" shows "mat_inv A *\\<^sub>m\\<^sub>m A = eye"' } ``` ### Data Fields - statement: Description of the original statement of the problem, together with assumptions (if any) - state: The *poof state* describing the current goals of the proof; it may also contain type information of the objects referenced in the *statement* field - step: The *proof step*, which is a command that advances the proof. It may introduce definitions or conjectures, or solve the current conjecture. **Note** that including this field as part of the proof state representation results in a data leak, since premise names are always included in the step. This field should not be used for training premise selection models; read more [here](https://github.com/Simontwice/MagnusData). - premise_name: The name of the ground-truth premise as it would appear in the proof library - premise_statement: The statement of the ground-truth premise **Note** that this is **not the only possible format** (fields, number of premise per statement) for this dataset; the scripts used to generate this and other datasets (for e.g. *proof step generation*) are available on [github](https://github.com/Simontwice/MagnusData). ### Data Splits We make the data available in a single file, but any train/val/test splitting is possible. ### Curation Rationale This dataset was created to facilitate the training of models for premise selection in Isabelle and potentially other Interactive Theorem Provers ([Lean](https://leanprover.github.io/), [Coq](https://github.com/coq/coq) etc.). There were no existing datasets for Isabelle that used raw text format; prior existing datasets used a translation scheme to selected logics, making the engineering during inference much more involved. ### Source Data The dataset was created using the proofs included in the [Archive of Formal Proofs](https://www.isa-afp.org/) and the Standard library included in the [Isabelle](https://isabelle.in.tum.de/) 2021-1 distribution. ### Known Limitations The data included in this dataset is mostly untyped, meaning that there is little information about the objects referenced in the statement or premise statements. Adding type information would be a valuable contribution. ### Licensing Information This dataset is made available under the Apache License, Version 2.0. This license allows you to use, copy, and modify the dataset, as long as you comply with the terms and conditions of the license. You may also distribute the dataset, either in its original form or as a modified work, provided that you include the license terms with any distribution. There is no warranty for this dataset, and it is provided "as is". If you have any questions or concerns about the licensing or use of the dataset, please open an issue. ### Citation If you use this dataset in your research, please cite the associated arXiv paper: [Magnushammer: A Transformer-based Approach to Premise Selection](https://arxiv.org/abs/2303.04488) ### Acknowledgements We would like to express our gratitude to the following individuals and organizations for their contributions to this project: * We would like to acknowledge [@jinpz](https://github.com/jinpz) for their contributions to the data mining aspect of this project. Their expertise and hard work greatly assisted us in achieving our project goals. * PISA API: We also want to thank the developers of the [PISA](https://github.com/albertqjiang/Portal-to-ISAbelle) API for creating a powerful tool that allowed us to interact with Isabelle through Python. * Google TRC Compute: Finally, we want to acknowledge Google's [TPU Reasearch Cloud](https://sites.research.google/trc/about/) for providing compute necessary to develop the code infrastructure needed for the mining procedure. We are grateful for the support and contributions of each of these individuals and organizations, and we would not have been able to accomplish this project without them.