%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : NUM530+3 : TPTP v8.1.2. Released v4.0.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n007.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 11:48:25 EDT 2023 % Result : Theorem 4.28s 1.37s % Output : Proof 11.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : NUM530+3 : TPTP v8.1.2. Released v4.0.0. % 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n007.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 300 % 0.13/0.34 % DateTime : Fri Aug 25 07:45:56 EDT 2023 % 0.13/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 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 0.52/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 3.31/1.26 Prover 4: Preprocessing ... % 3.31/1.26 Prover 1: Preprocessing ... % 3.69/1.30 Prover 2: Preprocessing ... % 3.69/1.30 Prover 3: Preprocessing ... % 3.69/1.30 Prover 0: Preprocessing ... % 3.69/1.30 Prover 5: Preprocessing ... % 3.69/1.30 Prover 6: Preprocessing ... % 4.28/1.34 Prover 3: Constructing countermodel ... % 4.28/1.34 Prover 2: Constructing countermodel ... % 4.28/1.34 Prover 6: Constructing countermodel ... % 4.28/1.34 Prover 5: Constructing countermodel ... % 4.28/1.34 Prover 0: Constructing countermodel ... % 4.28/1.37 Prover 5: proved (736ms) % 4.28/1.37 Prover 6: proved (738ms) % 4.28/1.37 % 4.28/1.37 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.28/1.37 % 4.28/1.38 % 4.28/1.38 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.28/1.38 % 4.28/1.39 Prover 0: proved (743ms) % 4.28/1.39 % 4.28/1.39 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.28/1.39 % 4.28/1.39 Prover 3: proved (742ms) % 4.28/1.39 % 4.28/1.39 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.28/1.39 % 4.28/1.39 Prover 2: proved (744ms) % 4.28/1.39 % 4.28/1.39 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.28/1.39 % 4.28/1.40 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 4.28/1.40 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 4.28/1.40 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 4.28/1.40 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 4.28/1.40 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 5.58/1.57 Prover 7: Preprocessing ... % 6.41/1.61 Prover 13: Preprocessing ... % 6.41/1.61 Prover 10: Preprocessing ... % 6.50/1.61 Prover 8: Preprocessing ... % 6.50/1.62 Prover 11: Preprocessing ... % 9.50/2.04 Prover 1: Constructing countermodel ... % 9.50/2.05 Prover 1: Found proof (size 1) % 9.50/2.05 Prover 1: proved (1424ms) % 9.50/2.05 Prover 11: stopped % 9.50/2.06 Prover 10: Constructing countermodel ... % 9.50/2.06 Prover 10: stopped % 9.50/2.09 Prover 8: Warning: ignoring some quantifiers % 9.50/2.10 Prover 8: Constructing countermodel ... % 9.50/2.10 Prover 8: stopped % 10.16/2.12 Prover 13: Constructing countermodel ... % 10.16/2.12 Prover 13: stopped % 10.16/2.13 Prover 7: Constructing countermodel ... % 10.16/2.13 Prover 7: stopped % 11.13/2.37 Prover 4: Constructing countermodel ... % 11.13/2.37 Prover 4: stopped % 11.13/2.37 % 11.13/2.37 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 11.13/2.37 % 11.13/2.37 % SZS output start Proof for theBenchmark % 11.13/2.38 Assumptions after simplification: % 11.13/2.38 --------------------------------- % 11.13/2.38 % 11.13/2.38 (m__3161) % 11.13/2.39 $false % 11.13/2.39 % 11.13/2.39 Further assumptions not needed in the proof: % 11.13/2.39 -------------------------------------------- % 11.13/2.39 mAMDistr, mAddAsso, mAddCanc, mAddComm, mDefDiff, mDefDiv, mDefLE, mDefPrime, % 11.13/2.39 mDefQuot, mDivAsso, mDivLE, mDivMin, mDivSum, mDivTrans, mIH, mIH_03, mLEAsym, % 11.13/2.39 mLENTr, mLERefl, mLETotal, mLETran, mMonAdd, mMonMul, mMonMul2, mMulAsso, % 11.13/2.39 mMulCanc, mMulComm, mNatSort, mPDP, mPrimDiv, mSortsB, mSortsB_02, mSortsC, % 11.13/2.39 mSortsC_01, mZeroAdd, mZeroMul, m_AddZero, m_MulUnit, m_MulZero, m__, m__2963, % 11.13/2.39 m__2987, m__3014, m__3025, m__3046, m__3059, m__3082, m__3124 % 11.13/2.39 % 11.13/2.39 Those formulas are unsatisfiable: % 11.13/2.39 --------------------------------- % 11.13/2.39 % 11.13/2.39 Begin of proof % 11.13/2.39 | % 11.13/2.39 | CLOSE: (m__3161) is inconsistent. % 11.13/2.39 | % 11.13/2.39 End of proof % 11.13/2.39 % SZS output end Proof for theBenchmark % 11.13/2.39 % 11.13/2.39 1781ms %------------------------------------------------------------------------------