%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : NUM539+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 : n032.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:29 EDT 2023 % Result : Theorem 20.51s 3.44s % Output : Proof 24.70s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.09 % Problem : NUM539+2 : TPTP v8.1.2. Released v4.0.0. % 0.00/0.09 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.09/0.29 % Computer : n032.cluster.edu % 0.09/0.29 % Model : x86_64 x86_64 % 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.29 % Memory : 8042.1875MB % 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64 % 0.09/0.29 % CPULimit : 300 % 0.09/0.29 % WCLimit : 300 % 0.09/0.29 % DateTime : Fri Aug 25 12:59:12 EDT 2023 % 0.09/0.29 % CPUTime : % 0.13/0.52 ________ _____ % 0.13/0.52 ___ __ \_________(_)________________________________ % 0.13/0.52 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.13/0.52 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.13/0.52 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.13/0.52 % 0.13/0.52 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.13/0.52 (2023-06-19) % 0.13/0.52 % 0.13/0.52 (c) Philipp Rümmer, 2009-2023 % 0.13/0.52 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.13/0.52 Amanda Stjerna. % 0.13/0.52 Free software under BSD-3-Clause. % 0.13/0.52 % 0.13/0.52 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.13/0.52 % 0.13/0.52 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.13/0.53 Running up to 7 provers in parallel. % 0.13/0.54 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.13/0.54 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.13/0.54 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.13/0.54 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.13/0.54 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.13/0.54 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 0.13/0.54 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 3.42/1.12 Prover 1: Preprocessing ... % 3.42/1.12 Prover 4: Preprocessing ... % 3.42/1.15 Prover 3: Preprocessing ... % 3.42/1.15 Prover 5: Preprocessing ... % 3.42/1.16 Prover 0: Preprocessing ... % 3.42/1.16 Prover 2: Preprocessing ... % 3.42/1.16 Prover 6: Preprocessing ... % 9.30/1.93 Prover 1: Constructing countermodel ... % 9.30/1.93 Prover 3: Constructing countermodel ... % 9.30/1.94 Prover 6: Proving ... % 9.30/1.94 Prover 5: Constructing countermodel ... % 9.30/1.95 Prover 2: Proving ... % 10.49/2.15 Prover 4: Constructing countermodel ... % 11.84/2.28 Prover 0: Proving ... % 20.51/3.43 Prover 5: proved (2891ms) % 20.51/3.43 % 20.51/3.44 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 20.51/3.44 % 20.51/3.44 Prover 3: stopped % 20.51/3.45 Prover 2: stopped % 20.51/3.45 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 20.51/3.45 Prover 6: stopped % 20.51/3.47 Prover 0: stopped % 20.51/3.48 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 20.51/3.48 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 20.51/3.48 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 20.51/3.48 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 20.51/3.53 Prover 7: Preprocessing ... % 20.51/3.55 Prover 8: Preprocessing ... % 21.39/3.58 Prover 10: Preprocessing ... % 21.39/3.59 Prover 11: Preprocessing ... % 21.39/3.60 Prover 13: Preprocessing ... % 21.39/3.62 Prover 7: Constructing countermodel ... % 21.39/3.67 Prover 10: Constructing countermodel ... % 23.09/3.74 Prover 8: Warning: ignoring some quantifiers % 23.09/3.75 Prover 8: Constructing countermodel ... % 23.23/3.80 Prover 13: Constructing countermodel ... % 23.67/3.83 Prover 10: Found proof (size 30) % 23.67/3.83 Prover 10: proved (373ms) % 23.67/3.83 Prover 8: stopped % 23.67/3.83 Prover 13: stopped % 23.67/3.83 Prover 4: stopped % 23.67/3.83 Prover 7: stopped % 23.67/3.83 Prover 1: stopped % 24.21/3.94 Prover 11: Constructing countermodel ... % 24.21/3.96 Prover 11: stopped % 24.21/3.96 % 24.21/3.96 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 24.21/3.96 % 24.21/3.97 % SZS output start Proof for theBenchmark % 24.21/3.97 Assumptions after simplification: % 24.21/3.97 --------------------------------- % 24.21/3.97 % 24.21/3.97 (mDefSub) % 24.40/3.98 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | % 24.40/3.98 ~ aSubsetOf0(v1, v0) | ~ aElementOf0(v2, v1) | ~ aSet0(v0) | % 24.40/3.98 aElementOf0(v2, v0)) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | % 24.40/3.98 ~ aSubsetOf0(v1, v0) | ~ aSet0(v0) | aSet0(v1)) & ! [v0: $i] : ! [v1: $i] % 24.40/3.98 : ( ~ $i(v1) | ~ $i(v0) | ~ aSet0(v1) | ~ aSet0(v0) | aSubsetOf0(v1, v0) | % 24.40/3.98 ? [v2: $i] : ($i(v2) & aElementOf0(v2, v1) & ~ aElementOf0(v2, v0))) % 24.40/3.98 % 24.40/3.98 (mLessTrans) % 24.40/3.99 $i(szNzAzT0) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ % 24.40/3.99 $i(v1) | ~ $i(v0) | ~ sdtlseqdt0(v1, v2) | ~ sdtlseqdt0(v0, v1) | ~ % 24.40/3.99 aElementOf0(v2, szNzAzT0) | ~ aElementOf0(v1, szNzAzT0) | ~ % 24.40/3.99 aElementOf0(v0, szNzAzT0) | sdtlseqdt0(v0, v2)) % 24.40/3.99 % 24.40/3.99 (mNATSet) % 24.40/3.99 $i(szNzAzT0) & isCountable0(szNzAzT0) & aSet0(szNzAzT0) % 24.40/3.99 % 24.40/3.99 (m__) % 24.40/4.01 $i(xT) & $i(xS) & ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ( ~ (v1 = v0) & % 24.40/4.01 szmzizndt0(xT) = v1 & szmzizndt0(xS) = v0 & $i(v2) & $i(v1) & $i(v0) & % 24.40/4.01 aElementOf0(v2, xT) & aElementOf0(v0, xS) & ~ sdtlseqdt0(v0, v2) & ! [v3: % 24.40/4.01 $i] : ( ~ $i(v3) | ~ aElementOf0(v3, xS) | sdtlseqdt0(v0, v3))) % 24.40/4.01 % 24.40/4.01 (m__1779) % 24.40/4.02 $i(xT) & $i(xS) & $i(szNzAzT0) & $i(slcrc0) & ? [v0: $i] : ? [v1: $i] : ( ~ % 24.40/4.02 (xT = slcrc0) & ~ (xS = slcrc0) & $i(v1) & $i(v0) & aSubsetOf0(xT, % 24.40/4.02 szNzAzT0) & aSubsetOf0(xS, szNzAzT0) & aElementOf0(v1, xS) & % 24.40/4.02 aElementOf0(v0, xT) & aSet0(xT) & aSet0(xS) & ! [v2: $i] : ( ~ $i(v2) | ~ % 24.40/4.02 aElementOf0(v2, xT) | aElementOf0(v2, szNzAzT0)) & ! [v2: $i] : ( ~ % 24.40/4.02 $i(v2) | ~ aElementOf0(v2, xS) | aElementOf0(v2, szNzAzT0))) % 24.40/4.02 % 24.40/4.02 (m__1802) % 24.40/4.02 $i(xT) & $i(xS) & ? [v0: $i] : ? [v1: $i] : (szmzizndt0(xT) = v1 & % 24.40/4.02 szmzizndt0(xS) = v0 & $i(v1) & $i(v0) & aElementOf0(v1, xT) & % 24.40/4.02 aElementOf0(v1, xS) & aElementOf0(v0, xT) & aElementOf0(v0, xS) & ! [v2: % 24.40/4.02 $i] : ( ~ $i(v2) | ~ aElementOf0(v2, xT) | sdtlseqdt0(v1, v2)) & ! [v2: % 24.40/4.02 $i] : ( ~ $i(v2) | ~ aElementOf0(v2, xS) | sdtlseqdt0(v0, v2))) % 24.40/4.02 % 24.40/4.02 (function-axioms) % 24.40/4.02 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 24.40/4.02 (sdtmndt0(v3, v2) = v1) | ~ (sdtmndt0(v3, v2) = v0)) & ! [v0: $i] : ! % 24.40/4.02 [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (sdtpldt0(v3, v2) = v1) | % 24.40/4.02 ~ (sdtpldt0(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 % 24.40/4.02 = v0 | ~ (szmzazxdt0(v2) = v1) | ~ (szmzazxdt0(v2) = v0)) & ! [v0: $i] : % 24.40/4.02 ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (szmzizndt0(v2) = v1) | ~ % 24.40/4.02 (szmzizndt0(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 % 24.40/4.02 | ~ (sbrdtbr0(v2) = v1) | ~ (sbrdtbr0(v2) = v0)) & ! [v0: $i] : ! [v1: % 24.40/4.02 $i] : ! [v2: $i] : (v1 = v0 | ~ (szszuzczcdt0(v2) = v1) | ~ % 24.40/4.02 (szszuzczcdt0(v2) = v0)) % 24.40/4.02 % 24.40/4.02 Further assumptions not needed in the proof: % 24.40/4.02 -------------------------------------------- % 24.40/4.02 mCConsSet, mCDiffSet, mCardCons, mCardDiff, mCardEmpty, mCardNum, mCardS, % 24.40/4.02 mCardSub, mCardSubEx, mCntRel, mConsDiff, mCountNFin, mCountNFin_01, mDefCons, % 24.40/4.02 mDefDiff, mDefEmp, mDefMax, mDefMin, mDiffCons, mEOfElem, mElmSort, mEmpFin, % 24.40/4.02 mFConsSet, mFDiffSet, mFinRel, mIH, mIHSort, mLessASymm, mLessRefl, mLessRel, % 24.40/4.02 mLessSucc, mLessTotal, mNatExtra, mNatNSucc, mNoScLessZr, mSetSort, mSubASymm, % 24.40/4.02 mSubFSet, mSubRefl, mSubTrans, mSuccEquSucc, mSuccLess, mSuccNum, mZeroLess, % 24.40/4.02 mZeroNum % 24.40/4.02 % 24.40/4.02 Those formulas are unsatisfiable: % 24.40/4.02 --------------------------------- % 24.40/4.02 % 24.40/4.02 Begin of proof % 24.40/4.02 | % 24.40/4.02 | ALPHA: (mDefSub) implies: % 24.40/4.03 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ % 24.40/4.03 | $i(v0) | ~ aSubsetOf0(v1, v0) | ~ aElementOf0(v2, v1) | ~ % 24.40/4.03 | aSet0(v0) | aElementOf0(v2, v0)) % 24.40/4.03 | % 24.40/4.03 | ALPHA: (mNATSet) implies: % 24.40/4.03 | (2) aSet0(szNzAzT0) % 24.40/4.03 | % 24.40/4.03 | ALPHA: (mLessTrans) implies: % 24.40/4.03 | (3) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ % 24.40/4.03 | $i(v0) | ~ sdtlseqdt0(v1, v2) | ~ sdtlseqdt0(v0, v1) | ~ % 24.40/4.03 | aElementOf0(v2, szNzAzT0) | ~ aElementOf0(v1, szNzAzT0) | ~ % 24.40/4.03 | aElementOf0(v0, szNzAzT0) | sdtlseqdt0(v0, v2)) % 24.40/4.03 | % 24.40/4.03 | ALPHA: (m__1779) implies: % 24.40/4.03 | (4) $i(szNzAzT0) % 24.40/4.03 | (5) ? [v0: $i] : ? [v1: $i] : ( ~ (xT = slcrc0) & ~ (xS = slcrc0) & % 24.40/4.03 | $i(v1) & $i(v0) & aSubsetOf0(xT, szNzAzT0) & aSubsetOf0(xS, szNzAzT0) % 24.40/4.03 | & aElementOf0(v1, xS) & aElementOf0(v0, xT) & aSet0(xT) & aSet0(xS) & % 24.40/4.03 | ! [v2: $i] : ( ~ $i(v2) | ~ aElementOf0(v2, xT) | aElementOf0(v2, % 24.40/4.03 | szNzAzT0)) & ! [v2: $i] : ( ~ $i(v2) | ~ aElementOf0(v2, xS) | % 24.40/4.03 | aElementOf0(v2, szNzAzT0))) % 24.40/4.03 | % 24.40/4.03 | ALPHA: (m__1802) implies: % 24.40/4.03 | (6) ? [v0: $i] : ? [v1: $i] : (szmzizndt0(xT) = v1 & szmzizndt0(xS) = v0 % 24.40/4.03 | & $i(v1) & $i(v0) & aElementOf0(v1, xT) & aElementOf0(v1, xS) & % 24.40/4.03 | aElementOf0(v0, xT) & aElementOf0(v0, xS) & ! [v2: $i] : ( ~ $i(v2) % 24.40/4.03 | | ~ aElementOf0(v2, xT) | sdtlseqdt0(v1, v2)) & ! [v2: $i] : ( ~ % 24.40/4.03 | $i(v2) | ~ aElementOf0(v2, xS) | sdtlseqdt0(v0, v2))) % 24.40/4.03 | % 24.40/4.03 | ALPHA: (m__) implies: % 24.40/4.03 | (7) $i(xT) % 24.40/4.03 | (8) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ( ~ (v1 = v0) & % 24.40/4.03 | szmzizndt0(xT) = v1 & szmzizndt0(xS) = v0 & $i(v2) & $i(v1) & $i(v0) % 24.40/4.03 | & aElementOf0(v2, xT) & aElementOf0(v0, xS) & ~ sdtlseqdt0(v0, v2) & % 24.40/4.03 | ! [v3: $i] : ( ~ $i(v3) | ~ aElementOf0(v3, xS) | sdtlseqdt0(v0, % 24.40/4.03 | v3))) % 24.40/4.03 | % 24.40/4.03 | ALPHA: (function-axioms) implies: % 24.40/4.03 | (9) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (szmzizndt0(v2) % 24.40/4.03 | = v1) | ~ (szmzizndt0(v2) = v0)) % 24.40/4.03 | % 24.40/4.03 | DELTA: instantiating (8) with fresh symbols all_42_0, all_42_1, all_42_2 % 24.40/4.03 | gives: % 24.40/4.04 | (10) ~ (all_42_1 = all_42_2) & szmzizndt0(xT) = all_42_1 & szmzizndt0(xS) % 24.40/4.04 | = all_42_2 & $i(all_42_0) & $i(all_42_1) & $i(all_42_2) & % 24.40/4.04 | aElementOf0(all_42_0, xT) & aElementOf0(all_42_2, xS) & ~ % 24.40/4.04 | sdtlseqdt0(all_42_2, all_42_0) & ! [v0: $i] : ( ~ $i(v0) | ~ % 24.40/4.04 | aElementOf0(v0, xS) | sdtlseqdt0(all_42_2, v0)) % 24.40/4.04 | % 24.40/4.04 | ALPHA: (10) implies: % 24.40/4.04 | (11) ~ sdtlseqdt0(all_42_2, all_42_0) % 24.40/4.04 | (12) aElementOf0(all_42_0, xT) % 24.40/4.04 | (13) $i(all_42_0) % 24.40/4.04 | (14) szmzizndt0(xS) = all_42_2 % 24.40/4.04 | (15) szmzizndt0(xT) = all_42_1 % 24.40/4.04 | % 24.40/4.04 | DELTA: instantiating (6) with fresh symbols all_45_0, all_45_1 gives: % 24.40/4.04 | (16) szmzizndt0(xT) = all_45_0 & szmzizndt0(xS) = all_45_1 & $i(all_45_0) & % 24.40/4.04 | $i(all_45_1) & aElementOf0(all_45_0, xT) & aElementOf0(all_45_0, xS) & % 24.40/4.04 | aElementOf0(all_45_1, xT) & aElementOf0(all_45_1, xS) & ! [v0: $i] : % 24.40/4.04 | ( ~ $i(v0) | ~ aElementOf0(v0, xT) | sdtlseqdt0(all_45_0, v0)) & ! % 24.40/4.04 | [v0: $i] : ( ~ $i(v0) | ~ aElementOf0(v0, xS) | sdtlseqdt0(all_45_1, % 24.40/4.04 | v0)) % 24.40/4.04 | % 24.40/4.04 | ALPHA: (16) implies: % 24.40/4.04 | (17) aElementOf0(all_45_1, xT) % 24.40/4.04 | (18) aElementOf0(all_45_0, xS) % 24.40/4.04 | (19) aElementOf0(all_45_0, xT) % 24.40/4.04 | (20) $i(all_45_1) % 24.40/4.04 | (21) $i(all_45_0) % 24.40/4.04 | (22) szmzizndt0(xS) = all_45_1 % 24.40/4.04 | (23) szmzizndt0(xT) = all_45_0 % 24.40/4.04 | (24) ! [v0: $i] : ( ~ $i(v0) | ~ aElementOf0(v0, xS) | % 24.40/4.04 | sdtlseqdt0(all_45_1, v0)) % 24.70/4.04 | (25) ! [v0: $i] : ( ~ $i(v0) | ~ aElementOf0(v0, xT) | % 24.70/4.04 | sdtlseqdt0(all_45_0, v0)) % 24.70/4.04 | % 24.70/4.04 | DELTA: instantiating (5) with fresh symbols all_48_0, all_48_1 gives: % 24.70/4.04 | (26) ~ (xT = slcrc0) & ~ (xS = slcrc0) & $i(all_48_0) & $i(all_48_1) & % 24.70/4.04 | aSubsetOf0(xT, szNzAzT0) & aSubsetOf0(xS, szNzAzT0) & % 24.70/4.04 | aElementOf0(all_48_0, xS) & aElementOf0(all_48_1, xT) & aSet0(xT) & % 24.70/4.04 | aSet0(xS) & ! [v0: $i] : ( ~ $i(v0) | ~ aElementOf0(v0, xT) | % 24.70/4.04 | aElementOf0(v0, szNzAzT0)) & ! [v0: $i] : ( ~ $i(v0) | ~ % 24.70/4.04 | aElementOf0(v0, xS) | aElementOf0(v0, szNzAzT0)) % 24.70/4.04 | % 24.70/4.04 | ALPHA: (26) implies: % 24.70/4.04 | (27) aSubsetOf0(xT, szNzAzT0) % 24.70/4.04 | % 24.70/4.04 | GROUND_INST: instantiating (9) with all_42_2, all_45_1, xS, simplifying with % 24.70/4.04 | (14), (22) gives: % 24.70/4.04 | (28) all_45_1 = all_42_2 % 24.70/4.04 | % 24.70/4.04 | GROUND_INST: instantiating (9) with all_42_1, all_45_0, xT, simplifying with % 24.70/4.04 | (15), (23) gives: % 24.70/4.04 | (29) all_45_0 = all_42_1 % 24.70/4.04 | % 24.70/4.04 | REDUCE: (21), (29) imply: % 24.70/4.04 | (30) $i(all_42_1) % 24.70/4.04 | % 24.70/4.04 | REDUCE: (20), (28) imply: % 24.70/4.04 | (31) $i(all_42_2) % 24.70/4.04 | % 24.70/4.04 | REDUCE: (19), (29) imply: % 24.70/4.04 | (32) aElementOf0(all_42_1, xT) % 24.70/4.04 | % 24.70/4.04 | REDUCE: (18), (29) imply: % 24.70/4.04 | (33) aElementOf0(all_42_1, xS) % 24.70/4.04 | % 24.70/4.05 | REDUCE: (17), (28) imply: % 24.70/4.05 | (34) aElementOf0(all_42_2, xT) % 24.70/4.05 | % 24.70/4.05 | GROUND_INST: instantiating (24) with all_42_1, simplifying with (30), (33) % 24.70/4.05 | gives: % 24.70/4.05 | (35) sdtlseqdt0(all_45_1, all_42_1) % 24.70/4.05 | % 24.70/4.05 | GROUND_INST: instantiating (25) with all_42_0, simplifying with (12), (13) % 24.70/4.05 | gives: % 24.70/4.05 | (36) sdtlseqdt0(all_45_0, all_42_0) % 24.70/4.05 | % 24.70/4.05 | GROUND_INST: instantiating (1) with szNzAzT0, xT, all_42_0, simplifying with % 24.70/4.05 | (2), (4), (7), (12), (13), (27) gives: % 24.70/4.05 | (37) aElementOf0(all_42_0, szNzAzT0) % 24.70/4.05 | % 24.70/4.05 | GROUND_INST: instantiating (1) with szNzAzT0, xT, all_42_1, simplifying with % 24.70/4.05 | (2), (4), (7), (27), (30), (32) gives: % 24.70/4.05 | (38) aElementOf0(all_42_1, szNzAzT0) % 24.70/4.05 | % 24.70/4.05 | GROUND_INST: instantiating (1) with szNzAzT0, xT, all_42_2, simplifying with % 24.70/4.05 | (2), (4), (7), (27), (31), (34) gives: % 24.70/4.05 | (39) aElementOf0(all_42_2, szNzAzT0) % 24.70/4.05 | % 24.70/4.05 | REDUCE: (29), (36) imply: % 24.70/4.05 | (40) sdtlseqdt0(all_42_1, all_42_0) % 24.70/4.05 | % 24.70/4.05 | REDUCE: (28), (35) imply: % 24.70/4.05 | (41) sdtlseqdt0(all_42_2, all_42_1) % 24.70/4.05 | % 24.70/4.05 | GROUND_INST: instantiating (3) with all_42_2, all_42_1, all_42_0, simplifying % 24.70/4.05 | with (11), (13), (30), (31), (37), (38), (39), (40), (41) gives: % 24.70/4.05 | (42) $false % 24.70/4.05 | % 24.70/4.05 | CLOSE: (42) is inconsistent. % 24.70/4.05 | % 24.70/4.05 End of proof % 24.70/4.05 % SZS output end Proof for theBenchmark % 24.70/4.05 % 24.70/4.05 3535ms %------------------------------------------------------------------------------