(*
This file is part of the dpll(t) engine sammy
Copyright (C) 2004  The University of Iowa
George Hagen

This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License
as published by the Free Software Foundation; either version 2
of the License, or (at your option) any later version.

This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
*)

(** Main dpllt search procedure *)

(* this is determined starting from the call to satisfiable *)
exception Timeout
(* determined from program start *)
exception GlobalTimeout
exception DontKnow

val initial_bcp : unit -> unit

val satisfiable : Pqueue.pqueue -> Cstore.cstore -> Pred_db.pred_db -> 
                  Skolemizer.skolemizer -> Iset.iset -> bool
(** [satisfiable q cstore pred_db skolemizer ilits] determines if the current
clause set is satisfiable or not.  
[q] is the predicate priority queue, with clauses linked via the 
predicates' watched literals.
[cstore] is the theory interface.
[pred_db] is the predicate and term database.
[skolemizer] is the instantiation engine.
[ilits] are the literals generated from the call to Satbox.initialize_search()

[Dpllt.satisfiable] may raise [Dpllt.Timeout] if the
globally-defined timeout is exceeded.  Other behavioral modifiers are
contained in the [global.ml] parameters. *)

val update_clauses : Global.pred_id list -> unit
(** [update_clauses lit_id_list] dynamically adds a clause to the current set of clauses, where lit_id_list is the set of literals making up the clause.  The new clause set is then simplified through unit propagation (if appropriate).
*)
