We give techniques for extracting proofs from the
Clausal Normal Form transformation. We discuss and solve three
technical problems:
{\bf (1)}. How to handle the introduction of definitions and Skolem functions.
{\bf (2)}. How to generate short (linear size) proofs.
{\bf (3)}. How to handle optimized Skolemization. We reduce it
to standard Skolemization.