How to Install and Uninstall minisat2.x86_64 Package on Fedora 35

Last updated: February 08,2025

1. Install "minisat2.x86_64" package

Please follow the instructions below to install minisat2.x86_64 on Fedora 35


    
        
            $
        

        
            
                sudo dnf update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo dnf install
            
                        
                minisat2.x86_64
            
                    
    
    Copied

2. Uninstall "minisat2.x86_64" package

This is a short guide on how to uninstall minisat2.x86_64 on Fedora 35:


    
        
            $
        

        
            
                sudo dnf remove
            
                        
                minisat2.x86_64
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo dnf autoremove
            
                    
    
    Copied

3. Information about the minisat2.x86_64 package on Fedora 35

Last metadata expiration check: 2:51:39 ago on Wed Sep 7 02:25:42 2022.
Available Packages
Name : minisat2
Version : 2.2.1
Release : 13.fc35
Architecture : x86_64
Size : 27 k
Source : minisat2-2.2.1-13.fc35.src.rpm
Repository : fedora
Summary : Minimalistic SAT solver
URL : http://minisat.se/
License : MIT
Description : MiniSat is a minimalistic, open-source Boolean satisfiability problem
: (SAT) solver, developed to help researchers and developers alike to get
: started on SAT. Together with SatELite, MiniSat was recently awarded in
: the three industrial categories and one of the "crafted" categories of
: the SAT 2005 competition.
:
: A SAT solver can determine if it is possible to find assignments to
: boolean variables that would make a given expression true, if the
: expression is written with only AND, OR, NOT, parentheses, and boolean
: variables. If the expression is satisfiable, MiniSAT can also produce a
: set of assignments that make the expression true. Although the problem
: is NP-complete, SAT solvers (like this one) are often able to decide
: this problem in a reasonable time frame.