How to Install and Uninstall E.x86_64 Package on Fedora 34
Last updated: November 29,2024
1. Install "E.x86_64" package
Here is a brief guide to show you how to install E.x86_64 on Fedora 34
$
sudo dnf update
Copied
$
sudo dnf install
E.x86_64
Copied
2. Uninstall "E.x86_64" package
Here is a brief guide to show you how to uninstall E.x86_64 on Fedora 34:
$
sudo dnf remove
E.x86_64
Copied
$
sudo dnf autoremove
Copied
3. Information about the E.x86_64 package on Fedora 34
Last metadata expiration check: 3:35:44 ago on Tue Sep 6 08:10:37 2022.
Available Packages
Name : E
Version : 2.6
Release : 1.fc34
Architecture : x86_64
Size : 1.5 M
Source : E-2.6-1.fc34.src.rpm
Repository : updates
Summary : Equational Theorem Prover
URL : http://www.eprover.org/
License : GPLv2+ or LGPLv2+
Description : E is a purely equational theorem prover for full first-order logic.
: That means it is a program that you can stuff a mathematical
: specification (in first-order format) and a hypothesis into, and which
: will then run forever, using up all of your machines' resources. Very
: occasionally it will find a proof for the hypothesis and tell you so.
:
: E's inference core is based on a modified version of the superposition
: calculus for equational clausal logic. Both clausification and
: reasoning on the clausal form can be documented in checkable proof
: objects.
:
: E was the best-performing open source software prover in the 2008 CADE
: ATP System Competition (CASC) in the FOF, CNF, and UEQ divisions. In
: the 2011 competition, it won second place in the FOF division, and
: placed highly in CNF and UEQ.
Available Packages
Name : E
Version : 2.6
Release : 1.fc34
Architecture : x86_64
Size : 1.5 M
Source : E-2.6-1.fc34.src.rpm
Repository : updates
Summary : Equational Theorem Prover
URL : http://www.eprover.org/
License : GPLv2+ or LGPLv2+
Description : E is a purely equational theorem prover for full first-order logic.
: That means it is a program that you can stuff a mathematical
: specification (in first-order format) and a hypothesis into, and which
: will then run forever, using up all of your machines' resources. Very
: occasionally it will find a proof for the hypothesis and tell you so.
:
: E's inference core is based on a modified version of the superposition
: calculus for equational clausal logic. Both clausification and
: reasoning on the clausal form can be documented in checkable proof
: objects.
:
: E was the best-performing open source software prover in the 2008 CADE
: ATP System Competition (CASC) in the FOF, CNF, and UEQ divisions. In
: the 2011 competition, it won second place in the FOF division, and
: placed highly in CNF and UEQ.