TSTP Solution File: ALG028+1 by Princess---230619

View Problem - Process Solution

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

% Computer : n002.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 16:35:44 EDT 2023

% Result   : Theorem 19.02s 3.51s
% Output   : Proof 19.02s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : ALG028+1 : TPTP v8.1.2. Released v2.7.0.
% 0.08/0.14  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.35  % Computer : n002.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Mon Aug 28 03:52:04 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.20/0.61  ________       _____
% 0.20/0.61  ___  __ \_________(_)________________________________
% 0.20/0.61  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.20/0.61  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.20/0.61  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.20/0.61  
% 0.20/0.61  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.61  (2023-06-19)
% 0.20/0.61  
% 0.20/0.61  (c) Philipp Rümmer, 2009-2023
% 0.20/0.61  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.61                Amanda Stjerna.
% 0.20/0.61  Free software under BSD-3-Clause.
% 0.20/0.61  
% 0.20/0.61  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.61  
% 0.20/0.61  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.20/0.63  Running up to 7 provers in parallel.
% 0.20/0.64  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.64  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.64  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.64  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.64  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.65  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 0.20/0.65  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 8.58/1.93  Prover 4: Preprocessing ...
% 8.58/1.95  Prover 1: Preprocessing ...
% 8.58/1.96  Prover 6: Preprocessing ...
% 8.58/1.96  Prover 2: Preprocessing ...
% 8.58/1.97  Prover 0: Preprocessing ...
% 8.58/1.98  Prover 5: Preprocessing ...
% 8.58/1.98  Prover 3: Preprocessing ...
% 15.86/2.87  Prover 1: Constructing countermodel ...
% 15.86/2.87  Prover 4: Constructing countermodel ...
% 15.99/2.90  Prover 1: Found proof (size 1)
% 15.99/2.90  Prover 4: Found proof (size 1)
% 15.99/2.90  Prover 1: proved (2262ms)
% 15.99/2.90  Prover 4: proved (2259ms)
% 16.30/2.93  Prover 3: Constructing countermodel ...
% 16.30/2.93  Prover 3: stopped
% 16.30/2.93  Prover 0: Constructing countermodel ...
% 16.30/2.93  Prover 0: stopped
% 16.48/2.94  Prover 2: Constructing countermodel ...
% 16.48/2.94  Prover 2: stopped
% 16.48/2.94  Prover 6: Constructing countermodel ...
% 16.48/2.95  Prover 6: stopped
% 19.02/3.49  Prover 5: Constructing countermodel ...
% 19.02/3.51  Prover 5: stopped
% 19.02/3.51  
% 19.02/3.51  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 19.02/3.51  
% 19.02/3.52  % SZS output start Proof for theBenchmark
% 19.02/3.52  Assumptions after simplification:
% 19.02/3.52  ---------------------------------
% 19.02/3.52  
% 19.02/3.52    (co1)
% 19.02/3.53    $false
% 19.02/3.53  
% 19.02/3.53  Further assumptions not needed in the proof:
% 19.02/3.53  --------------------------------------------
% 19.02/3.53  ax1, ax10, ax11, ax2, ax3, ax4, ax5, ax6, ax7, ax8, ax9
% 19.02/3.53  
% 19.02/3.53  Those formulas are unsatisfiable:
% 19.02/3.53  ---------------------------------
% 19.02/3.53  
% 19.02/3.53  Begin of proof
% 19.02/3.53  | 
% 19.02/3.53  | CLOSE: (co1) is inconsistent.
% 19.02/3.53  | 
% 19.02/3.53  End of proof
% 19.02/3.53  % SZS output end Proof for theBenchmark
% 19.02/3.53  
% 19.02/3.53  2919ms
%------------------------------------------------------------------------------