TSTP Solution File: ARI022_1 by Princess---230619

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : ARI022_1 : TPTP v8.1.2. Released v5.0.0.
% Transfm  : none
% Format   : tptp
% Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s

% Computer : n021.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Aug 30 17:46:42 EDT 2023

% Result   : Theorem 2.27s 1.08s
% Output   : Proof 2.27s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : ARI022_1 : TPTP v8.1.2. Released v5.0.0.
% 0.12/0.14  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.14/0.35  % Computer : n021.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Tue Aug 29 18:31:44 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 0.65/0.69  ________       _____
% 0.65/0.69  ___  __ \_________(_)________________________________
% 0.65/0.69  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.65/0.69  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.65/0.69  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.65/0.69  
% 0.65/0.69  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.65/0.69  (2023-06-19)
% 0.65/0.69  
% 0.65/0.69  (c) Philipp Rümmer, 2009-2023
% 0.65/0.69  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.65/0.69                Amanda Stjerna.
% 0.65/0.69  Free software under BSD-3-Clause.
% 0.65/0.69  
% 0.65/0.69  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.65/0.69  
% 0.65/0.69  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.65/0.71  Running up to 7 provers in parallel.
% 0.65/0.72  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.65/0.72  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.65/0.72  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.65/0.72  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.65/0.72  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.65/0.72  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.65/0.72  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.86/1.02  Prover 4: Preprocessing ...
% 1.86/1.02  Prover 1: Preprocessing ...
% 2.18/1.04  Prover 4: Constructing countermodel ...
% 2.18/1.04  Prover 1: Constructing countermodel ...
% 2.27/1.07  Prover 6: Preprocessing ...
% 2.27/1.07  Prover 5: Preprocessing ...
% 2.27/1.07  Prover 3: Preprocessing ...
% 2.27/1.07  Prover 0: Preprocessing ...
% 2.27/1.07  Prover 2: Preprocessing ...
% 2.27/1.07  Prover 3: Constructing countermodel ...
% 2.27/1.07  Prover 0: Constructing countermodel ...
% 2.27/1.07  Prover 2: Constructing countermodel ...
% 2.27/1.07  Prover 5: Constructing countermodel ...
% 2.27/1.07  Prover 6: Constructing countermodel ...
% 2.27/1.07  Prover 3: proved (355ms)
% 2.27/1.07  Prover 0: proved (358ms)
% 2.27/1.07  Prover 5: proved (353ms)
% 2.27/1.08  
% 2.27/1.08  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.27/1.08  
% 2.27/1.08  
% 2.27/1.08  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.27/1.08  
% 2.27/1.08  Prover 2: proved (358ms)
% 2.27/1.08  
% 2.27/1.08  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.27/1.08  
% 2.27/1.08  
% 2.27/1.08  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.27/1.08  
% 2.27/1.08  Prover 4: Found proof (size 1)
% 2.27/1.08  Prover 1: Found proof (size 1)
% 2.27/1.08  Prover 4: proved (357ms)
% 2.27/1.08  Prover 1: proved (360ms)
% 2.27/1.08  Prover 6: proved (354ms)
% 2.27/1.08  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 2.27/1.08  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 2.27/1.08  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 2.27/1.08  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 2.27/1.09  Prover 10: Preprocessing ...
% 2.27/1.09  Prover 8: Preprocessing ...
% 2.27/1.09  Prover 11: Preprocessing ...
% 2.27/1.09  Prover 7: Preprocessing ...
% 2.27/1.09  Prover 10: Constructing countermodel ...
% 2.27/1.09  Prover 10: stopped
% 2.27/1.09  Prover 8: Constructing countermodel ...
% 2.27/1.10  Prover 11: Constructing countermodel ...
% 2.27/1.10  Prover 8: stopped
% 2.27/1.10  Prover 11: stopped
% 2.27/1.10  Prover 7: Constructing countermodel ...
% 2.27/1.10  Prover 7: stopped
% 2.27/1.10  
% 2.27/1.10  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.27/1.10  
% 2.27/1.10  % SZS output start Proof for theBenchmark
% 2.27/1.10  Assumptions after simplification:
% 2.27/1.10  ---------------------------------
% 2.27/1.10  
% 2.27/1.10    (n4_lesseq_n2)
% 2.27/1.11    $false
% 2.27/1.11  
% 2.27/1.11  Those formulas are unsatisfiable:
% 2.27/1.11  ---------------------------------
% 2.27/1.11  
% 2.27/1.11  Begin of proof
% 2.27/1.11  | 
% 2.27/1.11  | CLOSE: (n4_lesseq_n2) is inconsistent.
% 2.27/1.11  | 
% 2.27/1.11  End of proof
% 2.27/1.11  % SZS output end Proof for theBenchmark
% 2.27/1.11  
% 2.27/1.11  419ms
%------------------------------------------------------------------------------