Generators for Large LF Proofs
Aaron Stump
astump@acm.org

The eq/ and qbf/ directories contain generators for large LF proofs.

1. The proofs are in Twelf format.  

2. The proofs can be generated either in explicit form (no omitted
   arguments) or implicit form (some arguments omitted which can be
   reconstructed during LF type checking).

3. To compile the generator, just run "make" in that directory.

4. eq/ is an artifical class of equality proofs.  You need a C compiler
   to compile the generator.  Running make will also run the generator
   to generate some instances.

5. qbf/ is a class of proofs produced by a very naive QBF solver. The
   solver accepts QBF benchmarks in DIMACS format.  The directory includes
   some rather easy benchmarks I pulled off www.qbflib.org.  You need 
   a Haskell compiler to compile the generator (I used ghc version 
   6.something).

6. The directories include some instances already generated.

7. The scripts run_twelf* in the directories will use a script in this
   directory called twelf.sh to invoke Twelf to run the benchmarks.

8. The generators also generate proofs in the format of a fast LF
   checker I and co-authors implemented a few years back, described
   in our LFMTP 2007 paper "A Signature Compiler for the Edinburgh LF".

9. If you are interested in fast proof checking, my group has been
   developing a very fast checker for an extension of LF called LFSC,
   "LF with Side Conditions".  See our (currently) draft paper "Fast
   and Flexible Proof Checking for SMT".

10. Feel free to contact me with any questions and I will try to help
    get you running with these benchmarks.