%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : NUM540+2 : TPTP v8.1.2. Released v4.0.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n008.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:30 EDT 2023 % Result : Theorem 11.19s 2.32s % Output : Proof 14.01s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : NUM540+2 : TPTP v8.1.2. Released v4.0.0. % 0.00/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.35 % Computer : n008.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 16:30:32 EDT 2023 % 0.14/0.35 % CPUTime : % 0.20/0.63 ________ _____ % 0.20/0.63 ___ __ \_________(_)________________________________ % 0.20/0.63 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.63 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.63 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.63 % 0.20/0.63 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.63 (2023-06-19) % 0.20/0.63 % 0.20/0.63 (c) Philipp Rümmer, 2009-2023 % 0.20/0.63 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.63 Amanda Stjerna. % 0.20/0.63 Free software under BSD-3-Clause. % 0.20/0.63 % 0.20/0.63 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.63 % 0.20/0.63 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.20/0.65 Running up to 7 provers in parallel. % 0.20/0.68 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.68 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.68 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.68 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.68 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.68 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.68 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 3.50/1.21 Prover 4: Preprocessing ... % 3.50/1.21 Prover 1: Preprocessing ... % 3.78/1.25 Prover 2: Preprocessing ... % 3.78/1.25 Prover 5: Preprocessing ... % 3.78/1.25 Prover 0: Preprocessing ... % 3.78/1.25 Prover 3: Preprocessing ... % 3.78/1.25 Prover 6: Preprocessing ... % 9.72/2.09 Prover 1: Constructing countermodel ... % 9.72/2.14 Prover 5: Constructing countermodel ... % 9.72/2.18 Prover 6: Proving ... % 9.72/2.19 Prover 3: Constructing countermodel ... % 9.72/2.23 Prover 2: Proving ... % 11.19/2.32 Prover 3: proved (1647ms) % 11.19/2.32 % 11.19/2.32 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 11.19/2.32 % 11.19/2.32 Prover 5: stopped % 11.19/2.32 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 11.19/2.32 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 11.19/2.33 Prover 6: stopped % 11.19/2.35 Prover 2: stopped % 11.19/2.35 Prover 1: Found proof (size 7) % 11.19/2.35 Prover 1: proved (1683ms) % 11.19/2.35 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 11.19/2.35 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 12.30/2.49 Prover 8: Preprocessing ... % 12.30/2.49 Prover 7: Preprocessing ... % 12.30/2.50 Prover 10: Preprocessing ... % 12.30/2.51 Prover 11: Preprocessing ... % 12.30/2.52 Prover 7: stopped % 12.98/2.54 Prover 10: stopped % 12.98/2.56 Prover 4: Constructing countermodel ... % 13.37/2.59 Prover 0: Proving ... % 13.37/2.59 Prover 0: stopped % 13.37/2.61 Prover 4: stopped % 13.37/2.62 Prover 11: stopped % 13.75/2.66 Prover 8: Warning: ignoring some quantifiers % 13.81/2.67 Prover 8: Constructing countermodel ... % 13.81/2.68 Prover 8: stopped % 13.81/2.68 % 13.81/2.68 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 13.81/2.68 % 13.81/2.68 % SZS output start Proof for theBenchmark % 13.81/2.69 Assumptions after simplification: % 13.81/2.69 --------------------------------- % 13.81/2.69 % 13.81/2.69 (m__) % 14.01/2.71 $i(sz00) & $i(slcrc0) & ? [v0: $i] : ( ~ (v0 = slcrc0) & slbdtrb0(sz00) = v0 % 14.01/2.71 & aSet0(v0) = 0 & $i(v0) & ! [v1: $i] : ( ~ (aElementOf0(v1, v0) = 0) | ~ % 14.01/2.71 $i(v1)) & ? [v1: $i] : (aElementOf0(v1, v0) = 0 & $i(v1))) % 14.01/2.71 % 14.01/2.71 Further assumptions not needed in the proof: % 14.01/2.71 -------------------------------------------- % 14.01/2.72 mCConsSet, mCDiffSet, mCardCons, mCardDiff, mCardEmpty, mCardNum, mCardS, % 14.01/2.72 mCardSub, mCardSubEx, mCntRel, mConsDiff, mCountNFin, mCountNFin_01, mDefCons, % 14.01/2.72 mDefDiff, mDefEmp, mDefMax, mDefMin, mDefSeg, mDefSub, mDiffCons, mEOfElem, % 14.01/2.72 mElmSort, mEmpFin, mFConsSet, mFDiffSet, mFinRel, mIH, mIHSort, mLessASymm, % 14.01/2.72 mLessRefl, mLessRel, mLessSucc, mLessTotal, mLessTrans, mMinMin, mNATSet, % 14.01/2.72 mNatExtra, mNatNSucc, mNoScLessZr, mSegFin, mSetSort, mSubASymm, mSubFSet, % 14.01/2.72 mSubRefl, mSubTrans, mSuccEquSucc, mSuccLess, mSuccNum, mZeroLess, mZeroNum % 14.01/2.72 % 14.01/2.72 Those formulas are unsatisfiable: % 14.01/2.72 --------------------------------- % 14.01/2.72 % 14.01/2.72 Begin of proof % 14.01/2.72 | % 14.01/2.72 | ALPHA: (m__) implies: % 14.01/2.72 | (1) ? [v0: $i] : ( ~ (v0 = slcrc0) & slbdtrb0(sz00) = v0 & aSet0(v0) = 0 & % 14.01/2.72 | $i(v0) & ! [v1: $i] : ( ~ (aElementOf0(v1, v0) = 0) | ~ $i(v1)) & % 14.01/2.72 | ? [v1: $i] : (aElementOf0(v1, v0) = 0 & $i(v1))) % 14.01/2.72 | % 14.01/2.72 | DELTA: instantiating (1) with fresh symbol all_45_0 gives: % 14.01/2.72 | (2) ~ (all_45_0 = slcrc0) & slbdtrb0(sz00) = all_45_0 & aSet0(all_45_0) = % 14.01/2.72 | 0 & $i(all_45_0) & ! [v0: $i] : ( ~ (aElementOf0(v0, all_45_0) = 0) | % 14.01/2.72 | ~ $i(v0)) & ? [v0: $i] : (aElementOf0(v0, all_45_0) = 0 & $i(v0)) % 14.01/2.72 | % 14.01/2.72 | ALPHA: (2) implies: % 14.01/2.72 | (3) ! [v0: $i] : ( ~ (aElementOf0(v0, all_45_0) = 0) | ~ $i(v0)) % 14.01/2.73 | (4) ? [v0: $i] : (aElementOf0(v0, all_45_0) = 0 & $i(v0)) % 14.01/2.73 | % 14.01/2.73 | DELTA: instantiating (4) with fresh symbol all_48_0 gives: % 14.01/2.73 | (5) aElementOf0(all_48_0, all_45_0) = 0 & $i(all_48_0) % 14.01/2.73 | % 14.01/2.73 | ALPHA: (5) implies: % 14.01/2.73 | (6) $i(all_48_0) % 14.01/2.73 | (7) aElementOf0(all_48_0, all_45_0) = 0 % 14.01/2.73 | % 14.01/2.73 | GROUND_INST: instantiating (3) with all_48_0, simplifying with (6), (7) gives: % 14.01/2.73 | (8) $false % 14.01/2.73 | % 14.01/2.73 | CLOSE: (8) is inconsistent. % 14.01/2.73 | % 14.01/2.73 End of proof % 14.01/2.73 % SZS output end Proof for theBenchmark % 14.01/2.73 % 14.01/2.73 2098ms %------------------------------------------------------------------------------