split preparing clauses and writing problemfile;
included results of count_constants in return-type of prover;
optionally pass counted constants to prover;
removed unused external_prover from signature
header {* Main HOL *}
theory Main
imports Plain Quickcheck Map Recdef SAT
begin
text {*
Classical Higher-order Logic -- only ``Main'', excluding real and
complex numbers etc.
*}
text {* See further \cite{Nipkow-et-al:2002:tutorial} *}
end