%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : NUM484+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 : 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 11:48:05 EDT 2023 % Result : Theorem 5.36s 1.50s % Output : Proof 11.01s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : NUM484+3 : TPTP v8.1.2. Released v4.0.0. % 0.07/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.15/0.35 % Computer : n013.cluster.edu % 0.15/0.35 % Model : x86_64 x86_64 % 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.35 % Memory : 8042.1875MB % 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.35 % CPULimit : 300 % 0.15/0.35 % WCLimit : 300 % 0.15/0.35 % DateTime : Fri Aug 25 08:24:32 EDT 2023 % 0.15/0.35 % CPUTime : % 0.21/0.62 ________ _____ % 0.21/0.62 ___ __ \_________(_)________________________________ % 0.21/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.62 % 0.21/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.62 (2023-06-19) % 0.21/0.62 % 0.21/0.62 (c) Philipp Rümmer, 2009-2023 % 0.21/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.62 Amanda Stjerna. % 0.21/0.62 Free software under BSD-3-Clause. % 0.21/0.62 % 0.21/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.62 % 0.21/0.62 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.21/0.63 Running up to 7 provers in parallel. % 0.21/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 3.75/1.25 Prover 1: Preprocessing ... % 3.75/1.25 Prover 4: Preprocessing ... % 4.03/1.29 Prover 5: Preprocessing ... % 4.03/1.29 Prover 6: Preprocessing ... % 4.03/1.29 Prover 0: Preprocessing ... % 4.03/1.29 Prover 2: Preprocessing ... % 4.03/1.29 Prover 3: Preprocessing ... % 4.03/1.46 Prover 5: Constructing countermodel ... % 4.03/1.46 Prover 6: Constructing countermodel ... % 4.03/1.47 Prover 3: Constructing countermodel ... % 4.03/1.47 Prover 2: Constructing countermodel ... % 5.36/1.50 Prover 3: proved (858ms) % 5.36/1.50 % 5.36/1.50 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.36/1.50 % 5.36/1.50 Prover 5: proved (850ms) % 5.36/1.50 % 5.36/1.50 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.36/1.50 % 5.36/1.50 Prover 2: proved (857ms) % 5.36/1.50 % 5.36/1.50 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.36/1.51 % 5.36/1.51 Prover 6: proved (853ms) % 5.36/1.51 % 5.36/1.51 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.36/1.51 % 5.36/1.51 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.36/1.51 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 5.36/1.51 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 5.36/1.52 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 5.82/1.55 Prover 0: Constructing countermodel ... % 5.82/1.55 Prover 0: stopped % 5.86/1.57 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 6.51/1.68 Prover 11: Preprocessing ... % 6.51/1.69 Prover 10: Preprocessing ... % 6.51/1.70 Prover 7: Preprocessing ... % 6.51/1.70 Prover 8: Preprocessing ... % 6.51/1.73 Prover 13: Preprocessing ... % 8.51/2.00 Prover 1: Constructing countermodel ... % 8.51/2.01 Prover 1: Found proof (size 1) % 8.51/2.01 Prover 1: proved (1369ms) % 8.51/2.01 Prover 11: stopped % 9.08/2.10 Prover 10: Constructing countermodel ... % 9.08/2.10 Prover 10: stopped % 9.08/2.12 Prover 8: Warning: ignoring some quantifiers % 9.08/2.13 Prover 13: Constructing countermodel ... % 9.08/2.13 Prover 13: stopped % 9.08/2.13 Prover 8: Constructing countermodel ... % 9.08/2.13 Prover 8: stopped % 9.08/2.14 Prover 7: Constructing countermodel ... % 9.08/2.14 Prover 7: stopped % 10.76/2.29 Prover 4: Constructing countermodel ... % 10.76/2.29 Prover 4: stopped % 10.76/2.29 % 10.76/2.29 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 10.76/2.29 % 10.76/2.29 % SZS output start Proof for theBenchmark % 10.76/2.30 Assumptions after simplification: % 10.76/2.30 --------------------------------- % 10.76/2.30 % 10.76/2.30 (m__1737) % 11.01/2.30 $false % 11.01/2.30 % 11.01/2.30 Further assumptions not needed in the proof: % 11.01/2.30 -------------------------------------------- % 11.01/2.30 mAMDistr, mAddAsso, mAddCanc, mAddComm, mDefDiff, mDefDiv, mDefLE, mDefPrime, % 11.01/2.30 mDefQuot, mDivAsso, mDivLE, mDivMin, mDivSum, mDivTrans, mIH, mIH_03, mLEAsym, % 11.01/2.30 mLENTr, mLERefl, mLETotal, mLETran, mMonAdd, mMonMul, mMonMul2, mMulAsso, % 11.01/2.30 mMulCanc, mMulComm, mNatSort, mSortsB, mSortsB_02, mSortsC, mSortsC_01, % 11.01/2.30 mZeroAdd, mZeroMul, m_AddZero, m_MulUnit, m_MulZero, m__, m__1700, m__1716, % 11.01/2.30 m__1716_04, m__1725 % 11.01/2.30 % 11.01/2.30 Those formulas are unsatisfiable: % 11.01/2.30 --------------------------------- % 11.01/2.30 % 11.01/2.30 Begin of proof % 11.01/2.31 | % 11.01/2.31 | CLOSE: (m__1737) is inconsistent. % 11.01/2.31 | % 11.01/2.31 End of proof % 11.01/2.31 % SZS output end Proof for theBenchmark % 11.01/2.31 % 11.01/2.31 1683ms %------------------------------------------------------------------------------