{"url":"/dataset/holist","name":"HOList","full_name":"HOList","description_markdown":"The official **HOList** benchmark for automated theorem proving consists of all theorem statements in the core, complex, and flyspeck corpora. The goal of the benchmark is to prove as many theorems as possible in the HOList environment in the order they appear in the database. That is, only theorems that occur before the current theorem are supposed to be used as premises (lemmata) in its proof.\r\n\r\nSource: [HoList](https://sites.google.com/view/holist/home)\r\nImage Source: [https://sites.google.com/view/holist/home](https://sites.google.com/view/holist/home)","description_withheld":null,"homepage":"https://sites.google.com/view/holist/home","introduced_date":null,"introduced_date_note":null,"introduced_by":{"paper":"/paper/holist-an-environment-for-machine-learning-of","title":"HOList: An Environment for Machine Learning of Higher-Order Theorem Proving","first_author":"Kshitij Bansal","url":null},"license":{"name":"Unknown","url":null},"modalities":[{"name":"Texts","url":"/datasets/modality/texts"}],"tasks":[{"name":"Automated Theorem Proving","url":"/task/automated-theorem-proving","datasets_with_task":"/datasets/task/automated-theorem-proving"}],"languages":[],"variants":["HOList benchmark","HOList"],"data_loaders":[],"num_papers_in_archive":8,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/automated-theorem-proving-on-holist-benchmark","task":"Automated Theorem Proving","dataset_variant":"HOList benchmark","rows":4,"metrics":["Percentage correct"],"first_row_in_archive_order":{"model":"4-hop GNN, sub-expression sharing","paper":"/paper/graph-representations-for-higher-order-logic","metrics":{"Percentage correct":"49.95"},"code_links":[]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers_with_a_benchmark_row":[{"paper":"/paper/learning-to-reason-in-large-theories-without","title":"Learning to Reason in Large Theories without Imitation","date":"2019-05-25","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/graph-representations-for-higher-order-logic","title":"Graph Representations for Higher-Order Logic and Theorem Proving","date":"2019-05-24","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/holist-an-environment-for-machine-learning-of","title":"HOList: An Environment for Machine Learning of Higher-Order Theorem Proving","date":"2019-04-05","rows_on_this_dataset":2,"code_links":3,"syntology":null}],"syntology_totals":{"read_at":"2026-09-24T18:15:14+00:00","papers_with_samples":0,"samples_harvested":0,"samples_ran":0,"samples_unverified":0,"pointer_only_for_licence":0,"papers_with_no_sample_that_ran":0,"note":"the per-paper counts above, summed; not a rate"},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks."}