↑ Up

Princess---230619.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : ITP001+5 : TPTP v8.1.2. Bugfixed v7.5.0.
% Transfm  : none
% Format   : tptp
% Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s

% Computer : n023.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 : Thu Aug 31 04:08:17 EDT 2023

% Result   : Theorem 15.06s 2.74s
% Output   : Proof 28.40s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : ITP001+5 : TPTP v8.1.2. Bugfixed v7.5.0.
% 0.00/0.10  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.10/0.32  % Computer : n023.cluster.edu
% 0.10/0.32  % Model    : x86_64 x86_64
% 0.10/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32  % Memory   : 8042.1875MB
% 0.10/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32  % CPULimit : 300
% 0.10/0.32  % WCLimit  : 300
% 0.10/0.32  % DateTime : Sun Aug 27 17:10:41 EDT 2023
% 0.10/0.32  % CPUTime  : 
% 0.58/0.59  ________       _____
% 0.58/0.59  ___  __ \_________(_)________________________________
% 0.58/0.59  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.58/0.59  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.58/0.59  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.58/0.59  
% 0.58/0.60  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.58/0.60  (2023-06-19)
% 0.58/0.60  
% 0.58/0.60  (c) Philipp Rümmer, 2009-2023
% 0.58/0.60  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.58/0.60                Amanda Stjerna.
% 0.58/0.60  Free software under BSD-3-Clause.
% 0.58/0.60  
% 0.58/0.60  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.58/0.60  
% 0.58/0.60  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.58/0.61  Running up to 7 provers in parallel.
% 0.58/0.62  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.58/0.62  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.58/0.62  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.58/0.62  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.58/0.62  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.58/0.62  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.58/0.62  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 7.81/1.79  Prover 1: Preprocessing ...
% 7.81/1.79  Prover 4: Preprocessing ...
% 8.12/1.83  Prover 3: Preprocessing ...
% 8.12/1.83  Prover 5: Preprocessing ...
% 8.12/1.83  Prover 6: Preprocessing ...
% 8.12/1.83  Prover 2: Preprocessing ...
% 8.12/1.83  Prover 0: Preprocessing ...
% 14.14/2.66  Prover 6: Constructing countermodel ...
% 14.14/2.67  Prover 3: Constructing countermodel ...
% 15.06/2.73  Prover 6: proved (2110ms)
% 15.06/2.74  
% 15.06/2.74  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 15.06/2.74  
% 15.06/2.74  Prover 3: proved (2116ms)
% 15.06/2.74  
% 15.06/2.74  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 15.06/2.74  
% 15.06/2.74  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 15.06/2.75  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 15.06/2.77  Prover 0: stopped
% 15.06/2.80  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 15.06/2.80  Prover 2: stopped
% 15.80/2.82  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 15.80/2.85  Prover 5: Constructing countermodel ...
% 15.80/2.86  Prover 5: stopped
% 15.80/2.87  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 16.54/2.98  Prover 8: Preprocessing ...
% 17.17/3.02  Prover 10: Preprocessing ...
% 17.17/3.05  Prover 13: Preprocessing ...
% 17.17/3.08  Prover 7: Preprocessing ...
% 17.94/3.10  Prover 11: Preprocessing ...
% 23.51/3.82  Prover 1: Constructing countermodel ...
% 23.51/3.83  Prover 1: Found proof (size 1)
% 23.51/3.83  Prover 1: proved (3212ms)
% 23.51/3.84  Prover 11: stopped
% 23.51/3.89  Prover 10: Constructing countermodel ...
% 23.51/3.89  Prover 10: stopped
% 24.84/4.00  Prover 8: Warning: ignoring some quantifiers
% 25.13/4.03  Prover 8: Constructing countermodel ...
% 25.13/4.03  Prover 8: stopped
% 26.29/4.20  Prover 13: Warning: ignoring some quantifiers
% 26.29/4.22  Prover 7: Warning: ignoring some quantifiers
% 26.29/4.26  Prover 13: Constructing countermodel ...
% 26.29/4.26  Prover 13: stopped
% 26.29/4.27  Prover 7: Constructing countermodel ...
% 26.29/4.27  Prover 7: stopped
% 28.40/4.68  Prover 4: Constructing countermodel ...
% 28.40/4.68  Prover 4: stopped
% 28.40/4.68  
% 28.40/4.68  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 28.40/4.68  
% 28.40/4.68  % SZS output start Proof for theBenchmark
% 28.40/4.70  Assumptions after simplification:
% 28.40/4.70  ---------------------------------
% 28.40/4.70  
% 28.40/4.70    (conj_thm_2Ebool_2ETRUTH)
% 28.40/4.70    $false
% 28.40/4.70  
% 28.40/4.70  Further assumptions not needed in the proof:
% 28.40/4.70  --------------------------------------------
% 28.40/4.70  ap_tp, arr_ne, ax_all_p, ax_and_p, ax_eq_p, ax_ex_p, ax_false_p, ax_imp_p,
% 28.40/4.70  ax_neg_p, ax_or_p, ax_thm_2Ebool_2EAND__DEF, ax_thm_2Ebool_2EBOOL__CASES__AX,
% 28.40/4.70  ax_thm_2Ebool_2EBOUNDED__DEF, ax_thm_2Ebool_2ECOND__DEF,
% 28.40/4.70  ax_thm_2Ebool_2EDATATYPE__TAG__DEF, ax_thm_2Ebool_2EETA__AX,
% 28.40/4.70  ax_thm_2Ebool_2EEXISTS__DEF, ax_thm_2Ebool_2EEXISTS__UNIQUE__DEF,
% 28.40/4.70  ax_thm_2Ebool_2EFORALL__DEF, ax_thm_2Ebool_2EF__DEF,
% 28.40/4.70  ax_thm_2Ebool_2EINFINITY__AX, ax_thm_2Ebool_2EIN__DEF, ax_thm_2Ebool_2ELET__DEF,
% 28.40/4.70  ax_thm_2Ebool_2ENOT__DEF, ax_thm_2Ebool_2EONE__ONE__DEF,
% 28.40/4.70  ax_thm_2Ebool_2EONTO__DEF, ax_thm_2Ebool_2EOR__DEF,
% 28.40/4.70  ax_thm_2Ebool_2ERES__EXISTS__DEF, ax_thm_2Ebool_2ERES__EXISTS__UNIQUE__DEF,
% 28.40/4.70  ax_thm_2Ebool_2ERES__FORALL__DEF, ax_thm_2Ebool_2ERES__SELECT__DEF,
% 28.40/4.70  ax_thm_2Ebool_2ESELECT__AX, ax_thm_2Ebool_2ETYPE__DEFINITION,
% 28.40/4.70  ax_thm_2Ebool_2ET__DEF, ax_thm_2Ebool_2Eliteral__case__DEF, ax_true_p, bool_ne,
% 28.40/4.70  boolext, funcext, ibeta, ind_ne, kbeta, lameq_f1, lameq_f10, lameq_f11,
% 28.40/4.70  lameq_f12, lameq_f13, lameq_f14, lameq_f15, lameq_f16, lameq_f17, lameq_f18,
% 28.40/4.71  lameq_f19, lameq_f2, lameq_f20, lameq_f21, lameq_f22, lameq_f23, lameq_f24,
% 28.40/4.71  lameq_f25, lameq_f26, lameq_f27, lameq_f28, lameq_f29, lameq_f3, lameq_f30,
% 28.40/4.71  lameq_f31, lameq_f32, lameq_f33, lameq_f34, lameq_f35, lameq_f36, lameq_f37,
% 28.40/4.71  lameq_f38, lameq_f39, lameq_f4, lameq_f40, lameq_f41, lameq_f42, lameq_f43,
% 28.40/4.71  lameq_f44, lameq_f45, lameq_f46, lameq_f5, lameq_f6, lameq_f7, lameq_f8,
% 28.40/4.71  lameq_f9, mem_c_2Ebool_2EARB, mem_c_2Ebool_2EBOUNDED, mem_c_2Ebool_2ECOND,
% 28.40/4.71  mem_c_2Ebool_2EDATATYPE, mem_c_2Ebool_2EF, mem_c_2Ebool_2EIN,
% 28.40/4.71  mem_c_2Ebool_2ELET, mem_c_2Ebool_2EONE__ONE, mem_c_2Ebool_2EONTO,
% 28.40/4.71  mem_c_2Ebool_2ERES__ABSTRACT, mem_c_2Ebool_2ERES__EXISTS,
% 28.40/4.71  mem_c_2Ebool_2ERES__EXISTS__UNIQUE, mem_c_2Ebool_2ERES__FORALL,
% 28.40/4.71  mem_c_2Ebool_2ERES__SELECT, mem_c_2Ebool_2ET, mem_c_2Ebool_2ETYPE__DEFINITION,
% 28.40/4.71  mem_c_2Ebool_2E_21, mem_c_2Ebool_2E_2F_5C, mem_c_2Ebool_2E_3F,
% 28.40/4.71  mem_c_2Ebool_2E_3F_21, mem_c_2Ebool_2E_5C_2F, mem_c_2Ebool_2E_7E,
% 28.40/4.71  mem_c_2Ebool_2Eitself__case, mem_c_2Ebool_2Eliteral__case,
% 28.40/4.71  mem_c_2Ebool_2Ethe__value, mem_c_2Emin_2E_3D, mem_c_2Emin_2E_3D_3D_3E,
% 28.40/4.71  mem_c_2Emin_2E_40, ne_ty_2Ebool_2Eitself
% 28.40/4.71  
% 28.40/4.71  Those formulas are unsatisfiable:
% 28.40/4.71  ---------------------------------
% 28.40/4.71  
% 28.40/4.71  Begin of proof
% 28.40/4.71  | 
% 28.40/4.71  | CLOSE: (conj_thm_2Ebool_2ETRUTH) is inconsistent.
% 28.40/4.71  | 
% 28.40/4.71  End of proof
% 28.40/4.71  % SZS output end Proof for theBenchmark
% 28.40/4.71  
% 28.40/4.71  4112ms
%------------------------------------------------------------------------------