%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : NUM551+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 : n011.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:34 EDT 2023 % Result : Theorem 28.09s 4.66s % Output : Proof 38.86s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : NUM551+3 : TPTP v8.1.2. Released v4.0.0. % 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.35 % Computer : n011.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 300 % 0.14/0.35 % DateTime : Fri Aug 25 09:41:38 EDT 2023 % 0.14/0.35 % CPUTime : % 0.21/0.61 ________ _____ % 0.21/0.61 ___ __ \_________(_)________________________________ % 0.21/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.61 % 0.21/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.61 (2023-06-19) % 0.21/0.61 % 0.21/0.61 (c) Philipp Rümmer, 2009-2023 % 0.21/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.61 Amanda Stjerna. % 0.21/0.61 Free software under BSD-3-Clause. % 0.21/0.61 % 0.21/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.61 % 0.21/0.61 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.21/0.63 Running up to 7 provers in parallel. % 0.21/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 4.44/1.32 Prover 4: Preprocessing ... % 4.44/1.32 Prover 1: Preprocessing ... % 4.44/1.37 Prover 6: Preprocessing ... % 4.44/1.37 Prover 5: Preprocessing ... % 4.44/1.37 Prover 2: Preprocessing ... % 4.44/1.37 Prover 3: Preprocessing ... % 4.44/1.37 Prover 0: Preprocessing ... % 14.70/2.77 Prover 1: Constructing countermodel ... % 14.70/2.78 Prover 6: Proving ... % 14.70/2.81 Prover 3: Constructing countermodel ... % 16.30/2.95 Prover 2: Proving ... % 16.30/2.96 Prover 5: Proving ... % 20.74/3.60 Prover 4: Constructing countermodel ... % 21.76/3.67 Prover 0: Proving ... % 28.09/4.65 Prover 3: proved (4016ms) % 28.09/4.65 % 28.09/4.66 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 28.09/4.66 % 28.09/4.66 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 28.09/4.66 Prover 6: stopped % 29.14/4.67 Prover 0: stopped % 29.14/4.72 Prover 2: stopped % 29.14/4.73 Prover 5: stopped % 29.14/4.74 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 29.14/4.74 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 29.14/4.74 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 29.14/4.75 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 30.70/4.92 Prover 7: Preprocessing ... % 30.70/4.92 Prover 8: Preprocessing ... % 31.25/4.95 Prover 13: Preprocessing ... % 31.25/4.95 Prover 10: Preprocessing ... % 31.25/4.96 Prover 11: Preprocessing ... % 33.08/5.23 Prover 10: Constructing countermodel ... % 34.82/5.46 Prover 7: Constructing countermodel ... % 35.39/5.49 Prover 8: Warning: ignoring some quantifiers % 35.61/5.51 Prover 8: Constructing countermodel ... % 36.43/5.65 Prover 13: Constructing countermodel ... % 36.43/5.67 Prover 10: Found proof (size 11) % 36.43/5.67 Prover 10: proved (937ms) % 36.43/5.67 Prover 7: stopped % 36.43/5.67 Prover 1: stopped % 36.43/5.67 Prover 13: stopped % 36.43/5.68 Prover 4: stopped % 36.43/5.68 Prover 8: stopped % 38.41/6.06 Prover 11: Constructing countermodel ... % 38.41/6.09 Prover 11: stopped % 38.41/6.09 % 38.41/6.09 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 38.41/6.09 % 38.41/6.09 % SZS output start Proof for theBenchmark % 38.41/6.10 Assumptions after simplification: % 38.41/6.10 --------------------------------- % 38.41/6.10 % 38.41/6.10 (mEOfElem) % 38.41/6.11 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ aElementOf0(v1, v0) | % 38.41/6.11 ~ aSet0(v0) | aElement0(v1)) % 38.41/6.11 % 38.41/6.11 (m__) % 38.41/6.11 $i(xQ) & ! [v0: $i] : ( ~ $i(v0) | ~ aElementOf0(v0, xQ) | ~ aElement0(v0)) % 38.41/6.12 % 38.41/6.12 (m__2270) % 38.79/6.15 $i(xQ) & $i(xS) & $i(xk) & ? [v0: $i] : (slbdtsldtrb0(xS, xk) = v0 & % 38.79/6.15 sbrdtbr0(xQ) = xk & $i(v0) & aSubsetOf0(xQ, xS) & aElementOf0(xQ, v0) & % 38.79/6.15 aSet0(xQ) & ! [v1: $i] : ( ~ $i(v1) | ~ aElementOf0(v1, xQ) | % 38.79/6.15 aElementOf0(v1, xS))) % 38.79/6.15 % 38.79/6.15 (m__2313) % 38.79/6.15 $i(xQ) & $i(slcrc0) & ? [v0: $i] : ( ~ (xQ = slcrc0) & $i(v0) & % 38.79/6.15 aElementOf0(v0, xQ)) % 38.79/6.15 % 38.79/6.15 Further assumptions not needed in the proof: % 38.79/6.15 -------------------------------------------- % 38.79/6.15 mCConsSet, mCDiffSet, mCardCons, mCardDiff, mCardEmpty, mCardNum, mCardS, % 38.79/6.15 mCardSeg, mCardSub, mCardSubEx, mCntRel, mConsDiff, mCountNFin, mCountNFin_01, % 38.79/6.15 mDefCons, mDefDiff, mDefEmp, mDefMax, mDefMin, mDefSeg, mDefSel, mDefSub, % 38.79/6.15 mDiffCons, mElmSort, mEmpFin, mFConsSet, mFDiffSet, mFinRel, mFinSubSeg, mIH, % 38.79/6.15 mIHSort, mLessASymm, mLessRefl, mLessRel, mLessSucc, mLessTotal, mLessTrans, % 38.79/6.15 mMinMin, mNATSet, mNatExtra, mNatNSucc, mNoScLessZr, mSegFin, mSegLess, % 38.79/6.15 mSegSucc, mSegZero, mSelCSet, mSelFSet, mSelNSet, mSetSort, mSubASymm, mSubFSet, % 38.79/6.15 mSubRefl, mSubTrans, mSuccEquSucc, mSuccLess, mSuccNum, mZeroLess, mZeroNum, % 38.86/6.15 m__2202, m__2202_02, m__2227, m__2256, m__2291 % 38.86/6.15 % 38.86/6.15 Those formulas are unsatisfiable: % 38.86/6.15 --------------------------------- % 38.86/6.15 % 38.86/6.15 Begin of proof % 38.86/6.16 | % 38.86/6.16 | ALPHA: (m__2270) implies: % 38.86/6.16 | (1) ? [v0: $i] : (slbdtsldtrb0(xS, xk) = v0 & sbrdtbr0(xQ) = xk & $i(v0) & % 38.86/6.16 | aSubsetOf0(xQ, xS) & aElementOf0(xQ, v0) & aSet0(xQ) & ! [v1: $i] : % 38.86/6.16 | ( ~ $i(v1) | ~ aElementOf0(v1, xQ) | aElementOf0(v1, xS))) % 38.86/6.16 | % 38.86/6.16 | ALPHA: (m__2313) implies: % 38.86/6.16 | (2) ? [v0: $i] : ( ~ (xQ = slcrc0) & $i(v0) & aElementOf0(v0, xQ)) % 38.86/6.16 | % 38.86/6.16 | ALPHA: (m__) implies: % 38.86/6.16 | (3) $i(xQ) % 38.86/6.16 | (4) ! [v0: $i] : ( ~ $i(v0) | ~ aElementOf0(v0, xQ) | ~ aElement0(v0)) % 38.86/6.16 | % 38.86/6.16 | DELTA: instantiating (2) with fresh symbol all_54_0 gives: % 38.86/6.16 | (5) ~ (xQ = slcrc0) & $i(all_54_0) & aElementOf0(all_54_0, xQ) % 38.86/6.16 | % 38.86/6.16 | ALPHA: (5) implies: % 38.86/6.16 | (6) aElementOf0(all_54_0, xQ) % 38.86/6.16 | (7) $i(all_54_0) % 38.86/6.16 | % 38.86/6.16 | DELTA: instantiating (1) with fresh symbol all_56_0 gives: % 38.86/6.16 | (8) slbdtsldtrb0(xS, xk) = all_56_0 & sbrdtbr0(xQ) = xk & $i(all_56_0) & % 38.86/6.16 | aSubsetOf0(xQ, xS) & aElementOf0(xQ, all_56_0) & aSet0(xQ) & ! [v0: % 38.86/6.16 | $i] : ( ~ $i(v0) | ~ aElementOf0(v0, xQ) | aElementOf0(v0, xS)) % 38.86/6.16 | % 38.86/6.16 | ALPHA: (8) implies: % 38.86/6.16 | (9) aSet0(xQ) % 38.86/6.16 | % 38.86/6.17 | GROUND_INST: instantiating (mEOfElem) with xQ, all_54_0, simplifying with (3), % 38.86/6.17 | (6), (7), (9) gives: % 38.86/6.17 | (10) aElement0(all_54_0) % 38.86/6.17 | % 38.86/6.17 | GROUND_INST: instantiating (4) with all_54_0, simplifying with (6), (7), (10) % 38.86/6.17 | gives: % 38.86/6.17 | (11) $false % 38.86/6.17 | % 38.86/6.17 | CLOSE: (11) is inconsistent. % 38.86/6.17 | % 38.86/6.17 End of proof % 38.86/6.17 % SZS output end Proof for theBenchmark % 38.86/6.17 % 38.86/6.17 5554ms %------------------------------------------------------------------------------