%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : NUM634+1 : TPTP v8.1.2. Released v4.0.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n022.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:49:07 EDT 2023 % Result : Theorem 9.81s 2.12s % Output : Proof 18.70s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.14 % Problem : NUM634+1 : TPTP v8.1.2. Released v4.0.0. % 0.00/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.15/0.36 % Computer : n022.cluster.edu % 0.15/0.36 % Model : x86_64 x86_64 % 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.36 % Memory : 8042.1875MB % 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.36 % CPULimit : 300 % 0.15/0.36 % WCLimit : 300 % 0.15/0.36 % DateTime : Fri Aug 25 14:51:10 EDT 2023 % 0.15/0.36 % CPUTime : % 0.23/0.63 ________ _____ % 0.23/0.63 ___ __ \_________(_)________________________________ % 0.23/0.63 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.23/0.63 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.23/0.63 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.23/0.63 % 0.23/0.63 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.23/0.63 (2023-06-19) % 0.23/0.63 % 0.23/0.63 (c) Philipp Rümmer, 2009-2023 % 0.23/0.63 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.23/0.63 Amanda Stjerna. % 0.23/0.63 Free software under BSD-3-Clause. % 0.23/0.63 % 0.23/0.63 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.23/0.63 % 0.23/0.63 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.23/0.65 Running up to 7 provers in parallel. % 0.23/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.23/0.66 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.23/0.66 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.23/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.23/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.23/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 0.23/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 4.25/1.34 Prover 4: Preprocessing ... % 4.25/1.34 Prover 1: Preprocessing ... % 4.25/1.37 Prover 0: Preprocessing ... % 4.25/1.37 Prover 3: Preprocessing ... % 4.25/1.37 Prover 2: Preprocessing ... % 4.25/1.37 Prover 5: Preprocessing ... % 4.25/1.37 Prover 6: Preprocessing ... % 9.08/2.09 Prover 3: Constructing countermodel ... % 9.08/2.09 Prover 6: Constructing countermodel ... % 9.81/2.11 Prover 5: Constructing countermodel ... % 9.81/2.12 Prover 3: proved (1458ms) % 9.81/2.12 % 9.81/2.12 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 9.81/2.12 % 9.81/2.12 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 9.81/2.12 Prover 5: stopped % 9.81/2.12 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 9.81/2.12 Prover 6: proved (1462ms) % 9.81/2.12 % 9.81/2.12 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 9.81/2.12 % 9.81/2.12 Prover 0: stopped % 9.81/2.13 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 9.81/2.14 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 11.29/2.34 Prover 10: Preprocessing ... % 11.29/2.36 Prover 7: Preprocessing ... % 11.29/2.38 Prover 11: Preprocessing ... % 11.29/2.41 Prover 8: Preprocessing ... % 11.29/2.41 Prover 2: Constructing countermodel ... % 11.29/2.41 Prover 2: stopped % 11.29/2.41 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 12.79/2.55 Prover 13: Preprocessing ... % 14.26/2.77 Prover 1: Constructing countermodel ... % 15.03/2.85 Prover 10: Constructing countermodel ... % 15.03/2.87 Prover 7: Constructing countermodel ... % 15.03/2.89 Prover 1: Found proof (size 4) % 15.03/2.89 Prover 1: proved (2233ms) % 15.82/2.92 Prover 10: stopped % 15.82/2.92 Prover 7: stopped % 15.82/2.97 Prover 8: Warning: ignoring some quantifiers % 15.82/2.99 Prover 8: Constructing countermodel ... % 16.55/3.00 Prover 13: Warning: ignoring some quantifiers % 16.55/3.02 Prover 8: stopped % 16.55/3.03 Prover 13: Constructing countermodel ... % 16.55/3.06 Prover 13: stopped % 17.19/3.24 Prover 4: Constructing countermodel ... % 17.19/3.27 Prover 4: stopped % 18.27/3.35 Prover 11: Constructing countermodel ... % 18.27/3.38 Prover 11: stopped % 18.27/3.38 % 18.27/3.38 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 18.27/3.38 % 18.27/3.38 % SZS output start Proof for theBenchmark % 18.27/3.39 Assumptions after simplification: % 18.27/3.39 --------------------------------- % 18.27/3.39 % 18.27/3.39 (m__3462) % 18.27/3.39 ~ (xK = sz00) & $i(xK) & $i(sz00) % 18.27/3.39 % 18.27/3.40 (m__3520) % 18.27/3.40 xK = sz00 & $i(sz00) % 18.27/3.40 % 18.27/3.40 Further assumptions not needed in the proof: % 18.27/3.40 -------------------------------------------- % 18.27/3.40 mCConsSet, mCDiffSet, mCardCons, mCardDiff, mCardEmpty, mCardNum, mCardS, % 18.27/3.40 mCardSeg, mCardSub, mCardSubEx, mCntRel, mConsDiff, mCountNFin, mCountNFin_01, % 18.27/3.40 mDefCons, mDefDiff, mDefEmp, mDefMax, mDefMin, mDefPtt, mDefRst, mDefSImg, % 18.27/3.40 mDefSeg, mDefSel, mDefSub, mDiffCons, mDirichlet, mDomSet, mEOfElem, mElmSort, % 18.27/3.40 mEmpFin, mFConsSet, mFDiffSet, mFinRel, mFinSubSeg, mFunSort, mIH, mIHSort, % 18.27/3.40 mImgCount, mImgElm, mImgRng, mLessASymm, mLessRefl, mLessRel, mLessSucc, % 18.27/3.40 mLessTotal, mLessTrans, mMinMin, mNATSet, mNatExtra, mNatNSucc, mNoScLessZr, % 18.27/3.40 mPttSet, mSegFin, mSegLess, mSegSucc, mSegZero, mSelCSet, mSelExtra, mSelFSet, % 18.27/3.40 mSelNSet, mSelSub, mSetSort, mSubASymm, mSubFSet, mSubRefl, mSubTrans, % 18.27/3.40 mSuccEquSucc, mSuccLess, mSuccNum, mZeroLess, mZeroNum, m__, m__3291, m__3398, % 18.27/3.40 m__3418, m__3435, m__3453 % 18.27/3.40 % 18.27/3.40 Those formulas are unsatisfiable: % 18.27/3.40 --------------------------------- % 18.27/3.40 % 18.27/3.40 Begin of proof % 18.70/3.40 | % 18.70/3.40 | ALPHA: (m__3462) implies: % 18.70/3.40 | (1) ~ (xK = sz00) % 18.70/3.40 | % 18.70/3.40 | ALPHA: (m__3520) implies: % 18.70/3.40 | (2) xK = sz00 % 18.70/3.40 | % 18.70/3.40 | REDUCE: (1), (2) imply: % 18.70/3.40 | (3) $false % 18.70/3.40 | % 18.70/3.40 | CLOSE: (3) is inconsistent. % 18.70/3.40 | % 18.70/3.40 End of proof % 18.70/3.40 % SZS output end Proof for theBenchmark % 18.70/3.40 % 18.70/3.41 2770ms %------------------------------------------------------------------------------