%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : NUM634+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 : n031.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 12.84s 2.71s % Output : Proof 27.54s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : NUM634+3 : TPTP v8.1.2. Released v4.0.0. % 0.12/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.34 % Computer : n031.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 : Fri Aug 25 13:21:07 EDT 2023 % 0.20/0.35 % CPUTime : % 0.20/0.66 ________ _____ % 0.20/0.66 ___ __ \_________(_)________________________________ % 0.20/0.66 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.66 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.66 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.66 % 0.20/0.66 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.66 (2023-06-19) % 0.20/0.66 % 0.20/0.66 (c) Philipp Rümmer, 2009-2023 % 0.20/0.66 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.66 Amanda Stjerna. % 0.20/0.66 Free software under BSD-3-Clause. % 0.20/0.66 % 0.20/0.66 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.66 % 0.20/0.66 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.20/0.68 Running up to 7 provers in parallel. % 0.20/0.69 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.69 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.69 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.69 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.69 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.69 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.69 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 4.86/1.50 Prover 4: Preprocessing ... % 4.86/1.50 Prover 1: Preprocessing ... % 4.86/1.54 Prover 6: Preprocessing ... % 4.86/1.54 Prover 0: Preprocessing ... % 5.53/1.54 Prover 2: Preprocessing ... % 5.53/1.55 Prover 5: Preprocessing ... % 5.53/1.55 Prover 3: Preprocessing ... % 12.37/2.65 Prover 6: Constructing countermodel ... % 12.37/2.65 Prover 5: Constructing countermodel ... % 12.37/2.65 Prover 3: Constructing countermodel ... % 12.84/2.71 Prover 5: proved (2019ms) % 12.84/2.71 Prover 3: proved (2021ms) % 12.84/2.71 % 12.84/2.71 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 12.84/2.71 % 12.84/2.71 % 12.84/2.71 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 12.84/2.71 % 12.84/2.71 Prover 6: proved (2021ms) % 12.84/2.71 % 12.84/2.71 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 12.84/2.71 % 12.84/2.72 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 12.84/2.72 Prover 0: stopped % 12.84/2.72 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 12.84/2.72 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 12.84/2.72 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 16.24/3.06 Prover 2: Constructing countermodel ... % 16.24/3.06 Prover 2: stopped % 16.24/3.06 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 16.24/3.07 Prover 7: Preprocessing ... % 16.24/3.08 Prover 10: Preprocessing ... % 16.24/3.08 Prover 11: Preprocessing ... % 16.60/3.11 Prover 8: Preprocessing ... % 17.75/3.26 Prover 1: Constructing countermodel ... % 18.13/3.31 Prover 13: Preprocessing ... % 18.69/3.56 Prover 1: Found proof (size 4) % 18.69/3.56 Prover 1: proved (2883ms) % 18.69/3.58 Prover 13: stopped % 20.16/3.61 Prover 11: stopped % 22.03/3.85 Prover 7: Constructing countermodel ... % 22.03/3.86 Prover 8: Warning: ignoring some quantifiers % 22.21/3.92 Prover 7: stopped % 22.21/3.93 Prover 8: Constructing countermodel ... % 22.73/3.97 Prover 8: stopped % 23.17/4.03 Prover 10: Constructing countermodel ... % 23.17/4.09 Prover 10: stopped % 27.54/5.04 Prover 4: Constructing countermodel ... % 27.54/5.08 Prover 4: stopped % 27.54/5.08 % 27.54/5.08 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 27.54/5.08 % 27.54/5.08 % SZS output start Proof for theBenchmark % 27.54/5.09 Assumptions after simplification: % 27.54/5.09 --------------------------------- % 27.54/5.09 % 27.54/5.09 (m__3462) % 27.54/5.10 ~ (xK = sz00) & $i(xK) & $i(sz00) % 27.54/5.10 % 27.54/5.10 (m__3520) % 27.54/5.10 xK = sz00 & $i(sz00) % 27.54/5.10 % 27.54/5.10 Further assumptions not needed in the proof: % 27.54/5.10 -------------------------------------------- % 27.54/5.10 mCConsSet, mCDiffSet, mCardCons, mCardDiff, mCardEmpty, mCardNum, mCardS, % 27.54/5.10 mCardSeg, mCardSub, mCardSubEx, mCntRel, mConsDiff, mCountNFin, mCountNFin_01, % 27.54/5.10 mDefCons, mDefDiff, mDefEmp, mDefMax, mDefMin, mDefPtt, mDefRst, mDefSImg, % 27.54/5.10 mDefSeg, mDefSel, mDefSub, mDiffCons, mDirichlet, mDomSet, mEOfElem, mElmSort, % 27.54/5.10 mEmpFin, mFConsSet, mFDiffSet, mFinRel, mFinSubSeg, mFunSort, mIH, mIHSort, % 27.54/5.10 mImgCount, mImgElm, mImgRng, mLessASymm, mLessRefl, mLessRel, mLessSucc, % 27.54/5.10 mLessTotal, mLessTrans, mMinMin, mNATSet, mNatExtra, mNatNSucc, mNoScLessZr, % 27.54/5.10 mPttSet, mSegFin, mSegLess, mSegSucc, mSegZero, mSelCSet, mSelExtra, mSelFSet, % 27.54/5.10 mSelNSet, mSelSub, mSetSort, mSubASymm, mSubFSet, mSubRefl, mSubTrans, % 27.54/5.10 mSuccEquSucc, mSuccLess, mSuccNum, mZeroLess, mZeroNum, m__, m__3291, m__3398, % 27.54/5.11 m__3418, m__3435, m__3453 % 27.54/5.11 % 27.54/5.11 Those formulas are unsatisfiable: % 27.54/5.11 --------------------------------- % 27.54/5.11 % 27.54/5.11 Begin of proof % 27.54/5.11 | % 27.54/5.11 | ALPHA: (m__3462) implies: % 27.54/5.11 | (1) ~ (xK = sz00) % 27.54/5.11 | % 27.54/5.11 | ALPHA: (m__3520) implies: % 27.54/5.11 | (2) xK = sz00 % 27.54/5.11 | % 27.54/5.11 | REDUCE: (1), (2) imply: % 27.54/5.11 | (3) $false % 27.54/5.11 | % 27.54/5.11 | CLOSE: (3) is inconsistent. % 27.54/5.11 | % 27.54/5.11 End of proof % 27.54/5.11 % SZS output end Proof for theBenchmark % 27.54/5.11 % 27.54/5.11 4450ms %------------------------------------------------------------------------------