%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : NUM582+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 : n007.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:45 EDT 2023 % Result : Theorem 27.20s 4.43s % Output : Proof 34.77s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.12 % Problem : NUM582+1 : TPTP v8.1.2. Released v4.0.0. % 0.10/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.33 % Computer : n007.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 300 % 0.12/0.34 % DateTime : Fri Aug 25 13:55:25 EDT 2023 % 0.12/0.34 % CPUTime : % 0.19/0.59 ________ _____ % 0.19/0.59 ___ __ \_________(_)________________________________ % 0.19/0.59 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.59 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.59 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.59 % 0.19/0.59 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.59 (2023-06-19) % 0.19/0.59 % 0.19/0.59 (c) Philipp Rümmer, 2009-2023 % 0.19/0.59 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.59 Amanda Stjerna. % 0.19/0.59 Free software under BSD-3-Clause. % 0.19/0.59 % 0.19/0.59 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.59 % 0.19/0.59 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.19/0.60 Running up to 7 provers in parallel. % 0.19/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.19/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 4.43/1.38 Prover 4: Preprocessing ... % 4.43/1.38 Prover 1: Preprocessing ... % 4.43/1.41 Prover 5: Preprocessing ... % 4.43/1.41 Prover 2: Preprocessing ... % 4.43/1.41 Prover 0: Preprocessing ... % 4.43/1.41 Prover 6: Preprocessing ... % 4.43/1.41 Prover 3: Preprocessing ... % 12.98/2.57 Prover 1: Constructing countermodel ... % 12.98/2.58 Prover 3: Constructing countermodel ... % 12.98/2.60 Prover 6: Proving ... % 12.98/2.61 Prover 5: Proving ... % 14.87/2.77 Prover 2: Proving ... % 19.99/3.49 Prover 4: Constructing countermodel ... % 21.18/3.59 Prover 0: Proving ... % 27.20/4.43 Prover 0: proved (3817ms) % 27.20/4.43 % 27.20/4.43 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 27.20/4.43 % 27.20/4.43 Prover 3: stopped % 27.20/4.44 Prover 6: stopped % 27.20/4.44 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 27.20/4.44 Prover 5: stopped % 27.20/4.44 Prover 2: stopped % 27.20/4.45 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 27.20/4.45 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 27.20/4.45 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 27.20/4.45 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 28.96/4.63 Prover 7: Preprocessing ... % 28.96/4.66 Prover 8: Preprocessing ... % 28.96/4.67 Prover 13: Preprocessing ... % 28.96/4.67 Prover 10: Preprocessing ... % 28.96/4.67 Prover 11: Preprocessing ... % 30.34/4.92 Prover 7: Constructing countermodel ... % 31.04/4.96 Prover 10: Constructing countermodel ... % 31.04/5.01 Prover 13: Warning: ignoring some quantifiers % 31.83/5.03 Prover 13: Constructing countermodel ... % 31.83/5.05 Prover 8: Warning: ignoring some quantifiers % 31.83/5.07 Prover 8: Constructing countermodel ... % 33.02/5.19 Prover 10: Found proof (size 24) % 33.02/5.19 Prover 10: proved (755ms) % 33.02/5.19 Prover 8: stopped % 33.02/5.19 Prover 13: stopped % 33.02/5.19 Prover 7: stopped % 33.02/5.20 Prover 4: stopped % 33.02/5.20 Prover 1: stopped % 34.02/5.46 Prover 11: Constructing countermodel ... % 34.36/5.48 Prover 11: stopped % 34.36/5.48 % 34.36/5.48 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 34.36/5.48 % 34.36/5.49 % SZS output start Proof for theBenchmark % 34.36/5.50 Assumptions after simplification: % 34.36/5.50 --------------------------------- % 34.36/5.50 % 34.36/5.50 (mZeroLess) % 34.36/5.50 $i(sz00) & $i(szNzAzT0) & ! [v0: $i] : ( ~ $i(v0) | ~ aElementOf0(v0, % 34.36/5.50 szNzAzT0) | sdtlseqdt0(sz00, v0)) % 34.36/5.51 % 34.36/5.51 (mZeroNum) % 34.36/5.51 $i(sz00) & $i(szNzAzT0) & aElementOf0(sz00, szNzAzT0) % 34.36/5.51 % 34.36/5.51 (m__) % 34.36/5.54 $i(xi) & $i(xN) & $i(xS) & ? [v0: $i] : (sdtlpdtrp0(xN, xi) = v0 & $i(v0) & % 34.36/5.54 ~ aSubsetOf0(v0, xS)) % 34.36/5.54 % 34.36/5.54 (m__3623) % 34.36/5.55 sdtlpdtrp0(xN, sz00) = xS & szDzozmdt0(xN) = szNzAzT0 & $i(xN) & $i(xS) & % 34.36/5.55 $i(sz00) & $i(szNzAzT0) & aFunction0(xN) & ! [v0: $i] : ! [v1: $i] : ! [v2: % 34.36/5.55 $i] : ! [v3: $i] : ( ~ (sdtlpdtrp0(xN, v0) = v1) | ~ (szmzizndt0(v1) = v2) % 34.36/5.55 | ~ (sdtmndt0(v1, v2) = v3) | ~ $i(v0) | ~ aSubsetOf0(v1, szNzAzT0) | ~ % 34.36/5.55 isCountable0(v1) | ~ aElementOf0(v0, szNzAzT0) | ? [v4: $i] : ? [v5: $i] % 34.36/5.55 : (sdtlpdtrp0(xN, v4) = v5 & szszuzczcdt0(v0) = v4 & $i(v5) & $i(v4) & % 34.36/5.55 aSubsetOf0(v5, v3) & isCountable0(v5))) % 34.36/5.55 % 34.36/5.55 (m__3754) % 34.36/5.55 $i(xN) & $i(szNzAzT0) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] % 34.36/5.55 : ( ~ (sdtlpdtrp0(xN, v1) = v3) | ~ (sdtlpdtrp0(xN, v0) = v2) | ~ $i(v1) | % 34.36/5.55 ~ $i(v0) | ~ sdtlseqdt0(v1, v0) | ~ aElementOf0(v1, szNzAzT0) | ~ % 34.36/5.55 aElementOf0(v0, szNzAzT0) | aSubsetOf0(v2, v3)) % 34.36/5.55 % 34.36/5.55 (m__3989) % 34.36/5.55 $i(xi) & $i(szNzAzT0) & aElementOf0(xi, szNzAzT0) % 34.36/5.55 % 34.36/5.55 (m__3989_02) % 34.36/5.56 $i(xQ) & $i(xi) & $i(xN) & $i(xk) & ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : % 34.36/5.56 ? [v3: $i] : (sdtlpdtrp0(xN, xi) = v0 & slbdtsldtrb0(v2, xk) = v3 & % 34.36/5.56 szmzizndt0(v0) = v1 & sdtmndt0(v0, v1) = v2 & $i(v3) & $i(v2) & $i(v1) & % 34.36/5.56 $i(v0) & aElementOf0(xQ, v3)) % 34.36/5.56 % 34.36/5.56 (m__4007) % 34.36/5.56 $i(xQ) & $i(xi) & $i(xN) & $i(xK) & ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : % 34.36/5.56 (sdtlpdtrp0(xN, xi) = v0 & szmzizndt0(v0) = v1 & sbrdtbr0(v2) = xK & % 34.36/5.56 sdtpldt0(xQ, v1) = v2 & $i(v2) & $i(v1) & $i(v0)) % 34.36/5.56 % 34.36/5.56 (function-axioms) % 34.36/5.57 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 34.36/5.57 (sdtexdt0(v3, v2) = v1) | ~ (sdtexdt0(v3, v2) = v0)) & ! [v0: $i] : ! % 34.36/5.57 [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (sdtlcdtrc0(v3, v2) = v1) % 34.36/5.57 | ~ (sdtlcdtrc0(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : % 34.36/5.57 ! [v3: $i] : (v1 = v0 | ~ (sdtlbdtrb0(v3, v2) = v1) | ~ (sdtlbdtrb0(v3, v2) % 34.36/5.57 = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 % 34.36/5.57 | ~ (sdtlpdtrp0(v3, v2) = v1) | ~ (sdtlpdtrp0(v3, v2) = v0)) & ! [v0: $i] % 34.36/5.57 : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (slbdtsldtrb0(v3, % 34.36/5.57 v2) = v1) | ~ (slbdtsldtrb0(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] % 34.36/5.57 : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (sdtmndt0(v3, v2) = v1) | ~ % 34.36/5.57 (sdtmndt0(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: % 34.36/5.57 $i] : (v1 = v0 | ~ (sdtpldt0(v3, v2) = v1) | ~ (sdtpldt0(v3, v2) = v0)) & % 34.36/5.57 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (szDzizrdt0(v2) = v1) | % 34.36/5.57 ~ (szDzizrdt0(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = % 34.36/5.57 v0 | ~ (szDzozmdt0(v2) = v1) | ~ (szDzozmdt0(v2) = v0)) & ! [v0: $i] : ! % 34.36/5.57 [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (slbdtrb0(v2) = v1) | ~ (slbdtrb0(v2) % 34.36/5.57 = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ % 34.36/5.57 (szmzazxdt0(v2) = v1) | ~ (szmzazxdt0(v2) = v0)) & ! [v0: $i] : ! [v1: % 34.36/5.57 $i] : ! [v2: $i] : (v1 = v0 | ~ (szmzizndt0(v2) = v1) | ~ (szmzizndt0(v2) % 34.36/5.57 = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ % 34.36/5.57 (sbrdtbr0(v2) = v1) | ~ (sbrdtbr0(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : % 34.36/5.57 ! [v2: $i] : (v1 = v0 | ~ (szszuzczcdt0(v2) = v1) | ~ (szszuzczcdt0(v2) = % 34.36/5.57 v0)) % 34.36/5.57 % 34.36/5.57 Further assumptions not needed in the proof: % 34.36/5.57 -------------------------------------------- % 34.36/5.57 mCConsSet, mCDiffSet, mCardCons, mCardDiff, mCardEmpty, mCardNum, mCardS, % 34.36/5.57 mCardSeg, mCardSub, mCardSubEx, mCntRel, mConsDiff, mCountNFin, mCountNFin_01, % 34.36/5.57 mDefCons, mDefDiff, mDefEmp, mDefMax, mDefMin, mDefPtt, mDefRst, mDefSImg, % 34.36/5.57 mDefSeg, mDefSel, mDefSub, mDiffCons, mDirichlet, mDomSet, mEOfElem, mElmSort, % 34.36/5.57 mEmpFin, mFConsSet, mFDiffSet, mFinRel, mFinSubSeg, mFunSort, mIH, mIHSort, % 34.36/5.57 mImgCount, mImgElm, mImgRng, mLessASymm, mLessRefl, mLessRel, mLessSucc, % 34.36/5.57 mLessTotal, mLessTrans, mMinMin, mNATSet, mNatExtra, mNatNSucc, mNoScLessZr, % 34.36/5.57 mPttSet, mSegFin, mSegLess, mSegSucc, mSegZero, mSelCSet, mSelExtra, mSelFSet, % 34.36/5.57 mSelNSet, mSelSub, mSetSort, mSubASymm, mSubFSet, mSubRefl, mSubTrans, % 34.36/5.57 mSuccEquSucc, mSuccLess, mSuccNum, m__3291, m__3398, m__3418, m__3435, m__3453, % 34.36/5.57 m__3462, m__3520, m__3533, m__3671, m__3821 % 34.36/5.57 % 34.36/5.57 Those formulas are unsatisfiable: % 34.36/5.57 --------------------------------- % 34.36/5.57 % 34.36/5.57 Begin of proof % 34.36/5.57 | % 34.36/5.57 | ALPHA: (mZeroNum) implies: % 34.36/5.57 | (1) aElementOf0(sz00, szNzAzT0) % 34.36/5.57 | % 34.36/5.57 | ALPHA: (mZeroLess) implies: % 34.36/5.57 | (2) ! [v0: $i] : ( ~ $i(v0) | ~ aElementOf0(v0, szNzAzT0) | % 34.36/5.57 | sdtlseqdt0(sz00, v0)) % 34.36/5.57 | % 34.36/5.57 | ALPHA: (m__3623) implies: % 34.36/5.57 | (3) $i(sz00) % 34.36/5.57 | (4) sdtlpdtrp0(xN, sz00) = xS % 34.36/5.57 | % 34.36/5.57 | ALPHA: (m__3754) implies: % 34.77/5.58 | (5) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ % 34.77/5.58 | (sdtlpdtrp0(xN, v1) = v3) | ~ (sdtlpdtrp0(xN, v0) = v2) | ~ $i(v1) % 34.77/5.58 | | ~ $i(v0) | ~ sdtlseqdt0(v1, v0) | ~ aElementOf0(v1, szNzAzT0) | % 34.77/5.58 | ~ aElementOf0(v0, szNzAzT0) | aSubsetOf0(v2, v3)) % 34.77/5.58 | % 34.77/5.58 | ALPHA: (m__3989) implies: % 34.77/5.58 | (6) aElementOf0(xi, szNzAzT0) % 34.77/5.58 | % 34.77/5.58 | ALPHA: (m__3989_02) implies: % 34.77/5.58 | (7) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : (sdtlpdtrp0(xN, % 34.77/5.58 | xi) = v0 & slbdtsldtrb0(v2, xk) = v3 & szmzizndt0(v0) = v1 & % 34.77/5.58 | sdtmndt0(v0, v1) = v2 & $i(v3) & $i(v2) & $i(v1) & $i(v0) & % 34.77/5.58 | aElementOf0(xQ, v3)) % 34.77/5.58 | % 34.77/5.58 | ALPHA: (m__4007) implies: % 34.77/5.58 | (8) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : (sdtlpdtrp0(xN, xi) = v0 & % 34.77/5.58 | szmzizndt0(v0) = v1 & sbrdtbr0(v2) = xK & sdtpldt0(xQ, v1) = v2 & % 34.77/5.58 | $i(v2) & $i(v1) & $i(v0)) % 34.77/5.58 | % 34.77/5.58 | ALPHA: (m__) implies: % 34.77/5.58 | (9) $i(xi) % 34.77/5.58 | (10) ? [v0: $i] : (sdtlpdtrp0(xN, xi) = v0 & $i(v0) & ~ aSubsetOf0(v0, % 34.77/5.58 | xS)) % 34.77/5.58 | % 34.77/5.58 | ALPHA: (function-axioms) implies: % 34.77/5.58 | (11) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 34.77/5.58 | (sdtlpdtrp0(v3, v2) = v1) | ~ (sdtlpdtrp0(v3, v2) = v0)) % 34.77/5.58 | % 34.77/5.58 | DELTA: instantiating (10) with fresh symbol all_69_0 gives: % 34.77/5.58 | (12) sdtlpdtrp0(xN, xi) = all_69_0 & $i(all_69_0) & ~ aSubsetOf0(all_69_0, % 34.77/5.58 | xS) % 34.77/5.58 | % 34.77/5.58 | ALPHA: (12) implies: % 34.77/5.58 | (13) ~ aSubsetOf0(all_69_0, xS) % 34.77/5.58 | (14) sdtlpdtrp0(xN, xi) = all_69_0 % 34.77/5.58 | % 34.77/5.58 | DELTA: instantiating (8) with fresh symbols all_71_0, all_71_1, all_71_2 % 34.77/5.58 | gives: % 34.77/5.58 | (15) sdtlpdtrp0(xN, xi) = all_71_2 & szmzizndt0(all_71_2) = all_71_1 & % 34.77/5.58 | sbrdtbr0(all_71_0) = xK & sdtpldt0(xQ, all_71_1) = all_71_0 & % 34.77/5.58 | $i(all_71_0) & $i(all_71_1) & $i(all_71_2) % 34.77/5.58 | % 34.77/5.58 | ALPHA: (15) implies: % 34.77/5.58 | (16) sdtlpdtrp0(xN, xi) = all_71_2 % 34.77/5.58 | % 34.77/5.58 | DELTA: instantiating (7) with fresh symbols all_75_0, all_75_1, all_75_2, % 34.77/5.58 | all_75_3 gives: % 34.77/5.58 | (17) sdtlpdtrp0(xN, xi) = all_75_3 & slbdtsldtrb0(all_75_1, xk) = all_75_0 % 34.77/5.58 | & szmzizndt0(all_75_3) = all_75_2 & sdtmndt0(all_75_3, all_75_2) = % 34.77/5.58 | all_75_1 & $i(all_75_0) & $i(all_75_1) & $i(all_75_2) & $i(all_75_3) & % 34.77/5.58 | aElementOf0(xQ, all_75_0) % 34.77/5.58 | % 34.77/5.58 | ALPHA: (17) implies: % 34.77/5.58 | (18) sdtlpdtrp0(xN, xi) = all_75_3 % 34.77/5.58 | % 34.77/5.58 | GROUND_INST: instantiating (11) with all_71_2, all_75_3, xi, xN, simplifying % 34.77/5.58 | with (16), (18) gives: % 34.77/5.58 | (19) all_75_3 = all_71_2 % 34.77/5.58 | % 34.77/5.58 | GROUND_INST: instantiating (11) with all_69_0, all_75_3, xi, xN, simplifying % 34.77/5.58 | with (14), (18) gives: % 34.77/5.58 | (20) all_75_3 = all_69_0 % 34.77/5.58 | % 34.77/5.58 | COMBINE_EQS: (19), (20) imply: % 34.77/5.58 | (21) all_71_2 = all_69_0 % 34.77/5.58 | % 34.77/5.58 | SIMP: (21) implies: % 34.77/5.59 | (22) all_71_2 = all_69_0 % 34.77/5.59 | % 34.77/5.59 | GROUND_INST: instantiating (2) with xi, simplifying with (6), (9) gives: % 34.77/5.59 | (23) sdtlseqdt0(sz00, xi) % 34.77/5.59 | % 34.77/5.59 | GROUND_INST: instantiating (5) with xi, sz00, all_69_0, xS, simplifying with % 34.77/5.59 | (1), (3), (4), (6), (9), (13), (14), (23) gives: % 34.77/5.59 | (24) $false % 34.77/5.59 | % 34.77/5.59 | CLOSE: (24) is inconsistent. % 34.77/5.59 | % 34.77/5.59 End of proof % 34.77/5.59 % SZS output end Proof for theBenchmark % 34.77/5.59 % 34.77/5.59 4998ms %------------------------------------------------------------------------------