%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : NUM614+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 : n023.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:59 EDT 2023 % Result : Theorem 42.31s 6.43s % Output : Proof 51.50s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.11 % Problem : NUM614+1 : TPTP v8.1.2. Released v4.0.0. % 0.07/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.33 % Computer : n023.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 300 % 0.12/0.33 % DateTime : Fri Aug 25 12:47:42 EDT 2023 % 0.12/0.33 % CPUTime : % 0.47/0.57 ________ _____ % 0.47/0.57 ___ __ \_________(_)________________________________ % 0.47/0.57 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.47/0.57 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.47/0.57 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.47/0.57 % 0.47/0.57 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.47/0.57 (2023-06-19) % 0.47/0.57 % 0.47/0.57 (c) Philipp Rümmer, 2009-2023 % 0.47/0.57 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.47/0.57 Amanda Stjerna. % 0.47/0.57 Free software under BSD-3-Clause. % 0.47/0.57 % 0.47/0.57 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.47/0.57 % 0.47/0.58 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.47/0.59 Running up to 7 provers in parallel. % 0.47/0.61 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.47/0.61 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.47/0.61 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.47/0.61 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 0.47/0.61 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.47/0.61 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.47/0.61 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 4.65/1.41 Prover 4: Preprocessing ... % 4.65/1.41 Prover 1: Preprocessing ... % 5.24/1.48 Prover 6: Preprocessing ... % 5.24/1.48 Prover 2: Preprocessing ... % 5.24/1.48 Prover 3: Preprocessing ... % 5.24/1.48 Prover 5: Preprocessing ... % 5.24/1.48 Prover 0: Preprocessing ... % 16.89/3.08 Prover 1: Constructing countermodel ... % 16.89/3.09 Prover 3: Constructing countermodel ... % 18.18/3.23 Prover 6: Proving ... % 19.59/3.41 Prover 5: Proving ... % 20.82/3.58 Prover 2: Proving ... % 26.94/4.38 Prover 4: Constructing countermodel ... % 28.29/4.55 Prover 0: Proving ... % 42.31/6.43 Prover 2: proved (5820ms) % 42.31/6.43 % 42.31/6.43 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 42.31/6.43 % 42.31/6.43 Prover 6: stopped % 42.31/6.45 Prover 5: stopped % 42.31/6.46 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 42.31/6.46 Prover 3: stopped % 42.31/6.46 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 42.31/6.46 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 42.31/6.46 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 42.31/6.48 Prover 0: stopped % 42.31/6.48 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 44.02/6.66 Prover 8: Preprocessing ... % 44.02/6.66 Prover 10: Preprocessing ... % 44.02/6.68 Prover 11: Preprocessing ... % 44.02/6.69 Prover 13: Preprocessing ... % 44.02/6.69 Prover 7: Preprocessing ... % 46.30/7.00 Prover 10: Constructing countermodel ... % 47.03/7.04 Prover 7: Constructing countermodel ... % 47.70/7.13 Prover 13: Warning: ignoring some quantifiers % 47.70/7.14 Prover 8: Warning: ignoring some quantifiers % 47.70/7.16 Prover 13: Constructing countermodel ... % 47.70/7.17 Prover 8: Constructing countermodel ... % 48.71/7.31 Prover 10: Found proof (size 13) % 48.71/7.31 Prover 10: proved (849ms) % 48.71/7.31 Prover 13: stopped % 48.71/7.31 Prover 1: stopped % 48.71/7.31 Prover 8: stopped % 48.71/7.31 Prover 4: stopped % 48.71/7.32 Prover 7: stopped % 51.27/7.80 Prover 11: Constructing countermodel ... % 51.38/7.83 Prover 11: stopped % 51.38/7.83 % 51.38/7.83 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 51.38/7.83 % 51.38/7.83 % SZS output start Proof for theBenchmark % 51.38/7.84 Assumptions after simplification: % 51.38/7.84 --------------------------------- % 51.38/7.84 % 51.38/7.84 (mDefSel) % 51.50/7.87 $i(szNzAzT0) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: % 51.50/7.87 $i] : (v4 = v1 | ~ (slbdtsldtrb0(v0, v1) = v2) | ~ (sbrdtbr0(v3) = v4) | % 51.50/7.87 ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ aElementOf0(v3, v2) | ~ % 51.50/7.87 aElementOf0(v1, szNzAzT0) | ~ aSet0(v0)) & ! [v0: $i] : ! [v1: $i] : ! % 51.50/7.87 [v2: $i] : ! [v3: $i] : ! [v4: $i] : ( ~ (slbdtsldtrb0(v0, v1) = v2) | ~ % 51.50/7.87 (sbrdtbr0(v3) = v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ % 51.50/7.87 aElementOf0(v3, v2) | ~ aElementOf0(v1, szNzAzT0) | ~ aSet0(v0) | % 51.50/7.87 aSubsetOf0(v3, v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] % 51.50/7.87 : (v3 = v2 | ~ (slbdtsldtrb0(v0, v1) = v2) | ~ $i(v3) | ~ $i(v1) | ~ % 51.50/7.87 $i(v0) | ~ aElementOf0(v1, szNzAzT0) | ~ aSet0(v3) | ~ aSet0(v0) | ? % 51.50/7.87 [v4: $i] : ? [v5: $i] : ($i(v4) & ( ~ aSubsetOf0(v4, v0) | ~ % 51.50/7.87 aElementOf0(v4, v3) | ( ~ (v5 = v1) & sbrdtbr0(v4) = v5 & $i(v5))) & % 51.50/7.87 (aElementOf0(v4, v3) | (v5 = v1 & sbrdtbr0(v4) = v1 & aSubsetOf0(v4, % 51.50/7.87 v0))))) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( % 51.50/7.87 ~ (slbdtsldtrb0(v0, v1) = v2) | ~ (sbrdtbr0(v3) = v1) | ~ $i(v3) | ~ % 51.50/7.87 $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ aSubsetOf0(v3, v0) | ~ aElementOf0(v1, % 51.50/7.87 szNzAzT0) | ~ aSet0(v0) | aElementOf0(v3, v2)) & ! [v0: $i] : ! [v1: % 51.50/7.87 $i] : ! [v2: $i] : ( ~ (slbdtsldtrb0(v0, v1) = v2) | ~ $i(v2) | ~ $i(v1) % 51.50/7.87 | ~ $i(v0) | ~ aElementOf0(v1, szNzAzT0) | ~ aSet0(v0) | aSet0(v2)) % 51.50/7.87 % 51.50/7.87 (m__) % 51.50/7.87 $i(xP) & $i(xO) & $i(xk) & ? [v0: $i] : (slbdtsldtrb0(xO, xk) = v0 & $i(v0) & % 51.50/7.87 ~ aElementOf0(xP, v0)) % 51.50/7.87 % 51.50/7.87 (m__3533) % 51.50/7.87 szszuzczcdt0(xk) = xK & $i(xk) & $i(xK) & $i(szNzAzT0) & aElementOf0(xk, % 51.50/7.88 szNzAzT0) % 51.50/7.88 % 51.50/7.88 (m__4891) % 51.50/7.88 $i(xO) & $i(xd) & $i(xe) & ? [v0: $i] : ? [v1: $i] : (szDzizrdt0(xd) = v0 & % 51.50/7.88 sdtlcdtrc0(xe, v1) = xO & sdtlbdtrb0(xd, v0) = v1 & $i(v1) & $i(v0) & % 51.50/7.88 aSet0(xO)) % 51.50/7.88 % 51.50/7.88 (m__5208) % 51.50/7.88 $i(xP) & $i(xO) & aSubsetOf0(xP, xO) % 51.50/7.88 % 51.50/7.88 (m__5217) % 51.50/7.88 sbrdtbr0(xP) = xk & $i(xP) & $i(xk) % 51.50/7.88 % 51.50/7.88 Further assumptions not needed in the proof: % 51.50/7.88 -------------------------------------------- % 51.50/7.88 mCConsSet, mCDiffSet, mCardCons, mCardDiff, mCardEmpty, mCardNum, mCardS, % 51.50/7.88 mCardSeg, mCardSub, mCardSubEx, mCntRel, mConsDiff, mCountNFin, mCountNFin_01, % 51.50/7.88 mDefCons, mDefDiff, mDefEmp, mDefMax, mDefMin, mDefPtt, mDefRst, mDefSImg, % 51.50/7.88 mDefSeg, mDefSub, mDiffCons, mDirichlet, mDomSet, mEOfElem, mElmSort, mEmpFin, % 51.50/7.88 mFConsSet, mFDiffSet, mFinRel, mFinSubSeg, mFunSort, mIH, mIHSort, mImgCount, % 51.50/7.88 mImgElm, mImgRng, mLessASymm, mLessRefl, mLessRel, mLessSucc, mLessTotal, % 51.50/7.88 mLessTrans, mMinMin, mNATSet, mNatExtra, mNatNSucc, mNoScLessZr, mPttSet, % 51.50/7.88 mSegFin, mSegLess, mSegSucc, mSegZero, mSelCSet, mSelExtra, mSelFSet, mSelNSet, % 51.50/7.88 mSelSub, mSetSort, mSubASymm, mSubFSet, mSubRefl, mSubTrans, mSuccEquSucc, % 51.50/7.88 mSuccLess, mSuccNum, mZeroLess, mZeroNum, m__3291, m__3398, m__3418, m__3435, % 51.50/7.88 m__3453, m__3462, m__3520, m__3623, m__3671, m__3754, m__3821, m__3965, m__4151, % 51.50/7.88 m__4182, m__4331, m__4411, m__4618, m__4660, m__4730, m__4758, m__4854, m__4908, % 51.50/7.88 m__4982, m__4998, m__5078, m__5093, m__5106, m__5116, m__5147, m__5164, m__5173, % 51.50/7.88 m__5182, m__5195 % 51.50/7.88 % 51.50/7.88 Those formulas are unsatisfiable: % 51.50/7.88 --------------------------------- % 51.50/7.88 % 51.50/7.88 Begin of proof % 51.50/7.88 | % 51.50/7.88 | ALPHA: (mDefSel) implies: % 51.50/7.88 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ % 51.50/7.88 | (slbdtsldtrb0(v0, v1) = v2) | ~ (sbrdtbr0(v3) = v1) | ~ $i(v3) | ~ % 51.50/7.88 | $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ aSubsetOf0(v3, v0) | ~ % 51.50/7.88 | aElementOf0(v1, szNzAzT0) | ~ aSet0(v0) | aElementOf0(v3, v2)) % 51.50/7.88 | % 51.50/7.88 | ALPHA: (m__3533) implies: % 51.50/7.88 | (2) aElementOf0(xk, szNzAzT0) % 51.50/7.88 | % 51.50/7.88 | ALPHA: (m__4891) implies: % 51.50/7.89 | (3) ? [v0: $i] : ? [v1: $i] : (szDzizrdt0(xd) = v0 & sdtlcdtrc0(xe, v1) = % 51.50/7.89 | xO & sdtlbdtrb0(xd, v0) = v1 & $i(v1) & $i(v0) & aSet0(xO)) % 51.50/7.89 | % 51.50/7.89 | ALPHA: (m__5208) implies: % 51.50/7.89 | (4) aSubsetOf0(xP, xO) % 51.50/7.89 | % 51.50/7.89 | ALPHA: (m__5217) implies: % 51.50/7.89 | (5) sbrdtbr0(xP) = xk % 51.50/7.89 | % 51.50/7.89 | ALPHA: (m__) implies: % 51.50/7.89 | (6) $i(xk) % 51.50/7.89 | (7) $i(xO) % 51.50/7.89 | (8) $i(xP) % 51.50/7.89 | (9) ? [v0: $i] : (slbdtsldtrb0(xO, xk) = v0 & $i(v0) & ~ aElementOf0(xP, % 51.50/7.89 | v0)) % 51.50/7.89 | % 51.50/7.89 | DELTA: instantiating (9) with fresh symbol all_78_0 gives: % 51.50/7.89 | (10) slbdtsldtrb0(xO, xk) = all_78_0 & $i(all_78_0) & ~ aElementOf0(xP, % 51.50/7.89 | all_78_0) % 51.50/7.89 | % 51.50/7.89 | ALPHA: (10) implies: % 51.50/7.89 | (11) ~ aElementOf0(xP, all_78_0) % 51.50/7.89 | (12) $i(all_78_0) % 51.50/7.89 | (13) slbdtsldtrb0(xO, xk) = all_78_0 % 51.50/7.89 | % 51.50/7.89 | DELTA: instantiating (3) with fresh symbols all_88_0, all_88_1 gives: % 51.50/7.89 | (14) szDzizrdt0(xd) = all_88_1 & sdtlcdtrc0(xe, all_88_0) = xO & % 51.50/7.89 | sdtlbdtrb0(xd, all_88_1) = all_88_0 & $i(all_88_0) & $i(all_88_1) & % 51.50/7.89 | aSet0(xO) % 51.50/7.89 | % 51.50/7.89 | ALPHA: (14) implies: % 51.50/7.89 | (15) aSet0(xO) % 51.50/7.89 | % 51.50/7.89 | GROUND_INST: instantiating (1) with xO, xk, all_78_0, xP, simplifying with % 51.50/7.89 | (2), (4), (5), (6), (7), (8), (11), (12), (13), (15) gives: % 51.50/7.89 | (16) $false % 51.50/7.89 | % 51.50/7.89 | CLOSE: (16) is inconsistent. % 51.50/7.89 | % 51.50/7.89 End of proof % 51.50/7.89 % SZS output end Proof for theBenchmark % 51.50/7.90 % 51.50/7.90 7318ms %------------------------------------------------------------------------------