%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : NUM571+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 : 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:40 EDT 2023 % Result : Theorem 44.72s 6.78s % Output : Proof 56.74s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : NUM571+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.35 % Computer : n008.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 300 % 0.13/0.35 % DateTime : Fri Aug 25 12:57:48 EDT 2023 % 0.13/0.35 % CPUTime : % 0.21/0.61 ________ _____ % 0.21/0.61 ___ __ \_________(_)________________________________ % 0.21/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.61 % 0.21/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.61 (2023-06-19) % 0.21/0.61 % 0.21/0.61 (c) Philipp Rümmer, 2009-2023 % 0.21/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.61 Amanda Stjerna. % 0.21/0.61 Free software under BSD-3-Clause. % 0.21/0.61 % 0.21/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.61 % 0.21/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.21/0.62 Running up to 7 provers in parallel. % 0.21/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 0.21/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 4.08/1.36 Prover 4: Preprocessing ... % 4.08/1.36 Prover 1: Preprocessing ... % 4.08/1.42 Prover 0: Preprocessing ... % 4.08/1.42 Prover 6: Preprocessing ... % 4.08/1.42 Prover 5: Preprocessing ... % 4.08/1.42 Prover 2: Preprocessing ... % 4.08/1.43 Prover 3: Preprocessing ... % 12.87/2.56 Prover 6: Proving ... % 13.23/2.58 Prover 3: Constructing countermodel ... % 13.23/2.58 Prover 1: Constructing countermodel ... % 13.23/2.62 Prover 5: Proving ... % 14.40/2.85 Prover 2: Proving ... % 18.02/3.26 Prover 4: Constructing countermodel ... % 19.77/3.46 Prover 0: Proving ... % 44.72/6.77 Prover 6: proved (6137ms) % 44.72/6.77 % 44.72/6.78 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 44.72/6.78 % 44.72/6.78 Prover 3: stopped % 44.72/6.78 Prover 5: stopped % 44.72/6.79 Prover 0: stopped % 44.72/6.79 Prover 2: stopped % 44.72/6.80 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 44.72/6.80 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 44.72/6.80 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 44.72/6.80 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 44.72/6.80 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 46.70/7.03 Prover 11: Preprocessing ... % 46.97/7.06 Prover 7: Preprocessing ... % 46.97/7.07 Prover 8: Preprocessing ... % 46.97/7.08 Prover 10: Preprocessing ... % 46.97/7.08 Prover 13: Preprocessing ... % 47.83/7.38 Prover 7: Constructing countermodel ... % 47.83/7.39 Prover 10: Constructing countermodel ... % 50.07/7.49 Prover 13: Warning: ignoring some quantifiers % 50.07/7.52 Prover 13: Constructing countermodel ... % 50.07/7.54 Prover 8: Warning: ignoring some quantifiers % 50.72/7.57 Prover 8: Constructing countermodel ... % 55.50/8.23 Prover 11: Constructing countermodel ... % 56.50/8.32 Prover 10: Found proof (size 37) % 56.50/8.32 Prover 10: proved (1531ms) % 56.50/8.32 Prover 13: stopped % 56.50/8.32 Prover 8: stopped % 56.50/8.32 Prover 1: stopped % 56.50/8.32 Prover 4: stopped % 56.50/8.33 Prover 11: stopped % 56.50/8.33 Prover 7: stopped % 56.50/8.33 % 56.50/8.33 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 56.50/8.33 % 56.50/8.33 % SZS output start Proof for theBenchmark % 56.50/8.34 Assumptions after simplification: % 56.50/8.34 --------------------------------- % 56.50/8.34 % 56.50/8.34 (m__) % 56.74/8.36 $i(xi) & $i(xN) & $i(szNzAzT0) & ? [v0: $i] : (sdtlpdtrp0(xN, xi) = v0 & % 56.74/8.36 $i(v0) & ( ~ aSubsetOf0(v0, szNzAzT0) | ~ isCountable0(v0))) % 56.74/8.36 % 56.74/8.36 (m__3435) % 56.74/8.36 $i(xS) & $i(szNzAzT0) & aSubsetOf0(xS, szNzAzT0) & isCountable0(xS) % 56.74/8.36 % 56.74/8.36 (m__3623) % 56.74/8.36 sdtlpdtrp0(xN, sz00) = xS & szDzozmdt0(xN) = szNzAzT0 & $i(xN) & $i(xS) & % 56.74/8.36 $i(sz00) & $i(szNzAzT0) & aFunction0(xN) & ! [v0: $i] : ! [v1: $i] : ! [v2: % 56.74/8.36 $i] : ! [v3: $i] : ( ~ (sdtlpdtrp0(xN, v0) = v1) | ~ (szmzizndt0(v1) = v2) % 56.74/8.36 | ~ (sdtmndt0(v1, v2) = v3) | ~ $i(v0) | ~ aSubsetOf0(v1, szNzAzT0) | ~ % 56.74/8.36 isCountable0(v1) | ~ aElementOf0(v0, szNzAzT0) | ? [v4: $i] : ? [v5: $i] % 56.74/8.36 : (sdtlpdtrp0(xN, v4) = v5 & szszuzczcdt0(v0) = v4 & $i(v5) & $i(v4) & % 56.74/8.37 aSubsetOf0(v5, v3) & isCountable0(v5))) % 56.74/8.37 % 56.74/8.37 (m__3702_02) % 56.74/8.37 $i(xi) & $i(xN) & $i(sz00) & $i(szNzAzT0) & ? [v0: $i] : ? [v1: $i] : ? % 56.74/8.37 [v2: $i] : ($i(v1) & (xi = sz00 | (v2 = xi & sdtlpdtrp0(xN, xi) = v0 & % 56.74/8.37 szszuzczcdt0(v1) = xi & $i(v0) & aSubsetOf0(v0, szNzAzT0) & % 56.74/8.37 isCountable0(v0) & aElementOf0(v1, szNzAzT0)))) % 56.74/8.37 % 56.74/8.37 (function-axioms) % 56.74/8.38 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 56.74/8.38 (sdtexdt0(v3, v2) = v1) | ~ (sdtexdt0(v3, v2) = v0)) & ! [v0: $i] : ! % 56.74/8.38 [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (sdtlcdtrc0(v3, v2) = v1) % 56.74/8.38 | ~ (sdtlcdtrc0(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : % 56.74/8.38 ! [v3: $i] : (v1 = v0 | ~ (sdtlbdtrb0(v3, v2) = v1) | ~ (sdtlbdtrb0(v3, v2) % 56.74/8.38 = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 % 56.74/8.38 | ~ (sdtlpdtrp0(v3, v2) = v1) | ~ (sdtlpdtrp0(v3, v2) = v0)) & ! [v0: $i] % 56.74/8.38 : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (slbdtsldtrb0(v3, % 56.74/8.38 v2) = v1) | ~ (slbdtsldtrb0(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] % 56.74/8.38 : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (sdtmndt0(v3, v2) = v1) | ~ % 56.74/8.38 (sdtmndt0(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: % 56.74/8.38 $i] : (v1 = v0 | ~ (sdtpldt0(v3, v2) = v1) | ~ (sdtpldt0(v3, v2) = v0)) & % 56.74/8.38 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (szDzizrdt0(v2) = v1) | % 56.74/8.38 ~ (szDzizrdt0(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = % 56.74/8.38 v0 | ~ (szDzozmdt0(v2) = v1) | ~ (szDzozmdt0(v2) = v0)) & ! [v0: $i] : ! % 56.74/8.38 [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (slbdtrb0(v2) = v1) | ~ (slbdtrb0(v2) % 56.74/8.38 = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ % 56.74/8.38 (szmzazxdt0(v2) = v1) | ~ (szmzazxdt0(v2) = v0)) & ! [v0: $i] : ! [v1: % 56.74/8.38 $i] : ! [v2: $i] : (v1 = v0 | ~ (szmzizndt0(v2) = v1) | ~ (szmzizndt0(v2) % 56.74/8.38 = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ % 56.74/8.38 (sbrdtbr0(v2) = v1) | ~ (sbrdtbr0(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : % 56.74/8.38 ! [v2: $i] : (v1 = v0 | ~ (szszuzczcdt0(v2) = v1) | ~ (szszuzczcdt0(v2) = % 56.74/8.38 v0)) % 56.74/8.38 % 56.74/8.38 Further assumptions not needed in the proof: % 56.74/8.38 -------------------------------------------- % 56.74/8.38 mCConsSet, mCDiffSet, mCardCons, mCardDiff, mCardEmpty, mCardNum, mCardS, % 56.74/8.38 mCardSeg, mCardSub, mCardSubEx, mCntRel, mConsDiff, mCountNFin, mCountNFin_01, % 56.74/8.38 mDefCons, mDefDiff, mDefEmp, mDefMax, mDefMin, mDefPtt, mDefRst, mDefSImg, % 56.74/8.38 mDefSeg, mDefSel, mDefSub, mDiffCons, mDirichlet, mDomSet, mEOfElem, mElmSort, % 56.74/8.38 mEmpFin, mFConsSet, mFDiffSet, mFinRel, mFinSubSeg, mFunSort, mIH, mIHSort, % 56.74/8.38 mImgCount, mImgElm, mImgRng, mLessASymm, mLessRefl, mLessRel, mLessSucc, % 56.74/8.38 mLessTotal, mLessTrans, mMinMin, mNATSet, mNatExtra, mNatNSucc, mNoScLessZr, % 56.74/8.38 mPttSet, mSegFin, mSegLess, mSegSucc, mSegZero, mSelCSet, mSelExtra, mSelFSet, % 56.74/8.38 mSelNSet, mSelSub, mSetSort, mSubASymm, mSubFSet, mSubRefl, mSubTrans, % 56.74/8.38 mSuccEquSucc, mSuccLess, mSuccNum, mZeroLess, mZeroNum, m__3291, m__3398, % 56.74/8.38 m__3418, m__3453, m__3462, m__3520, m__3533, m__3671, m__3702 % 56.74/8.38 % 56.74/8.38 Those formulas are unsatisfiable: % 56.74/8.38 --------------------------------- % 56.74/8.38 % 56.74/8.38 Begin of proof % 56.74/8.38 | % 56.74/8.38 | ALPHA: (m__3435) implies: % 56.74/8.38 | (1) isCountable0(xS) % 56.74/8.38 | (2) aSubsetOf0(xS, szNzAzT0) % 56.74/8.38 | % 56.74/8.38 | ALPHA: (m__3623) implies: % 56.74/8.38 | (3) sdtlpdtrp0(xN, sz00) = xS % 56.74/8.38 | % 56.74/8.38 | ALPHA: (m__3702_02) implies: % 56.74/8.38 | (4) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ($i(v1) & (xi = sz00 | (v2 = % 56.74/8.38 | xi & sdtlpdtrp0(xN, xi) = v0 & szszuzczcdt0(v1) = xi & $i(v0) & % 56.74/8.38 | aSubsetOf0(v0, szNzAzT0) & isCountable0(v0) & aElementOf0(v1, % 56.74/8.38 | szNzAzT0)))) % 56.74/8.38 | % 56.74/8.38 | ALPHA: (m__) implies: % 56.74/8.38 | (5) ? [v0: $i] : (sdtlpdtrp0(xN, xi) = v0 & $i(v0) & ( ~ aSubsetOf0(v0, % 56.74/8.38 | szNzAzT0) | ~ isCountable0(v0))) % 56.74/8.39 | % 56.74/8.39 | ALPHA: (function-axioms) implies: % 56.74/8.39 | (6) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 56.74/8.39 | (sdtlpdtrp0(v3, v2) = v1) | ~ (sdtlpdtrp0(v3, v2) = v0)) % 56.74/8.39 | % 56.74/8.39 | DELTA: instantiating (5) with fresh symbol all_67_0 gives: % 56.74/8.39 | (7) sdtlpdtrp0(xN, xi) = all_67_0 & $i(all_67_0) & ( ~ aSubsetOf0(all_67_0, % 56.74/8.39 | szNzAzT0) | ~ isCountable0(all_67_0)) % 56.74/8.39 | % 56.74/8.39 | ALPHA: (7) implies: % 56.74/8.39 | (8) sdtlpdtrp0(xN, xi) = all_67_0 % 56.74/8.39 | (9) ~ aSubsetOf0(all_67_0, szNzAzT0) | ~ isCountable0(all_67_0) % 56.74/8.39 | % 56.74/8.39 | DELTA: instantiating (4) with fresh symbols all_71_0, all_71_1, all_71_2 % 56.74/8.39 | gives: % 56.74/8.39 | (10) $i(all_71_1) & (xi = sz00 | (all_71_0 = xi & sdtlpdtrp0(xN, xi) = % 56.74/8.39 | all_71_2 & szszuzczcdt0(all_71_1) = xi & $i(all_71_2) & % 56.74/8.39 | aSubsetOf0(all_71_2, szNzAzT0) & isCountable0(all_71_2) & % 56.74/8.39 | aElementOf0(all_71_1, szNzAzT0))) % 56.74/8.39 | % 56.74/8.39 | ALPHA: (10) implies: % 56.74/8.39 | (11) xi = sz00 | (all_71_0 = xi & sdtlpdtrp0(xN, xi) = all_71_2 & % 56.74/8.39 | szszuzczcdt0(all_71_1) = xi & $i(all_71_2) & aSubsetOf0(all_71_2, % 56.74/8.39 | szNzAzT0) & isCountable0(all_71_2) & aElementOf0(all_71_1, % 56.74/8.39 | szNzAzT0)) % 56.74/8.39 | % 56.74/8.39 | BETA: splitting (9) gives: % 56.74/8.39 | % 56.74/8.39 | Case 1: % 56.74/8.39 | | % 56.74/8.39 | | (12) ~ aSubsetOf0(all_67_0, szNzAzT0) % 56.74/8.39 | | % 56.74/8.39 | | BETA: splitting (11) gives: % 56.74/8.39 | | % 56.74/8.39 | | Case 1: % 56.74/8.39 | | | % 56.74/8.39 | | | (13) xi = sz00 % 56.74/8.39 | | | % 56.74/8.39 | | | REDUCE: (8), (13) imply: % 56.74/8.39 | | | (14) sdtlpdtrp0(xN, sz00) = all_67_0 % 56.74/8.39 | | | % 56.74/8.39 | | | GROUND_INST: instantiating (6) with xS, all_67_0, sz00, xN, simplifying % 56.74/8.39 | | | with (3), (14) gives: % 56.74/8.39 | | | (15) all_67_0 = xS % 56.74/8.39 | | | % 56.74/8.39 | | | REDUCE: (12), (15) imply: % 56.74/8.39 | | | (16) ~ aSubsetOf0(xS, szNzAzT0) % 56.74/8.39 | | | % 56.74/8.39 | | | PRED_UNIFY: (2), (16) imply: % 56.74/8.39 | | | (17) $false % 56.74/8.39 | | | % 56.74/8.39 | | | CLOSE: (17) is inconsistent. % 56.74/8.39 | | | % 56.74/8.39 | | Case 2: % 56.74/8.39 | | | % 56.74/8.39 | | | (18) all_71_0 = xi & sdtlpdtrp0(xN, xi) = all_71_2 & % 56.74/8.39 | | | szszuzczcdt0(all_71_1) = xi & $i(all_71_2) & aSubsetOf0(all_71_2, % 56.74/8.39 | | | szNzAzT0) & isCountable0(all_71_2) & aElementOf0(all_71_1, % 56.74/8.39 | | | szNzAzT0) % 56.74/8.40 | | | % 56.74/8.40 | | | ALPHA: (18) implies: % 56.74/8.40 | | | (19) aSubsetOf0(all_71_2, szNzAzT0) % 56.74/8.40 | | | (20) sdtlpdtrp0(xN, xi) = all_71_2 % 56.74/8.40 | | | % 56.74/8.40 | | | GROUND_INST: instantiating (6) with all_67_0, all_71_2, xi, xN, % 56.74/8.40 | | | simplifying with (8), (20) gives: % 56.74/8.40 | | | (21) all_71_2 = all_67_0 % 56.74/8.40 | | | % 56.74/8.40 | | | REDUCE: (19), (21) imply: % 56.74/8.40 | | | (22) aSubsetOf0(all_67_0, szNzAzT0) % 56.74/8.40 | | | % 56.74/8.40 | | | PRED_UNIFY: (12), (22) imply: % 56.74/8.40 | | | (23) $false % 56.74/8.40 | | | % 56.74/8.40 | | | CLOSE: (23) is inconsistent. % 56.74/8.40 | | | % 56.74/8.40 | | End of split % 56.74/8.40 | | % 56.74/8.40 | Case 2: % 56.74/8.40 | | % 56.74/8.40 | | (24) ~ isCountable0(all_67_0) % 56.74/8.40 | | % 56.74/8.40 | | BETA: splitting (11) gives: % 56.74/8.40 | | % 56.74/8.40 | | Case 1: % 56.74/8.40 | | | % 56.74/8.40 | | | (25) xi = sz00 % 56.74/8.40 | | | % 56.74/8.40 | | | REDUCE: (8), (25) imply: % 56.74/8.40 | | | (26) sdtlpdtrp0(xN, sz00) = all_67_0 % 56.74/8.40 | | | % 56.74/8.40 | | | GROUND_INST: instantiating (6) with xS, all_67_0, sz00, xN, simplifying % 56.74/8.40 | | | with (3), (26) gives: % 56.74/8.40 | | | (27) all_67_0 = xS % 56.74/8.40 | | | % 56.74/8.40 | | | REDUCE: (24), (27) imply: % 56.74/8.40 | | | (28) ~ isCountable0(xS) % 56.74/8.40 | | | % 56.74/8.40 | | | PRED_UNIFY: (1), (28) imply: % 56.74/8.40 | | | (29) $false % 56.74/8.40 | | | % 56.74/8.40 | | | CLOSE: (29) is inconsistent. % 56.74/8.40 | | | % 56.74/8.40 | | Case 2: % 56.74/8.40 | | | % 56.74/8.40 | | | (30) all_71_0 = xi & sdtlpdtrp0(xN, xi) = all_71_2 & % 56.74/8.40 | | | szszuzczcdt0(all_71_1) = xi & $i(all_71_2) & aSubsetOf0(all_71_2, % 56.74/8.40 | | | szNzAzT0) & isCountable0(all_71_2) & aElementOf0(all_71_1, % 56.74/8.40 | | | szNzAzT0) % 56.74/8.40 | | | % 56.74/8.40 | | | ALPHA: (30) implies: % 56.74/8.40 | | | (31) isCountable0(all_71_2) % 56.74/8.40 | | | (32) sdtlpdtrp0(xN, xi) = all_71_2 % 56.74/8.40 | | | % 56.74/8.40 | | | GROUND_INST: instantiating (6) with all_67_0, all_71_2, xi, xN, % 56.74/8.40 | | | simplifying with (8), (32) gives: % 56.74/8.40 | | | (33) all_71_2 = all_67_0 % 56.74/8.40 | | | % 56.74/8.40 | | | REDUCE: (31), (33) imply: % 56.74/8.40 | | | (34) isCountable0(all_67_0) % 56.74/8.40 | | | % 56.74/8.40 | | | PRED_UNIFY: (24), (34) imply: % 56.74/8.40 | | | (35) $false % 56.74/8.40 | | | % 56.74/8.40 | | | CLOSE: (35) is inconsistent. % 56.74/8.40 | | | % 56.74/8.40 | | End of split % 56.74/8.40 | | % 56.74/8.40 | End of split % 56.74/8.40 | % 56.74/8.40 End of proof % 56.74/8.40 % SZS output end Proof for theBenchmark % 56.74/8.40 % 56.74/8.40 7792ms %------------------------------------------------------------------------------