Some more doc + indentation

TODO.md

@@ -7,7 +7,6 @@
     * Allow theory propagation
 - Cleanup code
     * Simplify Solver.Make functor
-    * Clean Solver_types interface
 - Add proof output for smt/theories
     * Each theory brings its own proof output (tautologies), somehow
 - Allow to plug one's code into boolean propagation

sat/res.mli

@@ -8,3 +8,4 @@ module type S = Res_intf.S
 
 module Make : functor (St : Solver_types.S)(Proof : sig type proof end)
   -> S with type atom= St.atom and type clause = St.clause and type lemma = Proof.proof
+(** Functor to create a module building proofs from a sat-solver unsat trace. *)

sat/res_intf.ml

@@ -1,10 +1,12 @@
 (* Copyright 2014 Guillaume Bury *)
 
 module type S = sig
+  (** Sinature for a module handling proof by resolution from sat solving traces *)
 
   type atom
   type clause
   type lemma
+  (** Abstract types for atoms, clauses and theoriy-specific lemmas *)
 
   val is_proven : clause -> bool
   (** Returns [true] if the clause has a derivation in the current proof graph, and [false] otherwise. *)

util/sat_solve.ml

@@ -155,7 +155,7 @@ let argspec = Arg.align [
     "-time", Arg.String (int_arg time_limit),
     "<t>[smhd] Sets the time limit for the sat solver";
     "-u", Arg.Set p_unsat_core,
-    " Prints the unsat-core explanation of the unsat proof";
+    " Prints the unsat-core explanation of the unsat proof (if used with -check)";
     "-v", Arg.Int (fun i -> Log.set_debug i),
     "<lvl> Sets the debug verbose level";
   ]