TPTP Games

• Finding problems
  • Generate a list of FOF problems in the TPTP that are theorems, real first-order, have some equality, are difficult, and have been found to be theorems by the EP prover.
  • Specialize that query to require that EP solved the problem in between 5 and 20 seconds (you'll need to change to advanced mode).

• Browsing the TPTP, solving a problem, viewing a derivation, verifying a derivation.
  • Browse the TPTP to the problem HAL002+1
  • "View Solutions" to that problem, and look at EP's proof
  • Go back to viewing the problem, and "Solve Problem" - that'll short-cut to the SystemOnTPTP interface with the problem name preinstalled in the "TPTP Problem" field.
  • Get a recommendation of which systems are best for this problem
  • Use SPASS to solve the problem, and get a TPTP format output.
  • Use EP to solve the problem, and view the derivation in IDV. Use the interestingness slider to generate a derivation synopsis. Try the good-bad cat button.
  • Cut-and-paste HAL002+1 into the "Input Formulae" box of the SystemOnTPTP interface, but delete the axioms (leaving just the include and the conjecture. Try prove it with whatever system you like - you won't succeed. Use Paradox to show that the problem is now CounterSatisfiable, i.e., not a logical consequence of the axioms (in the included axiom file).
  • Go back to looking at EP's proof, and "Process Solution" - that'll short-cut to the SystemOnTSTP interface with the problem and system names preinstalled into the "TPTP Problem" and "TSTP System" fields.
  • Verify the derivation using GDV. Shucks, seems that some steps are too hard for Otter - change the command line for GDV to GDV -p SPASS---3.01 %s - aaah, there you go.

• Preparing problems
  • Cut-and-paste HAL002+1 into the "Input Formulae" box of the SystemB4TPTP interface, and use tptp4X to check the syntax (of course it's OK). Go back, make some random syntax error, and try again.
  • Correct the problem and use the BNFParserDrill to get a feeling for the syntax, and see if you can browse through the online hyperlinked BNF to see which BNF rules are being used at each level.
  • Cut-and-paste HAL002+1 into the "Input Formulae" box of the SystemOnTPTP interface, and add the extra axiom

    fof(subtract_to_0,axiom,
        ( element(crazy,domain)
         & subtract(domain,crazy,crazy) != zero(domain) ) ).

    It'll be real easy to prove now - you'd better check that the axioms (included and explicit) are satisfiable. Delete the hypothesis and conjecture and use a model finder for that, and if it fails try show them unsatisfiable using a theorem prover.
  • Use FlotterOnTPTP to convert the formulae to clause normal form - are you impressed?
  • Use tptp2X to add the axioms of equality to the problem. Change the tptp2X command to tptp2X -q1 -d- -t add_equality %s to do this. How many axioms were added?
  • Use tptp2X to convert the problem to dfg syntax. Change the tptp2X command to tptp2X -q1 -d- -f dfg %s to do this.

• Small exercises
  • Do the exercise at the end of the notes "Using the TPTP World".
  • Do the "Osama Bin Laden" example from the notes.

Exam Style Questions