↑ Up

Princess---230619.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : ARI462_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 : n001.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:48:08 EDT 2023

% Result   : Theorem 4.34s 1.36s
% Output   : Proof 7.16s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : ARI462_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.16/0.33  % Computer : n001.cluster.edu
% 0.16/0.33  % Model    : x86_64 x86_64
% 0.16/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33  % Memory   : 8042.1875MB
% 0.16/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33  % CPULimit : 300
% 0.16/0.33  % WCLimit  : 300
% 0.16/0.33  % DateTime : Tue Aug 29 18:55:37 EDT 2023
% 0.16/0.34  % CPUTime  : 
% 0.20/0.64  ________       _____
% 0.20/0.64  ___  __ \_________(_)________________________________
% 0.20/0.64  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.20/0.64  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.20/0.64  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.20/0.64  
% 0.20/0.64  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.64  (2023-06-19)
% 0.20/0.64  
% 0.20/0.64  (c) Philipp Rümmer, 2009-2023
% 0.20/0.64  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.64                Amanda Stjerna.
% 0.20/0.64  Free software under BSD-3-Clause.
% 0.20/0.64  
% 0.20/0.64  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.64  
% 0.20/0.65  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.20/0.66  Running up to 7 provers in parallel.
% 0.20/0.67  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.67  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.67  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.67  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.67  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.67  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.67  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.71/0.95  Prover 0: Warning: Problem contains reals, using incomplete axiomatisation
% 1.71/0.95  Prover 5: Warning: Problem contains reals, using incomplete axiomatisation
% 1.71/0.96  Prover 3: Warning: Problem contains reals, using incomplete axiomatisation
% 1.71/0.96  Prover 4: Warning: Problem contains reals, using incomplete axiomatisation
% 1.71/0.96  Prover 1: Warning: Problem contains reals, using incomplete axiomatisation
% 1.71/0.96  Prover 6: Warning: Problem contains reals, using incomplete axiomatisation
% 1.71/0.96  Prover 2: Warning: Problem contains reals, using incomplete axiomatisation
% 2.24/1.02  Prover 1: Preprocessing ...
% 2.24/1.03  Prover 4: Preprocessing ...
% 2.24/1.07  Prover 0: Preprocessing ...
% 2.77/1.08  Prover 3: Preprocessing ...
% 2.77/1.08  Prover 6: Preprocessing ...
% 2.77/1.09  Prover 5: Preprocessing ...
% 2.77/1.10  Prover 2: Preprocessing ...
% 4.34/1.33  Prover 6: Constructing countermodel ...
% 4.34/1.35  Prover 6: proved (687ms)
% 4.34/1.36  
% 4.34/1.36  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.34/1.36  
% 4.34/1.36  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 4.34/1.36  Prover 7: Warning: Problem contains reals, using incomplete axiomatisation
% 4.34/1.41  Prover 0: Constructing countermodel ...
% 4.34/1.41  Prover 0: stopped
% 4.34/1.41  Prover 2: stopped
% 4.34/1.43  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 4.34/1.43  Prover 8: Warning: Problem contains reals, using incomplete axiomatisation
% 4.34/1.43  Prover 7: Preprocessing ...
% 4.34/1.43  Prover 8: Preprocessing ...
% 4.34/1.43  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 4.34/1.45  Prover 10: Warning: Problem contains reals, using incomplete axiomatisation
% 4.34/1.49  Prover 10: Preprocessing ...
% 5.63/1.50  Prover 5: Constructing countermodel ...
% 5.63/1.50  Prover 5: stopped
% 5.63/1.51  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 5.63/1.51  Prover 11: Warning: Problem contains reals, using incomplete axiomatisation
% 5.63/1.55  Prover 3: Constructing countermodel ...
% 5.63/1.55  Prover 11: Preprocessing ...
% 5.63/1.55  Prover 3: stopped
% 5.63/1.57  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 5.63/1.57  Prover 13: Warning: Problem contains reals, using incomplete axiomatisation
% 5.63/1.59  Prover 13: Preprocessing ...
% 5.63/1.59  Prover 1: Constructing countermodel ...
% 6.48/1.61  Prover 1: Found proof (size 1)
% 6.48/1.61  Prover 1: proved (944ms)
% 6.48/1.61  Prover 10: stopped
% 6.64/1.63  Prover 13: stopped
% 6.64/1.64  Prover 4: Constructing countermodel ...
% 6.64/1.64  Prover 4: stopped
% 6.64/1.65  Prover 8: Warning: ignoring some quantifiers
% 6.64/1.66  Prover 8: Constructing countermodel ...
% 6.64/1.66  Prover 8: stopped
% 6.64/1.67  Prover 11: stopped
% 7.16/1.75  Prover 7: Warning: ignoring some quantifiers
% 7.16/1.76  Prover 7: Constructing countermodel ...
% 7.16/1.76  Prover 7: stopped
% 7.16/1.76  
% 7.16/1.76  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.16/1.76  
% 7.16/1.76  % SZS output start Proof for theBenchmark
% 7.16/1.76  Assumptions after simplification:
% 7.16/1.76  ---------------------------------
% 7.16/1.76  
% 7.16/1.76    (real_uminus_problem_4)
% 7.16/1.77    $false
% 7.16/1.77  
% 7.16/1.77  Those formulas are unsatisfiable:
% 7.16/1.77  ---------------------------------
% 7.16/1.77  
% 7.16/1.77  Begin of proof
% 7.16/1.77  | 
% 7.16/1.77  | CLOSE: (real_uminus_problem_4) is inconsistent.
% 7.16/1.77  | 
% 7.16/1.77  End of proof
% 7.16/1.77  % SZS output end Proof for theBenchmark
% 7.16/1.77  
% 7.16/1.77  1123ms
%------------------------------------------------------------------------------