%------------------------------------------------------------------------------ % 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 : n029.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:16 EDT 2023 % Result : Theorem 11.02s 2.29s % Output : Proof 20.57s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : ITP001_5 : TPTP v8.1.2. Bugfixed v7.5.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.17/0.35 % Computer : n029.cluster.edu % 0.17/0.35 % Model : x86_64 x86_64 % 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.17/0.35 % Memory : 8042.1875MB % 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.17/0.35 % CPULimit : 300 % 0.17/0.35 % WCLimit : 300 % 0.17/0.35 % DateTime : Sun Aug 27 13:06:55 EDT 2023 % 0.17/0.35 % CPUTime : % 0.21/0.58 ________ _____ % 0.21/0.58 ___ __ \_________(_)________________________________ % 0.21/0.58 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.58 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.58 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.58 % 0.21/0.58 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.58 (2023-06-19) % 0.21/0.58 % 0.21/0.58 (c) Philipp Rümmer, 2009-2023 % 0.21/0.58 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.58 Amanda Stjerna. % 0.21/0.58 Free software under BSD-3-Clause. % 0.21/0.58 % 0.21/0.58 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.58 % 0.21/0.58 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.21/0.59 Running up to 7 provers in parallel. % 0.21/0.61 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.61 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.61 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.61 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.61 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.61 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.61 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 5.08/1.53 Prover 4: Preprocessing ... % 5.08/1.55 Prover 0: Preprocessing ... % 5.08/1.55 Prover 6: Preprocessing ... % 5.08/1.56 Prover 1: Preprocessing ... % 5.08/1.58 Prover 3: Preprocessing ... % 6.30/1.58 Prover 2: Preprocessing ... % 6.30/1.59 Prover 5: Preprocessing ... % 11.02/2.22 Prover 3: Constructing countermodel ... % 11.02/2.22 Prover 6: Constructing countermodel ... % 11.02/2.28 Prover 3: proved (1682ms) % 11.02/2.28 Prover 6: proved (1673ms) % 11.02/2.28 % 11.02/2.29 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 11.02/2.29 % 11.02/2.29 % 11.02/2.29 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 11.02/2.29 % 11.02/2.30 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 11.02/2.31 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 11.02/2.32 Prover 0: stopped % 11.02/2.32 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 11.02/2.36 Prover 5: Constructing countermodel ... % 11.02/2.36 Prover 5: stopped % 11.02/2.36 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 12.29/2.39 Prover 2: stopped % 12.29/2.40 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 13.23/2.54 Prover 10: Preprocessing ... % 13.23/2.57 Prover 8: Preprocessing ... % 13.23/2.57 Prover 7: Preprocessing ... % 13.23/2.58 Prover 13: Preprocessing ... % 13.23/2.58 Prover 11: Preprocessing ... % 16.32/2.95 Prover 1: Constructing countermodel ... % 16.32/2.96 Prover 1: Found proof (size 1) % 16.32/2.96 Prover 1: proved (2365ms) % 16.32/3.09 Prover 10: Constructing countermodel ... % 16.32/3.09 Prover 10: stopped % 16.32/3.14 Prover 8: Warning: ignoring some quantifiers % 17.85/3.18 Prover 8: Constructing countermodel ... % 17.85/3.18 Prover 8: stopped % 17.85/3.22 Prover 13: Warning: ignoring some quantifiers % 18.76/3.31 Prover 13: Constructing countermodel ... % 18.76/3.31 Prover 13: stopped % 19.36/3.35 Prover 7: Warning: ignoring some quantifiers % 19.64/3.41 Prover 7: Constructing countermodel ... % 19.64/3.41 Prover 7: stopped % 20.01/3.49 Prover 4: Constructing countermodel ... % 20.01/3.49 Prover 4: stopped % 20.57/3.59 Prover 11: Constructing countermodel ... % 20.57/3.59 Prover 11: stopped % 20.57/3.59 % 20.57/3.60 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 20.57/3.60 % 20.57/3.60 % SZS output start Proof for theBenchmark % 20.57/3.61 Assumptions after simplification: % 20.57/3.61 --------------------------------- % 20.57/3.61 % 20.57/3.61 (conj_thm_2Ebool_2ETRUTH) % 20.57/3.61 $false % 20.57/3.61 % 20.57/3.61 Further assumptions not needed in the proof: % 20.57/3.61 -------------------------------------------- % 20.57/3.61 ap_tp, ax_all_p, ax_and_p, ax_eq_p, ax_ex_p, ax_false_p, ax_imp_p, ax_neg_p, % 20.57/3.61 ax_or_p, ax_thm_2Ebool_2EAND__DEF, ax_thm_2Ebool_2EBOOL__CASES__AX, % 20.57/3.61 ax_thm_2Ebool_2EBOUNDED__DEF, ax_thm_2Ebool_2ECOND__DEF, % 20.57/3.61 ax_thm_2Ebool_2EDATATYPE__TAG__DEF, ax_thm_2Ebool_2EETA__AX, % 20.57/3.61 ax_thm_2Ebool_2EEXISTS__DEF, ax_thm_2Ebool_2EEXISTS__UNIQUE__DEF, % 20.57/3.61 ax_thm_2Ebool_2EFORALL__DEF, ax_thm_2Ebool_2EF__DEF, % 20.57/3.61 ax_thm_2Ebool_2EINFINITY__AX, ax_thm_2Ebool_2EIN__DEF, ax_thm_2Ebool_2ELET__DEF, % 20.57/3.61 ax_thm_2Ebool_2ENOT__DEF, ax_thm_2Ebool_2EONE__ONE__DEF, % 20.57/3.61 ax_thm_2Ebool_2EONTO__DEF, ax_thm_2Ebool_2EOR__DEF, % 20.57/3.61 ax_thm_2Ebool_2ERES__EXISTS__DEF, ax_thm_2Ebool_2ERES__EXISTS__UNIQUE__DEF, % 20.57/3.61 ax_thm_2Ebool_2ERES__FORALL__DEF, ax_thm_2Ebool_2ERES__SELECT__DEF, % 20.57/3.61 ax_thm_2Ebool_2ESELECT__AX, ax_thm_2Ebool_2ETYPE__DEFINITION, % 20.57/3.61 ax_thm_2Ebool_2ET__DEF, ax_thm_2Ebool_2Eliteral__case__DEF, ax_true_p, boolext, % 20.57/3.61 funcext, ibeta, kbeta, lameq_f1, lameq_f10, lameq_f11, lameq_f12, lameq_f13, % 20.57/3.61 lameq_f14, lameq_f15, lameq_f16, lameq_f17, lameq_f18, lameq_f19, lameq_f2, % 20.57/3.61 lameq_f20, lameq_f21, lameq_f22, lameq_f23, lameq_f24, lameq_f25, lameq_f26, % 20.57/3.61 lameq_f27, lameq_f28, lameq_f29, lameq_f3, lameq_f30, lameq_f31, lameq_f32, % 20.57/3.61 lameq_f33, lameq_f34, lameq_f35, lameq_f36, lameq_f37, lameq_f38, lameq_f39, % 20.57/3.61 lameq_f4, lameq_f40, lameq_f41, lameq_f42, lameq_f43, lameq_f44, lameq_f45, % 20.57/3.61 lameq_f46, lameq_f5, lameq_f6, lameq_f7, lameq_f8, lameq_f9, mem_c_2Ebool_2EARB, % 20.57/3.61 mem_c_2Ebool_2EBOUNDED, mem_c_2Ebool_2ECOND, mem_c_2Ebool_2EDATATYPE, % 20.57/3.61 mem_c_2Ebool_2EF, mem_c_2Ebool_2EIN, mem_c_2Ebool_2ELET, % 20.57/3.61 mem_c_2Ebool_2EONE__ONE, mem_c_2Ebool_2EONTO, mem_c_2Ebool_2ERES__ABSTRACT, % 20.57/3.61 mem_c_2Ebool_2ERES__EXISTS, mem_c_2Ebool_2ERES__EXISTS__UNIQUE, % 20.57/3.62 mem_c_2Ebool_2ERES__FORALL, mem_c_2Ebool_2ERES__SELECT, mem_c_2Ebool_2ET, % 20.57/3.62 mem_c_2Ebool_2ETYPE__DEFINITION, mem_c_2Ebool_2E_21, mem_c_2Ebool_2E_2F_5C, % 20.57/3.62 mem_c_2Ebool_2E_3F, mem_c_2Ebool_2E_3F_21, mem_c_2Ebool_2E_5C_2F, % 20.57/3.62 mem_c_2Ebool_2E_7E, mem_c_2Ebool_2Eitself__case, mem_c_2Ebool_2Eliteral__case, % 20.57/3.62 mem_c_2Ebool_2Ethe__value, mem_c_2Emin_2E_3D, mem_c_2Emin_2E_3D_3D_3E, % 20.57/3.62 mem_c_2Emin_2E_40, stp_eq_fo_c_2Ebool_2EBOUNDED, stp_eq_fo_c_2Ebool_2EF, % 20.57/3.62 stp_eq_fo_c_2Ebool_2ET, stp_eq_fo_c_2Ebool_2E_2F_5C, % 20.57/3.62 stp_eq_fo_c_2Ebool_2E_5C_2F, stp_eq_fo_c_2Ebool_2E_7E, % 20.57/3.62 stp_eq_fo_c_2Emin_2E_3D_3D_3E, stp_inj_mem_i, stp_inj_mem_o, stp_inj_surj_i, % 20.57/3.62 stp_inj_surj_o, stp_iso_mem_i, stp_iso_mem_o % 20.57/3.62 % 20.57/3.62 Those formulas are unsatisfiable: % 20.57/3.62 --------------------------------- % 20.57/3.62 % 20.57/3.62 Begin of proof % 20.57/3.62 | % 20.57/3.62 | CLOSE: (conj_thm_2Ebool_2ETRUTH) is inconsistent. % 20.57/3.62 | % 20.57/3.62 End of proof % 20.57/3.62 % SZS output end Proof for theBenchmark % 20.57/3.62 % 20.57/3.62 3041ms %------------------------------------------------------------------------------