%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : NUM547+3 : TPTP v8.1.2. Released v4.0.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n013.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:32 EDT 2023 % Result : Theorem 13.84s 2.72s % Output : Proof 17.55s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : NUM547+3 : TPTP v8.1.2. Released v4.0.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.15/0.34 % Computer : n013.cluster.edu % 0.15/0.34 % Model : x86_64 x86_64 % 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.34 % Memory : 8042.1875MB % 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.34 % CPULimit : 300 % 0.15/0.34 % WCLimit : 300 % 0.15/0.34 % DateTime : Fri Aug 25 15:00:32 EDT 2023 % 0.15/0.34 % CPUTime : % 0.19/0.60 ________ _____ % 0.19/0.60 ___ __ \_________(_)________________________________ % 0.19/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.60 % 0.19/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.60 (2023-06-19) % 0.19/0.60 % 0.19/0.60 (c) Philipp Rümmer, 2009-2023 % 0.19/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.60 Amanda Stjerna. % 0.19/0.60 Free software under BSD-3-Clause. % 0.19/0.60 % 0.19/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.60 % 0.19/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.19/0.61 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 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 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 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 3.65/1.21 Prover 4: Preprocessing ... % 3.65/1.22 Prover 1: Preprocessing ... % 4.01/1.26 Prover 2: Preprocessing ... % 4.01/1.26 Prover 6: Preprocessing ... % 4.01/1.26 Prover 5: Preprocessing ... % 4.01/1.26 Prover 3: Preprocessing ... % 4.01/1.26 Prover 0: Preprocessing ... % 11.66/2.30 Prover 1: Constructing countermodel ... % 11.66/2.33 Prover 3: Constructing countermodel ... % 12.04/2.36 Prover 6: Proving ... % 12.47/2.42 Prover 2: Proving ... % 12.47/2.43 Prover 5: Proving ... % 13.84/2.71 Prover 3: proved (2093ms) % 13.84/2.71 % 13.84/2.72 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 13.84/2.72 % 13.84/2.72 Prover 2: stopped % 13.84/2.72 Prover 5: stopped % 13.84/2.72 Prover 6: stopped % 13.84/2.73 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 13.84/2.73 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 13.84/2.73 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 13.84/2.74 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 15.09/2.79 Prover 1: Found proof (size 13) % 15.09/2.79 Prover 1: proved (2169ms) % 15.54/2.85 Prover 8: Preprocessing ... % 15.54/2.85 Prover 11: Preprocessing ... % 15.54/2.85 Prover 7: Preprocessing ... % 15.77/2.86 Prover 4: Constructing countermodel ... % 15.77/2.87 Prover 10: Preprocessing ... % 15.77/2.90 Prover 4: stopped % 15.77/2.91 Prover 0: Proving ... % 15.77/2.91 Prover 0: stopped % 15.77/2.92 Prover 7: stopped % 16.31/2.96 Prover 10: stopped % 16.58/3.03 Prover 11: stopped % 17.11/3.10 Prover 8: Warning: ignoring some quantifiers % 17.11/3.11 Prover 8: Constructing countermodel ... % 17.11/3.12 Prover 8: stopped % 17.11/3.12 % 17.11/3.12 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 17.11/3.12 % 17.11/3.12 % SZS output start Proof for theBenchmark % 17.40/3.13 Assumptions after simplification: % 17.40/3.13 --------------------------------- % 17.40/3.13 % 17.40/3.13 (m__) % 17.55/3.16 $i(xS) & $i(xk) & ? [v0: $i] : (slbdtsldtrb0(xS, xk) = v0 & $i(v0) & ! [v1: % 17.55/3.16 $i] : ! [v2: any] : ( ~ (aSubsetOf0(v1, xS) = v2) | ~ $i(v1) | ? [v3: % 17.55/3.16 any] : ? [v4: $i] : (sbrdtbr0(v1) = v4 & aSet0(v1) = v3 & $i(v4) & ( ~ % 17.55/3.16 (v4 = xk) | ( ~ (v2 = 0) & ( ~ (v3 = 0) | ? [v5: $i] : ? [v6: int] : % 17.55/3.16 ( ~ (v6 = 0) & aElementOf0(v5, v1) = 0 & aElementOf0(v5, xS) = v6 % 17.55/3.16 & $i(v5))))))) & ! [v1: $i] : ( ~ (aElementOf0(v1, v0) = 0) | % 17.55/3.16 ~ $i(v1))) % 17.55/3.16 % 17.55/3.16 (m__2227) % 17.55/3.17 $i(xT) & $i(xS) & $i(xk) & $i(slcrc0) & ? [v0: $i] : ? [v1: $i] : ( ~ (v0 = % 17.55/3.17 slcrc0) & slbdtsldtrb0(xT, xk) = v1 & slbdtsldtrb0(xS, xk) = v0 & % 17.55/3.17 aSubsetOf0(v0, v1) = 0 & aSet0(v1) = 0 & aSet0(v0) = 0 & $i(v1) & $i(v0) & % 17.55/3.17 ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ (aElementOf0(v2, v1) = v3) | ~ % 17.55/3.17 $i(v2) | ? [v4: any] : ? [v5: any] : ? [v6: $i] : (sbrdtbr0(v2) = v6 & % 17.55/3.17 aSubsetOf0(v2, xT) = v5 & aSet0(v2) = v4 & $i(v6) & ( ~ (v6 = xk) | ( ~ % 17.55/3.17 (v5 = 0) & ( ~ (v4 = 0) | ? [v7: $i] : ? [v8: int] : ( ~ (v8 = 0) % 17.55/3.17 & aElementOf0(v7, v2) = 0 & aElementOf0(v7, xT) = v8 & % 17.55/3.17 $i(v7))))))) & ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ % 17.55/3.17 (aElementOf0(v2, v1) = v3) | ~ $i(v2) | ? [v4: int] : ( ~ (v4 = 0) & % 17.55/3.17 aElementOf0(v2, v0) = v4)) & ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ % 17.55/3.17 (aElementOf0(v2, v0) = v3) | ~ $i(v2) | ? [v4: any] : ? [v5: any] : ? % 17.55/3.17 [v6: $i] : (sbrdtbr0(v2) = v6 & aSubsetOf0(v2, xS) = v5 & aSet0(v2) = v4 & % 17.55/3.17 $i(v6) & ( ~ (v6 = xk) | ( ~ (v5 = 0) & ( ~ (v4 = 0) | ? [v7: $i] : ? % 17.55/3.17 [v8: int] : ( ~ (v8 = 0) & aElementOf0(v7, v2) = 0 & % 17.55/3.17 aElementOf0(v7, xS) = v8 & $i(v7))))))) & ! [v2: $i] : ( ~ % 17.55/3.17 (aElementOf0(v2, v1) = 0) | ~ $i(v2) | (sbrdtbr0(v2) = xk & % 17.55/3.17 aSubsetOf0(v2, xT) = 0 & aSet0(v2) = 0 & ! [v3: $i] : ! [v4: int] : % 17.55/3.17 (v4 = 0 | ~ (aElementOf0(v3, xT) = v4) | ~ $i(v3) | ? [v5: int] : ( ~ % 17.55/3.17 (v5 = 0) & aElementOf0(v3, v2) = v5)))) & ! [v2: $i] : ( ~ % 17.55/3.17 (aElementOf0(v2, v0) = 0) | ~ $i(v2) | (sbrdtbr0(v2) = xk & % 17.55/3.17 aSubsetOf0(v2, xS) = 0 & aSet0(v2) = 0 & ! [v3: $i] : ! [v4: int] : % 17.55/3.17 (v4 = 0 | ~ (aElementOf0(v3, xS) = v4) | ~ $i(v3) | ? [v5: int] : ( ~ % 17.55/3.17 (v5 = 0) & aElementOf0(v3, v2) = v5)))) & ? [v2: $i] : % 17.55/3.17 (aElementOf0(v2, v0) = 0 & $i(v2))) % 17.55/3.17 % 17.55/3.17 (function-axioms) % 17.55/3.18 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 17.55/3.18 (slbdtsldtrb0(v3, v2) = v1) | ~ (slbdtsldtrb0(v3, v2) = v0)) & ! [v0: % 17.55/3.18 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 17.55/3.18 : (v1 = v0 | ~ (iLess0(v3, v2) = v1) | ~ (iLess0(v3, v2) = v0)) & ! [v0: % 17.55/3.18 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 17.55/3.18 : (v1 = v0 | ~ (sdtlseqdt0(v3, v2) = v1) | ~ (sdtlseqdt0(v3, v2) = v0)) & ! % 17.55/3.18 [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 17.55/3.18 (sdtmndt0(v3, v2) = v1) | ~ (sdtmndt0(v3, v2) = v0)) & ! [v0: $i] : ! % 17.55/3.18 [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (sdtpldt0(v3, v2) = v1) | % 17.55/3.18 ~ (sdtpldt0(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 17.55/3.18 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 17.55/3.18 (aSubsetOf0(v3, v2) = v1) | ~ (aSubsetOf0(v3, v2) = v0)) & ! [v0: % 17.55/3.18 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 17.55/3.18 : (v1 = v0 | ~ (aElementOf0(v3, v2) = v1) | ~ (aElementOf0(v3, v2) = v0)) & % 17.55/3.18 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (slbdtrb0(v2) = v1) | % 17.55/3.18 ~ (slbdtrb0(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 % 17.55/3.18 | ~ (szmzazxdt0(v2) = v1) | ~ (szmzazxdt0(v2) = v0)) & ! [v0: $i] : ! % 17.55/3.18 [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (szmzizndt0(v2) = v1) | ~ % 17.55/3.18 (szmzizndt0(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 % 17.55/3.18 | ~ (sbrdtbr0(v2) = v1) | ~ (sbrdtbr0(v2) = v0)) & ! [v0: $i] : ! [v1: % 17.55/3.18 $i] : ! [v2: $i] : (v1 = v0 | ~ (szszuzczcdt0(v2) = v1) | ~ % 17.55/3.18 (szszuzczcdt0(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 17.55/3.18 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (isCountable0(v2) = v1) | % 17.55/3.18 ~ (isCountable0(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 17.55/3.18 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (isFinite0(v2) = v1) | ~ % 17.55/3.18 (isFinite0(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 17.55/3.18 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (aSet0(v2) = v1) | ~ % 17.55/3.18 (aSet0(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] % 17.55/3.18 : ! [v2: $i] : (v1 = v0 | ~ (aElement0(v2) = v1) | ~ (aElement0(v2) = v0)) % 17.55/3.18 % 17.55/3.18 Further assumptions not needed in the proof: % 17.55/3.18 -------------------------------------------- % 17.55/3.18 mCConsSet, mCDiffSet, mCardCons, mCardDiff, mCardEmpty, mCardNum, mCardS, % 17.55/3.18 mCardSeg, mCardSub, mCardSubEx, mCntRel, mConsDiff, mCountNFin, mCountNFin_01, % 17.55/3.18 mDefCons, mDefDiff, mDefEmp, mDefMax, mDefMin, mDefSeg, mDefSel, mDefSub, % 17.55/3.18 mDiffCons, mEOfElem, mElmSort, mEmpFin, mFConsSet, mFDiffSet, mFinRel, % 17.55/3.18 mFinSubSeg, mIH, mIHSort, mLessASymm, mLessRefl, mLessRel, mLessSucc, % 17.55/3.18 mLessTotal, mLessTrans, mMinMin, mNATSet, mNatExtra, mNatNSucc, mNoScLessZr, % 17.55/3.18 mSegFin, mSegLess, mSegSucc, mSegZero, mSelCSet, mSelFSet, mSelNSet, mSetSort, % 17.55/3.18 mSubASymm, mSubFSet, mSubRefl, mSubTrans, mSuccEquSucc, mSuccLess, mSuccNum, % 17.55/3.18 mZeroLess, mZeroNum, m__2202, m__2202_02, m__2256 % 17.55/3.18 % 17.55/3.18 Those formulas are unsatisfiable: % 17.55/3.18 --------------------------------- % 17.55/3.18 % 17.55/3.18 Begin of proof % 17.55/3.18 | % 17.55/3.18 | ALPHA: (m__2227) implies: % 17.55/3.19 | (1) ? [v0: $i] : ? [v1: $i] : ( ~ (v0 = slcrc0) & slbdtsldtrb0(xT, xk) = % 17.55/3.19 | v1 & slbdtsldtrb0(xS, xk) = v0 & aSubsetOf0(v0, v1) = 0 & aSet0(v1) = % 17.55/3.19 | 0 & aSet0(v0) = 0 & $i(v1) & $i(v0) & ! [v2: $i] : ! [v3: int] : % 17.55/3.19 | (v3 = 0 | ~ (aElementOf0(v2, v1) = v3) | ~ $i(v2) | ? [v4: any] : % 17.55/3.19 | ? [v5: any] : ? [v6: $i] : (sbrdtbr0(v2) = v6 & aSubsetOf0(v2, xT) % 17.55/3.19 | = v5 & aSet0(v2) = v4 & $i(v6) & ( ~ (v6 = xk) | ( ~ (v5 = 0) & ( % 17.55/3.19 | ~ (v4 = 0) | ? [v7: $i] : ? [v8: int] : ( ~ (v8 = 0) & % 17.55/3.19 | aElementOf0(v7, v2) = 0 & aElementOf0(v7, xT) = v8 & % 17.55/3.19 | $i(v7))))))) & ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ % 17.55/3.19 | (aElementOf0(v2, v1) = v3) | ~ $i(v2) | ? [v4: int] : ( ~ (v4 = % 17.55/3.19 | 0) & aElementOf0(v2, v0) = v4)) & ! [v2: $i] : ! [v3: int] : % 17.55/3.19 | (v3 = 0 | ~ (aElementOf0(v2, v0) = v3) | ~ $i(v2) | ? [v4: any] : % 17.55/3.19 | ? [v5: any] : ? [v6: $i] : (sbrdtbr0(v2) = v6 & aSubsetOf0(v2, xS) % 17.55/3.19 | = v5 & aSet0(v2) = v4 & $i(v6) & ( ~ (v6 = xk) | ( ~ (v5 = 0) & ( % 17.55/3.19 | ~ (v4 = 0) | ? [v7: $i] : ? [v8: int] : ( ~ (v8 = 0) & % 17.55/3.19 | aElementOf0(v7, v2) = 0 & aElementOf0(v7, xS) = v8 & % 17.55/3.19 | $i(v7))))))) & ! [v2: $i] : ( ~ (aElementOf0(v2, v1) = % 17.55/3.19 | 0) | ~ $i(v2) | (sbrdtbr0(v2) = xk & aSubsetOf0(v2, xT) = 0 & % 17.55/3.19 | aSet0(v2) = 0 & ! [v3: $i] : ! [v4: int] : (v4 = 0 | ~ % 17.55/3.19 | (aElementOf0(v3, xT) = v4) | ~ $i(v3) | ? [v5: int] : ( ~ (v5 % 17.55/3.19 | = 0) & aElementOf0(v3, v2) = v5)))) & ! [v2: $i] : ( ~ % 17.55/3.19 | (aElementOf0(v2, v0) = 0) | ~ $i(v2) | (sbrdtbr0(v2) = xk & % 17.55/3.19 | aSubsetOf0(v2, xS) = 0 & aSet0(v2) = 0 & ! [v3: $i] : ! [v4: % 17.55/3.19 | int] : (v4 = 0 | ~ (aElementOf0(v3, xS) = v4) | ~ $i(v3) | ? % 17.55/3.19 | [v5: int] : ( ~ (v5 = 0) & aElementOf0(v3, v2) = v5)))) & ? % 17.55/3.19 | [v2: $i] : (aElementOf0(v2, v0) = 0 & $i(v2))) % 17.55/3.19 | % 17.55/3.19 | ALPHA: (m__) implies: % 17.55/3.19 | (2) ? [v0: $i] : (slbdtsldtrb0(xS, xk) = v0 & $i(v0) & ! [v1: $i] : ! % 17.55/3.19 | [v2: any] : ( ~ (aSubsetOf0(v1, xS) = v2) | ~ $i(v1) | ? [v3: any] % 17.55/3.19 | : ? [v4: $i] : (sbrdtbr0(v1) = v4 & aSet0(v1) = v3 & $i(v4) & ( ~ % 17.55/3.19 | (v4 = xk) | ( ~ (v2 = 0) & ( ~ (v3 = 0) | ? [v5: $i] : ? [v6: % 17.55/3.19 | int] : ( ~ (v6 = 0) & aElementOf0(v5, v1) = 0 & % 17.55/3.19 | aElementOf0(v5, xS) = v6 & $i(v5))))))) & ! [v1: $i] : ( % 17.55/3.19 | ~ (aElementOf0(v1, v0) = 0) | ~ $i(v1))) % 17.55/3.19 | % 17.55/3.19 | ALPHA: (function-axioms) implies: % 17.55/3.19 | (3) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 17.55/3.19 | (slbdtsldtrb0(v3, v2) = v1) | ~ (slbdtsldtrb0(v3, v2) = v0)) % 17.55/3.19 | % 17.55/3.19 | DELTA: instantiating (2) with fresh symbol all_53_0 gives: % 17.55/3.19 | (4) slbdtsldtrb0(xS, xk) = all_53_0 & $i(all_53_0) & ! [v0: $i] : ! [v1: % 17.55/3.19 | any] : ( ~ (aSubsetOf0(v0, xS) = v1) | ~ $i(v0) | ? [v2: any] : ? % 17.55/3.19 | [v3: $i] : (sbrdtbr0(v0) = v3 & aSet0(v0) = v2 & $i(v3) & ( ~ (v3 = % 17.55/3.19 | xk) | ( ~ (v1 = 0) & ( ~ (v2 = 0) | ? [v4: $i] : ? [v5: int] % 17.55/3.19 | : ( ~ (v5 = 0) & aElementOf0(v4, v0) = 0 & aElementOf0(v4, % 17.55/3.19 | xS) = v5 & $i(v4))))))) & ! [v0: $i] : ( ~ % 17.55/3.19 | (aElementOf0(v0, all_53_0) = 0) | ~ $i(v0)) % 17.55/3.19 | % 17.55/3.19 | ALPHA: (4) implies: % 17.55/3.20 | (5) slbdtsldtrb0(xS, xk) = all_53_0 % 17.55/3.20 | (6) ! [v0: $i] : ( ~ (aElementOf0(v0, all_53_0) = 0) | ~ $i(v0)) % 17.55/3.20 | % 17.55/3.20 | DELTA: instantiating (1) with fresh symbols all_56_0, all_56_1 gives: % 17.55/3.20 | (7) ~ (all_56_1 = slcrc0) & slbdtsldtrb0(xT, xk) = all_56_0 & % 17.55/3.20 | slbdtsldtrb0(xS, xk) = all_56_1 & aSubsetOf0(all_56_1, all_56_0) = 0 & % 17.55/3.20 | aSet0(all_56_0) = 0 & aSet0(all_56_1) = 0 & $i(all_56_0) & $i(all_56_1) % 17.55/3.20 | & ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (aElementOf0(v0, all_56_0) % 17.55/3.20 | = v1) | ~ $i(v0) | ? [v2: any] : ? [v3: any] : ? [v4: $i] : % 17.55/3.20 | (sbrdtbr0(v0) = v4 & aSubsetOf0(v0, xT) = v3 & aSet0(v0) = v2 & % 17.55/3.20 | $i(v4) & ( ~ (v4 = xk) | ( ~ (v3 = 0) & ( ~ (v2 = 0) | ? [v5: $i] % 17.55/3.20 | : ? [v6: int] : ( ~ (v6 = 0) & aElementOf0(v5, v0) = 0 & % 17.55/3.20 | aElementOf0(v5, xT) = v6 & $i(v5))))))) & ! [v0: $i] : ! % 17.55/3.20 | [v1: int] : (v1 = 0 | ~ (aElementOf0(v0, all_56_0) = v1) | ~ $i(v0) | % 17.55/3.20 | ? [v2: int] : ( ~ (v2 = 0) & aElementOf0(v0, all_56_1) = v2)) & ! % 17.55/3.20 | [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (aElementOf0(v0, all_56_1) = v1) % 17.55/3.20 | | ~ $i(v0) | ? [v2: any] : ? [v3: any] : ? [v4: $i] : % 17.55/3.20 | (sbrdtbr0(v0) = v4 & aSubsetOf0(v0, xS) = v3 & aSet0(v0) = v2 & % 17.55/3.20 | $i(v4) & ( ~ (v4 = xk) | ( ~ (v3 = 0) & ( ~ (v2 = 0) | ? [v5: $i] % 17.55/3.20 | : ? [v6: int] : ( ~ (v6 = 0) & aElementOf0(v5, v0) = 0 & % 17.55/3.20 | aElementOf0(v5, xS) = v6 & $i(v5))))))) & ! [v0: $i] : ( ~ % 17.55/3.20 | (aElementOf0(v0, all_56_0) = 0) | ~ $i(v0) | (sbrdtbr0(v0) = xk & % 17.55/3.20 | aSubsetOf0(v0, xT) = 0 & aSet0(v0) = 0 & ! [v1: $i] : ! [v2: int] % 17.55/3.20 | : (v2 = 0 | ~ (aElementOf0(v1, xT) = v2) | ~ $i(v1) | ? [v3: % 17.55/3.20 | int] : ( ~ (v3 = 0) & aElementOf0(v1, v0) = v3)))) & ! [v0: % 17.55/3.20 | $i] : ( ~ (aElementOf0(v0, all_56_1) = 0) | ~ $i(v0) | (sbrdtbr0(v0) % 17.55/3.20 | = xk & aSubsetOf0(v0, xS) = 0 & aSet0(v0) = 0 & ! [v1: $i] : ! % 17.55/3.20 | [v2: int] : (v2 = 0 | ~ (aElementOf0(v1, xS) = v2) | ~ $i(v1) | % 17.55/3.20 | ? [v3: int] : ( ~ (v3 = 0) & aElementOf0(v1, v0) = v3)))) & ? % 17.55/3.20 | [v0: $i] : (aElementOf0(v0, all_56_1) = 0 & $i(v0)) % 17.55/3.20 | % 17.55/3.20 | ALPHA: (7) implies: % 17.55/3.20 | (8) slbdtsldtrb0(xS, xk) = all_56_1 % 17.55/3.20 | (9) ? [v0: $i] : (aElementOf0(v0, all_56_1) = 0 & $i(v0)) % 17.55/3.20 | % 17.55/3.20 | DELTA: instantiating (9) with fresh symbol all_59_0 gives: % 17.55/3.20 | (10) aElementOf0(all_59_0, all_56_1) = 0 & $i(all_59_0) % 17.55/3.20 | % 17.55/3.20 | ALPHA: (10) implies: % 17.55/3.20 | (11) $i(all_59_0) % 17.55/3.20 | (12) aElementOf0(all_59_0, all_56_1) = 0 % 17.55/3.20 | % 17.55/3.21 | GROUND_INST: instantiating (3) with all_53_0, all_56_1, xk, xS, simplifying % 17.55/3.21 | with (5), (8) gives: % 17.55/3.21 | (13) all_56_1 = all_53_0 % 17.55/3.21 | % 17.55/3.21 | REDUCE: (12), (13) imply: % 17.55/3.21 | (14) aElementOf0(all_59_0, all_53_0) = 0 % 17.55/3.21 | % 17.55/3.21 | GROUND_INST: instantiating (6) with all_59_0, simplifying with (11), (14) % 17.55/3.21 | gives: % 17.55/3.21 | (15) $false % 17.55/3.21 | % 17.55/3.21 | CLOSE: (15) is inconsistent. % 17.55/3.21 | % 17.55/3.21 End of proof % 17.55/3.21 % SZS output end Proof for theBenchmark % 17.55/3.21 % 17.55/3.21 2609ms %------------------------------------------------------------------------------