%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : NUM576+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 : n005.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:42 EDT 2023 % Result : Theorem 18.34s 3.22s % Output : Proof 26.93s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : NUM576+1 : TPTP v8.1.2. Released v4.0.0. % 0.06/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.33 % Computer : n005.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 17:06:08 EDT 2023 % 0.12/0.33 % CPUTime : % 0.18/0.59 ________ _____ % 0.18/0.59 ___ __ \_________(_)________________________________ % 0.18/0.59 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.18/0.59 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.18/0.59 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.18/0.59 % 0.18/0.59 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.18/0.59 (2023-06-19) % 0.18/0.59 % 0.18/0.59 (c) Philipp Rümmer, 2009-2023 % 0.18/0.59 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.18/0.59 Amanda Stjerna. % 0.18/0.59 Free software under BSD-3-Clause. % 0.18/0.59 % 0.18/0.59 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.18/0.59 % 0.18/0.59 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.18/0.60 Running up to 7 provers in parallel. % 0.18/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.18/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.18/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.18/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.18/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.18/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.18/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 4.48/1.27 Prover 4: Preprocessing ... % 4.48/1.28 Prover 1: Preprocessing ... % 4.48/1.31 Prover 5: Preprocessing ... % 4.48/1.31 Prover 2: Preprocessing ... % 4.48/1.31 Prover 0: Preprocessing ... % 4.48/1.31 Prover 6: Preprocessing ... % 4.48/1.31 Prover 3: Preprocessing ... % 13.18/2.47 Prover 6: Proving ... % 13.18/2.47 Prover 3: Constructing countermodel ... % 13.18/2.47 Prover 1: Constructing countermodel ... % 13.18/2.50 Prover 5: Proving ... % 14.76/2.74 Prover 2: Proving ... % 18.34/3.13 Prover 4: Constructing countermodel ... % 18.34/3.16 Prover 0: Proving ... % 18.34/3.22 Prover 3: proved (2610ms) % 18.34/3.22 % 18.34/3.22 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 18.34/3.22 % 18.34/3.23 Prover 2: stopped % 18.34/3.23 Prover 5: stopped % 18.34/3.24 Prover 6: stopped % 18.34/3.24 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 18.34/3.24 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 18.34/3.24 Prover 0: stopped % 18.34/3.26 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 18.34/3.26 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 18.34/3.26 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 20.03/3.39 Prover 8: Preprocessing ... % 20.03/3.44 Prover 13: Preprocessing ... % 20.03/3.44 Prover 10: Preprocessing ... % 20.75/3.45 Prover 7: Preprocessing ... % 20.75/3.46 Prover 11: Preprocessing ... % 22.35/3.66 Prover 10: Constructing countermodel ... % 23.09/3.76 Prover 8: Warning: ignoring some quantifiers % 23.09/3.78 Prover 8: Constructing countermodel ... % 23.47/3.80 Prover 7: Constructing countermodel ... % 23.47/3.81 Prover 13: Warning: ignoring some quantifiers % 23.47/3.83 Prover 13: Constructing countermodel ... % 25.43/4.13 Prover 10: Found proof (size 12) % 25.43/4.13 Prover 10: proved (890ms) % 25.43/4.13 Prover 7: stopped % 25.43/4.13 Prover 4: stopped % 25.43/4.13 Prover 1: stopped % 25.43/4.13 Prover 13: stopped % 25.43/4.13 Prover 8: stopped % 26.54/4.30 Prover 11: Constructing countermodel ... % 26.75/4.32 Prover 11: stopped % 26.75/4.32 % 26.75/4.32 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 26.75/4.32 % 26.75/4.32 % SZS output start Proof for theBenchmark % 26.75/4.33 Assumptions after simplification: % 26.75/4.33 --------------------------------- % 26.75/4.33 % 26.75/4.33 (mLessASymm) % 26.75/4.34 $i(szNzAzT0) & ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ $i(v1) | ~ $i(v0) | % 26.75/4.34 ~ sdtlseqdt0(v1, v0) | ~ sdtlseqdt0(v0, v1) | ~ aElementOf0(v1, szNzAzT0) % 26.75/4.34 | ~ aElementOf0(v0, szNzAzT0)) % 26.75/4.34 % 26.75/4.34 (mLessTotal) % 26.93/4.37 $i(szNzAzT0) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (szszuzczcdt0(v1) % 26.93/4.37 = v2) | ~ $i(v1) | ~ $i(v0) | ~ aElementOf0(v1, szNzAzT0) | ~ % 26.93/4.37 aElementOf0(v0, szNzAzT0) | sdtlseqdt0(v2, v0) | sdtlseqdt0(v0, v1)) % 26.93/4.37 % 26.93/4.37 (m__) % 26.93/4.37 $i(xj) & $i(xi) & ? [v0: $i] : ? [v1: $i] : ( ~ (xj = xi) & szszuzczcdt0(xj) % 26.93/4.37 = v0 & szszuzczcdt0(xi) = v1 & $i(v1) & $i(v0) & ~ sdtlseqdt0(v1, xj) & ~ % 26.93/4.37 sdtlseqdt0(v0, xi)) % 26.93/4.37 % 26.93/4.37 (m__3856) % 26.93/4.38 $i(xj) & $i(xi) & $i(szNzAzT0) & aElementOf0(xj, szNzAzT0) & aElementOf0(xi, % 26.93/4.38 szNzAzT0) % 26.93/4.38 % 26.93/4.38 Further assumptions not needed in the proof: % 26.93/4.38 -------------------------------------------- % 26.93/4.38 mCConsSet, mCDiffSet, mCardCons, mCardDiff, mCardEmpty, mCardNum, mCardS, % 26.93/4.38 mCardSeg, mCardSub, mCardSubEx, mCntRel, mConsDiff, mCountNFin, mCountNFin_01, % 26.93/4.38 mDefCons, mDefDiff, mDefEmp, mDefMax, mDefMin, mDefPtt, mDefRst, mDefSImg, % 26.93/4.38 mDefSeg, mDefSel, mDefSub, mDiffCons, mDirichlet, mDomSet, mEOfElem, mElmSort, % 26.93/4.38 mEmpFin, mFConsSet, mFDiffSet, mFinRel, mFinSubSeg, mFunSort, mIH, mIHSort, % 26.93/4.38 mImgCount, mImgElm, mImgRng, mLessRefl, mLessRel, mLessSucc, mLessTrans, % 26.93/4.38 mMinMin, mNATSet, mNatExtra, mNatNSucc, mNoScLessZr, mPttSet, mSegFin, mSegLess, % 26.93/4.38 mSegSucc, mSegZero, mSelCSet, mSelExtra, mSelFSet, mSelNSet, mSelSub, mSetSort, % 26.93/4.38 mSubASymm, mSubFSet, mSubRefl, mSubTrans, mSuccEquSucc, mSuccLess, mSuccNum, % 26.93/4.38 mZeroLess, mZeroNum, m__3291, m__3398, m__3418, m__3435, m__3453, m__3462, % 26.93/4.38 m__3520, m__3533, m__3623, m__3671, m__3754 % 26.93/4.38 % 26.93/4.38 Those formulas are unsatisfiable: % 26.93/4.38 --------------------------------- % 26.93/4.38 % 26.93/4.38 Begin of proof % 26.93/4.38 | % 26.93/4.38 | ALPHA: (mLessASymm) implies: % 26.93/4.38 | (1) ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ $i(v1) | ~ $i(v0) | ~ % 26.93/4.38 | sdtlseqdt0(v1, v0) | ~ sdtlseqdt0(v0, v1) | ~ aElementOf0(v1, % 26.93/4.38 | szNzAzT0) | ~ aElementOf0(v0, szNzAzT0)) % 26.93/4.38 | % 26.93/4.38 | ALPHA: (mLessTotal) implies: % 26.93/4.38 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (szszuzczcdt0(v1) = v2) | % 26.93/4.38 | ~ $i(v1) | ~ $i(v0) | ~ aElementOf0(v1, szNzAzT0) | ~ % 26.93/4.38 | aElementOf0(v0, szNzAzT0) | sdtlseqdt0(v2, v0) | sdtlseqdt0(v0, v1)) % 26.93/4.38 | % 26.93/4.38 | ALPHA: (m__3856) implies: % 26.93/4.38 | (3) aElementOf0(xi, szNzAzT0) % 26.93/4.38 | (4) aElementOf0(xj, szNzAzT0) % 26.93/4.38 | % 26.93/4.38 | ALPHA: (m__) implies: % 26.93/4.38 | (5) $i(xi) % 26.93/4.38 | (6) $i(xj) % 26.93/4.38 | (7) ? [v0: $i] : ? [v1: $i] : ( ~ (xj = xi) & szszuzczcdt0(xj) = v0 & % 26.93/4.38 | szszuzczcdt0(xi) = v1 & $i(v1) & $i(v0) & ~ sdtlseqdt0(v1, xj) & ~ % 26.93/4.38 | sdtlseqdt0(v0, xi)) % 26.93/4.38 | % 26.93/4.38 | DELTA: instantiating (7) with fresh symbols all_70_0, all_70_1 gives: % 26.93/4.39 | (8) ~ (xj = xi) & szszuzczcdt0(xj) = all_70_1 & szszuzczcdt0(xi) = % 26.93/4.39 | all_70_0 & $i(all_70_0) & $i(all_70_1) & ~ sdtlseqdt0(all_70_0, xj) & % 26.93/4.39 | ~ sdtlseqdt0(all_70_1, xi) % 26.93/4.39 | % 26.93/4.39 | ALPHA: (8) implies: % 26.93/4.39 | (9) ~ (xj = xi) % 26.93/4.39 | (10) ~ sdtlseqdt0(all_70_1, xi) % 26.93/4.39 | (11) ~ sdtlseqdt0(all_70_0, xj) % 26.93/4.39 | (12) szszuzczcdt0(xi) = all_70_0 % 26.93/4.39 | (13) szszuzczcdt0(xj) = all_70_1 % 26.93/4.39 | % 26.93/4.39 | GROUND_INST: instantiating (2) with xj, xi, all_70_0, simplifying with (3), % 26.93/4.39 | (4), (5), (6), (11), (12) gives: % 26.93/4.39 | (14) sdtlseqdt0(xj, xi) % 26.93/4.39 | % 26.93/4.39 | GROUND_INST: instantiating (2) with xi, xj, all_70_1, simplifying with (3), % 26.93/4.39 | (4), (5), (6), (10), (13) gives: % 26.93/4.39 | (15) sdtlseqdt0(xi, xj) % 26.93/4.39 | % 26.93/4.39 | GROUND_INST: instantiating (1) with xi, xj, simplifying with (3), (4), (5), % 26.93/4.39 | (6), (14), (15) gives: % 26.93/4.39 | (16) xj = xi % 26.93/4.39 | % 26.93/4.39 | REDUCE: (9), (16) imply: % 26.93/4.39 | (17) $false % 26.93/4.39 | % 26.93/4.39 | CLOSE: (17) is inconsistent. % 26.93/4.39 | % 26.93/4.39 End of proof % 26.93/4.39 % SZS output end Proof for theBenchmark % 26.93/4.39 % 26.93/4.39 3802ms %------------------------------------------------------------------------------