How to Install and Uninstall alt-ergo.x86_64 Package on Fedora 39
Last updated: November 25,2024
1. Install "alt-ergo.x86_64" package
This is a short guide on how to install alt-ergo.x86_64 on Fedora 39
$
sudo dnf update
Copied
$
sudo dnf install
alt-ergo.x86_64
Copied
2. Uninstall "alt-ergo.x86_64" package
Please follow the guidance below to uninstall alt-ergo.x86_64 on Fedora 39:
$
sudo dnf remove
alt-ergo.x86_64
Copied
$
sudo dnf autoremove
Copied
3. Information about the alt-ergo.x86_64 package on Fedora 39
Last metadata expiration check: 2:14:00 ago on Thu Mar 7 11:44:58 2024.
Available Packages
Name : alt-ergo
Version : 2.3.3
Release : 10.fc39
Architecture : x86_64
Size : 6.2 M
Source : alt-ergo-2.3.3-10.fc39.src.rpm
Repository : fedora
Summary : Automated theorem prover including linear arithmetic
URL : https://alt-ergo.ocamlpro.com/
License : Apache-2.0 AND LGPL-2.1-only WITH OCaml-LGPL-linking-exception
Description : Alt-Ergo is an automated theorem prover implemented in OCaml. It is
: based on CC(X) - a congruence closure algorithm parameterized by an
: equational theory X. This algorithm is reminiscent of the Shostak
: algorithm. Currently CC(X) is instantiated by the theory of linear
: arithmetics. Alt-Ergo also contains a home made SAT-solver and an
: instantiation mechanism by which it fully supports quantifiers.
Available Packages
Name : alt-ergo
Version : 2.3.3
Release : 10.fc39
Architecture : x86_64
Size : 6.2 M
Source : alt-ergo-2.3.3-10.fc39.src.rpm
Repository : fedora
Summary : Automated theorem prover including linear arithmetic
URL : https://alt-ergo.ocamlpro.com/
License : Apache-2.0 AND LGPL-2.1-only WITH OCaml-LGPL-linking-exception
Description : Alt-Ergo is an automated theorem prover implemented in OCaml. It is
: based on CC(X) - a congruence closure algorithm parameterized by an
: equational theory X. This algorithm is reminiscent of the Shostak
: algorithm. Currently CC(X) is instantiated by the theory of linear
: arithmetics. Alt-Ergo also contains a home made SAT-solver and an
: instantiation mechanism by which it fully supports quantifiers.