TSTP Solution File: ITP010+2 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : ITP010+2 : TPTP v8.1.2. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n004.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:35 EDT 2023
% Result : Theorem 7.04s 1.62s
% Output : Proof 10.67s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : ITP010+2 : TPTP v8.1.2. Bugfixed v7.5.0.
% 0.13/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.35 % Computer : n004.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 : Sun Aug 27 12:49:37 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/sandbox2/benchmark/theBenchmark.p ...
% 0.20/0.62 Running up to 7 provers in parallel.
% 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 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 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.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 4.01/1.25 Prover 4: Preprocessing ...
% 4.01/1.26 Prover 1: Preprocessing ...
% 4.01/1.28 Prover 0: Preprocessing ...
% 4.01/1.28 Prover 6: Preprocessing ...
% 4.01/1.28 Prover 5: Preprocessing ...
% 4.01/1.28 Prover 2: Preprocessing ...
% 4.01/1.28 Prover 3: Preprocessing ...
% 6.36/1.58 Prover 5: Constructing countermodel ...
% 7.04/1.61 Prover 5: proved (978ms)
% 7.04/1.62
% 7.04/1.62 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.04/1.62
% 7.04/1.62 Prover 2: stopped
% 7.04/1.62 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 7.04/1.62 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 7.04/1.68 Prover 0: stopped
% 7.04/1.69 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 8.51/1.81 Prover 7: Preprocessing ...
% 8.51/1.82 Prover 8: Preprocessing ...
% 8.51/1.83 Prover 10: Preprocessing ...
% 8.51/1.89 Prover 3: Constructing countermodel ...
% 8.51/1.89 Prover 3: stopped
% 8.51/1.89 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 8.70/1.95 Prover 6: Constructing countermodel ...
% 8.70/1.95 Prover 6: stopped
% 8.70/1.97 Prover 11: Preprocessing ...
% 8.70/1.98 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 8.70/2.00 Prover 1: Constructing countermodel ...
% 8.70/2.02 Prover 1: Found proof (size 1)
% 8.70/2.02 Prover 1: proved (1387ms)
% 8.70/2.02 Prover 4: stopped
% 10.05/2.03 Prover 13: Preprocessing ...
% 10.05/2.10 Prover 13: stopped
% 10.67/2.11 Prover 10: Constructing countermodel ...
% 10.67/2.11 Prover 10: stopped
% 10.67/2.11 Prover 8: Warning: ignoring some quantifiers
% 10.67/2.11 Prover 11: stopped
% 10.67/2.12 Prover 8: Constructing countermodel ...
% 10.67/2.12 Prover 8: stopped
% 10.67/2.15 Prover 7: Constructing countermodel ...
% 10.67/2.15 Prover 7: stopped
% 10.67/2.15
% 10.67/2.15 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.67/2.15
% 10.67/2.15 % SZS output start Proof for theBenchmark
% 10.67/2.15 Assumptions after simplification:
% 10.67/2.15 ---------------------------------
% 10.67/2.15
% 10.67/2.15 (conj_thm_2Ecardinal_2ECARD__NOT__LE)
% 10.67/2.16 $false
% 10.67/2.16
% 10.67/2.16 Further assumptions not needed in the proof:
% 10.67/2.16 --------------------------------------------
% 10.67/2.16 ap_tp, arr_ne, ax_all_p, ax_and_p, ax_eq_p, ax_false_p, ax_imp_p, ax_neg_p,
% 10.67/2.16 ax_or_p, ax_true_p, bool_ne, boolext, conj_thm_2Ebool_2EEQ__CLAUSES,
% 10.67/2.16 conj_thm_2Ebool_2EFALSITY, conj_thm_2Ebool_2EFORALL__SIMP,
% 10.67/2.16 conj_thm_2Ebool_2EIMP__CLAUSES, conj_thm_2Ebool_2ENOT__CLAUSES,
% 10.67/2.16 conj_thm_2Ebool_2EREFL__CLAUSE, conj_thm_2Ebool_2ETRUTH,
% 10.67/2.16 conj_thm_2Ecardinal_2ECARD__LE__TOTAL, conj_thm_2Esat_2EAND__INV2,
% 10.67/2.16 conj_thm_2Esat_2EAND__INV__IMP, conj_thm_2Esat_2ENOT__NOT,
% 10.67/2.16 conj_thm_2Esat_2EOR__DUAL2, conj_thm_2Esat_2EOR__DUAL3, conj_thm_2Esat_2Edc__eq,
% 10.67/2.16 conj_thm_2Esat_2Edc__neg, funcext, ibeta, ind_ne, kbeta, mem_c_2Ebool_2EF,
% 10.67/2.16 mem_c_2Ebool_2ET, mem_c_2Ebool_2E_21, mem_c_2Ebool_2E_2F_5C,
% 10.67/2.16 mem_c_2Ebool_2E_5C_2F, mem_c_2Ebool_2E_7E, mem_c_2Ecardinal_2Ecardleq,
% 10.67/2.16 mem_c_2Emin_2E_3D, mem_c_2Emin_2E_3D_3D_3E
% 10.67/2.16
% 10.67/2.16 Those formulas are unsatisfiable:
% 10.67/2.16 ---------------------------------
% 10.67/2.16
% 10.67/2.16 Begin of proof
% 10.67/2.16 |
% 10.67/2.16 | CLOSE: (conj_thm_2Ecardinal_2ECARD__NOT__LE) is inconsistent.
% 10.67/2.16 |
% 10.67/2.16 End of proof
% 10.67/2.16 % SZS output end Proof for theBenchmark
% 10.67/2.16
% 10.67/2.16 1549ms
%------------------------------------------------------------------------------