How to Install and Uninstall libstp2_3 Package on openSuSE Tumbleweed
Last updated: November 10,2024
1. Install "libstp2_3" package
This tutorial shows how to install libstp2_3 on openSuSE Tumbleweed
$
sudo zypper refresh
Copied
$
sudo zypper install
libstp2_3
Copied
2. Uninstall "libstp2_3" package
Here is a brief guide to show you how to uninstall libstp2_3 on openSuSE Tumbleweed:
$
sudo zypper remove
libstp2_3
Copied
3. Information about the libstp2_3 package on openSuSE Tumbleweed
Information for package libstp2_3:
----------------------------------
Repository : openSUSE-Tumbleweed-Oss
Name : libstp2_3
Version : 2.3.3+20231214-1.1
Arch : x86_64
Vendor : openSUSE
Installed Size : 2.6 MiB
Installed : No
Status : not installed
Source package : stp-2.3.3+20231214-1.1.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 : openSUSE-Tumbleweed-Oss
Name : libstp2_3
Version : 2.3.3+20231214-1.1
Arch : x86_64
Vendor : openSUSE
Installed Size : 2.6 MiB
Installed : No
Status : not installed
Source package : stp-2.3.3+20231214-1.1.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.