%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : NUM550+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 : n013.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:33 EDT 2023 % Result : Theorem 10.48s 2.21s % Output : Proof 16.42s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : NUM550+1 : TPTP v8.1.2. Released v4.0.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n013.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 300 % 0.13/0.34 % DateTime : Fri Aug 25 10:06:47 EDT 2023 % 0.13/0.34 % CPUTime : % 0.21/0.62 ________ _____ % 0.21/0.62 ___ __ \_________(_)________________________________ % 0.21/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.62 % 0.21/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.62 (2023-06-19) % 0.21/0.62 % 0.21/0.62 (c) Philipp Rümmer, 2009-2023 % 0.21/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.62 Amanda Stjerna. % 0.21/0.62 Free software under BSD-3-Clause. % 0.21/0.62 % 0.21/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.62 % 0.21/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.21/0.64 Running up to 7 provers in parallel. % 0.21/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 3.64/1.23 Prover 1: Preprocessing ... % 3.64/1.23 Prover 4: Preprocessing ... % 3.64/1.26 Prover 2: Preprocessing ... % 3.64/1.26 Prover 0: Preprocessing ... % 3.64/1.26 Prover 3: Preprocessing ... % 3.64/1.27 Prover 5: Preprocessing ... % 3.64/1.27 Prover 6: Preprocessing ... % 10.33/2.14 Prover 1: Constructing countermodel ... % 10.48/2.20 Prover 2: Constructing countermodel ... % 10.48/2.21 Prover 2: proved (1556ms) % 10.48/2.21 % 10.48/2.21 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 10.48/2.21 % 11.00/2.23 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 11.00/2.25 Prover 5: Constructing countermodel ... % 11.00/2.25 Prover 3: Constructing countermodel ... % 11.00/2.26 Prover 3: stopped % 11.00/2.26 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 11.36/2.27 Prover 5: stopped % 11.36/2.27 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 11.36/2.27 Prover 6: Proving ... % 11.36/2.28 Prover 6: stopped % 11.36/2.28 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 12.13/2.39 Prover 7: Preprocessing ... % 12.54/2.44 Prover 10: Preprocessing ... % 12.54/2.44 Prover 8: Preprocessing ... % 12.70/2.46 Prover 11: Preprocessing ... % 13.59/2.69 Prover 7: Constructing countermodel ... % 13.59/2.69 Prover 0: Constructing countermodel ... % 13.59/2.69 Prover 10: Constructing countermodel ... % 13.59/2.69 Prover 0: stopped % 13.59/2.70 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 13.59/2.73 Prover 4: Constructing countermodel ... % 13.59/2.78 Prover 13: Preprocessing ... % 13.59/2.78 Prover 8: Warning: ignoring some quantifiers % 14.56/2.80 Prover 8: Constructing countermodel ... % 14.56/2.81 Prover 10: Found proof (size 10) % 14.56/2.81 Prover 10: proved (543ms) % 14.56/2.81 Prover 4: stopped % 14.56/2.81 Prover 1: stopped % 14.56/2.81 Prover 8: stopped % 15.36/2.82 Prover 7: stopped % 15.36/2.84 Prover 13: stopped % 16.11/2.99 Prover 11: Constructing countermodel ... % 16.11/3.02 Prover 11: stopped % 16.11/3.02 % 16.11/3.02 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 16.11/3.02 % 16.11/3.02 % SZS output start Proof for theBenchmark % 16.34/3.03 Assumptions after simplification: % 16.34/3.03 --------------------------------- % 16.34/3.03 % 16.34/3.03 (mCardEmpty) % 16.42/3.07 $i(sz00) & $i(slcrc0) & ! [v0: $i] : (v0 = sz00 | ~ (sbrdtbr0(slcrc0) = v0) % 16.42/3.07 | ~ aSet0(slcrc0)) & ! [v0: $i] : (v0 = slcrc0 | ~ (sbrdtbr0(v0) = sz00) % 16.42/3.07 | ~ $i(v0) | ~ aSet0(v0)) % 16.42/3.07 % 16.42/3.07 (m__) % 16.42/3.07 xQ = slcrc0 & $i(slcrc0) % 16.42/3.07 % 16.42/3.07 (m__2202_02) % 16.42/3.07 ~ (xk = sz00) & $i(xT) & $i(xS) & $i(xk) & $i(sz00) & aSet0(xT) & aSet0(xS) % 16.42/3.07 % 16.42/3.07 (m__2291) % 16.42/3.07 sbrdtbr0(xQ) = xk & $i(xQ) & $i(xk) & isFinite0(xQ) & aSet0(xQ) % 16.42/3.07 % 16.42/3.07 Further assumptions not needed in the proof: % 16.42/3.07 -------------------------------------------- % 16.42/3.07 mCConsSet, mCDiffSet, mCardCons, mCardDiff, mCardNum, mCardS, mCardSeg, % 16.42/3.07 mCardSub, mCardSubEx, mCntRel, mConsDiff, mCountNFin, mCountNFin_01, mDefCons, % 16.42/3.07 mDefDiff, mDefEmp, mDefMax, mDefMin, mDefSeg, mDefSel, mDefSub, mDiffCons, % 16.42/3.07 mEOfElem, mElmSort, mEmpFin, mFConsSet, mFDiffSet, mFinRel, mFinSubSeg, mIH, % 16.42/3.07 mIHSort, mLessASymm, mLessRefl, mLessRel, mLessSucc, mLessTotal, mLessTrans, % 16.42/3.07 mMinMin, mNATSet, mNatExtra, mNatNSucc, mNoScLessZr, mSegFin, mSegLess, % 16.42/3.07 mSegSucc, mSegZero, mSelCSet, mSelFSet, mSelNSet, mSetSort, mSubASymm, mSubFSet, % 16.42/3.07 mSubRefl, mSubTrans, mSuccEquSucc, mSuccLess, mSuccNum, mZeroLess, mZeroNum, % 16.42/3.07 m__2202, m__2227, m__2256, m__2270 % 16.42/3.07 % 16.42/3.07 Those formulas are unsatisfiable: % 16.42/3.07 --------------------------------- % 16.42/3.07 % 16.42/3.07 Begin of proof % 16.42/3.08 | % 16.42/3.08 | ALPHA: (mCardEmpty) implies: % 16.42/3.08 | (1) ! [v0: $i] : (v0 = sz00 | ~ (sbrdtbr0(slcrc0) = v0) | ~ % 16.42/3.08 | aSet0(slcrc0)) % 16.42/3.08 | % 16.42/3.08 | ALPHA: (m__2202_02) implies: % 16.42/3.08 | (2) ~ (xk = sz00) % 16.42/3.08 | % 16.42/3.08 | ALPHA: (m__2291) implies: % 16.42/3.08 | (3) aSet0(xQ) % 16.42/3.08 | (4) sbrdtbr0(xQ) = xk % 16.42/3.08 | % 16.42/3.08 | ALPHA: (m__) implies: % 16.42/3.08 | (5) xQ = slcrc0 % 16.42/3.08 | % 16.42/3.08 | REDUCE: (4), (5) imply: % 16.42/3.08 | (6) sbrdtbr0(slcrc0) = xk % 16.42/3.08 | % 16.42/3.08 | REDUCE: (3), (5) imply: % 16.42/3.08 | (7) aSet0(slcrc0) % 16.42/3.08 | % 16.42/3.08 | GROUND_INST: instantiating (1) with xk, simplifying with (6), (7) gives: % 16.42/3.08 | (8) xk = sz00 % 16.42/3.08 | % 16.42/3.08 | REDUCE: (2), (8) imply: % 16.42/3.08 | (9) $false % 16.42/3.08 | % 16.42/3.08 | CLOSE: (9) is inconsistent. % 16.42/3.08 | % 16.42/3.08 End of proof % 16.42/3.08 % SZS output end Proof for theBenchmark % 16.42/3.08 % 16.42/3.08 2459ms %------------------------------------------------------------------------------