sig
module Ctx : Ctx.S
type t
type clause = Clause_intf.S.t
type flag = SClause.flag
val set_flag : Clause_intf.S.flag -> Clause_intf.S.t -> bool -> unit
val get_flag : Clause_intf.S.flag -> Clause_intf.S.t -> bool
val mark_redundant : Clause_intf.S.t -> unit
val is_redundant : Clause_intf.S.t -> bool
val mark_backward_simplified : Clause_intf.S.t -> unit
val is_backward_simplified : Clause_intf.S.t -> bool
val equal : t -> t -> bool
val hash : t -> int
val compare : Clause_intf.S.t -> Clause_intf.S.t -> int
val id : Clause_intf.S.t -> int
val lits : Clause_intf.S.t -> Logtk.Literal.t array
val is_ground : Clause_intf.S.t -> bool
val weight : Clause_intf.S.t -> int
module Tbl :
sig
type key = t
type 'a t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Hashtbl.statistics
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.sequence
val values : 'a t -> 'a CCHashtbl.sequence
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_seq : 'a t -> (key * 'a) CCHashtbl.sequence
val of_seq : (key * 'a) CCHashtbl.sequence -> 'a t
val add_seq : 'a t -> (key * 'a) CCHashtbl.sequence -> unit
val add_seq_count : int t -> key CCHashtbl.sequence -> unit
val of_seq_count : key CCHashtbl.sequence -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val print :
key CCHashtbl.printer ->
'a CCHashtbl.printer -> 'a t CCHashtbl.printer
end
val is_goal : Clause_intf.S.t -> bool
val distance_to_goal : Clause_intf.S.t -> int option
val comes_from_goal : Clause_intf.S.t -> bool
val pp_trail : Trail.t CCFormat.printer
val has_trail : Clause_intf.S.t -> bool
val trail : Clause_intf.S.t -> Trail.t
val trail_l : Clause_intf.S.t list -> Trail.t
val update_trail :
(Trail.t -> Trail.t) -> Clause_intf.S.t -> Clause_intf.S.t
val trail_subsumes : Clause_intf.S.t -> Clause_intf.S.t -> bool
val is_active : Clause_intf.S.t -> v:Trail.valuation -> bool
val create :
penalty:int ->
trail:Trail.t ->
Logtk.Literal.t list -> Clause_intf.proof_step -> Clause_intf.S.t
val create_a :
penalty:int ->
trail:Trail.t ->
Logtk.Literal.t array -> Clause_intf.proof_step -> Clause_intf.S.t
val of_sclause :
?penalty:int -> SClause.t -> Clause_intf.proof_step -> Clause_intf.S.t
val of_forms :
?penalty:int ->
trail:Trail.t ->
Logtk.Term.t Logtk.SLiteral.t list ->
Clause_intf.proof_step -> Clause_intf.S.t
val of_forms_axiom :
?penalty:int ->
file:string ->
name:string -> Logtk.Term.t Logtk.SLiteral.t list -> Clause_intf.S.t
val of_statement : Logtk.Statement.clause_t -> Clause_intf.S.t list
val proof_step : Clause_intf.S.t -> Clause_intf.proof_step
val proof : Clause_intf.S.t -> Clause_intf.proof
val proof_parent : Clause_intf.S.t -> Logtk.Proof.Parent.t
val proof_parent_subst :
Logtk.Subst.Renaming.t ->
Clause_intf.S.t Logtk.Scoped.t -> Logtk.Subst.t -> Logtk.Proof.Parent.t
val update_proof :
Clause_intf.S.t ->
(Clause_intf.proof_step -> Clause_intf.proof_step) -> Clause_intf.S.t
val is_empty : Clause_intf.S.t -> bool
val length : Clause_intf.S.t -> int
val maxlits : Clause_intf.S.t Logtk.Scoped.t -> Logtk.Subst.t -> CCBV.t
val is_maxlit :
Clause_intf.S.t Logtk.Scoped.t -> Logtk.Subst.t -> idx:int -> bool
val eligible_res :
Clause_intf.S.t Logtk.Scoped.t -> Logtk.Subst.t -> CCBV.t
val eligible_res_no_subst : Clause_intf.S.t -> CCBV.t
val eligible_param :
Clause_intf.S.t Logtk.Scoped.t -> Logtk.Subst.t -> CCBV.t
val is_eligible_param :
Clause_intf.S.t Logtk.Scoped.t -> Logtk.Subst.t -> idx:int -> bool
val has_selected_lits : Clause_intf.S.t -> bool
val is_selected : Clause_intf.S.t -> int -> bool
val selected_lits : Clause_intf.S.t -> (Logtk.Literal.t * int) list
val penalty : Clause_intf.S.t -> int
val is_unit_clause : Clause_intf.S.t -> bool
val is_oriented_rule : Clause_intf.S.t -> bool
val symbols :
?init:Logtk.ID.Set.t -> Clause_intf.S.t Sequence.t -> Logtk.ID.Set.t
val to_sclause : Clause_intf.S.t -> SClause.t
val to_forms : Clause_intf.S.t -> Logtk.Term.t Logtk.SLiteral.t list
val to_s_form : Clause_intf.S.t -> Logtk.TypedSTerm.Form.t
module Seq :
sig
val lits : Clause_intf.S.t -> Logtk.Literal.t Sequence.t
val terms : Clause_intf.S.t -> Logtk.Term.t Sequence.t
val vars : Clause_intf.S.t -> Logtk.Type.t Logtk.HVar.t Sequence.t
end
module Eligible :
sig
type t = int -> Logtk.Literal.t -> bool
val res : Clause_intf.S.clause -> Clause_intf.S.Eligible.t
val param : Clause_intf.S.clause -> Clause_intf.S.Eligible.t
val eq : Clause_intf.S.Eligible.t
val arith : Clause_intf.S.Eligible.t
val filter : (Logtk.Literal.t -> bool) -> Clause_intf.S.Eligible.t
val max : Clause_intf.S.clause -> Clause_intf.S.Eligible.t
val pos : Clause_intf.S.Eligible.t
val neg : Clause_intf.S.Eligible.t
val always : Clause_intf.S.Eligible.t
val combine : Clause_intf.S.Eligible.t list -> Clause_intf.S.Eligible.t
val ( ** ) :
Clause_intf.S.Eligible.t ->
Clause_intf.S.Eligible.t -> Clause_intf.S.Eligible.t
val ( ++ ) :
Clause_intf.S.Eligible.t ->
Clause_intf.S.Eligible.t -> Clause_intf.S.Eligible.t
val ( ~~ ) : Clause_intf.S.Eligible.t -> Clause_intf.S.Eligible.t
end
module ClauseSet :
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 map : (elt -> elt) -> t -> t
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
end
module Pos :
sig val at : Clause_intf.S.t -> Logtk.Position.t -> Logtk.Term.t end
module WithPos :
sig
type t = {
clause : Clause_intf.S.clause;
pos : Logtk.Position.t;
term : Logtk.Term.t;
}
val compare : Clause_intf.S.WithPos.t -> Clause_intf.S.WithPos.t -> int
val pp : Clause_intf.S.WithPos.t CCFormat.printer
end
val pp : Clause_intf.S.t CCFormat.printer
val pp_tstp : Clause_intf.S.t CCFormat.printer
val pp_tstp_full : Clause_intf.S.t CCFormat.printer
val to_string : Clause_intf.S.t -> string
val pp_set : Clause_intf.S.ClauseSet.t CCFormat.printer
val pp_set_tstp : Clause_intf.S.ClauseSet.t CCFormat.printer
end