Dataset Open Access

Superposition for Lambda-Free Higher-Order Logic — Supplementary Material

Bentkamp, Alexander; Blanchette, Jasmin; Cruanes, Simon; Waldmann, Uwe

Dublin Core Export

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="" xmlns:oai_dc="" xmlns:xsi="" xsi:schemaLocation="">
  <dc:creator>Bentkamp, Alexander</dc:creator>
  <dc:creator>Blanchette, Jasmin</dc:creator>
  <dc:creator>Cruanes, Simon</dc:creator>
  <dc:creator>Waldmann, Uwe</dc:creator>
  <dc:description>We provide the following supplementary material for our paper. The longer version of our paper can be found here: report.

Compiling Zipperposition

Compilation instructions for Zipperposition, in particular instructions for compilation for StarExec, can also be found in the Zipperposition readme.

In general, follow the following steps:

	Install OPAM
	Zipperposition requires OCaml &gt;= 4.03.0, e.g. use
	opam switch 4.05.0+flambda
eval `opam config env`
	You might have to install gmplib on your system, e.g.
	sudo apt-get install libgmp3-dev
	Zipperposition requires the following dependencies.
	opam install zarith containers sequence oasis msat menhir jbuilder
	Clone Zipperposition and compile it (we used commit 7fe2ebeb0500e350fd0f1dd4c4ad402ba9cf99b6):
	git clone --branch dev
cd zipperposition
make build
	This will create the binary zipperposition.native.
	Compile the applicative encoder if needed:
	jbuilder build ./src/tools/app_encode.exe
	This will create the binary ./_build/default/src/tools/app_encode.exe.


We used the following first-order (TFF) and the higher-order (THF) TPTP (v7.0.0) problems for the evaluation:
TFF problem list 
THF problem list 

The selection criteria for the problems are described in our paper. We used these scripts to create these problems lists and to generate an XML file to link these problems into a seperate space in Starexec:  Problem selection &amp; StarExec XML generation scripts 

Run scripts

We used the following run scripts on starexec. This archive also contains the Zipperposition binary and the applicative encoder binary, compiled for Starexec:  StarExec run scripts 

The scripts use the following command-line options for Zipperposition:

	First-order mode:
	./zipperposition.native -i tptp -o tptp --no-ho --no-avatar --no-induction --no-unif-pattern --simultaneous-sup false --no-max-vars --no-fool
	Intensional purifying calculus:
	./zipperposition.native -i tptp -o tptp --no-avatar --ho --force-ho --no-ho-elim-pred-var --ho-general-ext-pos --no-ho-unif --no-induction --no-unif-pattern --simultaneous-sup false --ho-purify int --ho-no-ext-pos --ho-no-ext-neg --ho-prim-enum none --no-max-vars --dont-select-ho-var-lits --no-fool
	Intensional nonpurifying calculus:
	./zipperposition.native -i tptp -o tptp --no-avatar --ho --force-ho --no-ho-elim-pred-var --ho-general-ext-pos --no-ho-unif --no-induction --no-unif-pattern --simultaneous-sup false --sup-at-vars --ho-no-ext-pos --ho-no-ext-neg --ho-prim-enum none --no-max-vars --dont-select-ho-var-lits --no-fool
	Extensional purifying calculus:
	./zipperposition.native -i tptp -o tptp --no-avatar --ho --force-ho --no-ho-elim-pred-var --ho-general-ext-pos --no-ho-unif --no-induction --no-unif-pattern --simultaneous-sup false --ho-purify ext --ho-ext-axiom --restrict-hidden-sup-at-vars --ho-prim-enum none --no-max-vars --dont-select-ho-var-lits --no-fool
	Extensional nonpurifying calculus:
	./zipperposition.native -i tptp -o tptp --no-avatar --ho --force-ho --no-ho-elim-pred-var --ho-general-ext-pos --no-ho-unif --no-induction --no-unif-pattern --simultaneous-sup false --sup-at-vars --restrict-hidden-sup-at-vars --ho-ext-axiom --ho-prim-enum none --no-max-vars --dont-select-ho-var-lits --no-fool

Additionally, we provided the problem's filename as the first argument, the order (--ord rpo6 or --ord kbo), the timeout (--timeout 600) and the memory limit (--mem-limit 128000). We used --timeout 600 and Starexec's Wallclock timeout was set to 600s, but Starexec's CPU timeout was set to 300s. So effectively we allowed only 300s of calculation time.

For the applicative encoder app_encode.exe, we provide the problem's filename as the first argument. The option -o tptp should be used to ensure that the output is also in TPTP format. To add the extensionality axiom to the applicative encoding, we use --app-encode-extensional.


Download the raw output of the evaluation and the .csv files created by StarExec here:  Evaluation output 

We used our own scripts to statistically analyse the results instead of using StarExec's statistics:  Evaluation scripts. Set the location of the xml-file and the output files produced by StarExec in and run to obtain the statistics displayed in the paper.


We tested the examples given in our paper in Zipperposition. Here are the problem files we used. Some are in TPTP format (.p) and some are in Zipperposition format (.zf).

	Example "Justification for the weaker variable condition in the intensional variant" 
	Example "Justification PosExt" (only in report) 
	Example "Justification for purification and SUP inferences at variables" (only in report) 
	Example "Addition of Peano numbers" 
	Example "Addition of Peano numbers" (applicative encoding) 
  <dc:title>Superposition for Lambda-Free Higher-Order Logic — Supplementary Material</dc:title>
All versions This version
Views 102102
Downloads 8888
Data volume 138.7 MB138.7 MB
Unique views 8181
Unique downloads 4242


Cite as