Index index by Group index by Distribution index by Vendor index by creation date index by Name Mirrors Help

The search service can find package by either name (apache), provides(webserver), absolute file names (/usr/bin/apache), binaries (gprof) or shared libraries (libXm.so.2) in standard path. It does not support multiple arguments yet...

The System and Arch are optional added filters, for example System could be "redhat", "redhat-7.2", "mandrake" or "gnome", Arch could be "i386" or "src", etc. depending on your system.

System Arch

RPM resource eqp

EQP is an automated theorem proving program for first-order equational logic. Its strengths are good implementations of associative-commutative unification and matching, a variety of strategies for equational reasoning, and fast search. It seems to perform well on many problems about lattice-like structures. EQP is not a stable and polished production theorem prover like Otter or Prover9. Since it has obtained several interesting results, it was decided to make it available (including the source code) to everyone, with no restrictions (and of course no warranty either). EQP's documentation is not great, but if you already know Otter, you probably will not have great difficulty in learning to use EQP. In the early 1930's, it was postulated that every Robbin's Algebra, (named after Herbert Ellis Robbins), must also be a Boolean Algebra. Many human mathematicians attempted to find a proof, or a counter-example of this conjecture, but failed. The EQP automated theorem prover (and its author William McCune) made history by providing the first known proof in 1996. The EQP input files for proving Robbin's Conjecture can be found in the package documentation directory /usr/share/doc/eqp-09e/examples/robbins/

Found 1 sites for eqp

Found 8 RPM for eqp

PackageSummaryDistributionDownload
eqp-09e-20.fc38.aarch64.htmlAutomated theorem prover for first-order equational logicFedora 38 for aarch64eqp-09e-20.fc38.aarch64.rpm
eqp-09e-20.fc38.ppc64le.htmlAutomated theorem prover for first-order equational logicFedora 38 for ppc64leeqp-09e-20.fc38.ppc64le.rpm
eqp-09e-20.fc38.s390x.htmlAutomated theorem prover for first-order equational logicFedora 38 for s390xeqp-09e-20.fc38.s390x.rpm
eqp-09e-20.fc38.x86_64.htmlAutomated theorem prover for first-order equational logicFedora 38 for x86_64eqp-09e-20.fc38.x86_64.rpm
eqp-09e-19.fc37.aarch64.htmlAutomated theorem prover for first-order equational logicFedora 37 for aarch64eqp-09e-19.fc37.aarch64.rpm
eqp-09e-19.fc37.ppc64le.htmlAutomated theorem prover for first-order equational logicFedora 37 for ppc64leeqp-09e-19.fc37.ppc64le.rpm
eqp-09e-19.fc37.s390x.htmlAutomated theorem prover for first-order equational logicFedora 37 for s390xeqp-09e-19.fc37.s390x.rpm
eqp-09e-19.fc37.x86_64.htmlAutomated theorem prover for first-order equational logicFedora 37 for x86_64eqp-09e-19.fc37.x86_64.rpm

Generated by rpm2html 1.6

Fabrice Bellet