TSTP Solution File: NUM587+1 by Princess---230619

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : NUM587+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 : n023.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:47 EDT 2023

% Result   : Theorem 20.61s 3.44s
% Output   : Proof 28.14s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : NUM587+1 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.12  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.12/0.33  % Computer : n023.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.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Fri Aug 25 15:02:27 EDT 2023
% 0.12/0.33  % CPUTime  : 
% 0.58/0.60  ________       _____
% 0.58/0.60  ___  __ \_________(_)________________________________
% 0.58/0.60  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.58/0.60  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.58/0.60  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.58/0.60  
% 0.58/0.60  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.58/0.60  (2023-06-19)
% 0.58/0.60  
% 0.58/0.60  (c) Philipp Rümmer, 2009-2023
% 0.58/0.60  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.58/0.60                Amanda Stjerna.
% 0.58/0.60  Free software under BSD-3-Clause.
% 0.58/0.60  
% 0.58/0.60  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.58/0.60  
% 0.58/0.60  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.58/0.61  Running up to 7 provers in parallel.
% 0.58/0.63  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.58/0.63  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.58/0.63  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.58/0.63  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.58/0.63  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.58/0.63  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 0.58/0.63  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 4.54/1.35  Prover 4: Preprocessing ...
% 4.54/1.35  Prover 1: Preprocessing ...
% 4.93/1.39  Prover 3: Preprocessing ...
% 4.93/1.39  Prover 6: Preprocessing ...
% 4.93/1.39  Prover 2: Preprocessing ...
% 4.93/1.39  Prover 5: Preprocessing ...
% 4.93/1.40  Prover 0: Preprocessing ...
% 13.03/2.46  Prover 1: Constructing countermodel ...
% 13.69/2.52  Prover 3: Constructing countermodel ...
% 13.69/2.55  Prover 6: Proving ...
% 13.69/2.58  Prover 5: Proving ...
% 15.34/2.80  Prover 2: Proving ...
% 18.79/3.25  Prover 4: Constructing countermodel ...
% 20.04/3.40  Prover 0: Proving ...
% 20.61/3.44  Prover 3: proved (2815ms)
% 20.61/3.44  
% 20.61/3.44  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 20.61/3.44  
% 20.61/3.44  Prover 5: stopped
% 20.61/3.45  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 20.61/3.45  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 20.61/3.45  Prover 2: stopped
% 20.61/3.45  Prover 0: stopped
% 20.61/3.46  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 20.61/3.46  Prover 6: stopped
% 20.61/3.46  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 20.61/3.46  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 21.73/3.60  Prover 7: Preprocessing ...
% 22.33/3.65  Prover 10: Preprocessing ...
% 22.33/3.69  Prover 13: Preprocessing ...
% 22.33/3.69  Prover 11: Preprocessing ...
% 22.33/3.69  Prover 8: Preprocessing ...
% 24.09/3.88  Prover 10: Constructing countermodel ...
% 24.09/3.92  Prover 7: Constructing countermodel ...
% 24.64/4.01  Prover 8: Warning: ignoring some quantifiers
% 25.17/4.02  Prover 8: Constructing countermodel ...
% 25.17/4.05  Prover 13: Warning: ignoring some quantifiers
% 25.55/4.07  Prover 13: Constructing countermodel ...
% 26.14/4.16  Prover 10: Found proof (size 18)
% 26.14/4.16  Prover 10: proved (712ms)
% 26.14/4.16  Prover 13: stopped
% 26.14/4.16  Prover 7: stopped
% 26.14/4.16  Prover 8: stopped
% 26.14/4.16  Prover 1: stopped
% 26.14/4.18  Prover 4: stopped
% 27.45/4.48  Prover 11: Constructing countermodel ...
% 27.60/4.50  Prover 11: stopped
% 27.60/4.50  
% 27.60/4.50  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 27.60/4.50  
% 27.60/4.51  % SZS output start Proof for theBenchmark
% 27.60/4.52  Assumptions after simplification:
% 27.60/4.52  ---------------------------------
% 27.60/4.52  
% 27.60/4.52    (mDefSub)
% 27.77/4.53     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : ( ~ $i(v2) |  ~ $i(v1) |  ~ $i(v0) |
% 27.77/4.53       ~ aSubsetOf0(v1, v0) |  ~ aElementOf0(v2, v1) |  ~ aSet0(v0) |
% 27.77/4.53      aElementOf0(v2, v0)) &  ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) | 
% 27.77/4.53      ~ aSubsetOf0(v1, v0) |  ~ aSet0(v0) | aSet0(v1)) &  ! [v0: $i] :  ! [v1: $i]
% 27.77/4.53    : ( ~ $i(v1) |  ~ $i(v0) |  ~ aSet0(v1) |  ~ aSet0(v0) | aSubsetOf0(v1, v0) | 
% 27.77/4.53      ? [v2: $i] : ($i(v2) & aElementOf0(v2, v1) &  ~ aElementOf0(v2, v0)))
% 27.77/4.53  
% 27.77/4.53    (m__)
% 27.77/4.53    $i(xx) & $i(xT) &  ~ aElementOf0(xx, xT)
% 27.77/4.53  
% 27.77/4.53    (m__3291)
% 27.77/4.53    $i(xT) & isFinite0(xT) & aSet0(xT)
% 27.77/4.53  
% 27.77/4.53    (m__3453)
% 27.82/4.57    $i(xc) & $i(xS) & $i(xK) & $i(xT) &  ? [v0: $i] :  ? [v1: $i] :
% 27.82/4.57    (sdtlcdtrc0(xc, v0) = v1 & szDzozmdt0(xc) = v0 & slbdtsldtrb0(xS, xK) = v0 &
% 27.82/4.57      $i(v1) & $i(v0) & aFunction0(xc) & aSubsetOf0(v1, xT))
% 27.82/4.57  
% 27.82/4.57    (m__4263)
% 27.82/4.57    $i(xQ) & $i(xx) & $i(xi) & $i(xN) & $i(xc) &  ? [v0: $i] :  ? [v1: $i] :  ?
% 27.82/4.57    [v2: $i] :  ? [v3: $i] :  ? [v4: $i] : (sdtlcdtrc0(xc, v3) = v4 &
% 27.82/4.57      sdtlpdtrp0(xN, xi) = v0 & sdtlpdtrp0(xc, v2) = xx & szDzozmdt0(xc) = v3 &
% 27.82/4.57      szmzizndt0(v0) = v1 & sdtpldt0(xQ, v1) = v2 & $i(v4) & $i(v3) & $i(v2) &
% 27.82/4.57      $i(v1) & $i(v0) & aElementOf0(xx, v4))
% 27.82/4.57  
% 27.82/4.57    (function-axioms)
% 27.82/4.58     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~
% 27.82/4.58      (sdtexdt0(v3, v2) = v1) |  ~ (sdtexdt0(v3, v2) = v0)) &  ! [v0: $i] :  !
% 27.82/4.58    [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~ (sdtlcdtrc0(v3, v2) = v1)
% 27.82/4.58      |  ~ (sdtlcdtrc0(v3, v2) = v0)) &  ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : 
% 27.82/4.58    ! [v3: $i] : (v1 = v0 |  ~ (sdtlbdtrb0(v3, v2) = v1) |  ~ (sdtlbdtrb0(v3, v2)
% 27.82/4.58        = v0)) &  ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0
% 27.82/4.58      |  ~ (sdtlpdtrp0(v3, v2) = v1) |  ~ (sdtlpdtrp0(v3, v2) = v0)) &  ! [v0: $i]
% 27.82/4.58    :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~ (slbdtsldtrb0(v3,
% 27.82/4.58          v2) = v1) |  ~ (slbdtsldtrb0(v3, v2) = v0)) &  ! [v0: $i] :  ! [v1: $i]
% 27.82/4.58    :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~ (sdtmndt0(v3, v2) = v1) |  ~
% 27.82/4.58      (sdtmndt0(v3, v2) = v0)) &  ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3:
% 27.82/4.58      $i] : (v1 = v0 |  ~ (sdtpldt0(v3, v2) = v1) |  ~ (sdtpldt0(v3, v2) = v0)) & 
% 27.82/4.58    ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : (v1 = v0 |  ~ (szDzizrdt0(v2) = v1) |
% 27.82/4.58       ~ (szDzizrdt0(v2) = v0)) &  ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : (v1 =
% 27.82/4.58      v0 |  ~ (szDzozmdt0(v2) = v1) |  ~ (szDzozmdt0(v2) = v0)) &  ! [v0: $i] :  !
% 27.82/4.58    [v1: $i] :  ! [v2: $i] : (v1 = v0 |  ~ (slbdtrb0(v2) = v1) |  ~ (slbdtrb0(v2)
% 27.82/4.58        = v0)) &  ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : (v1 = v0 |  ~
% 27.82/4.58      (szmzazxdt0(v2) = v1) |  ~ (szmzazxdt0(v2) = v0)) &  ! [v0: $i] :  ! [v1:
% 27.82/4.58      $i] :  ! [v2: $i] : (v1 = v0 |  ~ (szmzizndt0(v2) = v1) |  ~ (szmzizndt0(v2)
% 27.82/4.59        = v0)) &  ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : (v1 = v0 |  ~
% 27.82/4.59      (sbrdtbr0(v2) = v1) |  ~ (sbrdtbr0(v2) = v0)) &  ! [v0: $i] :  ! [v1: $i] : 
% 27.82/4.59    ! [v2: $i] : (v1 = v0 |  ~ (szszuzczcdt0(v2) = v1) |  ~ (szszuzczcdt0(v2) =
% 27.82/4.59        v0))
% 27.82/4.59  
% 27.82/4.59  Further assumptions not needed in the proof:
% 27.82/4.59  --------------------------------------------
% 27.82/4.59  mCConsSet, mCDiffSet, mCardCons, mCardDiff, mCardEmpty, mCardNum, mCardS,
% 27.82/4.59  mCardSeg, mCardSub, mCardSubEx, mCntRel, mConsDiff, mCountNFin, mCountNFin_01,
% 27.82/4.59  mDefCons, mDefDiff, mDefEmp, mDefMax, mDefMin, mDefPtt, mDefRst, mDefSImg,
% 27.82/4.59  mDefSeg, mDefSel, mDiffCons, mDirichlet, mDomSet, mEOfElem, mElmSort, mEmpFin,
% 27.82/4.59  mFConsSet, mFDiffSet, mFinRel, mFinSubSeg, mFunSort, mIH, mIHSort, mImgCount,
% 27.82/4.59  mImgElm, mImgRng, mLessASymm, mLessRefl, mLessRel, mLessSucc, mLessTotal,
% 27.82/4.59  mLessTrans, mMinMin, mNATSet, mNatExtra, mNatNSucc, mNoScLessZr, mPttSet,
% 27.82/4.59  mSegFin, mSegLess, mSegSucc, mSegZero, mSelCSet, mSelExtra, mSelFSet, mSelNSet,
% 27.82/4.59  mSelSub, mSetSort, mSubASymm, mSubFSet, mSubRefl, mSubTrans, mSuccEquSucc,
% 27.82/4.59  mSuccLess, mSuccNum, mZeroLess, mZeroNum, m__3398, m__3418, m__3435, m__3462,
% 27.82/4.59  m__3520, m__3533, m__3623, m__3671, m__3754, m__3821, m__3965, m__4151, m__4200,
% 27.82/4.59  m__4200_02, m__4237
% 27.82/4.59  
% 27.82/4.59  Those formulas are unsatisfiable:
% 27.82/4.59  ---------------------------------
% 27.82/4.59  
% 27.82/4.59  Begin of proof
% 27.82/4.59  | 
% 27.82/4.59  | ALPHA: (mDefSub) implies:
% 27.82/4.59  |   (1)   ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : ( ~ $i(v2) |  ~ $i(v1) |  ~
% 27.82/4.59  |          $i(v0) |  ~ aSubsetOf0(v1, v0) |  ~ aElementOf0(v2, v1) |  ~
% 27.82/4.59  |          aSet0(v0) | aElementOf0(v2, v0))
% 27.82/4.59  | 
% 27.82/4.59  | ALPHA: (m__3291) implies:
% 27.82/4.59  |   (2)  aSet0(xT)
% 27.82/4.59  | 
% 27.82/4.59  | ALPHA: (m__3453) implies:
% 27.82/4.59  |   (3)   ? [v0: $i] :  ? [v1: $i] : (sdtlcdtrc0(xc, v0) = v1 & szDzozmdt0(xc) =
% 27.82/4.59  |          v0 & slbdtsldtrb0(xS, xK) = v0 & $i(v1) & $i(v0) & aFunction0(xc) &
% 27.82/4.59  |          aSubsetOf0(v1, xT))
% 27.82/4.59  | 
% 27.82/4.59  | ALPHA: (m__4263) implies:
% 27.82/4.59  |   (4)   ? [v0: $i] :  ? [v1: $i] :  ? [v2: $i] :  ? [v3: $i] :  ? [v4: $i] :
% 27.82/4.59  |        (sdtlcdtrc0(xc, v3) = v4 & sdtlpdtrp0(xN, xi) = v0 & sdtlpdtrp0(xc, v2)
% 27.82/4.60  |          = xx & szDzozmdt0(xc) = v3 & szmzizndt0(v0) = v1 & sdtpldt0(xQ, v1) =
% 27.82/4.60  |          v2 & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0) & aElementOf0(xx,
% 27.82/4.60  |            v4))
% 27.82/4.60  | 
% 27.82/4.60  | ALPHA: (m__) implies:
% 27.82/4.60  |   (5)   ~ aElementOf0(xx, xT)
% 27.82/4.60  |   (6)  $i(xT)
% 27.82/4.60  |   (7)  $i(xx)
% 27.82/4.60  | 
% 27.82/4.60  | ALPHA: (function-axioms) implies:
% 27.82/4.60  |   (8)   ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : (v1 = v0 |  ~ (szDzozmdt0(v2)
% 27.82/4.60  |            = v1) |  ~ (szDzozmdt0(v2) = v0))
% 27.82/4.60  |   (9)   ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~
% 27.82/4.60  |          (sdtlcdtrc0(v3, v2) = v1) |  ~ (sdtlcdtrc0(v3, v2) = v0))
% 27.82/4.60  | 
% 27.82/4.60  | DELTA: instantiating (3) with fresh symbols all_70_0, all_70_1 gives:
% 27.82/4.60  |   (10)  sdtlcdtrc0(xc, all_70_1) = all_70_0 & szDzozmdt0(xc) = all_70_1 &
% 27.82/4.60  |         slbdtsldtrb0(xS, xK) = all_70_1 & $i(all_70_0) & $i(all_70_1) &
% 27.82/4.60  |         aFunction0(xc) & aSubsetOf0(all_70_0, xT)
% 27.82/4.60  | 
% 27.82/4.60  | ALPHA: (10) implies:
% 27.82/4.60  |   (11)  aSubsetOf0(all_70_0, xT)
% 27.82/4.60  |   (12)  szDzozmdt0(xc) = all_70_1
% 27.82/4.60  |   (13)  sdtlcdtrc0(xc, all_70_1) = all_70_0
% 27.82/4.60  | 
% 27.82/4.60  | DELTA: instantiating (4) with fresh symbols all_74_0, all_74_1, all_74_2,
% 27.82/4.60  |        all_74_3, all_74_4 gives:
% 27.82/4.60  |   (14)  sdtlcdtrc0(xc, all_74_1) = all_74_0 & sdtlpdtrp0(xN, xi) = all_74_4 &
% 27.82/4.60  |         sdtlpdtrp0(xc, all_74_2) = xx & szDzozmdt0(xc) = all_74_1 &
% 27.82/4.60  |         szmzizndt0(all_74_4) = all_74_3 & sdtpldt0(xQ, all_74_3) = all_74_2 &
% 27.82/4.60  |         $i(all_74_0) & $i(all_74_1) & $i(all_74_2) & $i(all_74_3) &
% 27.82/4.60  |         $i(all_74_4) & aElementOf0(xx, all_74_0)
% 27.82/4.60  | 
% 27.82/4.60  | ALPHA: (14) implies:
% 27.82/4.60  |   (15)  aElementOf0(xx, all_74_0)
% 27.82/4.60  |   (16)  $i(all_74_0)
% 27.82/4.60  |   (17)  szDzozmdt0(xc) = all_74_1
% 27.82/4.60  |   (18)  sdtlcdtrc0(xc, all_74_1) = all_74_0
% 27.82/4.60  | 
% 27.82/4.60  | GROUND_INST: instantiating (8) with all_70_1, all_74_1, xc, simplifying with
% 27.82/4.60  |              (12), (17) gives:
% 27.82/4.60  |   (19)  all_74_1 = all_70_1
% 27.82/4.60  | 
% 27.82/4.60  | REDUCE: (18), (19) imply:
% 27.82/4.60  |   (20)  sdtlcdtrc0(xc, all_70_1) = all_74_0
% 27.82/4.60  | 
% 27.82/4.61  | GROUND_INST: instantiating (9) with all_70_0, all_74_0, all_70_1, xc,
% 27.82/4.61  |              simplifying with (13), (20) gives:
% 27.82/4.61  |   (21)  all_74_0 = all_70_0
% 27.82/4.61  | 
% 27.82/4.61  | REDUCE: (16), (21) imply:
% 27.82/4.61  |   (22)  $i(all_70_0)
% 27.82/4.61  | 
% 27.82/4.61  | REDUCE: (15), (21) imply:
% 27.82/4.61  |   (23)  aElementOf0(xx, all_70_0)
% 27.82/4.61  | 
% 28.14/4.61  | GROUND_INST: instantiating (1) with xT, all_70_0, xx, simplifying with (2),
% 28.14/4.61  |              (5), (6), (7), (11), (22), (23) gives:
% 28.14/4.61  |   (24)  $false
% 28.14/4.61  | 
% 28.14/4.61  | CLOSE: (24) is inconsistent.
% 28.14/4.61  | 
% 28.14/4.61  End of proof
% 28.14/4.61  % SZS output end Proof for theBenchmark
% 28.14/4.61  
% 28.14/4.61  4008ms
%------------------------------------------------------------------------------