%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : NUM591+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:49 EDT 2023 % Result : Theorem 138.20s 18.71s % Output : Proof 138.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : NUM591+1 : TPTP v8.1.2. Released v4.0.0. % 0.11/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n005.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 14:24:23 EDT 2023 % 0.13/0.34 % CPUTime : % 0.20/0.62 ________ _____ % 0.20/0.62 ___ __ \_________(_)________________________________ % 0.20/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.62 % 0.20/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.62 (2023-06-19) % 0.20/0.62 % 0.20/0.62 (c) Philipp Rümmer, 2009-2023 % 0.20/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.62 Amanda Stjerna. % 0.20/0.62 Free software under BSD-3-Clause. % 0.20/0.62 % 0.20/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.62 % 0.20/0.62 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.20/0.63 Running up to 7 provers in parallel. % 0.20/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 4.03/1.33 Prover 1: Preprocessing ... % 4.03/1.33 Prover 4: Preprocessing ... % 4.70/1.37 Prover 0: Preprocessing ... % 4.70/1.37 Prover 6: Preprocessing ... % 4.70/1.37 Prover 2: Preprocessing ... % 4.70/1.37 Prover 5: Preprocessing ... % 4.70/1.38 Prover 3: Preprocessing ... % 13.23/2.45 Prover 3: Constructing countermodel ... % 13.23/2.46 Prover 1: Constructing countermodel ... % 13.23/2.52 Prover 5: Proving ... % 13.23/2.52 Prover 6: Proving ... % 14.66/2.67 Prover 2: Proving ... % 17.79/3.09 Prover 4: Constructing countermodel ... % 18.76/3.22 Prover 0: Proving ... % 73.90/10.27 Prover 2: stopped % 73.90/10.27 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 74.90/10.45 Prover 7: Preprocessing ... % 75.86/10.63 Prover 7: Constructing countermodel ... % 102.04/13.97 Prover 5: stopped % 102.66/14.02 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 103.59/14.12 Prover 8: Preprocessing ... % 105.48/14.40 Prover 8: Warning: ignoring some quantifiers % 105.48/14.41 Prover 8: Constructing countermodel ... % 117.74/15.98 Prover 1: stopped % 117.74/15.98 Prover 9: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1423531889 % 118.41/16.09 Prover 9: Preprocessing ... % 122.73/16.67 Prover 9: Constructing countermodel ... % 132.04/17.91 Prover 6: stopped % 132.04/17.91 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 132.97/18.08 Prover 10: Preprocessing ... % 133.56/18.24 Prover 10: Constructing countermodel ... % 137.67/18.70 Prover 10: Found proof (size 25) % 137.67/18.70 Prover 10: proved (793ms) % 137.67/18.70 Prover 9: stopped % 137.67/18.70 Prover 3: stopped % 137.67/18.70 Prover 0: stopped % 138.20/18.71 Prover 7: stopped % 138.20/18.71 Prover 4: stopped % 138.20/18.71 Prover 8: stopped % 138.20/18.71 % 138.20/18.71 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 138.20/18.71 % 138.20/18.72 % SZS output start Proof for theBenchmark % 138.20/18.72 Assumptions after simplification: % 138.20/18.72 --------------------------------- % 138.20/18.72 % 138.20/18.72 (mNatExtra) % 138.20/18.76 $i(sz00) & $i(szNzAzT0) & ! [v0: $i] : (v0 = sz00 | ~ $i(v0) | ~ % 138.20/18.76 aElementOf0(v0, szNzAzT0) | ? [v1: $i] : (szszuzczcdt0(v1) = v0 & $i(v1) & % 138.20/18.76 aElementOf0(v1, szNzAzT0))) % 138.20/18.76 % 138.20/18.76 (m__) % 138.20/18.77 $i(xd) & $i(xY) & $i(xk) & $i(xT) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : % 138.20/18.77 ( ~ (slbdtsldtrb0(v1, xk) = v2) | ~ $i(v1) | ~ $i(v0) | ~ aSubsetOf0(v1, % 138.20/18.77 xY) | ~ isCountable0(v1) | ~ aElementOf0(v0, xT) | ? [v3: $i] : ? [v4: % 138.20/18.77 $i] : ( ~ (v4 = v0) & sdtlpdtrp0(xd, v3) = v4 & $i(v4) & $i(v3) & % 138.20/18.77 aElementOf0(v3, v2) & aSet0(v3))) % 138.20/18.77 % 138.20/18.77 (m__3398) % 138.20/18.78 $i(xK) & $i(xT) & $i(szNzAzT0) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! % 138.20/18.78 [v3: $i] : ! [v4: $i] : ( ~ (sdtlcdtrc0(v3, v2) = v4) | ~ (szDzozmdt0(v3) = % 138.20/18.79 v2) | ~ (slbdtsldtrb0(v1, v0) = v2) | ~ $i(v3) | ~ $i(v1) | ~ $i(v0) | % 138.20/18.79 ~ aFunction0(v3) | ~ iLess0(v0, xK) | ~ aSubsetOf0(v4, xT) | ~ % 138.20/18.79 aSubsetOf0(v1, szNzAzT0) | ~ isCountable0(v1) | ~ aElementOf0(v0, % 138.20/18.79 szNzAzT0) | ? [v5: $i] : ? [v6: $i] : ? [v7: $i] : (slbdtsldtrb0(v6, % 138.20/18.79 v0) = v7 & $i(v7) & $i(v6) & $i(v5) & aSubsetOf0(v6, v1) & % 138.20/18.79 isCountable0(v6) & aElementOf0(v5, xT) & ! [v8: $i] : ! [v9: $i] : (v9 = % 138.20/18.79 v5 | ~ (sdtlpdtrp0(v3, v8) = v9) | ~ $i(v8) | ~ aElementOf0(v8, % 138.20/18.79 v7)))) % 138.20/18.79 % 138.20/18.79 (m__3418) % 138.20/18.79 $i(xK) & $i(szNzAzT0) & aElementOf0(xK, szNzAzT0) % 138.20/18.79 % 138.20/18.79 (m__3462) % 138.20/18.79 ~ (xK = sz00) & $i(xK) & $i(sz00) % 138.20/18.79 % 138.20/18.79 (m__3520) % 138.20/18.79 ~ (xK = sz00) & $i(xK) & $i(sz00) % 138.20/18.79 % 138.20/18.79 (m__3533) % 138.20/18.79 szszuzczcdt0(xk) = xK & $i(xk) & $i(xK) & $i(szNzAzT0) & aElementOf0(xk, % 138.20/18.79 szNzAzT0) % 138.20/18.79 % 138.20/18.79 (m__4423) % 138.20/18.79 $i(xk) & $i(xK) & iLess0(xk, xK) % 138.20/18.79 % 138.20/18.79 (m__4482) % 138.20/18.79 $i(xd) & $i(xY) & $i(xk) & $i(xT) & $i(szNzAzT0) & ? [v0: $i] : ? [v1: $i] : % 138.20/18.79 (sdtlcdtrc0(xd, v0) = v1 & szDzozmdt0(xd) = v0 & slbdtsldtrb0(xY, xk) = v0 & % 138.20/18.79 $i(v1) & $i(v0) & aFunction0(xd) & aSubsetOf0(v1, xT) & aSubsetOf0(xY, % 138.20/18.79 szNzAzT0) & isCountable0(xY)) % 138.20/18.79 % 138.20/18.79 Further assumptions not needed in the proof: % 138.20/18.79 -------------------------------------------- % 138.20/18.79 mCConsSet, mCDiffSet, mCardCons, mCardDiff, mCardEmpty, mCardNum, mCardS, % 138.20/18.79 mCardSeg, mCardSub, mCardSubEx, mCntRel, mConsDiff, mCountNFin, mCountNFin_01, % 138.20/18.79 mDefCons, mDefDiff, mDefEmp, mDefMax, mDefMin, mDefPtt, mDefRst, mDefSImg, % 138.20/18.79 mDefSeg, mDefSel, mDefSub, mDiffCons, mDirichlet, mDomSet, mEOfElem, mElmSort, % 138.20/18.79 mEmpFin, mFConsSet, mFDiffSet, mFinRel, mFinSubSeg, mFunSort, mIH, mIHSort, % 138.20/18.79 mImgCount, mImgElm, mImgRng, mLessASymm, mLessRefl, mLessRel, mLessSucc, % 138.20/18.79 mLessTotal, mLessTrans, mMinMin, mNATSet, mNatNSucc, mNoScLessZr, mPttSet, % 138.20/18.79 mSegFin, mSegLess, mSegSucc, mSegZero, mSelCSet, mSelExtra, mSelFSet, mSelNSet, % 138.20/18.79 mSelSub, mSetSort, mSubASymm, mSubFSet, mSubRefl, mSubTrans, mSuccEquSucc, % 138.20/18.79 mSuccLess, mSuccNum, mZeroLess, mZeroNum, m__3291, m__3435, m__3453, m__3623, % 138.20/18.79 m__3671, m__3754, m__3821, m__3965, m__4151, m__4182, m__4331, m__4448, % 138.20/18.79 m__4448_02 % 138.20/18.79 % 138.20/18.79 Those formulas are unsatisfiable: % 138.20/18.79 --------------------------------- % 138.20/18.79 % 138.20/18.79 Begin of proof % 138.20/18.79 | % 138.20/18.79 | ALPHA: (mNatExtra) implies: % 138.20/18.79 | (1) ! [v0: $i] : (v0 = sz00 | ~ $i(v0) | ~ aElementOf0(v0, szNzAzT0) | % 138.20/18.79 | ? [v1: $i] : (szszuzczcdt0(v1) = v0 & $i(v1) & aElementOf0(v1, % 138.20/18.79 | szNzAzT0))) % 138.20/18.79 | % 138.20/18.79 | ALPHA: (m__3418) implies: % 138.20/18.79 | (2) aElementOf0(xK, szNzAzT0) % 138.20/18.79 | % 138.20/18.79 | ALPHA: (m__3398) implies: % 138.20/18.80 | (3) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ( % 138.20/18.80 | ~ (sdtlcdtrc0(v3, v2) = v4) | ~ (szDzozmdt0(v3) = v2) | ~ % 138.20/18.80 | (slbdtsldtrb0(v1, v0) = v2) | ~ $i(v3) | ~ $i(v1) | ~ $i(v0) | ~ % 138.20/18.80 | aFunction0(v3) | ~ iLess0(v0, xK) | ~ aSubsetOf0(v4, xT) | ~ % 138.20/18.80 | aSubsetOf0(v1, szNzAzT0) | ~ isCountable0(v1) | ~ aElementOf0(v0, % 138.20/18.80 | szNzAzT0) | ? [v5: $i] : ? [v6: $i] : ? [v7: $i] : % 138.20/18.80 | (slbdtsldtrb0(v6, v0) = v7 & $i(v7) & $i(v6) & $i(v5) & % 138.20/18.80 | aSubsetOf0(v6, v1) & isCountable0(v6) & aElementOf0(v5, xT) & ! % 138.20/18.80 | [v8: $i] : ! [v9: $i] : (v9 = v5 | ~ (sdtlpdtrp0(v3, v8) = v9) | % 138.20/18.80 | ~ $i(v8) | ~ aElementOf0(v8, v7)))) % 138.20/18.80 | % 138.20/18.80 | ALPHA: (m__3520) implies: % 138.20/18.80 | (4) ~ (xK = sz00) % 138.20/18.80 | % 138.20/18.80 | ALPHA: (m__3533) implies: % 138.20/18.80 | (5) aElementOf0(xk, szNzAzT0) % 138.20/18.80 | % 138.20/18.80 | ALPHA: (m__4423) implies: % 138.20/18.80 | (6) iLess0(xk, xK) % 138.20/18.80 | (7) $i(xK) % 138.20/18.80 | % 138.20/18.80 | ALPHA: (m__4482) implies: % 138.20/18.80 | (8) ? [v0: $i] : ? [v1: $i] : (sdtlcdtrc0(xd, v0) = v1 & szDzozmdt0(xd) = % 138.20/18.80 | v0 & slbdtsldtrb0(xY, xk) = v0 & $i(v1) & $i(v0) & aFunction0(xd) & % 138.20/18.80 | aSubsetOf0(v1, xT) & aSubsetOf0(xY, szNzAzT0) & isCountable0(xY)) % 138.20/18.80 | % 138.20/18.80 | ALPHA: (m__) implies: % 138.20/18.80 | (9) $i(xk) % 138.20/18.80 | (10) $i(xY) % 138.20/18.80 | (11) $i(xd) % 138.20/18.80 | (12) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (slbdtsldtrb0(v1, xk) = % 138.20/18.80 | v2) | ~ $i(v1) | ~ $i(v0) | ~ aSubsetOf0(v1, xY) | ~ % 138.20/18.80 | isCountable0(v1) | ~ aElementOf0(v0, xT) | ? [v3: $i] : ? [v4: % 138.20/18.80 | $i] : ( ~ (v4 = v0) & sdtlpdtrp0(xd, v3) = v4 & $i(v4) & $i(v3) & % 138.20/18.80 | aElementOf0(v3, v2) & aSet0(v3))) % 138.20/18.80 | % 138.20/18.80 | DELTA: instantiating (8) with fresh symbols all_77_0, all_77_1 gives: % 138.20/18.81 | (13) sdtlcdtrc0(xd, all_77_1) = all_77_0 & szDzozmdt0(xd) = all_77_1 & % 138.20/18.81 | slbdtsldtrb0(xY, xk) = all_77_1 & $i(all_77_0) & $i(all_77_1) & % 138.20/18.81 | aFunction0(xd) & aSubsetOf0(all_77_0, xT) & aSubsetOf0(xY, szNzAzT0) & % 138.20/18.81 | isCountable0(xY) % 138.20/18.81 | % 138.20/18.81 | ALPHA: (13) implies: % 138.20/18.81 | (14) isCountable0(xY) % 138.20/18.81 | (15) aSubsetOf0(xY, szNzAzT0) % 138.20/18.81 | (16) aSubsetOf0(all_77_0, xT) % 138.20/18.81 | (17) aFunction0(xd) % 138.20/18.81 | (18) slbdtsldtrb0(xY, xk) = all_77_1 % 138.20/18.81 | (19) szDzozmdt0(xd) = all_77_1 % 138.20/18.81 | (20) sdtlcdtrc0(xd, all_77_1) = all_77_0 % 138.20/18.81 | % 138.20/18.81 | GROUND_INST: instantiating (1) with xK, simplifying with (2), (7) gives: % 138.20/18.81 | (21) xK = sz00 | ? [v0: $i] : (szszuzczcdt0(v0) = xK & $i(v0) & % 138.20/18.81 | aElementOf0(v0, szNzAzT0)) % 138.20/18.81 | % 138.20/18.81 | GROUND_INST: instantiating (3) with xk, xY, all_77_1, xd, all_77_0, % 138.20/18.81 | simplifying with (5), (6), (9), (10), (11), (14), (15), (16), % 138.20/18.81 | (17), (18), (19), (20) gives: % 138.20/18.81 | (22) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : (slbdtsldtrb0(v1, xk) = v2 & % 138.20/18.81 | $i(v2) & $i(v1) & $i(v0) & aSubsetOf0(v1, xY) & isCountable0(v1) & % 138.20/18.81 | aElementOf0(v0, xT) & ! [v3: $i] : ! [v4: $i] : (v4 = v0 | ~ % 138.20/18.81 | (sdtlpdtrp0(xd, v3) = v4) | ~ $i(v3) | ~ aElementOf0(v3, v2))) % 138.20/18.81 | % 138.20/18.81 | DELTA: instantiating (22) with fresh symbols all_104_0, all_104_1, all_104_2 % 138.20/18.81 | gives: % 138.20/18.81 | (23) slbdtsldtrb0(all_104_1, xk) = all_104_0 & $i(all_104_0) & % 138.20/18.81 | $i(all_104_1) & $i(all_104_2) & aSubsetOf0(all_104_1, xY) & % 138.20/18.81 | isCountable0(all_104_1) & aElementOf0(all_104_2, xT) & ! [v0: $i] : % 138.20/18.81 | ! [v1: int] : (v1 = all_104_2 | ~ (sdtlpdtrp0(xd, v0) = v1) | ~ % 138.20/18.81 | $i(v0) | ~ aElementOf0(v0, all_104_0)) % 138.20/18.81 | % 138.20/18.81 | ALPHA: (23) implies: % 138.20/18.81 | (24) aElementOf0(all_104_2, xT) % 138.20/18.81 | (25) isCountable0(all_104_1) % 138.20/18.81 | (26) aSubsetOf0(all_104_1, xY) % 138.20/18.81 | (27) $i(all_104_2) % 138.20/18.81 | (28) $i(all_104_1) % 138.20/18.81 | (29) slbdtsldtrb0(all_104_1, xk) = all_104_0 % 138.20/18.82 | (30) ! [v0: $i] : ! [v1: int] : (v1 = all_104_2 | ~ (sdtlpdtrp0(xd, v0) % 138.20/18.82 | = v1) | ~ $i(v0) | ~ aElementOf0(v0, all_104_0)) % 138.20/18.82 | % 138.20/18.82 | BETA: splitting (21) gives: % 138.20/18.82 | % 138.20/18.82 | Case 1: % 138.20/18.82 | | % 138.20/18.82 | | (31) xK = sz00 % 138.20/18.82 | | % 138.20/18.82 | | REDUCE: (4), (31) imply: % 138.20/18.82 | | (32) $false % 138.20/18.82 | | % 138.20/18.82 | | CLOSE: (32) is inconsistent. % 138.20/18.82 | | % 138.20/18.82 | Case 2: % 138.20/18.82 | | % 138.20/18.82 | | % 138.20/18.82 | | GROUND_INST: instantiating (12) with all_104_2, all_104_1, all_104_0, % 138.20/18.82 | | simplifying with (24), (25), (26), (27), (28), (29) gives: % 138.20/18.82 | | (33) ? [v0: $i] : ? [v1: any] : ( ~ (v1 = all_104_2) & sdtlpdtrp0(xd, % 138.20/18.82 | | v0) = v1 & $i(v1) & $i(v0) & aElementOf0(v0, all_104_0) & % 138.20/18.82 | | aSet0(v0)) % 138.20/18.82 | | % 138.20/18.82 | | DELTA: instantiating (33) with fresh symbols all_133_0, all_133_1 gives: % 138.20/18.82 | | (34) ~ (all_133_0 = all_104_2) & sdtlpdtrp0(xd, all_133_1) = all_133_0 & % 138.20/18.82 | | $i(all_133_0) & $i(all_133_1) & aElementOf0(all_133_1, all_104_0) & % 138.20/18.82 | | aSet0(all_133_1) % 138.20/18.82 | | % 138.20/18.82 | | ALPHA: (34) implies: % 138.20/18.82 | | (35) ~ (all_133_0 = all_104_2) % 138.20/18.82 | | (36) aElementOf0(all_133_1, all_104_0) % 138.20/18.82 | | (37) $i(all_133_1) % 138.20/18.82 | | (38) sdtlpdtrp0(xd, all_133_1) = all_133_0 % 138.20/18.82 | | % 138.20/18.82 | | GROUND_INST: instantiating (30) with all_133_1, all_133_0, simplifying with % 138.20/18.82 | | (36), (37), (38) gives: % 138.20/18.82 | | (39) all_133_0 = all_104_2 % 138.20/18.82 | | % 138.20/18.82 | | REDUCE: (35), (39) imply: % 138.20/18.82 | | (40) $false % 138.20/18.82 | | % 138.20/18.82 | | CLOSE: (40) is inconsistent. % 138.20/18.82 | | % 138.20/18.82 | End of split % 138.20/18.82 | % 138.20/18.82 End of proof % 138.20/18.82 % SZS output end Proof for theBenchmark % 138.20/18.82 % 138.20/18.82 18206ms %------------------------------------------------------------------------------