atp-0.1.0.0: Interface to automated theorem provers
Copyright(c) Evgenii Kotelnikov 2019-2021
LicenseGPL-3
Maintainerevgeny.kotelnikov@gmail.com
Stabilityexperimental
Safe HaskellNone
LanguageHaskell2010

ATP.Prove

Description

Interface to automated theorem provers.

Synopsis

Documentation

data ProvingOptions Source #

The options that describe what theorem prover to use for a problem and how to run it.

Constructors

ProvingOptions 

Fields

defaultOptions :: ProvingOptions Source #

The default options used by refute and prove.

>>> defaultOptions
ProvingOptions {prover = Prover {vendor = E, executable = "eprover"}, timeLimit = 300, memoryLimit = 2000, debug = False}

refute :: Clauses -> IO (Partial Solution) Source #

Attempt to refute a set of clauses using defaultProver.

refute = refuteWith defaultOptions

refuteUsing :: Prover -> Clauses -> IO (Partial Solution) Source #

Attempt to refute a set of clauses using a given prover.

refuteWith :: ProvingOptions -> Clauses -> IO (Partial Solution) Source #

Attempt to refute a set of clauses with a given set of options.

prove :: Theorem -> IO (Partial Solution) Source #

Attempt to prove a theorem using defaultProver.

prove = proveWith defaultOptions

proveUsing :: Prover -> Theorem -> IO (Partial Solution) Source #

Attempt to prove a theorem using a given prover.

proveWith :: ProvingOptions -> Theorem -> IO (Partial Solution) Source #

Attempt to prove a theorem with a given set of options.