Module Libzipperposition.SClause
Simple Clause
type flagtype 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
}
Basics
val make : trail:Trail.t -> Logtk.Literal.t array -> tval equal : t -> t -> boolval compare : t -> t -> intval hash : t -> intval id : t -> intval lits : t -> Logtk.Literal.t arrayval trail : t -> Trail.tval is_empty : t -> boolval length : t -> intval update_trail : (Trail.t -> Trail.t) -> t -> tval to_s_form : ?allow_free_db:bool -> ?ctx:Logtk.Term.Conv.ctx -> t -> Logtk.TypedSTerm.Form.t
Flags
val flag_lemma : flagclause is a lemma
val flag_persistent : flagclause is a lemma
clause cannot be redundant
val flag_redundant : flagclause cannot be redundant
clause has been shown to be redundant
val flag_backward_simplified : flagclause has been shown to be redundant
clause has been backward simplified
val new_flag : unit -> flagget value of boolean flag
new flag that can be used on clauses
IO
val 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.printer
Proofs
val proof_tc : t Logtk.Proof.Result.tcval mk_proof_res : t -> Logtk.Proof.Result.tval adapt : Logtk.Proof.S.t -> t -> Logtk.Proof.S.t