package logtk

You can search for identifiers within the package.

in-package search v0.2.0

Core types and algorithms for logic

Install

Dune Dependency

github.com Readme Changelog Edit opam file Versions (4)

Authors

Maintainers

S

simon.cruanes.2.17@m4x.org

Sources

2.1.tar.gz

md5=e72de75e9f0f87da9e6e8c0a4d4c89f9

sha512=81becfc9badd686ab3692cd9312172aa4c4e3581b110e81770bb01e0ffbc1eb8495d0dd6d43b98f3d06e6b8c8a338174c13ebafb4e9849a3ddf89f9a3a72c287

doc/logtk.parsers/Logtk_parsers/Trace_tstp/index.html

Module `Logtk_parsers.Trace_tstp`

Trace of a TSTP prover

type id = Ast_tptp.name

type term = Logtk.STerm.t

type form = Logtk.STerm.t

type clause = term Logtk.SLiteral.t list

type t =

| Axiom of string * string
| Theory of string
| InferForm of form * step lazy_t
| InferClause of clause * step lazy_t

and step = {

id : id;
rule : string;
parents : t array;
esa : bool;
(*
Equisatisfiable step?
*)

}

val equal : t -> t -> bool

val compare : t -> t -> int

val mk_f_axiom : id:id -> form -> file:string -> name:string -> t

val mk_c_axiom : id:id -> clause -> file:string -> name:string -> t

val mk_f_step : ?esa:bool -> id:id -> form -> rule:string -> t list -> t

val mk_c_step : ?esa:bool -> id:id -> clause -> rule:string -> t list -> t

val is_axiom : t -> bool

val is_theory : t -> bool

val is_step : t -> bool

val is_proof_of_false : t -> bool

val get_id : t -> id

Obtain the ID of the proof step.

raises Invalid_argument
if the step is Axiom or Theory

val force : t -> unit

Force the lazy proof step, if any

Proof traversal

module StepTbl : Hashtbl.S with type key = t

type proof_set = unit StepTbl.t

val is_dag : t -> bool

Is the proof a proper DAG?

val traverse : ?traversed:proof_set -> t -> (t -> unit) -> unit

Traverse the proof. Each proof node is traversed only once, using the set to recognize already traversed proofs.

val to_iter : t -> t Iter.t

Traversal of parent proofs

val depth : t -> int

Max depth of the proof

val size : t -> int

Number of nodes in the proof

IO

type 'a or_error = ('a, string) CCResult.t

val of_decls : form Ast_tptp.t Iter.t -> t or_error

Try to extract a proof from a list of TSTP statements.

val parse : ?recursive:bool -> string -> t or_error

Try to parse a proof from a file.

Debug printing, non recursive

include Logtk.Interfaces.PRINT with type t := t

val pp : t CCFormat.printer

val to_string : t -> string

val pp1 : t CCFormat.printer

Print proof step, and its parents

val pp_tstp : t CCFormat.printer

print the whole proofs

On This Page

Trace of a TSTP prover
1. Proof traversal
2. IO