Integration of Automated and Interactive Theorem Proving in ILP

Ilf is a convenient interface between the non-expert user of ATP's and most of the available high performance ATP's. The typed first order input language and the transformation algorithms for coding types into clausal logic, which are integrated into Ilf, make ATP's almost transparent to the user. One only has to learn one language to use many provers. The natural language proof presentation unit closes the gap between the (illegible) machine output of ATP's and the desire of the user to understand machine generated proofs. It is planned to upgrade all integrated ATP's as well as to integrate new high performance provers.