TSTP Solution File: ARI292_1 by Princess---230619

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : ARI292_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 : n014.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:47:36 EDT 2023

% Result   : Theorem 4.65s 1.50s
% Output   : Proof 8.09s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : ARI292_1 : TPTP v8.1.2. Released v5.0.0.
% 0.00/0.13  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34  % Computer : n014.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Tue Aug 29 17:58:45 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.21/0.66  ________       _____
% 0.21/0.66  ___  __ \_________(_)________________________________
% 0.21/0.66  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.21/0.66  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.21/0.66  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.21/0.66  
% 0.21/0.66  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.21/0.66  (2023-06-19)
% 0.21/0.66  
% 0.21/0.66  (c) Philipp Rümmer, 2009-2023
% 0.21/0.66  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.21/0.66                Amanda Stjerna.
% 0.21/0.66  Free software under BSD-3-Clause.
% 0.21/0.66  
% 0.21/0.66  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.21/0.66  
% 0.21/0.66  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.21/0.68  Running up to 7 provers in parallel.
% 0.21/0.70  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.21/0.70  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.21/0.70  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.21/0.70  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.21/0.70  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.21/0.70  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.21/0.70  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.67/0.96  Prover 2: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.67/0.96  Prover 4: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.67/0.96  Prover 1: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.67/0.96  Prover 6: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.67/0.96  Prover 5: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.67/0.96  Prover 0: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.67/0.96  Prover 3: Warning: Problem contains rationals, using incomplete axiomatisation
% 2.20/1.07  Prover 4: Preprocessing ...
% 2.20/1.07  Prover 1: Preprocessing ...
% 2.57/1.14  Prover 6: Preprocessing ...
% 2.57/1.14  Prover 3: Preprocessing ...
% 2.57/1.14  Prover 0: Preprocessing ...
% 2.57/1.14  Prover 5: Preprocessing ...
% 2.57/1.14  Prover 2: Preprocessing ...
% 4.65/1.47  Prover 6: Constructing countermodel ...
% 4.65/1.50  Prover 6: proved (797ms)
% 4.65/1.50  
% 4.65/1.50  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.65/1.50  
% 5.48/1.50  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 5.48/1.50  Prover 7: Warning: Problem contains rationals, using incomplete axiomatisation
% 5.48/1.53  Prover 2: stopped
% 5.48/1.54  Prover 7: Preprocessing ...
% 5.48/1.54  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 5.48/1.54  Prover 8: Warning: Problem contains rationals, using incomplete axiomatisation
% 5.48/1.55  Prover 8: Preprocessing ...
% 5.48/1.56  Prover 0: Constructing countermodel ...
% 5.48/1.56  Prover 0: stopped
% 6.04/1.58  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 6.04/1.58  Prover 10: Warning: Problem contains rationals, using incomplete axiomatisation
% 6.04/1.64  Prover 10: Preprocessing ...
% 6.73/1.68  Prover 1: Constructing countermodel ...
% 6.85/1.71  Prover 1: Found proof (size 1)
% 6.85/1.71  Prover 1: proved (1023ms)
% 7.06/1.76  Prover 8: Warning: ignoring some quantifiers
% 7.06/1.77  Prover 8: Constructing countermodel ...
% 7.06/1.77  Prover 8: stopped
% 7.06/1.77  Prover 4: Constructing countermodel ...
% 7.06/1.77  Prover 4: stopped
% 7.06/1.79  Prover 7: stopped
% 7.06/1.80  Prover 10: stopped
% 7.65/1.87  Prover 3: Constructing countermodel ...
% 7.65/1.87  Prover 3: stopped
% 8.09/1.88  Prover 5: Constructing countermodel ...
% 8.09/1.88  Prover 5: stopped
% 8.09/1.88  
% 8.09/1.88  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.09/1.88  
% 8.09/1.89  % SZS output start Proof for theBenchmark
% 8.09/1.89  Assumptions after simplification:
% 8.09/1.89  ---------------------------------
% 8.09/1.89  
% 8.09/1.89    (rat_product_problem_9)
% 8.09/1.89    $false
% 8.09/1.89  
% 8.09/1.89  Those formulas are unsatisfiable:
% 8.09/1.89  ---------------------------------
% 8.09/1.89  
% 8.09/1.89  Begin of proof
% 8.09/1.89  | 
% 8.09/1.89  | CLOSE: (rat_product_problem_9) is inconsistent.
% 8.09/1.89  | 
% 8.09/1.89  End of proof
% 8.09/1.89  % SZS output end Proof for theBenchmark
% 8.09/1.89  
% 8.09/1.89  1233ms
%------------------------------------------------------------------------------