How to Install and Uninstall spass Package on Ubuntu 20.10 (Groovy Gorilla)

Last updated: May 10,2024

1. Install "spass" package

Learn how to install spass on Ubuntu 20.10 (Groovy Gorilla)


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                spass
            
                    
    
    Copied

2. Uninstall "spass" package

Please follow the step by step instructions below to uninstall spass on Ubuntu 20.10 (Groovy Gorilla):


    
        
            $
        

        
            
                sudo apt remove
            
                        
                spass
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the spass package on Ubuntu 20.10 (Groovy Gorilla)

Package: spass
Architecture: amd64
Version: 3.9-1
Priority: optional
Section: universe/science
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Science Maintainers
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 746
Depends: libc6 (>= 2.14)
Filename: pool/universe/s/spass/spass_3.9-1_amd64.deb
Size: 285788
MD5sum: c75e752ad35372f9c9f9bc16e7690e86
SHA1: 060067e0e432f4c5b6df02957c8ceb0cb41b2c53
SHA256: ae15343679069dcb75e4cf55818b92ee2ce89ffcddb8e892b784cd803ac5a151
SHA512: d21f3b11b94ba5f021cf6b1df160da7a0ca7b7b15773e01abfe41a442ed559a20bae553418081ee01daee7e039aa915e91693fd4fb06d54fff2d53486b34d827
Homepage: http://www.mpi-inf.mpg.de/departments/automation-of-logic/software/spass-workbench/classic-spass-theorem-prover/
Description-en: automated theorem prover for first-order logic with equality
SPASS is a saturation-based automated theorem prover for first-order logic with
equality. It is unique due to the combination of the superposition calculus
with specific inference/reduction rules for sorts (types) and a splitting rule
for case analysis motivated by the beta-rule of analytic tableaux and the case
analysis employed in the Davis-Putnam procedure. Furthermore, SPASS provides a
sophisticated clause normal form translation.
.
This package consists of the SPASS/FLOTTER binary, documentation, and a small
example collection. The tools collections contain the proof checker pcs, the
syntax translators dfg2otter and dfg2tptp, and the ASCII pretty printer
dfg2ascii.
Description-md5: bc89b2923428eac81fa58fc7ea00984e