How to Install and Uninstall stp.i686 Package on Fedora 35

Last updated: October 05,2024

1. Install "stp.i686" package

In this section, we are going to explain the necessary steps to install stp.i686 on Fedora 35


    
        
            $
        

        
            
                sudo dnf update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo dnf install
            
                        
                stp.i686
            
                    
    
    Copied

2. Uninstall "stp.i686" package

This guide covers the steps necessary to uninstall stp.i686 on Fedora 35:


    
        
            $
        

        
            
                sudo dnf remove
            
                        
                stp.i686
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo dnf autoremove
            
                    
    
    Copied

3. Information about the stp.i686 package on Fedora 35

Last metadata expiration check: 5:03:11 ago on Wed Sep 7 08:25:01 2022.
Available Packages
Name : stp
Version : 2.3.3
Release : 18.fc35
Architecture : i686
Size : 2.0 M
Source : stp-2.3.3-18.fc35.src.rpm
Repository : fedora
Summary : Constraint solver/decision procedure
URL : http://stp.github.io/
License : MIT
Description : STP (Simple Theorem Prover) is a constraint solver (also referred to as
: a decision procedure or automated prover) aimed at solving constraints
: generated by program analysis tools, theorem provers, automated bug
: finders, intelligent fuzzers and model checkers. STP has been used in
: many research projects at Stanford, Berkeley, MIT, CMU and other
: universities, as well as companies and government agencies.
:
: The input to STP are formulas over the theory of bit-vectors and arrays
: (this theory captures most expressions from languages like C/C++/Java
: and Verilog), and the output of STP is a single bit of information that
: indicates whether the formula is satisfiable or not. If the input is
: satisfiable, then it also generates a variable assignment to satisfy the
: input formula.
:
: Additional information can be found at:
: http://people.csail.mit.edu/vganesh/STP_files/stp.html