%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU596^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Sep 30 08:24:39 AM UTC 2026
% Result : Theorem 0.20s 0.30s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 22
% Syntax : Number of formulae : 49 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 650 ( 64 equ; 0 cnn)
% Maximal formula atoms : 148 ( 13 avg)
% Number of connectives : 1200 ( 59 ~; 45 |; 128 &; 524 @)
% ( 36 <=>; 408 =>; 0 <=; 0 <~>)
% Maximal formula depth : 170 ( 18 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 41 ( 41 >; 0 *; 0 +; 0 <<)
% Number of symbols : 128 ( 125 usr; 117 con; 0-4 aty)
% Number of variables : 243 ( 27 ^; 201 !; 15 ?; 243 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
in: $i > $i > $o ).
thf(decl_25,type,
setextAx: $o ).
thf(decl_26,type,
emptyset: $i ).
thf(decl_27,type,
emptysetAx: $o ).
thf(decl_29,type,
setadjoinAx: $o ).
thf(decl_30,type,
powerset: $i > $i ).
thf(decl_31,type,
powersetAx: $o ).
thf(decl_33,type,
setunionAx: $o ).
thf(decl_35,type,
omega0Ax: $o ).
thf(decl_36,type,
omegaSAx: $o ).
thf(decl_37,type,
omegaIndAx: $o ).
thf(decl_38,type,
replAx: $o ).
thf(decl_39,type,
foundationAx: $o ).
thf(decl_40,type,
wellorderingAx: $o ).
thf(decl_42,type,
descrp: $o ).
thf(decl_43,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(decl_44,type,
dsetconstrI: $o ).
thf(decl_45,type,
dsetconstrEL: $o ).
thf(decl_46,type,
dsetconstrER: $o ).
thf(decl_47,type,
exuE1: $o ).
thf(decl_49,type,
prop2setE: $o ).
thf(decl_50,type,
emptysetE: $o ).
thf(decl_51,type,
emptysetimpfalse: $o ).
thf(decl_52,type,
notinemptyset: $o ).
thf(decl_53,type,
exuE3e: $o ).
thf(decl_54,type,
setext: $o ).
thf(decl_55,type,
emptyI: $o ).
thf(decl_56,type,
noeltsimpempty: $o ).
thf(decl_57,type,
setbeta: $o ).
thf(decl_58,type,
nonempty: $i > $o ).
thf(decl_59,type,
nonemptyE1: $o ).
thf(decl_60,type,
nonemptyI: $o ).
thf(decl_61,type,
nonemptyI1: $o ).
thf(decl_62,type,
setadjoinIL: $o ).
thf(decl_63,type,
emptyinunitempty: $o ).
thf(decl_64,type,
setadjoinIR: $o ).
thf(decl_65,type,
setadjoinE: $o ).
thf(decl_66,type,
setadjoinOr: $o ).
thf(decl_67,type,
setoftrueEq: $o ).
thf(decl_68,type,
powersetI: $o ).
thf(decl_69,type,
emptyinPowerset: $o ).
thf(decl_70,type,
emptyInPowerset: $o ).
thf(decl_71,type,
powersetE: $o ).
thf(decl_72,type,
setunionI: $o ).
thf(decl_73,type,
setunionE: $o ).
thf(decl_74,type,
subPowSU: $o ).
thf(decl_75,type,
exuE2: $o ).
thf(decl_76,type,
nonemptyImpWitness: $o ).
thf(decl_77,type,
uniqinunit: $o ).
thf(decl_78,type,
notinsingleton: $o ).
thf(decl_79,type,
eqinunit: $o ).
thf(decl_80,type,
singletonsswitch: $o ).
thf(decl_81,type,
upairsetE: $o ).
thf(decl_82,type,
upairsetIL: $o ).
thf(decl_83,type,
upairsetIR: $o ).
thf(decl_84,type,
emptyE1: $o ).
thf(decl_85,type,
vacuousDall: $o ).
thf(decl_86,type,
quantDeMorgan1: $o ).
thf(decl_87,type,
quantDeMorgan2: $o ).
thf(decl_88,type,
quantDeMorgan3: $o ).
thf(decl_89,type,
quantDeMorgan4: $o ).
thf(decl_90,type,
prop2setI: $o ).
thf(decl_92,type,
prop2set2propI: $o ).
thf(decl_93,type,
notdexE: $o ).
thf(decl_94,type,
notdallE: $o ).
thf(decl_95,type,
exuI1: $o ).
thf(decl_96,type,
exuI3: $o ).
thf(decl_97,type,
exuI2: $o ).
thf(decl_98,type,
inCongP: $o ).
thf(decl_99,type,
in__Cong: $o ).
thf(decl_100,type,
exuE3u: $o ).
thf(decl_101,type,
exu__Cong: $o ).
thf(decl_102,type,
emptyset__Cong: $o ).
thf(decl_103,type,
setadjoin__Cong: $o ).
thf(decl_104,type,
powerset__Cong: $o ).
thf(decl_105,type,
setunion__Cong: $o ).
thf(decl_106,type,
omega__Cong: $o ).
thf(decl_107,type,
exuEu: $o ).
thf(decl_108,type,
descr__Cong: $o ).
thf(decl_109,type,
dsetconstr__Cong: $o ).
thf(decl_110,type,
subset: $i > $i > $o ).
thf(decl_113,type,
subsetI1: $o ).
thf(decl_114,type,
eqimpsubset2: $o ).
thf(decl_115,type,
eqimpsubset1: $o ).
thf(decl_116,type,
subsetI2: $o ).
thf(decl_117,type,
emptysetsubset: $o ).
thf(decl_118,type,
subsetE: $o ).
thf(decl_119,type,
subsetE2: $o ).
thf(decl_120,type,
notsubsetI: $o ).
thf(decl_121,type,
notequalI1: $o ).
thf(decl_122,type,
notequalI2: $o ).
thf(decl_123,type,
subsetRefl: $o ).
thf(decl_124,type,
subsetTrans: $o ).
thf(decl_125,type,
setadjoinSub: $o ).
thf(decl_126,type,
setadjoinSub2: $o ).
thf(decl_127,type,
subset2powerset: $o ).
thf(decl_128,type,
setextsub: $o ).
thf(decl_129,type,
subsetemptysetimpeq: $o ).
thf(decl_130,type,
powersetI1: $o ).
thf(decl_131,type,
powersetE1: $o ).
thf(decl_132,type,
inPowerset: $o ).
thf(decl_133,type,
powersetsubset: $o ).
thf(decl_134,type,
sepInPowerset: $o ).
thf(decl_135,type,
sepSubset: $o ).
thf(decl_137,type,
binunionIL: $o ).
thf(decl_138,type,
upairset2IR: $o ).
thf(decl_139,type,
binunionIR: $o ).
thf(decl_140,type,
binunionEcases: $o ).
thf(decl_141,type,
binunionE: $o ).
thf(decl_142,type,
binunionLsub: $o ).
thf(decl_143,type,
binunionRsub: $o ).
thf(decl_144,type,
binintersect: $i > $i > $i ).
thf(decl_145,type,
binintersectI: $o ).
thf(decl_146,type,
binintersectSubset5: $o ).
thf(decl_147,type,
binintersectEL: $o ).
thf(decl_148,type,
binintersectLsub: $o ).
thf(decl_149,type,
binintersectSubset2: $o ).
thf(decl_150,type,
binintersectSubset3: $o ).
thf(decl_151,type,
binintersectER: $o ).
thf(decl_152,type,
esk1_1: $i > $i ).
thf(decl_153,type,
esk2_1: $i > $i ).
thf(decl_154,type,
esk3_4: $i > $i > ( $i > $o ) > ( $i > $o ) > $i ).
thf(decl_155,type,
esk4_4: $i > $i > ( $i > $o ) > ( $i > $o ) > $i ).
thf(decl_156,type,
esk5_0: $i ).
thf(decl_157,type,
esk6_0: $i ).
thf(nonempty,axiom,
( nonempty
= ( ^ [X2: $i] : ( X2 != emptyset ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.nUHvAiSF2l/E---3.1_132461.p',nonempty) ).
thf(nonemptyI,axiom,
( nonemptyI
<=> ! [X4: $i,X1: $i > $o,X2: $i] :
( ( in @ X2 @ X4 )
=> ( ( X1 @ X2 )
=> ( nonempty
@ ( dsetconstr @ X4
@ ^ [X3: $i] : ( X1 @ X3 ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.nUHvAiSF2l/E---3.1_132461.p',nonemptyI) ).
thf(disjointsetsI1,conjecture,
( setextAx
=> ( emptysetAx
=> ( setadjoinAx
=> ( powersetAx
=> ( setunionAx
=> ( omega0Ax
=> ( omegaSAx
=> ( omegaIndAx
=> ( replAx
=> ( foundationAx
=> ( wellorderingAx
=> ( descrp
=> ( dsetconstrI
=> ( dsetconstrEL
=> ( dsetconstrER
=> ( exuE1
=> ( prop2setE
=> ( emptysetE
=> ( emptysetimpfalse
=> ( notinemptyset
=> ( exuE3e
=> ( setext
=> ( emptyI
=> ( noeltsimpempty
=> ( setbeta
=> ( nonemptyE1
=> ( nonemptyI
=> ( nonemptyI1
=> ( setadjoinIL
=> ( emptyinunitempty
=> ( setadjoinIR
=> ( setadjoinE
=> ( setadjoinOr
=> ( setoftrueEq
=> ( powersetI
=> ( emptyinPowerset
=> ( emptyInPowerset
=> ( powersetE
=> ( setunionI
=> ( setunionE
=> ( subPowSU
=> ( exuE2
=> ( nonemptyImpWitness
=> ( uniqinunit
=> ( notinsingleton
=> ( eqinunit
=> ( singletonsswitch
=> ( upairsetE
=> ( upairsetIL
=> ( upairsetIR
=> ( emptyE1
=> ( vacuousDall
=> ( quantDeMorgan1
=> ( quantDeMorgan2
=> ( quantDeMorgan3
=> ( quantDeMorgan4
=> ( prop2setI
=> ( prop2set2propI
=> ( notdexE
=> ( notdallE
=> ( exuI1
=> ( exuI3
=> ( exuI2
=> ( inCongP
=> ( in__Cong
=> ( exuE3u
=> ( exu__Cong
=> ( emptyset__Cong
=> ( setadjoin__Cong
=> ( powerset__Cong
=> ( setunion__Cong
=> ( omega__Cong
=> ( exuEu
=> ( descr__Cong
=> ( dsetconstr__Cong
=> ( subsetI1
=> ( eqimpsubset2
=> ( eqimpsubset1
=> ( subsetI2
=> ( emptysetsubset
=> ( subsetE
=> ( subsetE2
=> ( notsubsetI
=> ( notequalI1
=> ( notequalI2
=> ( subsetRefl
=> ( subsetTrans
=> ( setadjoinSub
=> ( setadjoinSub2
=> ( subset2powerset
=> ( setextsub
=> ( subsetemptysetimpeq
=> ( powersetI1
=> ( powersetE1
=> ( inPowerset
=> ( powersetsubset
=> ( sepInPowerset
=> ( sepSubset
=> ( binunionIL
=> ( upairset2IR
=> ( binunionIR
=> ( binunionEcases
=> ( binunionE
=> ( binunionLsub
=> ( binunionRsub
=> ( binintersectI
=> ( binintersectSubset5
=> ( binintersectEL
=> ( binintersectLsub
=> ( binintersectSubset2
=> ( binintersectSubset3
=> ( binintersectER
=> ! [X4: $i,X5: $i] :
( ~ ? [X2: $i] :
( ( in @ X2 @ X4 )
& ( in @ X2 @ X5 ) )
=> ( ( binintersect @ X4 @ X5 )
= emptyset ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.nUHvAiSF2l/E---3.1_132461.p',disjointsetsI1) ).
thf(sepSubset,axiom,
( sepSubset
<=> ! [X4: $i,X1: $i > $o] :
( subset
@ ( dsetconstr @ X4
@ ^ [X2: $i] : ( X1 @ X2 ) )
@ X4 ) ),
file('/export/starexec/sandbox2/tmp/tmp.nUHvAiSF2l/E---3.1_132461.p',sepSubset) ).
thf(sepInPowerset,axiom,
( sepInPowerset
<=> ! [X4: $i,X1: $i > $o] :
( in
@ ( dsetconstr @ X4
@ ^ [X2: $i] : ( X1 @ X2 ) )
@ ( powerset @ X4 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.nUHvAiSF2l/E---3.1_132461.p',sepInPowerset) ).
thf(dsetconstr__Cong,axiom,
( dsetconstr__Cong
<=> ! [X4: $i,X5: $i] :
( ( X4 = X5 )
=> ! [X1: $i > $o,X17: $i > $o] :
( ! [X2: $i] :
( ( in @ X2 @ X4 )
=> ! [X3: $i] :
( ( in @ X3 @ X5 )
=> ( ( X2 = X3 )
=> ( ( X1 @ X2 )
<=> ( X17 @ X3 ) ) ) ) )
=> ( ( dsetconstr @ X4
@ ^ [X2: $i] : ( X1 @ X2 ) )
= ( dsetconstr @ X5
@ ^ [X2: $i] : ( X17 @ X2 ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.nUHvAiSF2l/E---3.1_132461.p',dsetconstr__Cong) ).
thf(emptyE1,axiom,
( emptyE1
<=> ! [X4: $i,X1: $i > $o] :
( ? [X2: $i] :
( ( in @ X2 @ X4 )
& ( X1 @ X2 ) )
=> ( ( ( dsetconstr @ X4
@ ^ [X2: $i] : ( X1 @ X2 ) )
= emptyset )
=> ~ $true ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.nUHvAiSF2l/E---3.1_132461.p',emptyE1) ).
thf(setoftrueEq,axiom,
( setoftrueEq
<=> ! [X4: $i] :
( ( dsetconstr @ X4
@ ^ [X2: $i] : $true )
= X4 ) ),
file('/export/starexec/sandbox2/tmp/tmp.nUHvAiSF2l/E---3.1_132461.p',setoftrueEq) ).
thf(setbeta,axiom,
( setbeta
<=> ! [X4: $i,X1: $i > $o,X2: $i] :
( ( in @ X2 @ X4 )
=> ( ( in @ X2
@ ( dsetconstr @ X4
@ ^ [X3: $i] : ( X1 @ X3 ) ) )
<=> ( X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.nUHvAiSF2l/E---3.1_132461.p',setbeta) ).
thf(dsetconstrER,axiom,
( dsetconstrER
<=> ! [X4: $i,X1: $i > $o,X2: $i] :
( ( in @ X2
@ ( dsetconstr @ X4
@ ^ [X3: $i] : ( X1 @ X3 ) ) )
=> ( X1 @ X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.nUHvAiSF2l/E---3.1_132461.p',dsetconstrER) ).
thf(dsetconstrEL,axiom,
( dsetconstrEL
<=> ! [X4: $i,X1: $i > $o,X2: $i] :
( ( in @ X2
@ ( dsetconstr @ X4
@ ^ [X3: $i] : ( X1 @ X3 ) ) )
=> ( in @ X2 @ X4 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.nUHvAiSF2l/E---3.1_132461.p',dsetconstrEL) ).
thf(dsetconstrI,axiom,
( dsetconstrI
<=> ! [X4: $i,X1: $i > $o,X2: $i] :
( ( in @ X2 @ X4 )
=> ( ( X1 @ X2 )
=> ( in @ X2
@ ( dsetconstr @ X4
@ ^ [X3: $i] : ( X1 @ X3 ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.nUHvAiSF2l/E---3.1_132461.p',dsetconstrI) ).
thf(nonemptyImpWitness,axiom,
( nonemptyImpWitness
<=> ! [X4: $i] :
( ( nonempty @ X4 )
=> ? [X2: $i] :
( ( in @ X2 @ X4 )
& $true ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.nUHvAiSF2l/E---3.1_132461.p',nonemptyImpWitness) ).
thf(nonemptyI1,axiom,
( nonemptyI1
<=> ! [X4: $i] :
( ? [X2: $i] : ( in @ X2 @ X4 )
=> ( nonempty @ X4 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.nUHvAiSF2l/E---3.1_132461.p',nonemptyI1) ).
thf(nonemptyE1,axiom,
( nonemptyE1
<=> ! [X4: $i] :
( ( nonempty @ X4 )
=> ? [X2: $i] : ( in @ X2 @ X4 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.nUHvAiSF2l/E---3.1_132461.p',nonemptyE1) ).
thf(binintersectER,axiom,
( binintersectER
<=> ! [X4: $i,X5: $i,X2: $i] :
( ( in @ X2 @ ( binintersect @ X4 @ X5 ) )
=> ( in @ X2 @ X5 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.nUHvAiSF2l/E---3.1_132461.p',binintersectER) ).
thf(binintersectSubset3,axiom,
( binintersectSubset3
<=> ! [X4: $i,X5: $i] :
( ( ( binintersect @ X4 @ X5 )
= X5 )
=> ( subset @ X5 @ X4 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.nUHvAiSF2l/E---3.1_132461.p',binintersectSubset3) ).
thf(binintersectSubset2,axiom,
( binintersectSubset2
<=> ! [X4: $i,X5: $i] :
( ( subset @ X4 @ X5 )
=> ( ( binintersect @ X4 @ X5 )
= X4 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.nUHvAiSF2l/E---3.1_132461.p',binintersectSubset2) ).
thf(binintersectLsub,axiom,
( binintersectLsub
<=> ! [X4: $i,X5: $i] : ( subset @ ( binintersect @ X4 @ X5 ) @ X4 ) ),
file('/export/starexec/sandbox2/tmp/tmp.nUHvAiSF2l/E---3.1_132461.p',binintersectLsub) ).
thf(binintersectEL,axiom,
( binintersectEL
<=> ! [X4: $i,X5: $i,X2: $i] :
( ( in @ X2 @ ( binintersect @ X4 @ X5 ) )
=> ( in @ X2 @ X4 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.nUHvAiSF2l/E---3.1_132461.p',binintersectEL) ).
thf(binintersectSubset5,axiom,
( binintersectSubset5
<=> ! [X4: $i,X5: $i,X7: $i] :
( ( subset @ X7 @ X4 )
=> ( ( subset @ X7 @ X5 )
=> ( subset @ X7 @ ( binintersect @ X4 @ X5 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.nUHvAiSF2l/E---3.1_132461.p',binintersectSubset5) ).
thf(binintersectI,axiom,
( binintersectI
<=> ! [X4: $i,X5: $i,X2: $i] :
( ( in @ X2 @ X4 )
=> ( ( in @ X2 @ X5 )
=> ( in @ X2 @ ( binintersect @ X4 @ X5 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.nUHvAiSF2l/E---3.1_132461.p',binintersectI) ).
thf(c_0_22,plain,
( nonempty
= ( ^ [Z0: $i] : ( Z0 != emptyset ) ) ),
inference(fof_simplification,[status(thm)],[nonempty]) ).
thf(c_0_23,plain,
( nonemptyI
<=> ! [X4: $i,X1: $i > $o,X2: $i] :
( ( in @ X2 @ X4 )
=> ( ( X1 @ X2 )
=> ( nonempty
@ ( dsetconstr @ X4
@ ^ [Z0: $i] : ( X1 @ Z0 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[nonemptyI]) ).
thf(c_0_24,negated_conjecture,
~ ( setextAx
=> ( emptysetAx
=> ( setadjoinAx
=> ( powersetAx
=> ( setunionAx
=> ( omega0Ax
=> ( omegaSAx
=> ( omegaIndAx
=> ( replAx
=> ( foundationAx
=> ( wellorderingAx
=> ( descrp
=> ( dsetconstrI
=> ( dsetconstrEL
=> ( dsetconstrER
=> ( exuE1
=> ( prop2setE
=> ( emptysetE
=> ( emptysetimpfalse
=> ( notinemptyset
=> ( exuE3e
=> ( setext
=> ( emptyI
=> ( noeltsimpempty
=> ( setbeta
=> ( nonemptyE1
=> ( nonemptyI
=> ( nonemptyI1
=> ( setadjoinIL
=> ( emptyinunitempty
=> ( setadjoinIR
=> ( setadjoinE
=> ( setadjoinOr
=> ( setoftrueEq
=> ( powersetI
=> ( emptyinPowerset
=> ( emptyInPowerset
=> ( powersetE
=> ( setunionI
=> ( setunionE
=> ( subPowSU
=> ( exuE2
=> ( nonemptyImpWitness
=> ( uniqinunit
=> ( notinsingleton
=> ( eqinunit
=> ( singletonsswitch
=> ( upairsetE
=> ( upairsetIL
=> ( upairsetIR
=> ( emptyE1
=> ( vacuousDall
=> ( quantDeMorgan1
=> ( quantDeMorgan2
=> ( quantDeMorgan3
=> ( quantDeMorgan4
=> ( prop2setI
=> ( prop2set2propI
=> ( notdexE
=> ( notdallE
=> ( exuI1
=> ( exuI3
=> ( exuI2
=> ( inCongP
=> ( in__Cong
=> ( exuE3u
=> ( exu__Cong
=> ( emptyset__Cong
=> ( setadjoin__Cong
=> ( powerset__Cong
=> ( setunion__Cong
=> ( omega__Cong
=> ( exuEu
=> ( descr__Cong
=> ( dsetconstr__Cong
=> ( subsetI1
=> ( eqimpsubset2
=> ( eqimpsubset1
=> ( subsetI2
=> ( emptysetsubset
=> ( subsetE
=> ( subsetE2
=> ( notsubsetI
=> ( notequalI1
=> ( notequalI2
=> ( subsetRefl
=> ( subsetTrans
=> ( setadjoinSub
=> ( setadjoinSub2
=> ( subset2powerset
=> ( setextsub
=> ( subsetemptysetimpeq
=> ( powersetI1
=> ( powersetE1
=> ( inPowerset
=> ( powersetsubset
=> ( sepInPowerset
=> ( sepSubset
=> ( binunionIL
=> ( upairset2IR
=> ( binunionIR
=> ( binunionEcases
=> ( binunionE
=> ( binunionLsub
=> ( binunionRsub
=> ( binintersectI
=> ( binintersectSubset5
=> ( binintersectEL
=> ( binintersectLsub
=> ( binintersectSubset2
=> ( binintersectSubset3
=> ( binintersectER
=> ! [X4: $i,X5: $i] :
( ~ ? [X2: $i] :
( ( in @ X2 @ X4 )
& ( in @ X2 @ X5 ) )
=> ( ( binintersect @ X4 @ X5 )
= emptyset ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[disjointsetsI1]) ).
thf(c_0_25,plain,
( sepSubset
<=> ! [X4: $i,X1: $i > $o] :
( subset
@ ( dsetconstr @ X4
@ ^ [Z0: $i] : ( X1 @ Z0 ) )
@ X4 ) ),
inference(fof_simplification,[status(thm)],[sepSubset]) ).
thf(c_0_26,plain,
( sepInPowerset
<=> ! [X4: $i,X1: $i > $o] :
( in
@ ( dsetconstr @ X4
@ ^ [Z0: $i] : ( X1 @ Z0 ) )
@ ( powerset @ X4 ) ) ),
inference(fof_simplification,[status(thm)],[sepInPowerset]) ).
thf(c_0_27,plain,
( dsetconstr__Cong
<=> ! [X4: $i,X5: $i] :
( ( X4 = X5 )
=> ! [X1: $i > $o,X17: $i > $o] :
( ! [X2: $i] :
( ( in @ X2 @ X4 )
=> ! [X3: $i] :
( ( in @ X3 @ X5 )
=> ( ( X2 = X3 )
=> ( ( X1 @ X2 )
<=> ( X17 @ X3 ) ) ) ) )
=> ( ( dsetconstr @ X4
@ ^ [Z0: $i] : ( X1 @ Z0 ) )
= ( dsetconstr @ X5
@ ^ [Z0: $i] : ( X17 @ Z0 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[dsetconstr__Cong]) ).
thf(c_0_28,plain,
( emptyE1
<=> ! [X4: $i,X1: $i > $o] :
( ? [X2: $i] :
( ( in @ X2 @ X4 )
& ( X1 @ X2 ) )
=> ( ( ( dsetconstr @ X4
@ ^ [Z0: $i] : ( X1 @ Z0 ) )
= emptyset )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[emptyE1]) ).
thf(c_0_29,plain,
( setoftrueEq
<=> ! [X4: $i] :
( ( dsetconstr @ X4
@ ^ [Z0: $i] : $true )
= X4 ) ),
inference(fof_simplification,[status(thm)],[setoftrueEq]) ).
thf(c_0_30,plain,
( setbeta
<=> ! [X4: $i,X1: $i > $o,X2: $i] :
( ( in @ X2 @ X4 )
=> ( ( in @ X2
@ ( dsetconstr @ X4
@ ^ [Z0: $i] : ( X1 @ Z0 ) ) )
<=> ( X1 @ X2 ) ) ) ),
inference(fof_simplification,[status(thm)],[setbeta]) ).
thf(c_0_31,plain,
( dsetconstrER
<=> ! [X4: $i,X1: $i > $o,X2: $i] :
( ( in @ X2
@ ( dsetconstr @ X4
@ ^ [Z0: $i] : ( X1 @ Z0 ) ) )
=> ( X1 @ X2 ) ) ),
inference(fof_simplification,[status(thm)],[dsetconstrER]) ).
thf(c_0_32,plain,
( dsetconstrEL
<=> ! [X4: $i,X1: $i > $o,X2: $i] :
( ( in @ X2
@ ( dsetconstr @ X4
@ ^ [Z0: $i] : ( X1 @ Z0 ) ) )
=> ( in @ X2 @ X4 ) ) ),
inference(fof_simplification,[status(thm)],[dsetconstrEL]) ).
thf(c_0_33,plain,
( dsetconstrI
<=> ! [X4: $i,X1: $i > $o,X2: $i] :
( ( in @ X2 @ X4 )
=> ( ( X1 @ X2 )
=> ( in @ X2
@ ( dsetconstr @ X4
@ ^ [Z0: $i] : ( X1 @ Z0 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[dsetconstrI]) ).
thf(c_0_34,axiom,
( nonemptyImpWitness
= ( ! [X4: $i] :
( ( X4 != emptyset )
=> ? [X2: $i] :
( ( in @ X2 @ X4 )
& $true ) ) ) ),
inference(apply_def,[status(thm)],[nonemptyImpWitness,c_0_22]) ).
thf(c_0_35,axiom,
( nonemptyI1
= ( ! [X4: $i] :
( ? [X2: $i] : ( in @ X2 @ X4 )
=> ( X4 != emptyset ) ) ) ),
inference(apply_def,[status(thm)],[nonemptyI1,c_0_22]) ).
thf(c_0_36,plain,
( nonemptyI
= ( ! [X4: $i,X1: $i > $o,X2: $i] :
( ( in @ X2 @ X4 )
=> ( ( X1 @ X2 )
=> ( ( dsetconstr @ X4
@ ^ [Z0: $i] : ( X1 @ Z0 ) )
!= emptyset ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_23,c_0_22]) ).
thf(c_0_37,axiom,
( nonemptyE1
= ( ! [X4: $i] :
( ( X4 != emptyset )
=> ? [X2: $i] : ( in @ X2 @ X4 ) ) ) ),
inference(apply_def,[status(thm)],[nonemptyE1,c_0_22]) ).
thf(c_0_38,negated_conjecture,
~ ( setextAx
=> ( emptysetAx
=> ( setadjoinAx
=> ( powersetAx
=> ( setunionAx
=> ( omega0Ax
=> ( omegaSAx
=> ( omegaIndAx
=> ( replAx
=> ( foundationAx
=> ( wellorderingAx
=> ( descrp
=> ( ! [X76: $i,X77: $i > $o,X78: $i] :
( ( in @ X78 @ X76 )
=> ( ( X77 @ X78 )
=> ( in @ X78 @ ( dsetconstr @ X76 @ X77 ) ) ) )
=> ( ! [X79: $i,X80: $i > $o,X81: $i] :
( ( in @ X81 @ ( dsetconstr @ X79 @ X80 ) )
=> ( in @ X81 @ X79 ) )
=> ( ! [X82: $i,X83: $i > $o,X84: $i] :
( ( in @ X84 @ ( dsetconstr @ X82 @ X83 ) )
=> ( X83 @ X84 ) )
=> ( exuE1
=> ( prop2setE
=> ( emptysetE
=> ( emptysetimpfalse
=> ( notinemptyset
=> ( exuE3e
=> ( setext
=> ( emptyI
=> ( noeltsimpempty
=> ( ! [X85: $i,X86: $i > $o,X87: $i] :
( ( in @ X87 @ X85 )
=> ( ( in @ X87 @ ( dsetconstr @ X85 @ X86 ) )
<=> ( X86 @ X87 ) ) )
=> ( ! [X88: $i] :
( ( X88 != emptyset )
=> ? [X89: $i] : ( in @ X89 @ X88 ) )
=> ( ! [X90: $i,X91: $i > $o,X92: $i] :
( ( in @ X92 @ X90 )
=> ( ( X91 @ X92 )
=> ( ( dsetconstr @ X90 @ X91 )
!= emptyset ) ) )
=> ( ! [X93: $i] :
( ? [X94: $i] : ( in @ X94 @ X93 )
=> ( X93 != emptyset ) )
=> ( setadjoinIL
=> ( emptyinunitempty
=> ( setadjoinIR
=> ( setadjoinE
=> ( setadjoinOr
=> ( ! [X95: $i] :
( ( dsetconstr @ X95
@ ^ [Z0: $i] : $true )
= X95 )
=> ( powersetI
=> ( emptyinPowerset
=> ( emptyInPowerset
=> ( powersetE
=> ( setunionI
=> ( setunionE
=> ( subPowSU
=> ( exuE2
=> ( ! [X96: $i] :
( ( X96 != emptyset )
=> ? [X97: $i] :
( ( in @ X97 @ X96 )
& $true ) )
=> ( uniqinunit
=> ( notinsingleton
=> ( eqinunit
=> ( singletonsswitch
=> ( upairsetE
=> ( upairsetIL
=> ( upairsetIR
=> ( ! [X98: $i,X99: $i > $o] :
( ? [X100: $i] :
( ( in @ X100 @ X98 )
& ( X99 @ X100 ) )
=> ( ( ( dsetconstr @ X98 @ X99 )
= emptyset )
=> ~ $true ) )
=> ( vacuousDall
=> ( quantDeMorgan1
=> ( quantDeMorgan2
=> ( quantDeMorgan3
=> ( quantDeMorgan4
=> ( prop2setI
=> ( prop2set2propI
=> ( notdexE
=> ( notdallE
=> ( exuI1
=> ( exuI3
=> ( exuI2
=> ( inCongP
=> ( in__Cong
=> ( exuE3u
=> ( exu__Cong
=> ( emptyset__Cong
=> ( setadjoin__Cong
=> ( powerset__Cong
=> ( setunion__Cong
=> ( omega__Cong
=> ( exuEu
=> ( descr__Cong
=> ( ! [X101: $i,X102: $i] :
( ( X101 = X102 )
=> ! [X103: $i > $o,X104: $i > $o] :
( ! [X105: $i] :
( ( in @ X105 @ X101 )
=> ! [X106: $i] :
( ( in @ X106 @ X102 )
=> ( ( X105 = X106 )
=> ( ( X103 @ X105 )
<=> ( X104 @ X106 ) ) ) ) )
=> ( ( dsetconstr @ X101 @ X103 )
= ( dsetconstr @ X102 @ X104 ) ) ) )
=> ( subsetI1
=> ( eqimpsubset2
=> ( eqimpsubset1
=> ( subsetI2
=> ( emptysetsubset
=> ( subsetE
=> ( subsetE2
=> ( notsubsetI
=> ( notequalI1
=> ( notequalI2
=> ( subsetRefl
=> ( subsetTrans
=> ( setadjoinSub
=> ( setadjoinSub2
=> ( subset2powerset
=> ( setextsub
=> ( subsetemptysetimpeq
=> ( powersetI1
=> ( powersetE1
=> ( inPowerset
=> ( powersetsubset
=> ( ! [X107: $i,X108: $i > $o] : ( in @ ( dsetconstr @ X107 @ X108 ) @ ( powerset @ X107 ) )
=> ( ! [X109: $i,X110: $i > $o] : ( subset @ ( dsetconstr @ X109 @ X110 ) @ X109 )
=> ( binunionIL
=> ( upairset2IR
=> ( binunionIR
=> ( binunionEcases
=> ( binunionE
=> ( binunionLsub
=> ( binunionRsub
=> ( ! [X111: $i,X112: $i,X113: $i] :
( ( in @ X113 @ X111 )
=> ( ( in @ X113 @ X112 )
=> ( in @ X113 @ ( binintersect @ X111 @ X112 ) ) ) )
=> ( ! [X114: $i,X115: $i,X116: $i] :
( ( subset @ X116 @ X114 )
=> ( ( subset @ X116 @ X115 )
=> ( subset @ X116 @ ( binintersect @ X114 @ X115 ) ) ) )
=> ( ! [X117: $i,X118: $i,X119: $i] :
( ( in @ X119 @ ( binintersect @ X117 @ X118 ) )
=> ( in @ X119 @ X117 ) )
=> ( ! [X120: $i,X121: $i] : ( subset @ ( binintersect @ X120 @ X121 ) @ X120 )
=> ( ! [X122: $i,X123: $i] :
( ( subset @ X122 @ X123 )
=> ( ( binintersect @ X122 @ X123 )
= X122 ) )
=> ( ! [X124: $i,X125: $i] :
( ( ( binintersect @ X124 @ X125 )
= X125 )
=> ( subset @ X125 @ X124 ) )
=> ( ! [X126: $i,X127: $i,X128: $i] :
( ( in @ X128 @ ( binintersect @ X126 @ X127 ) )
=> ( in @ X128 @ X127 ) )
=> ! [X4: $i,X5: $i] :
( ~ ? [X2: $i] :
( ( in @ X2 @ X4 )
& ( in @ X2 @ X5 ) )
=> ( ( binintersect @ X4 @ X5 )
= emptyset ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27]),c_0_28]),c_0_29]),c_0_30]),c_0_31]),c_0_32]),c_0_33]),c_0_34]),c_0_35]),c_0_36]),c_0_37]),binintersectER]),binintersectSubset3]),binintersectSubset2]),binintersectLsub]),binintersectEL]),binintersectSubset5]),binintersectI])])]) ).
thf(c_0_39,negated_conjecture,
! [X129: $i,X130: $i > $o,X131: $i,X132: $i,X133: $i > $o,X134: $i,X135: $i,X136: $i > $o,X137: $i,X138: $i,X139: $i > $o,X140: $i,X141: $i,X143: $i,X144: $i > $o,X145: $i,X146: $i,X147: $i,X148: $i,X149: $i,X151: $i,X152: $i > $o,X153: $i,X154: $i,X155: $i,X156: $i > $o,X157: $i > $o,X160: $i,X161: $i > $o,X162: $i,X163: $i > $o,X164: $i,X165: $i,X166: $i,X167: $i,X168: $i,X169: $i,X170: $i,X171: $i,X172: $i,X173: $i,X174: $i,X175: $i,X176: $i,X177: $i,X178: $i,X179: $i,X180: $i,X181: $i,X184: $i] :
( setextAx
& emptysetAx
& setadjoinAx
& powersetAx
& setunionAx
& omega0Ax
& omegaSAx
& omegaIndAx
& replAx
& foundationAx
& wellorderingAx
& descrp
& ( ~ ( in @ X131 @ X129 )
| ~ ( X130 @ X131 )
| ( in @ X131 @ ( dsetconstr @ X129 @ X130 ) ) )
& ( ~ ( in @ X134 @ ( dsetconstr @ X132 @ X133 ) )
| ( in @ X134 @ X132 ) )
& ( ~ ( in @ X137 @ ( dsetconstr @ X135 @ X136 ) )
| ( X136 @ X137 ) )
& exuE1
& prop2setE
& emptysetE
& emptysetimpfalse
& notinemptyset
& exuE3e
& setext
& emptyI
& noeltsimpempty
& ( ~ ( in @ X140 @ ( dsetconstr @ X138 @ X139 ) )
| ( X139 @ X140 )
| ~ ( in @ X140 @ X138 ) )
& ( ~ ( X139 @ X140 )
| ( in @ X140 @ ( dsetconstr @ X138 @ X139 ) )
| ~ ( in @ X140 @ X138 ) )
& ( ( X141 = emptyset )
| ( in @ ( esk1_1 @ X141 ) @ X141 ) )
& ( ~ ( in @ X145 @ X143 )
| ~ ( X144 @ X145 )
| ( ( dsetconstr @ X143 @ X144 )
!= emptyset ) )
& ( ~ ( in @ X147 @ X146 )
| ( X146 != emptyset ) )
& setadjoinIL
& emptyinunitempty
& setadjoinIR
& setadjoinE
& setadjoinOr
& ( ( dsetconstr @ X148
@ ^ [Z0: $i] : $true )
= X148 )
& powersetI
& emptyinPowerset
& emptyInPowerset
& powersetE
& setunionI
& setunionE
& subPowSU
& exuE2
& ( ( in @ ( esk2_1 @ X149 ) @ X149 )
| ( X149 = emptyset ) )
& ( $true
| ( X149 = emptyset ) )
& uniqinunit
& notinsingleton
& eqinunit
& singletonsswitch
& upairsetE
& upairsetIL
& upairsetIR
& ( ~ ( in @ X153 @ X151 )
| ~ ( X152 @ X153 )
| ( ( dsetconstr @ X151 @ X152 )
!= emptyset )
| ~ $true )
& vacuousDall
& quantDeMorgan1
& quantDeMorgan2
& quantDeMorgan3
& quantDeMorgan4
& prop2setI
& prop2set2propI
& notdexE
& notdallE
& exuI1
& exuI3
& exuI2
& inCongP
& in__Cong
& exuE3u
& exu__Cong
& emptyset__Cong
& setadjoin__Cong
& powerset__Cong
& setunion__Cong
& omega__Cong
& exuEu
& descr__Cong
& ( ( in @ ( esk3_4 @ X154 @ X155 @ X156 @ X157 ) @ X154 )
| ( ( dsetconstr @ X154 @ X156 )
= ( dsetconstr @ X155 @ X157 ) )
| ( X154 != X155 ) )
& ( ( in @ ( esk4_4 @ X154 @ X155 @ X156 @ X157 ) @ X155 )
| ( ( dsetconstr @ X154 @ X156 )
= ( dsetconstr @ X155 @ X157 ) )
| ( X154 != X155 ) )
& ( ( ( esk3_4 @ X154 @ X155 @ X156 @ X157 )
= ( esk4_4 @ X154 @ X155 @ X156 @ X157 ) )
| ( ( dsetconstr @ X154 @ X156 )
= ( dsetconstr @ X155 @ X157 ) )
| ( X154 != X155 ) )
& ( ~ ( X156 @ ( esk3_4 @ X154 @ X155 @ X156 @ X157 ) )
| ~ ( X157 @ ( esk4_4 @ X154 @ X155 @ X156 @ X157 ) )
| ( ( dsetconstr @ X154 @ X156 )
= ( dsetconstr @ X155 @ X157 ) )
| ( X154 != X155 ) )
& ( ( X156 @ ( esk3_4 @ X154 @ X155 @ X156 @ X157 ) )
| ( X157 @ ( esk4_4 @ X154 @ X155 @ X156 @ X157 ) )
| ( ( dsetconstr @ X154 @ X156 )
= ( dsetconstr @ X155 @ X157 ) )
| ( X154 != X155 ) )
& subsetI1
& eqimpsubset2
& eqimpsubset1
& subsetI2
& emptysetsubset
& subsetE
& subsetE2
& notsubsetI
& notequalI1
& notequalI2
& subsetRefl
& subsetTrans
& setadjoinSub
& setadjoinSub2
& subset2powerset
& setextsub
& subsetemptysetimpeq
& powersetI1
& powersetE1
& inPowerset
& powersetsubset
& ( in @ ( dsetconstr @ X160 @ X161 ) @ ( powerset @ X160 ) )
& ( subset @ ( dsetconstr @ X162 @ X163 ) @ X162 )
& binunionIL
& upairset2IR
& binunionIR
& binunionEcases
& binunionE
& binunionLsub
& binunionRsub
& ( ~ ( in @ X166 @ X164 )
| ~ ( in @ X166 @ X165 )
| ( in @ X166 @ ( binintersect @ X164 @ X165 ) ) )
& ( ~ ( subset @ X169 @ X167 )
| ~ ( subset @ X169 @ X168 )
| ( subset @ X169 @ ( binintersect @ X167 @ X168 ) ) )
& ( ~ ( in @ X172 @ ( binintersect @ X170 @ X171 ) )
| ( in @ X172 @ X170 ) )
& ( subset @ ( binintersect @ X173 @ X174 ) @ X173 )
& ( ~ ( subset @ X175 @ X176 )
| ( ( binintersect @ X175 @ X176 )
= X175 ) )
& ( ( ( binintersect @ X177 @ X178 )
!= X178 )
| ( subset @ X178 @ X177 ) )
& ( ~ ( in @ X181 @ ( binintersect @ X179 @ X180 ) )
| ( in @ X181 @ X180 ) )
& ( ~ ( in @ X184 @ esk5_0 )
| ~ ( in @ X184 @ esk6_0 ) )
& ( ( binintersect @ esk5_0 @ esk6_0 )
!= emptyset ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_38])])])])])])]) ).
thf(c_0_40,negated_conjecture,
! [X2: $i,X3: $i,X4: $i] :
( ( in @ X2 @ X4 )
| ~ ( in @ X2 @ ( binintersect @ X3 @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
thf(c_0_41,negated_conjecture,
! [X2: $i] :
( ( in @ ( esk2_1 @ X2 ) @ X2 )
| ( X2 = emptyset ) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
thf(c_0_42,negated_conjecture,
! [X2: $i] :
( ~ ( in @ X2 @ esk5_0 )
| ~ ( in @ X2 @ esk6_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
thf(c_0_43,negated_conjecture,
! [X2: $i,X3: $i] :
( ( ( binintersect @ X2 @ X3 )
= emptyset )
| ( in @ ( esk2_1 @ ( binintersect @ X2 @ X3 ) ) @ X3 ) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
thf(c_0_44,negated_conjecture,
! [X2: $i,X3: $i,X4: $i] :
( ( in @ X2 @ X3 )
| ~ ( in @ X2 @ ( binintersect @ X3 @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
thf(c_0_45,negated_conjecture,
! [X2: $i] :
( ( ( binintersect @ X2 @ esk6_0 )
= emptyset )
| ~ ( in @ ( esk2_1 @ ( binintersect @ X2 @ esk6_0 ) ) @ esk5_0 ) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
thf(c_0_46,negated_conjecture,
! [X3: $i,X2: $i] :
( ( ( binintersect @ X2 @ X3 )
= emptyset )
| ( in @ ( esk2_1 @ ( binintersect @ X2 @ X3 ) ) @ X2 ) ),
inference(spm,[status(thm)],[c_0_44,c_0_41]) ).
thf(c_0_47,negated_conjecture,
( ( binintersect @ esk5_0 @ esk6_0 )
!= emptyset ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
thf(c_0_48,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU596^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.06/0.18 % Computer : n011.cluster.edu
% 0.06/0.18 % Model : x86_64 x86_64
% 0.06/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.18 % Memory : 8046.5625MB
% 0.06/0.18 % OS : Linux 6.8.0-71-generic
% 0.06/0.18 % CPULimit : 300
% 0.06/0.18 % WCLimit : 300
% 0.06/0.18 % DateTime : Tue Sep 29 13:56:16 UTC 2026
% 0.06/0.18 % CPUTime :
% 0.06/0.18 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.06/0.23 Running higher-order theorem proving
% 0.06/0.26 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.nUHvAiSF2l/E---3.1_132461.p
% 0.20/0.30 % Version: 3.5.1-ho
% 0.20/0.30 % Preprocessing class: HSLMSLSSLLLCHFA.
% 0.20/0.30 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.30 % Starting ehoh_best5 with 300s (1) cores
% 0.20/0.30 % Starting almost_fo_3_lam with 300s (1) cores
% 0.20/0.30 % Starting new_bool_5 with 300s (1) cores
% 0.20/0.30 % Starting pre_casc_3 with 300s (1) cores
% 0.20/0.30 % Starting ho_unfolding_8 with 300s (1) cores
% 0.20/0.30 % Starting new_ho_10_cnf2 with 300s (1) cores
% 0.20/0.30 % Starting new_bool_3 with 300s (1) cores
% 0.20/0.30 % Starting new_ho_5 with 300s (1) cores
% 0.20/0.30 % pre_casc_3 with pid 132498 completed with status 0
% 0.20/0.30 % Result found by pre_casc_3
% 0.20/0.30 % Preprocessing class: HSLMSLSSLLLCHFA.
% 0.20/0.30 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.30 % Starting ehoh_best5 with 300s (1) cores
% 0.20/0.30 % Starting almost_fo_3_lam with 300s (1) cores
% 0.20/0.30 % Starting new_bool_5 with 300s (1) cores
% 0.20/0.30 % Starting pre_casc_3 with 300s (1) cores
% 0.20/0.30 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,10,,5,20000,3.0,true))
% 0.20/0.30 % SinE strategy is GSinE(CountFormulas,hypos,10,,5,20000,3.0,true)
% 0.20/0.30 % Search class: HGHSM-FFMM32-SHFMMFBN
% 0.20/0.30 % partial match(2): HGHSM-FFMM31-SHFMMSBN
% 0.20/0.30 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.30 % Starting SubtermCWHack with 28s (1) cores
% 0.20/0.30 % SubtermCWHack with pid 132507 completed with status 0
% 0.20/0.30 % Result found by SubtermCWHack
% 0.20/0.30 % Preprocessing class: HSLMSLSSLLLCHFA.
% 0.20/0.30 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.30 % Starting ehoh_best5 with 300s (1) cores
% 0.20/0.30 % Starting almost_fo_3_lam with 300s (1) cores
% 0.20/0.30 % Starting new_bool_5 with 300s (1) cores
% 0.20/0.30 % Starting pre_casc_3 with 300s (1) cores
% 0.20/0.30 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,10,,5,20000,3.0,true))
% 0.20/0.30 % SinE strategy is GSinE(CountFormulas,hypos,10,,5,20000,3.0,true)
% 0.20/0.30 % Search class: HGHSM-FFMM32-SHFMMFBN
% 0.20/0.30 % partial match(2): HGHSM-FFMM31-SHFMMSBN
% 0.20/0.30 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.30 % Starting SubtermCWHack with 28s (1) cores
% 0.20/0.30 % Preprocessing time : 0.002 s
% 0.20/0.30
% 0.20/0.30 % Proof found!
% 0.20/0.30 % SZS status Theorem
% 0.20/0.30 % SZS output start CNFRefutation
% See solution above
% 0.20/0.30 % Parsed axioms : 244
% 0.20/0.30 % Removed by relevancy pruning/SinE : 222
% 0.20/0.30 % Initial clauses : 122
% 0.20/0.30 % Removed in clause preprocessing : 2
% 0.20/0.30 % Initial clauses in saturation : 120
% 0.20/0.30 % Processed clauses : 160
% 0.20/0.30 % ...of these trivial : 3
% 0.20/0.30 % ...subsumed : 18
% 0.20/0.30 % ...remaining for further processing : 139
% 0.20/0.30 % Other redundant clauses eliminated : 5
% 0.20/0.30 % Clauses deleted for lack of memory : 0
% 0.20/0.30 % Backward-subsumed : 0
% 0.20/0.30 % Backward-rewritten : 0
% 0.20/0.30 % Generated clauses : 136
% 0.20/0.30 % ...of the previous two non-redundant : 88
% 0.20/0.30 % ...aggressively subsumed : 0
% 0.20/0.30 % Contextual simplify-reflections : 0
% 0.20/0.30 % Paramodulations : 131
% 0.20/0.30 % Factorizations : 0
% 0.20/0.30 % NegExts : 0
% 0.20/0.30 % Equation resolutions : 5
% 0.20/0.30 % Disequality decompositions : 0
% 0.20/0.30 % Total rewrite steps : 27
% 0.20/0.30 % ...of those cached : 11
% 0.20/0.30 % Propositional unsat checks : 0
% 0.20/0.30 % Propositional check models : 0
% 0.20/0.30 % Propositional check unsatisfiable : 0
% 0.20/0.30 % Propositional clauses : 0
% 0.20/0.30 % Propositional clauses after purity: 0
% 0.20/0.30 % Propositional unsat core size : 0
% 0.20/0.30 % Propositional preprocessing time : 0.000
% 0.20/0.30 % Propositional encoding time : 0.000
% 0.20/0.30 % Propositional solver time : 0.000
% 0.20/0.30 % Success case prop preproc time : 0.000
% 0.20/0.30 % Success case prop encoding time : 0.000
% 0.20/0.30 % Success case prop solver time : 0.000
% 0.20/0.30 % Current number of processed clauses : 135
% 0.20/0.30 % Positive orientable unit clauses : 106
% 0.20/0.30 % Positive unorientable unit clauses: 0
% 0.20/0.30 % Negative unit clauses : 2
% 0.20/0.30 % Non-unit-clauses : 27
% 0.20/0.30 % Current number of unprocessed clauses: 45
% 0.20/0.30 % ...number of literals in the above : 95
% 0.20/0.30 % Current number of archived formulas : 0
% 0.20/0.30 % Current number of archived clauses : 0
% 0.20/0.30 % Clause-clause subsumption calls (NU) : 117
% 0.20/0.30 % Rec. Clause-clause subsumption calls : 113
% 0.20/0.30 % Non-unit clause-clause subsumptions : 13
% 0.20/0.30 % Unit Clause-clause subsumption calls : 6
% 0.20/0.30 % Rewrite failures with RHS unbound : 0
% 0.20/0.30 % BW rewrite match attempts : 5
% 0.20/0.30 % BW rewrite match successes : 0
% 0.20/0.30 % Condensation attempts : 0
% 0.20/0.30 % Condensation successes : 0
% 0.20/0.30 % Termbank termtop insertions : 10727
% 0.20/0.30 % Search garbage collected termcells : 3958
% 0.20/0.30
% 0.20/0.30 % -------------------------------------------------
% 0.20/0.30 % User time : 0.014 s
% 0.20/0.30 % System time : 0.006 s
% 0.20/0.30 % Total time : 0.020 s
% 0.20/0.30 % Maximum resident set size: 4896 pages
% 0.20/0.30
% 0.20/0.30 % -------------------------------------------------
% 0.20/0.30 % User time : 0.019 s
% 0.20/0.30 % System time : 0.012 s
% 0.20/0.30 % Total time : 0.031 s
% 0.20/0.30 % Maximum resident set size: 5120 pages
% 0.20/0.30 % E exiting
%------------------------------------------------------------------------------