sig
type term = Libzipperposition.FOTerm.t
type subst = Libzipperposition.Substs.t
type t = private {
lits : Literals.t;
var : Libzipperposition.FOTerm.var;
mutable hash : int;
}
val compare : ClauseContext.t -> ClauseContext.t -> int
val equal : ClauseContext.t -> ClauseContext.t -> bool
val hash : ClauseContext.t -> int
val hash_fun : ClauseContext.t CCHash.hash_fun
val make :
Literals.t -> var:Libzipperposition.FOTerm.var -> ClauseContext.t
val extract : Literals.t -> ClauseContext.term -> ClauseContext.t option
val extract_exn : Literals.t -> ClauseContext.term -> ClauseContext.t
val apply : ClauseContext.t -> ClauseContext.term -> Literals.t
val apply_same_scope : ClauseContext.t -> ClauseContext.term -> Literals.t
val raw_lits : ClauseContext.t -> Literals.t
val pp : ClauseContext.t CCFormat.printer
module Set :
sig
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val max_elt : t -> elt
val choose : t -> elt
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val of_seq : elt CCSet.sequence -> t
val add_seq : t -> elt CCSet.sequence -> t
val to_seq : t -> elt CCSet.sequence
val of_list : elt list -> t
val add_list : t -> elt list -> t
val to_list : t -> elt list
val pp :
?start:string ->
?stop:string -> ?sep:string -> elt CCSet.printer -> t CCSet.printer
val print :
?start:string ->
?stop:string ->
?sep:string -> elt CCSet.formatter -> t CCSet.formatter
end
end