How to Install and Uninstall libstp2_1 Package on openSUSE Leap
Last updated: December 27,2024
Deprecated! Installation of this package may no longer be supported.
1. Install "libstp2_1" package
This guide covers the steps necessary to install libstp2_1 on openSUSE Leap
$
sudo zypper refresh
Copied
$
sudo zypper install
libstp2_1
Copied
2. Uninstall "libstp2_1" package
This guide let you learn how to uninstall libstp2_1 on openSUSE Leap:
$
sudo zypper remove
libstp2_1
Copied
3. Information about the libstp2_1 package on openSUSE Leap
Information for package libstp2_1:
----------------------------------
Repository : Main Repository
Name : libstp2_1
Version : 2.3.1+20171008-bp153.1.17
Arch : x86_64
Vendor : openSUSE
Installed Size : 2,7 MiB
Installed : No
Status : not installed
Source package : stp-2.3.1+20171008-bp153.1.17.src
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 : libstp2_1
Version : 2.3.1+20171008-bp153.1.17
Arch : x86_64
Vendor : openSUSE
Installed Size : 2,7 MiB
Installed : No
Status : not installed
Source package : stp-2.3.1+20171008-bp153.1.17.src
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.