ATP System Features

• What kinds of problems can it attempt?
  • FOF or CNF
  • With or without equality
  • CNF general, unit equality, range restricted
  • Capacity

• What can it determine? What is it good at determining?
  • Logical consequence
  • Non-logical consequence
  • Satisfiability
  • Unsatisfiability

• Completeness (assuming soundness, and within theoretical limits)
  • Theoretical
  • Practical (grey area :-)

• What does it output?
  • Assurance of what it determines
  • Proof
    • Natural deduction
    • (CNF) Refutation
    • Tableau
  • Models
    • Finite models
    • Herbrand models
    • Infinite models
  • Saturation

• What input language does it use? (assuming FOL)
  • TPTP
  • Proprietary
  • Any requirement for equality axioms

• What output language does it use? (assuming FOL)
  • TPTP
  • Proprietary

• What CPU time can it usefully use?
  • Short (< 10s)
  • Medium (< 600s)
  • Long (> 600s)

• Hardware and software requirements
  • What hardware is supported?
  • What OSs are supported?
  • What software is required?

• Installation and execution
  • How easy is it to get?
  • How easy is it to install?
  • How easy is it to run?
  • How configurable is it?

• Support
  • How much useful documentation is available?
  • How mature is the system?
  • What's the development status (still being developed? stagnant? industrial use?)
  • Who are the developers? For whom and where do they work?
  • How much support do the developers provide?

Exam Style Questions