TSTP Solution File: ARI277_1 by Princess---230619

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : ARI277_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 : n032.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:32 EDT 2023

% Result   : Theorem 4.44s 1.23s
% Output   : Proof 8.03s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.08  % Problem  : ARI277_1 : TPTP v8.1.2. Released v5.0.0.
% 0.08/0.09  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.08/0.28  % Computer : n032.cluster.edu
% 0.08/0.28  % Model    : x86_64 x86_64
% 0.08/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28  % Memory   : 8042.1875MB
% 0.08/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28  % CPULimit : 300
% 0.08/0.28  % WCLimit  : 300
% 0.08/0.28  % DateTime : Tue Aug 29 18:28:01 EDT 2023
% 0.08/0.28  % CPUTime  : 
% 0.12/0.49  ________       _____
% 0.12/0.49  ___  __ \_________(_)________________________________
% 0.12/0.49  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.12/0.49  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.12/0.49  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.12/0.50  
% 0.12/0.50  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.12/0.50  (2023-06-19)
% 0.12/0.50  
% 0.12/0.50  (c) Philipp Rümmer, 2009-2023
% 0.12/0.50  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.12/0.50                Amanda Stjerna.
% 0.12/0.50  Free software under BSD-3-Clause.
% 0.12/0.50  
% 0.12/0.50  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.12/0.50  
% 0.12/0.50  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.12/0.51  Running up to 7 provers in parallel.
% 0.12/0.52  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.12/0.52  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.12/0.52  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.12/0.52  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.12/0.52  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.12/0.52  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.12/0.52  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.25/0.78  Prover 0: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.25/0.78  Prover 5: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.25/0.78  Prover 4: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.25/0.78  Prover 1: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.25/0.78  Prover 6: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.25/0.78  Prover 2: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.25/0.78  Prover 3: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.90/0.85  Prover 1: Preprocessing ...
% 1.90/0.85  Prover 4: Preprocessing ...
% 1.97/0.89  Prover 0: Preprocessing ...
% 1.97/0.89  Prover 6: Preprocessing ...
% 2.69/1.00  Prover 5: Preprocessing ...
% 2.69/1.00  Prover 3: Preprocessing ...
% 2.69/1.02  Prover 2: Preprocessing ...
% 4.08/1.19  Prover 6: Constructing countermodel ...
% 4.08/1.20  Prover 0: Constructing countermodel ...
% 4.44/1.22  Prover 6: proved (700ms)
% 4.44/1.23  
% 4.44/1.23  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.44/1.23  
% 4.44/1.24  Prover 0: proved (714ms)
% 4.44/1.24  
% 4.44/1.24  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.44/1.24  
% 4.44/1.24  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 4.44/1.24  Prover 7: Warning: Problem contains rationals, using incomplete axiomatisation
% 4.44/1.26  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 4.44/1.26  Prover 8: Warning: Problem contains rationals, using incomplete axiomatisation
% 4.96/1.28  Prover 8: Preprocessing ...
% 5.30/1.33  Prover 7: Preprocessing ...
% 5.53/1.42  Prover 2: stopped
% 6.15/1.44  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 6.15/1.44  Prover 10: Warning: Problem contains rationals, using incomplete axiomatisation
% 6.15/1.45  Prover 1: Constructing countermodel ...
% 6.15/1.45  Prover 1: Found proof (size 1)
% 6.15/1.45  Prover 1: proved (938ms)
% 6.15/1.46  Prover 4: Constructing countermodel ...
% 6.15/1.46  Prover 4: stopped
% 6.61/1.50  Prover 10: Preprocessing ...
% 6.61/1.51  Prover 8: Warning: ignoring some quantifiers
% 6.61/1.51  Prover 8: Constructing countermodel ...
% 6.61/1.51  Prover 8: stopped
% 7.22/1.58  Prover 5: Constructing countermodel ...
% 7.22/1.58  Prover 5: stopped
% 7.22/1.59  Prover 7: stopped
% 7.51/1.61  Prover 3: Constructing countermodel ...
% 7.51/1.61  Prover 3: stopped
% 8.03/1.75  Prover 10: stopped
% 8.03/1.75  
% 8.03/1.75  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.03/1.75  
% 8.03/1.75  % SZS output start Proof for theBenchmark
% 8.03/1.75  Assumptions after simplification:
% 8.03/1.75  ---------------------------------
% 8.03/1.75  
% 8.03/1.75    (rat_difference_problem_5)
% 8.03/1.75    $false
% 8.03/1.75  
% 8.03/1.75  Those formulas are unsatisfiable:
% 8.03/1.75  ---------------------------------
% 8.03/1.75  
% 8.03/1.75  Begin of proof
% 8.03/1.76  | 
% 8.03/1.76  | CLOSE: (rat_difference_problem_5) is inconsistent.
% 8.03/1.76  | 
% 8.03/1.76  End of proof
% 8.03/1.76  % SZS output end Proof for theBenchmark
% 8.03/1.76  
% 8.03/1.76  1260ms
%------------------------------------------------------------------------------