Libzipperposition.SClausetype t = private {id : int;unique ID of the clause
*)lits : Logtk.Literal.t array;the literals
*)trail : Trail.t;boolean trail
*)mutable flags : flag;boolean flags for the clause
*)}val make : trail:Trail.t -> Logtk.Literal.t array -> tval hash : t -> intval id : t -> intval lits : t -> Logtk.Literal.t arrayval is_empty : t -> boolval length : t -> intval to_s_form :
?allow_free_db:bool ->
?ctx:Logtk.Term.Conv.ctx ->
t ->
Logtk.TypedSTerm.Form.tval flag_lemma : flagclause is a lemma
val flag_persistent : flagclause cannot be redundant
val flag_redundant : flagclause has been shown to be redundant
val flag_backward_simplified : flagclause has been backward simplified
val flag_poly_arg_cong_res : flagclause is the result of polymorphic ArgCong
val new_flag : unit -> flagnew flag that can be used on clauses
val mark_redundant : t -> unitval is_redundant : t -> boolval mark_backward_simplified : t -> unitval is_backward_simplified : t -> boolval pp_vars : t CCFormat.printerval pp : t CCFormat.printerval pp_zf : t CCFormat.printerval pp_tstp : t CCFormat.printerval pp_tstp_full : t CCFormat.printerPrint in a toplevel TPTP statement
val pp_trail : Trail.t CCFormat.printerval pp_trail_tstp : Trail.t CCFormat.printerval pp_in : Logtk.Output_format.t -> t CCFormat.printerval proof_tc : t -> t Logtk.Proof.Result.tcval mk_proof_res : t -> Logtk.Proof.Result.tval adapt : Logtk.Proof.S.t -> t -> Logtk.Proof.S.t