%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : NUM559+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 : 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:36 EDT 2023 % Result : Theorem 8.37s 1.86s % Output : Proof 15.16s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : NUM559+3 : TPTP v8.1.2. Released v4.0.0. % 0.07/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.33 % Computer : n023.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 300 % 0.13/0.33 % DateTime : Fri Aug 25 11:33:27 EDT 2023 % 0.13/0.33 % CPUTime : % 0.48/0.60 ________ _____ % 0.48/0.60 ___ __ \_________(_)________________________________ % 0.48/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.48/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.48/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.48/0.60 % 0.48/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.48/0.60 (2023-06-19) % 0.48/0.60 % 0.48/0.60 (c) Philipp Rümmer, 2009-2023 % 0.48/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.48/0.60 Amanda Stjerna. % 0.48/0.60 Free software under BSD-3-Clause. % 0.48/0.60 % 0.48/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.48/0.60 % 0.48/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.48/0.61 Running up to 7 provers in parallel. % 0.48/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.48/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.48/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.48/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.48/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.48/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.48/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 3.44/1.20 Prover 4: Preprocessing ... % 3.44/1.20 Prover 1: Preprocessing ... % 3.44/1.22 Prover 3: Preprocessing ... % 3.44/1.22 Prover 2: Preprocessing ... % 3.44/1.22 Prover 0: Preprocessing ... % 3.44/1.22 Prover 5: Preprocessing ... % 3.44/1.22 Prover 6: Preprocessing ... % 8.37/1.83 Prover 3: Constructing countermodel ... % 8.37/1.83 Prover 6: Constructing countermodel ... % 8.37/1.85 Prover 3: proved (1231ms) % 8.37/1.85 Prover 6: proved (1227ms) % 8.37/1.85 % 8.37/1.86 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 8.37/1.86 % 8.37/1.86 % 8.37/1.86 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 8.37/1.86 % 8.37/1.86 Prover 0: stopped % 8.37/1.86 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 8.37/1.86 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 8.37/1.86 Prover 5: Constructing countermodel ... % 8.37/1.86 Prover 5: stopped % 8.37/1.86 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 8.37/1.87 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 8.72/1.93 Prover 2: Constructing countermodel ... % 8.72/1.93 Prover 2: stopped % 8.72/1.93 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 9.47/2.02 Prover 8: Preprocessing ... % 9.87/2.03 Prover 11: Preprocessing ... % 9.87/2.03 Prover 7: Preprocessing ... % 9.87/2.05 Prover 10: Preprocessing ... % 10.07/2.12 Prover 13: Preprocessing ... % 11.03/2.23 Prover 1: Constructing countermodel ... % 12.77/2.43 Prover 7: Constructing countermodel ... % 13.25/2.47 Prover 7: Found proof (size 4) % 13.25/2.47 Prover 7: proved (618ms) % 13.25/2.48 Prover 10: Constructing countermodel ... % 13.25/2.49 Prover 1: Found proof (size 8) % 13.25/2.49 Prover 1: proved (1877ms) % 13.25/2.51 Prover 10: stopped % 13.25/2.51 Prover 8: Warning: ignoring some quantifiers % 13.25/2.53 Prover 8: Constructing countermodel ... % 13.25/2.54 Prover 8: stopped % 14.11/2.61 Prover 13: Constructing countermodel ... % 14.38/2.63 Prover 13: stopped % 14.45/2.65 Prover 4: Constructing countermodel ... % 14.45/2.68 Prover 4: stopped % 14.88/2.77 Prover 11: Constructing countermodel ... % 15.16/2.79 Prover 11: stopped % 15.16/2.79 % 15.16/2.79 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 15.16/2.79 % 15.16/2.79 % SZS output start Proof for theBenchmark % 15.16/2.80 Assumptions after simplification: % 15.16/2.80 --------------------------------- % 15.16/2.80 % 15.16/2.80 (m__2323) % 15.16/2.80 $i(xQ) & $i(xx) & ~ aElementOf0(xx, xQ) % 15.16/2.80 % 15.16/2.80 (m__2338) % 15.16/2.80 $i(xQ) & $i(xx) & aElementOf0(xx, xQ) % 15.16/2.80 % 15.16/2.80 Further assumptions not needed in the proof: % 15.16/2.80 -------------------------------------------- % 15.16/2.80 mCConsSet, mCDiffSet, mCardCons, mCardDiff, mCardEmpty, mCardNum, mCardS, % 15.16/2.80 mCardSeg, mCardSub, mCardSubEx, mCntRel, mConsDiff, mCountNFin, mCountNFin_01, % 15.16/2.80 mDefCons, mDefDiff, mDefEmp, mDefMax, mDefMin, mDefSeg, mDefSel, mDefSub, % 15.16/2.80 mDiffCons, mEOfElem, mElmSort, mEmpFin, mFConsSet, mFDiffSet, mFinRel, % 15.16/2.80 mFinSubSeg, mIH, mIHSort, mLessASymm, mLessRefl, mLessRel, mLessSucc, % 15.16/2.80 mLessTotal, mLessTrans, mMinMin, mNATSet, mNatExtra, mNatNSucc, mNoScLessZr, % 15.16/2.80 mSegFin, mSegLess, mSegSucc, mSegZero, mSelCSet, mSelFSet, mSelNSet, mSetSort, % 15.16/2.80 mSubASymm, mSubFSet, mSubRefl, mSubTrans, mSuccEquSucc, mSuccLess, mSuccNum, % 15.16/2.80 mZeroLess, mZeroNum, m__, m__2202, m__2202_02, m__2227, m__2256, m__2270, % 15.16/2.80 m__2291, m__2304 % 15.16/2.80 % 15.16/2.80 Those formulas are unsatisfiable: % 15.16/2.80 --------------------------------- % 15.16/2.80 % 15.16/2.80 Begin of proof % 15.16/2.80 | % 15.16/2.80 | ALPHA: (m__2323) implies: % 15.16/2.80 | (1) ~ aElementOf0(xx, xQ) % 15.16/2.80 | % 15.16/2.81 | ALPHA: (m__2338) implies: % 15.16/2.81 | (2) aElementOf0(xx, xQ) % 15.16/2.81 | % 15.16/2.81 | PRED_UNIFY: (1), (2) imply: % 15.16/2.81 | (3) $false % 15.16/2.81 | % 15.16/2.81 | CLOSE: (3) is inconsistent. % 15.16/2.81 | % 15.16/2.81 End of proof % 15.16/2.81 % SZS output end Proof for theBenchmark % 15.16/2.81 % 15.16/2.81 2209ms %------------------------------------------------------------------------------