Implementing an ATP System

This simple Prolog implementation of the ANL loop with full resolution for clauses forms a very weak and broken ATP system. Missing features include:

Proof output (do you trust a system that just says "yes"?)
Refinement (gotta make it more powerful)
Doing subsumption on-the-fly (wot's this batch processing?)

Take this simple implementation, and implement the missing features. You should aim to produce an ATP system that can solve (and output proofs for) as many of the TPTP problems listed below as possible, in a 180 second time limit per problem.

   Easy
GEO079-1
PUZ001-1
PUZ011-1
MSC006-1
SYN006-1
   Harder
FLD001-3
GRP039-6
HWV006-1
PLA007-1
PUZ035-4
   Equality
CAT004-4
GEO007-3
GRP012-3
SET839-2
SYN014-1
   Satisfiable
KRS005-1
NLP043-1
SET777-1
SWV010-1
SYN059-1

You must email the source code of your program to me by 26th November. Your submission will be graded according to the following:

No refutations for satisfiable sets - 0%, but prerequisite for any marks for finding solutions
Solution of Easy problems with Proof output - 5%
Solution of Harder problems with Proof output - 5%
Solution of Equality problems with Proof output - 4% (you can add axioms of equality, if you want)
Subsumption on-the-fly - 3%
Quality of Prolog code - 3%

It is worth 20% of the subject's assessment. Please review the policies on assessment in the administration document.