This is the package containing the raw evaluation data for the paper "SAT-Inspired Higher-Order Eliminations" by Jasmin Blanchette and Petar Vukmirović. The problems used for the evaluation are located in the "problems" directory. The five categories are tptp_th0 (called T0 in Fig. 1 of the paper), tptp_th1 (called T1 in Fig. 1), seventeen_th0 (called S0 in Fig. 1) seventeen_th1 (called S1 in Fig. 1) tptp_cnffof (called F in Fig. 1) The empirical results are located in the "results" directory, under the following names, corresponding to the category names above: tptp_th0_results.csv tptp_th1_results.csv seventeen_th0_results.csv seventeen_th1_results.csv tptp_cnffof_results.csv The CSV files were...
In the last decades, proof assistants have been immeasurably useful in formally proving validity of ...
Optimized SAT solvers not only preprocess the clause set, they also transform it during solving as i...
We developed a procedure to enumerate complete sets of higher-order unifiers based on work by Jensen...
This is the package containing the raw evaluation data for the paper "SAT-Inspired Higher-Order Elim...
This archive contains the problems, raw evaluation results and scripts for running the experiments d...
This archive contains the raw evaluation results and scripts associated with the experiments describ...
We provide the following supplementary material for our article. Zipperposition Compilation instru...
This archive contains used benchmarks, raw results, scripts to create tables from the paper, and the...
We provide the following supplementary material for our paper. The longer version of our paper can b...
The Thousands of Problems for Theorem Provers (TPTP) problem library is the basis of a well known an...
This page contains supplementary material for the article The Embedding Path Order for Lambda-Free H...
This package contains problems used for evaluation, and the raw evaluation data, and the scripts nec...
One of the main success stories of automatic theorem provers has been their integration into proof a...
International audienceWe have extended the TLA+ proof system TLAPS with a new backend to improve the...
In the last decades, proof assistants have been immeasurably useful in formally proving validity of ...
Optimized SAT solvers not only preprocess the clause set, they also transform it during solving as i...
We developed a procedure to enumerate complete sets of higher-order unifiers based on work by Jensen...
This is the package containing the raw evaluation data for the paper "SAT-Inspired Higher-Order Elim...
This archive contains the problems, raw evaluation results and scripts for running the experiments d...
This archive contains the raw evaluation results and scripts associated with the experiments describ...
We provide the following supplementary material for our article. Zipperposition Compilation instru...
This archive contains used benchmarks, raw results, scripts to create tables from the paper, and the...
We provide the following supplementary material for our paper. The longer version of our paper can b...
The Thousands of Problems for Theorem Provers (TPTP) problem library is the basis of a well known an...
This page contains supplementary material for the article The Embedding Path Order for Lambda-Free H...
This package contains problems used for evaluation, and the raw evaluation data, and the scripts nec...
One of the main success stories of automatic theorem provers has been their integration into proof a...
International audienceWe have extended the TLA+ proof system TLAPS with a new backend to improve the...
In the last decades, proof assistants have been immeasurably useful in formally proving validity of ...
Optimized SAT solvers not only preprocess the clause set, they also transform it during solving as i...
We developed a procedure to enumerate complete sets of higher-order unifiers based on work by Jensen...