%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ITP001+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 : n013.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:15 EDT 2023 % Result : Theorem 3.68s 1.23s % Output : Proof 5.41s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : ITP001+2 : TPTP v8.1.2. Bugfixed v7.5.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.34 % Computer : n013.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 300 % 0.12/0.34 % DateTime : Sun Aug 27 12:10:32 EDT 2023 % 0.12/0.34 % CPUTime : % 0.19/0.61 ________ _____ % 0.19/0.61 ___ __ \_________(_)________________________________ % 0.19/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.61 % 0.19/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.61 (2023-06-19) % 0.19/0.61 % 0.19/0.61 (c) Philipp Rümmer, 2009-2023 % 0.19/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.61 Amanda Stjerna. % 0.19/0.61 Free software under BSD-3-Clause. % 0.19/0.61 % 0.19/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.61 % 0.19/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.19/0.62 Running up to 7 provers in parallel. % 0.19/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.19/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.50/1.02 Prover 1: Preprocessing ... % 2.50/1.03 Prover 4: Preprocessing ... % 2.77/1.07 Prover 0: Preprocessing ... % 2.77/1.07 Prover 2: Preprocessing ... % 2.77/1.07 Prover 5: Preprocessing ... % 2.77/1.07 Prover 3: Preprocessing ... % 2.77/1.08 Prover 6: Preprocessing ... % 3.68/1.20 Prover 5: Constructing countermodel ... % 3.68/1.20 Prover 3: Constructing countermodel ... % 3.68/1.21 Prover 6: Constructing countermodel ... % 3.68/1.21 Prover 2: Constructing countermodel ... % 3.68/1.23 Prover 5: proved (598ms) % 3.68/1.23 Prover 2: proved (603ms) % 3.68/1.23 % 3.68/1.23 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.68/1.23 % 4.06/1.24 Prover 6: proved (598ms) % 4.06/1.24 % 4.06/1.24 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.06/1.24 % 4.06/1.24 % 4.06/1.24 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.06/1.24 % 4.06/1.24 Prover 3: proved (604ms) % 4.06/1.24 % 4.06/1.24 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.06/1.24 % 4.06/1.24 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 4.06/1.24 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 4.06/1.24 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 4.06/1.24 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 4.16/1.26 Prover 0: Constructing countermodel ... % 4.16/1.27 Prover 0: stopped % 4.16/1.27 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 4.16/1.29 Prover 8: Preprocessing ... % 4.16/1.30 Prover 10: Preprocessing ... % 4.16/1.30 Prover 11: Preprocessing ... % 4.16/1.30 Prover 7: Preprocessing ... % 4.16/1.32 Prover 13: Preprocessing ... % 4.16/1.39 Prover 1: Constructing countermodel ... % 4.16/1.40 Prover 1: Found proof (size 1) % 4.16/1.40 Prover 1: proved (773ms) % 4.16/1.40 Prover 11: stopped % 4.16/1.43 Prover 10: Constructing countermodel ... % 4.16/1.43 Prover 10: stopped % 4.16/1.43 Prover 7: Constructing countermodel ... % 4.16/1.43 Prover 7: stopped % 4.16/1.45 Prover 13: Warning: ignoring some quantifiers % 5.41/1.46 Prover 13: Constructing countermodel ... % 5.41/1.46 Prover 13: stopped % 5.41/1.46 Prover 8: Warning: ignoring some quantifiers % 5.41/1.47 Prover 8: Constructing countermodel ... % 5.41/1.47 Prover 8: stopped % 5.41/1.48 Prover 4: Constructing countermodel ... % 5.41/1.48 Prover 4: stopped % 5.41/1.48 % 5.41/1.48 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.41/1.48 % 5.41/1.48 % SZS output start Proof for theBenchmark % 5.41/1.49 Assumptions after simplification: % 5.41/1.49 --------------------------------- % 5.41/1.49 % 5.41/1.49 (conj_thm_2Ebool_2ETRUTH) % 5.41/1.49 $false % 5.41/1.49 % 5.41/1.49 Further assumptions not needed in the proof: % 5.41/1.49 -------------------------------------------- % 5.41/1.49 ap_tp, arr_ne, ax_eq_p, ax_thm_2Ebool_2ET__DEF, ax_true_p, bool_ne, boolext, % 5.41/1.49 funcext, ibeta, ind_ne, kbeta, mem_c_2Ebool_2ET, mem_c_2Emin_2E_3D % 5.41/1.49 % 5.41/1.49 Those formulas are unsatisfiable: % 5.41/1.49 --------------------------------- % 5.41/1.49 % 5.41/1.49 Begin of proof % 5.41/1.49 | % 5.41/1.49 | CLOSE: (conj_thm_2Ebool_2ETRUTH) is inconsistent. % 5.41/1.49 | % 5.41/1.49 End of proof % 5.41/1.49 % SZS output end Proof for theBenchmark % 5.41/1.49 % 5.41/1.49 883ms %------------------------------------------------------------------------------