changelog | download | home | install | notes | performance
Metis (the first order prover) is pronounced "MET iss".
Metis began life in August 2001 as an intended replacement for the MESON_TAC proof tactic in HOL4. The first release of Metis in HOL (called METIS_TAC) occurred in July 2002 featuring a robust model elimination calculus. By November 2002 Metis also implemented the ordered paramodulation calculus, and shortly after gained some users in the form of HOL developers wishing to speed up their theory development.
September 2002 marked the appearance of the Metis standalone program, compiled to native code using the MLton compiler. This version of Metis is used for profiling the code and investigating performance on harder problems from the TPTP archive. This line of research led to an implementation of inherited term ordering constraints using the Omega procedure to check consistency.
As of August 2003, the latest release of Metis comprises around 13,000 non-comment lines of SML code.
Metis is developed by Joe Hurd to support his research in the CARD Group, Computing Laboratory, Oxford University, UK.