How to Install and Uninstall stp Package on openSUSE Leap
Last updated: December 25,2024
1. Install "stp" package
In this section, we are going to explain the necessary steps to install stp on openSUSE Leap
$
sudo zypper refresh
Copied
$
sudo zypper install
stp
Copied
2. Uninstall "stp" package
Please follow the steps below to uninstall stp on openSUSE Leap:
$
sudo zypper remove
stp
Copied
3. Information about the stp package on openSUSE Leap
Information for package stp:
----------------------------
Repository : Main Repository
Name : stp
Version : 2.3.3+20220722-bp155.1.7
Arch : x86_64
Vendor : openSUSE
Installed Size : 203.8 KiB
Installed : No
Status : not installed
Source package : stp-2.3.3+20220722-bp155.1.7.src
Upstream URL : https://github.com/stp/stp/wiki
Summary : Constraint Solver
Description :
STP is an efficient decision procedure for the validity (or satisfiability) of
formulas from a quantifier-free many-sorted theory of fixed-width bitvectors
and (non-extensional) one-dimensional arrays. The functions in STP's input
language include concatenation, extraction, left/right shift, sign-extension,
unary minus, addition, multiplication, (signed) modulo/division, bitwise
Boolean operations, if-then-else terms, and array reads and writes. The
predicates in the language include equality and (signed) comparators between
bitvector terms.
----------------------------
Repository : Main Repository
Name : stp
Version : 2.3.3+20220722-bp155.1.7
Arch : x86_64
Vendor : openSUSE
Installed Size : 203.8 KiB
Installed : No
Status : not installed
Source package : stp-2.3.3+20220722-bp155.1.7.src
Upstream URL : https://github.com/stp/stp/wiki
Summary : Constraint Solver
Description :
STP is an efficient decision procedure for the validity (or satisfiability) of
formulas from a quantifier-free many-sorted theory of fixed-width bitvectors
and (non-extensional) one-dimensional arrays. The functions in STP's input
language include concatenation, extraction, left/right shift, sign-extension,
unary minus, addition, multiplication, (signed) modulo/division, bitwise
Boolean operations, if-then-else terms, and array reads and writes. The
predicates in the language include equality and (signed) comparators between
bitvector terms.