TSTP Solution File: ARI103_1 by Princess---230619

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : ARI103_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 : n026.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:01 EDT 2023

% Result   : Theorem 2.39s 1.29s
% Output   : Proof 2.83s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : ARI103_1 : TPTP v8.1.2. Released v5.0.0.
% 0.00/0.12  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.14/0.33  % Computer : n026.cluster.edu
% 0.14/0.33  % Model    : x86_64 x86_64
% 0.14/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33  % Memory   : 8042.1875MB
% 0.14/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33  % CPULimit : 300
% 0.14/0.33  % WCLimit  : 300
% 0.14/0.33  % DateTime : Tue Aug 29 18:05:05 EDT 2023
% 0.14/0.33  % CPUTime  : 
% 0.17/0.66  ________       _____
% 0.17/0.66  ___  __ \_________(_)________________________________
% 0.17/0.66  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.17/0.66  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.17/0.66  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.17/0.66  
% 0.17/0.66  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.17/0.66  (2023-06-19)
% 0.17/0.66  
% 0.17/0.66  (c) Philipp Rümmer, 2009-2023
% 0.17/0.66  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.17/0.66                Amanda Stjerna.
% 0.17/0.66  Free software under BSD-3-Clause.
% 0.17/0.66  
% 0.17/0.66  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.17/0.66  
% 0.17/0.66  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.17/0.67  Running up to 7 provers in parallel.
% 0.17/0.71  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.17/0.71  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.17/0.71  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.17/0.71  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.17/0.71  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.17/0.71  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.17/0.71  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.02/1.20  Prover 4: Preprocessing ...
% 2.02/1.20  Prover 1: Preprocessing ...
% 2.02/1.20  Prover 6: Preprocessing ...
% 2.02/1.20  Prover 2: Preprocessing ...
% 2.02/1.20  Prover 0: Preprocessing ...
% 2.02/1.20  Prover 3: Preprocessing ...
% 2.02/1.20  Prover 5: Preprocessing ...
% 2.21/1.25  Prover 2: Constructing countermodel ...
% 2.21/1.25  Prover 5: Constructing countermodel ...
% 2.21/1.25  Prover 0: Constructing countermodel ...
% 2.21/1.25  Prover 6: Constructing countermodel ...
% 2.21/1.25  Prover 4: Constructing countermodel ...
% 2.21/1.25  Prover 3: Constructing countermodel ...
% 2.21/1.25  Prover 1: Constructing countermodel ...
% 2.39/1.29  Prover 0: proved (595ms)
% 2.39/1.29  Prover 5: proved (581ms)
% 2.39/1.29  
% 2.39/1.29  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.39/1.29  
% 2.39/1.29  
% 2.39/1.29  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.39/1.29  
% 2.39/1.29  Prover 2: proved (583ms)
% 2.39/1.29  Prover 6: proved (577ms)
% 2.39/1.29  
% 2.39/1.29  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.39/1.29  
% 2.39/1.29  
% 2.39/1.29  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.39/1.29  
% 2.39/1.29  Prover 3: proved (588ms)
% 2.39/1.29  
% 2.39/1.29  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.39/1.29  
% 2.39/1.30  Prover 1: Found proof (size 1)
% 2.39/1.30  Prover 4: Found proof (size 1)
% 2.39/1.30  Prover 4: proved (585ms)
% 2.39/1.30  Prover 1: proved (605ms)
% 2.39/1.30  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 2.39/1.30  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 2.39/1.30  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 2.39/1.30  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 2.39/1.30  Prover 8: Preprocessing ...
% 2.39/1.30  Prover 10: Preprocessing ...
% 2.39/1.31  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 2.39/1.31  Prover 7: Preprocessing ...
% 2.39/1.31  Prover 10: Constructing countermodel ...
% 2.39/1.31  Prover 8: Constructing countermodel ...
% 2.39/1.31  Prover 10: stopped
% 2.39/1.31  Prover 8: stopped
% 2.39/1.31  Prover 11: Preprocessing ...
% 2.39/1.31  Prover 7: Constructing countermodel ...
% 2.39/1.31  Prover 7: stopped
% 2.39/1.31  Prover 11: Constructing countermodel ...
% 2.39/1.31  Prover 11: stopped
% 2.39/1.32  Prover 13: Preprocessing ...
% 2.39/1.32  Prover 13: Constructing countermodel ...
% 2.39/1.33  Prover 13: stopped
% 2.39/1.33  
% 2.39/1.33  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.39/1.33  
% 2.39/1.33  % SZS output start Proof for theBenchmark
% 2.83/1.33  Assumptions after simplification:
% 2.83/1.33  ---------------------------------
% 2.83/1.33  
% 2.83/1.33    (product_2_3_not_5)
% 2.83/1.34    $false
% 2.83/1.34  
% 2.83/1.34  Those formulas are unsatisfiable:
% 2.83/1.34  ---------------------------------
% 2.83/1.34  
% 2.83/1.34  Begin of proof
% 2.83/1.34  | 
% 2.83/1.34  | CLOSE: (product_2_3_not_5) is inconsistent.
% 2.83/1.34  | 
% 2.83/1.34  End of proof
% 2.83/1.34  % SZS output end Proof for theBenchmark
% 2.83/1.34  
% 2.83/1.34  683ms
%------------------------------------------------------------------------------