%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU595^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n018.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:32:36 AM UTC 2026
% Result : Theorem 0.20s 0.34s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 3
% Syntax : Number of formulae : 32 ( 23 unt; 0 typ; 0 def)
% Number of atoms : 1808 ( 478 equ; 0 cnn)
% Maximal formula atoms : 113 ( 56 avg)
% Number of connectives : 1004 ( 7 ~; 2 |; 336 &; 185 @)
% ( 0 <=>; 459 =>; 0 <=; 0 <~>)
% Maximal formula depth : 120 ( 27 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 18 ( 18 >; 0 *; 0 +; 0 <<)
% Number of symbols : 220 ( 216 usr; 117 con; 0-4 aty)
% ( 15 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 81 ( 42 ^; 33 !; 6 ?; 81 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_1,type,
exu: ( $i > $o ) > $o ).
thf(func_def_3,type,
setextAx: $o ).
thf(func_def_5,type,
emptysetAx: $o ).
thf(func_def_6,type,
setadjoin: $i > $i > $i ).
thf(func_def_7,type,
setadjoinAx: $o ).
thf(func_def_8,type,
powerset: $i > $i ).
thf(func_def_9,type,
powersetAx: $o ).
thf(func_def_10,type,
setunion: $i > $i ).
thf(func_def_11,type,
setunionAx: $o ).
thf(func_def_13,type,
omega0Ax: $o ).
thf(func_def_14,type,
omegaSAx: $o ).
thf(func_def_15,type,
omegaIndAx: $o ).
thf(func_def_16,type,
replAx: $o ).
thf(func_def_17,type,
foundationAx: $o ).
thf(func_def_18,type,
wellorderingAx: $o ).
thf(func_def_19,type,
descr: ( $i > $o ) > $i ).
thf(func_def_20,type,
descrp: $o ).
thf(func_def_21,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(func_def_22,type,
dsetconstrI: $o ).
thf(func_def_23,type,
dsetconstrEL: $o ).
thf(func_def_24,type,
dsetconstrER: $o ).
thf(func_def_25,type,
exuE1: $o ).
thf(func_def_26,type,
prop2set: $o > $i ).
thf(func_def_27,type,
prop2setE: $o ).
thf(func_def_28,type,
emptysetE: $o ).
thf(func_def_29,type,
emptysetimpfalse: $o ).
thf(func_def_30,type,
notinemptyset: $o ).
thf(func_def_31,type,
exuE3e: $o ).
thf(func_def_32,type,
setext: $o ).
thf(func_def_33,type,
emptyI: $o ).
thf(func_def_34,type,
noeltsimpempty: $o ).
thf(func_def_35,type,
setbeta: $o ).
thf(func_def_36,type,
nonempty: $i > $o ).
thf(func_def_37,type,
nonemptyE1: $o ).
thf(func_def_38,type,
nonemptyI: $o ).
thf(func_def_39,type,
nonemptyI1: $o ).
thf(func_def_40,type,
setadjoinIL: $o ).
thf(func_def_41,type,
emptyinunitempty: $o ).
thf(func_def_42,type,
setadjoinIR: $o ).
thf(func_def_43,type,
setadjoinE: $o ).
thf(func_def_44,type,
setadjoinOr: $o ).
thf(func_def_45,type,
setoftrueEq: $o ).
thf(func_def_46,type,
powersetI: $o ).
thf(func_def_47,type,
emptyinPowerset: $o ).
thf(func_def_48,type,
emptyInPowerset: $o ).
thf(func_def_49,type,
powersetE: $o ).
thf(func_def_50,type,
setunionI: $o ).
thf(func_def_51,type,
setunionE: $o ).
thf(func_def_52,type,
subPowSU: $o ).
thf(func_def_53,type,
exuE2: $o ).
thf(func_def_54,type,
nonemptyImpWitness: $o ).
thf(func_def_55,type,
uniqinunit: $o ).
thf(func_def_56,type,
notinsingleton: $o ).
thf(func_def_57,type,
eqinunit: $o ).
thf(func_def_58,type,
singletonsswitch: $o ).
thf(func_def_59,type,
upairsetE: $o ).
thf(func_def_60,type,
upairsetIL: $o ).
thf(func_def_61,type,
upairsetIR: $o ).
thf(func_def_62,type,
emptyE1: $o ).
thf(func_def_63,type,
vacuousDall: $o ).
thf(func_def_64,type,
quantDeMorgan1: $o ).
thf(func_def_65,type,
quantDeMorgan2: $o ).
thf(func_def_66,type,
quantDeMorgan3: $o ).
thf(func_def_67,type,
quantDeMorgan4: $o ).
thf(func_def_68,type,
prop2setI: $o ).
thf(func_def_69,type,
set2prop: $i > $o ).
thf(func_def_70,type,
prop2set2propI: $o ).
thf(func_def_71,type,
notdexE: $o ).
thf(func_def_72,type,
notdallE: $o ).
thf(func_def_73,type,
exuI1: $o ).
thf(func_def_74,type,
exuI3: $o ).
thf(func_def_75,type,
exuI2: $o ).
thf(func_def_76,type,
inCongP: $o ).
thf(func_def_77,type,
in__Cong: $o ).
thf(func_def_78,type,
exuE3u: $o ).
thf(func_def_79,type,
exu__Cong: $o ).
thf(func_def_80,type,
emptyset__Cong: $o ).
thf(func_def_81,type,
setadjoin__Cong: $o ).
thf(func_def_82,type,
powerset__Cong: $o ).
thf(func_def_83,type,
setunion__Cong: $o ).
thf(func_def_84,type,
omega__Cong: $o ).
thf(func_def_85,type,
exuEu: $o ).
thf(func_def_86,type,
descr__Cong: $o ).
thf(func_def_87,type,
dsetconstr__Cong: $o ).
thf(func_def_88,type,
subset: $i > $i > $o ).
thf(func_def_89,type,
disjoint: $i > $i > $o ).
thf(func_def_90,type,
setsmeet: $i > $i > $o ).
thf(func_def_91,type,
subsetI1: $o ).
thf(func_def_92,type,
eqimpsubset2: $o ).
thf(func_def_93,type,
eqimpsubset1: $o ).
thf(func_def_94,type,
subsetI2: $o ).
thf(func_def_95,type,
emptysetsubset: $o ).
thf(func_def_96,type,
subsetE: $o ).
thf(func_def_97,type,
subsetE2: $o ).
thf(func_def_98,type,
notsubsetI: $o ).
thf(func_def_99,type,
notequalI1: $o ).
thf(func_def_100,type,
notequalI2: $o ).
thf(func_def_101,type,
subsetRefl: $o ).
thf(func_def_102,type,
subsetTrans: $o ).
thf(func_def_103,type,
setadjoinSub: $o ).
thf(func_def_104,type,
setadjoinSub2: $o ).
thf(func_def_105,type,
subset2powerset: $o ).
thf(func_def_106,type,
setextsub: $o ).
thf(func_def_107,type,
subsetemptysetimpeq: $o ).
thf(func_def_108,type,
powersetI1: $o ).
thf(func_def_109,type,
powersetE1: $o ).
thf(func_def_110,type,
inPowerset: $o ).
thf(func_def_111,type,
powersetsubset: $o ).
thf(func_def_112,type,
sepInPowerset: $o ).
thf(func_def_113,type,
sepSubset: $o ).
thf(func_def_114,type,
binunion: $i > $i > $i ).
thf(func_def_115,type,
binunionIL: $o ).
thf(func_def_116,type,
upairset2IR: $o ).
thf(func_def_117,type,
binunionIR: $o ).
thf(func_def_118,type,
binunionEcases: $o ).
thf(func_def_119,type,
binunionE: $o ).
thf(func_def_120,type,
binunionLsub: $o ).
thf(func_def_121,type,
binunionRsub: $o ).
thf(func_def_122,type,
binintersect: $i > $i > $i ).
thf(func_def_123,type,
binintersectI: $o ).
thf(func_def_124,type,
binintersectSubset5: $o ).
thf(func_def_125,type,
binintersectEL: $o ).
thf(func_def_126,type,
binintersectLsub: $o ).
thf(func_def_127,type,
binintersectSubset2: $o ).
thf(func_def_128,type,
binintersectSubset3: $o ).
thf(func_def_129,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_130,type,
vAND: $o > $o > $o ).
thf(func_def_131,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_132,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_133,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_134,type,
vIMP: $o > $o > $o ).
thf(func_def_135,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_136,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_137,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_138,type,
vIFF: $o > $o > $o ).
thf(func_def_139,type,
vNOT: $o > $o ).
thf(func_def_140,type,
vOR: $o > $o > $o ).
thf(func_def_141,type,
db4:
!>[X0: $tType] : X0 ).
thf(func_def_142,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_145,type,
db5:
!>[X0: $tType] : X0 ).
thf(func_def_149,type,
sK3: $i > $i > $i ).
thf(func_def_150,type,
sK4: $i > $i > $i ).
thf(func_def_151,type,
sK5: ( $i > $o ) > ( $i > $o ) > $i > $i > $i ).
thf(func_def_152,type,
sK6: $i > $i > ( $i > $o ) > ( $i > $o ) > $i ).
thf(func_def_153,type,
sK7: ( $i > $o ) > ( $i > $o ) > $i ).
thf(func_def_154,type,
sK8: ( $i > $o ) > ( $i > $o ) > $i ).
thf(func_def_155,type,
sK9: ( $i > $o ) > $i > $i ).
thf(func_def_156,type,
sK10: ( $i > $o ) > $i > $i ).
thf(func_def_157,type,
sK11: ( $i > $o ) > $i > $i ).
thf(func_def_158,type,
sK12: ( $i > $o ) > ( $i > $o ) > $i ).
thf(func_def_159,type,
sK13: ( $i > $o ) > ( $i > $o ) > $i ).
thf(func_def_160,type,
sK14: ( $i > $o ) > $i ).
thf(func_def_161,type,
sK15: ( $i > $o ) > $i > $i ).
thf(func_def_162,type,
sK16: ( $i > $o ) > $i ).
thf(func_def_163,type,
sK17: ( $i > $o ) > $i > $i ).
thf(func_def_164,type,
sK18: ( $i > $o ) > $i > $i ).
thf(func_def_165,type,
sK19: ( $i > $o ) > $i ).
thf(func_def_166,type,
sK20: ( $i > $o ) > $i > $i ).
thf(func_def_167,type,
sK21: ( $i > $o ) > $i ).
thf(func_def_168,type,
sK22: ( $i > $o ) > $i > $i ).
thf(func_def_169,type,
sK23: ( $i > $o ) > $i > $i ).
thf(func_def_170,type,
sK24: ( $i > $o ) > $i ).
thf(func_def_171,type,
sK25: ( $i > $o ) > $i > $i ).
thf(func_def_172,type,
sK26: ( $i > $o ) > $i ).
thf(func_def_173,type,
sK27: ( $i > $o ) > $i > $i ).
thf(func_def_174,type,
sK28: ( $i > $o ) > $i > $i ).
thf(func_def_175,type,
sK29: ( $i > $o ) > $i > $i ).
thf(func_def_176,type,
sK30: ( $i > $o ) > $i ).
thf(func_def_177,type,
sK31: ( $i > $o ) > $i > $i ).
thf(func_def_178,type,
sK32: ( $i > $o ) > $i ).
thf(func_def_179,type,
sK33: ( $i > $o ) > $i ).
thf(func_def_180,type,
sK34: ( $i > $o ) > $i ).
thf(func_def_181,type,
sK35: ( $i > $o ) > $i ).
thf(func_def_182,type,
sK36: ( $i > $o ) > $i > $i ).
thf(func_def_183,type,
sK37: ( $i > $o ) > $i > $i ).
thf(func_def_184,type,
sK38: ( $i > $o ) > $i > $i ).
thf(func_def_185,type,
sK39: ( $i > $o ) > $i > $i ).
thf(func_def_186,type,
sK40: ( $i > $o ) > $i > $i ).
thf(func_def_187,type,
sK41: ( $i > $o ) > $i > $i ).
thf(func_def_188,type,
sK42: ( $i > $o ) > $i > $i ).
thf(func_def_189,type,
sK43: $i > $i ).
thf(func_def_190,type,
sK44: ( $i > $o ) > $i ).
thf(func_def_191,type,
sK45: ( $i > $o ) > $i > $i ).
thf(func_def_192,type,
sK46: $i > $o > $i > $i ).
thf(func_def_193,type,
sK47: $i > $i > $i ).
thf(func_def_194,type,
sK48: $i > $i ).
thf(func_def_195,type,
sK49: $i > $i ).
thf(func_def_196,type,
sK50: $i > $i ).
thf(func_def_197,type,
sK51: $i > $i > $i ).
thf(func_def_198,type,
sK52: $i > $i > $i ).
thf(func_def_199,type,
sK53: ( $i > $o ) > $i ).
thf(func_def_200,type,
sK54: ( $i > $o ) > $i > $i ).
thf(func_def_201,type,
sK55: ( $i > $o ) > $i ).
thf(func_def_202,type,
sK56: ( $i > $o ) > $i > $i ).
thf(func_def_203,type,
sK57: ( $i > $o ) > $i > $i ).
thf(func_def_204,type,
sK58: $i > $i ).
thf(func_def_205,type,
sK59: $i > $i > $i > $i ).
thf(func_def_206,type,
sK60: $i > $i > $i ).
thf(func_def_207,type,
sK61: $i > $i > $i ).
thf(func_def_208,type,
sK62: $i > $i > $i ).
thf(func_def_209,type,
sK63: $i > $i ).
thf(func_def_210,type,
sK64: $i > ( $i > $i > $o ) > $i ).
thf(func_def_211,type,
sK65: $i > ( $i > $i > $o ) > $i ).
thf(func_def_212,type,
sK66: $i > $i > ( $i > $i > $o ) > $i ).
thf(func_def_213,type,
sK67: $i > ( $i > $i > $o ) > $i > $i ).
thf(func_def_214,type,
sK68: $i > $i > ( $i > $i > $o ) > $i ).
thf(func_def_215,type,
sK69: $i > $i > ( $i > $i > $o ) > $i ).
thf(func_def_216,type,
sK70: $i > $i ).
thf(func_def_217,type,
sK71: $i > $i > $i ).
thf(func_def_218,type,
sK72: $i > $i > $i ).
thf(func_def_219,type,
sK73: $i > $i > $i ).
thf(f16,axiom,
( dsetconstrER
= ( ! [X0: $i,X1: $i > $o,X2: $i] :
( ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) )
=> ( X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dsetconstrER) ).
thf(f108,axiom,
( binintersect
= ( ^ [X0: $i,X1: $i] :
( dsetconstr @ X0
@ ^ [X2: $i] : ( in @ X2 @ X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',binintersect) ).
thf(f115,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
=> ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ ( binintersect @ X0 @ X1 ) )
=> ( in @ X2 @ X1 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',binintersectER) ).
thf(f116,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
=> ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ ( binintersect @ X0 @ X1 ) )
=> ( in @ X2 @ X1 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f115]) ).
thf(f145,plain,
( dsetconstrER
= ( ! [X0: $i,X1: $i > $o,X2: $i] :
( ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) )
=> ( X1 @ X2 ) ) ) ),
inference(rectify,[],[f16]) ).
thf(f146,plain,
( dsetconstrER
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( Y1 @ Y0 ) ) ) ) ) ),
inference(fool_elimination,[],[f145]) ).
thf(f321,plain,
( binintersect
= ( ^ [X0: $i,X1: $i] :
( dsetconstr @ X0
@ ^ [X2: $i] : ( in @ X2 @ X1 ) ) ) ),
inference(rectify,[],[f108]) ).
thf(f322,plain,
( binintersect
= ( ^ [Y0: $i,Y1: $i] :
( dsetconstr @ Y0
@ ^ [Y2: $i] : ( in @ Y2 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f321]) ).
thf(f335,plain,
~ ( 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
=> ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ ( binintersect @ X0 @ X1 ) )
=> ( in @ X2 @ X1 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f116]) ).
thf(f336,plain,
~ ( ( setextAx = $true )
=> ( ( emptysetAx = $true )
=> ( ( setadjoinAx = $true )
=> ( ( powersetAx = $true )
=> ( ( setunionAx = $true )
=> ( ( omega0Ax = $true )
=> ( ( omegaSAx = $true )
=> ( ( omegaIndAx = $true )
=> ( ( replAx = $true )
=> ( ( foundationAx = $true )
=> ( ( wellorderingAx = $true )
=> ( ( descrp = $true )
=> ( ( dsetconstrI = $true )
=> ( ( dsetconstrEL = $true )
=> ( ( dsetconstrER = $true )
=> ( ( exuE1 = $true )
=> ( ( prop2setE = $true )
=> ( ( emptysetE = $true )
=> ( ( emptysetimpfalse = $true )
=> ( ( notinemptyset = $true )
=> ( ( exuE3e = $true )
=> ( ( setext = $true )
=> ( ( emptyI = $true )
=> ( ( noeltsimpempty = $true )
=> ( ( setbeta = $true )
=> ( ( nonemptyE1 = $true )
=> ( ( nonemptyI = $true )
=> ( ( nonemptyI1 = $true )
=> ( ( setadjoinIL = $true )
=> ( ( emptyinunitempty = $true )
=> ( ( setadjoinIR = $true )
=> ( ( setadjoinE = $true )
=> ( ( setadjoinOr = $true )
=> ( ( setoftrueEq = $true )
=> ( ( powersetI = $true )
=> ( ( emptyinPowerset = $true )
=> ( ( emptyInPowerset = $true )
=> ( ( powersetE = $true )
=> ( ( setunionI = $true )
=> ( ( setunionE = $true )
=> ( ( subPowSU = $true )
=> ( ( exuE2 = $true )
=> ( ( nonemptyImpWitness = $true )
=> ( ( uniqinunit = $true )
=> ( ( notinsingleton = $true )
=> ( ( eqinunit = $true )
=> ( ( singletonsswitch = $true )
=> ( ( upairsetE = $true )
=> ( ( upairsetIL = $true )
=> ( ( upairsetIR = $true )
=> ( ( emptyE1 = $true )
=> ( ( vacuousDall = $true )
=> ( ( quantDeMorgan1 = $true )
=> ( ( quantDeMorgan2 = $true )
=> ( ( quantDeMorgan3 = $true )
=> ( ( quantDeMorgan4 = $true )
=> ( ( prop2setI = $true )
=> ( ( prop2set2propI = $true )
=> ( ( notdexE = $true )
=> ( ( notdallE = $true )
=> ( ( exuI1 = $true )
=> ( ( exuI3 = $true )
=> ( ( exuI2 = $true )
=> ( ( inCongP = $true )
=> ( ( in__Cong = $true )
=> ( ( exuE3u = $true )
=> ( ( exu__Cong = $true )
=> ( ( emptyset__Cong = $true )
=> ( ( setadjoin__Cong = $true )
=> ( ( powerset__Cong = $true )
=> ( ( setunion__Cong = $true )
=> ( ( omega__Cong = $true )
=> ( ( exuEu = $true )
=> ( ( descr__Cong = $true )
=> ( ( dsetconstr__Cong = $true )
=> ( ( subsetI1 = $true )
=> ( ( eqimpsubset2 = $true )
=> ( ( eqimpsubset1 = $true )
=> ( ( subsetI2 = $true )
=> ( ( emptysetsubset = $true )
=> ( ( subsetE = $true )
=> ( ( subsetE2 = $true )
=> ( ( notsubsetI = $true )
=> ( ( notequalI1 = $true )
=> ( ( notequalI2 = $true )
=> ( ( subsetRefl = $true )
=> ( ( subsetTrans = $true )
=> ( ( setadjoinSub = $true )
=> ( ( setadjoinSub2 = $true )
=> ( ( subset2powerset = $true )
=> ( ( setextsub = $true )
=> ( ( subsetemptysetimpeq = $true )
=> ( ( powersetI1 = $true )
=> ( ( powersetE1 = $true )
=> ( ( inPowerset = $true )
=> ( ( powersetsubset = $true )
=> ( ( sepInPowerset = $true )
=> ( ( sepSubset = $true )
=> ( ( binunionIL = $true )
=> ( ( upairset2IR = $true )
=> ( ( binunionIR = $true )
=> ( ( binunionEcases = $true )
=> ( ( binunionE = $true )
=> ( ( binunionLsub = $true )
=> ( ( binunionRsub = $true )
=> ( ( binintersectI = $true )
=> ( ( binintersectSubset5 = $true )
=> ( ( binintersectEL = $true )
=> ( ( binintersectLsub = $true )
=> ( ( binintersectSubset2 = $true )
=> ( ( binintersectSubset3 = $true )
=> ! [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X2 @ ( binintersect @ X0 @ X1 ) )
= $true )
=> ( ( in @ X2 @ X1 )
= $true ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f335]) ).
thf(f337,plain,
( ? [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X2 @ X1 )
!= $true )
& ( ( in @ X2 @ ( binintersect @ X0 @ X1 ) )
= $true ) )
& ( binintersectSubset3 = $true )
& ( binintersectSubset2 = $true )
& ( binintersectLsub = $true )
& ( binintersectEL = $true )
& ( binintersectSubset5 = $true )
& ( binintersectI = $true )
& ( binunionRsub = $true )
& ( binunionLsub = $true )
& ( binunionE = $true )
& ( binunionEcases = $true )
& ( binunionIR = $true )
& ( upairset2IR = $true )
& ( binunionIL = $true )
& ( sepSubset = $true )
& ( sepInPowerset = $true )
& ( powersetsubset = $true )
& ( inPowerset = $true )
& ( powersetE1 = $true )
& ( powersetI1 = $true )
& ( subsetemptysetimpeq = $true )
& ( setextsub = $true )
& ( subset2powerset = $true )
& ( setadjoinSub2 = $true )
& ( setadjoinSub = $true )
& ( subsetTrans = $true )
& ( subsetRefl = $true )
& ( notequalI2 = $true )
& ( notequalI1 = $true )
& ( notsubsetI = $true )
& ( subsetE2 = $true )
& ( subsetE = $true )
& ( emptysetsubset = $true )
& ( subsetI2 = $true )
& ( eqimpsubset1 = $true )
& ( eqimpsubset2 = $true )
& ( subsetI1 = $true )
& ( dsetconstr__Cong = $true )
& ( descr__Cong = $true )
& ( exuEu = $true )
& ( omega__Cong = $true )
& ( setunion__Cong = $true )
& ( powerset__Cong = $true )
& ( setadjoin__Cong = $true )
& ( emptyset__Cong = $true )
& ( exu__Cong = $true )
& ( exuE3u = $true )
& ( in__Cong = $true )
& ( inCongP = $true )
& ( exuI2 = $true )
& ( exuI3 = $true )
& ( exuI1 = $true )
& ( notdallE = $true )
& ( notdexE = $true )
& ( prop2set2propI = $true )
& ( prop2setI = $true )
& ( quantDeMorgan4 = $true )
& ( quantDeMorgan3 = $true )
& ( quantDeMorgan2 = $true )
& ( quantDeMorgan1 = $true )
& ( vacuousDall = $true )
& ( emptyE1 = $true )
& ( upairsetIR = $true )
& ( upairsetIL = $true )
& ( upairsetE = $true )
& ( singletonsswitch = $true )
& ( eqinunit = $true )
& ( notinsingleton = $true )
& ( uniqinunit = $true )
& ( nonemptyImpWitness = $true )
& ( exuE2 = $true )
& ( subPowSU = $true )
& ( setunionE = $true )
& ( setunionI = $true )
& ( powersetE = $true )
& ( emptyInPowerset = $true )
& ( emptyinPowerset = $true )
& ( powersetI = $true )
& ( setoftrueEq = $true )
& ( setadjoinOr = $true )
& ( setadjoinE = $true )
& ( setadjoinIR = $true )
& ( emptyinunitempty = $true )
& ( setadjoinIL = $true )
& ( nonemptyI1 = $true )
& ( nonemptyI = $true )
& ( nonemptyE1 = $true )
& ( setbeta = $true )
& ( noeltsimpempty = $true )
& ( emptyI = $true )
& ( setext = $true )
& ( exuE3e = $true )
& ( notinemptyset = $true )
& ( emptysetimpfalse = $true )
& ( emptysetE = $true )
& ( prop2setE = $true )
& ( exuE1 = $true )
& ( dsetconstrER = $true )
& ( dsetconstrEL = $true )
& ( dsetconstrI = $true )
& ( descrp = $true )
& ( wellorderingAx = $true )
& ( foundationAx = $true )
& ( replAx = $true )
& ( omegaIndAx = $true )
& ( omegaSAx = $true )
& ( omega0Ax = $true )
& ( setunionAx = $true )
& ( powersetAx = $true )
& ( setadjoinAx = $true )
& ( emptysetAx = $true )
& ( setextAx = $true ) ),
inference(ennf_transformation,[],[f336]) ).
thf(f338,plain,
( ? [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X2 @ X1 )
!= $true )
& ( ( in @ X2 @ ( binintersect @ X0 @ X1 ) )
= $true ) )
& ( binintersectSubset3 = $true )
& ( binintersectSubset2 = $true )
& ( binintersectLsub = $true )
& ( binintersectEL = $true )
& ( binintersectSubset5 = $true )
& ( binintersectI = $true )
& ( binunionRsub = $true )
& ( binunionLsub = $true )
& ( binunionE = $true )
& ( binunionEcases = $true )
& ( binunionIR = $true )
& ( upairset2IR = $true )
& ( binunionIL = $true )
& ( sepSubset = $true )
& ( sepInPowerset = $true )
& ( powersetsubset = $true )
& ( inPowerset = $true )
& ( powersetE1 = $true )
& ( powersetI1 = $true )
& ( subsetemptysetimpeq = $true )
& ( setextsub = $true )
& ( subset2powerset = $true )
& ( setadjoinSub2 = $true )
& ( setadjoinSub = $true )
& ( subsetTrans = $true )
& ( subsetRefl = $true )
& ( notequalI2 = $true )
& ( notequalI1 = $true )
& ( notsubsetI = $true )
& ( subsetE2 = $true )
& ( subsetE = $true )
& ( emptysetsubset = $true )
& ( subsetI2 = $true )
& ( eqimpsubset1 = $true )
& ( eqimpsubset2 = $true )
& ( subsetI1 = $true )
& ( dsetconstr__Cong = $true )
& ( descr__Cong = $true )
& ( exuEu = $true )
& ( omega__Cong = $true )
& ( setunion__Cong = $true )
& ( powerset__Cong = $true )
& ( setadjoin__Cong = $true )
& ( emptyset__Cong = $true )
& ( exu__Cong = $true )
& ( exuE3u = $true )
& ( in__Cong = $true )
& ( inCongP = $true )
& ( exuI2 = $true )
& ( exuI3 = $true )
& ( exuI1 = $true )
& ( notdallE = $true )
& ( notdexE = $true )
& ( prop2set2propI = $true )
& ( prop2setI = $true )
& ( quantDeMorgan4 = $true )
& ( quantDeMorgan3 = $true )
& ( quantDeMorgan2 = $true )
& ( quantDeMorgan1 = $true )
& ( vacuousDall = $true )
& ( emptyE1 = $true )
& ( upairsetIR = $true )
& ( upairsetIL = $true )
& ( upairsetE = $true )
& ( singletonsswitch = $true )
& ( eqinunit = $true )
& ( notinsingleton = $true )
& ( uniqinunit = $true )
& ( nonemptyImpWitness = $true )
& ( exuE2 = $true )
& ( subPowSU = $true )
& ( setunionE = $true )
& ( setunionI = $true )
& ( powersetE = $true )
& ( emptyInPowerset = $true )
& ( emptyinPowerset = $true )
& ( powersetI = $true )
& ( setoftrueEq = $true )
& ( setadjoinOr = $true )
& ( setadjoinE = $true )
& ( setadjoinIR = $true )
& ( emptyinunitempty = $true )
& ( setadjoinIL = $true )
& ( nonemptyI1 = $true )
& ( nonemptyI = $true )
& ( nonemptyE1 = $true )
& ( setbeta = $true )
& ( noeltsimpempty = $true )
& ( emptyI = $true )
& ( setext = $true )
& ( exuE3e = $true )
& ( notinemptyset = $true )
& ( emptysetimpfalse = $true )
& ( emptysetE = $true )
& ( prop2setE = $true )
& ( exuE1 = $true )
& ( dsetconstrER = $true )
& ( dsetconstrEL = $true )
& ( dsetconstrI = $true )
& ( descrp = $true )
& ( wellorderingAx = $true )
& ( foundationAx = $true )
& ( replAx = $true )
& ( omegaIndAx = $true )
& ( omegaSAx = $true )
& ( omega0Ax = $true )
& ( setunionAx = $true )
& ( powersetAx = $true )
& ( setadjoinAx = $true )
& ( emptysetAx = $true )
& ( setextAx = $true ) ),
inference(flattening,[],[f337]) ).
thf(f339,plain,
( ( $true
!= ( in @ sK2 @ sK1 ) )
& ( $true
= ( in @ sK2 @ ( binintersect @ sK0 @ sK1 ) ) )
& ( binintersectSubset3 = $true )
& ( binintersectSubset2 = $true )
& ( binintersectLsub = $true )
& ( binintersectEL = $true )
& ( binintersectSubset5 = $true )
& ( binintersectI = $true )
& ( binunionRsub = $true )
& ( binunionLsub = $true )
& ( binunionE = $true )
& ( binunionEcases = $true )
& ( binunionIR = $true )
& ( upairset2IR = $true )
& ( binunionIL = $true )
& ( sepSubset = $true )
& ( sepInPowerset = $true )
& ( powersetsubset = $true )
& ( inPowerset = $true )
& ( powersetE1 = $true )
& ( powersetI1 = $true )
& ( subsetemptysetimpeq = $true )
& ( setextsub = $true )
& ( subset2powerset = $true )
& ( setadjoinSub2 = $true )
& ( setadjoinSub = $true )
& ( subsetTrans = $true )
& ( subsetRefl = $true )
& ( notequalI2 = $true )
& ( notequalI1 = $true )
& ( notsubsetI = $true )
& ( subsetE2 = $true )
& ( subsetE = $true )
& ( emptysetsubset = $true )
& ( subsetI2 = $true )
& ( eqimpsubset1 = $true )
& ( eqimpsubset2 = $true )
& ( subsetI1 = $true )
& ( dsetconstr__Cong = $true )
& ( descr__Cong = $true )
& ( exuEu = $true )
& ( omega__Cong = $true )
& ( setunion__Cong = $true )
& ( powerset__Cong = $true )
& ( setadjoin__Cong = $true )
& ( emptyset__Cong = $true )
& ( exu__Cong = $true )
& ( exuE3u = $true )
& ( in__Cong = $true )
& ( inCongP = $true )
& ( exuI2 = $true )
& ( exuI3 = $true )
& ( exuI1 = $true )
& ( notdallE = $true )
& ( notdexE = $true )
& ( prop2set2propI = $true )
& ( prop2setI = $true )
& ( quantDeMorgan4 = $true )
& ( quantDeMorgan3 = $true )
& ( quantDeMorgan2 = $true )
& ( quantDeMorgan1 = $true )
& ( vacuousDall = $true )
& ( emptyE1 = $true )
& ( upairsetIR = $true )
& ( upairsetIL = $true )
& ( upairsetE = $true )
& ( singletonsswitch = $true )
& ( eqinunit = $true )
& ( notinsingleton = $true )
& ( uniqinunit = $true )
& ( nonemptyImpWitness = $true )
& ( exuE2 = $true )
& ( subPowSU = $true )
& ( setunionE = $true )
& ( setunionI = $true )
& ( powersetE = $true )
& ( emptyInPowerset = $true )
& ( emptyinPowerset = $true )
& ( powersetI = $true )
& ( setoftrueEq = $true )
& ( setadjoinOr = $true )
& ( setadjoinE = $true )
& ( setadjoinIR = $true )
& ( emptyinunitempty = $true )
& ( setadjoinIL = $true )
& ( nonemptyI1 = $true )
& ( nonemptyI = $true )
& ( nonemptyE1 = $true )
& ( setbeta = $true )
& ( noeltsimpempty = $true )
& ( emptyI = $true )
& ( setext = $true )
& ( exuE3e = $true )
& ( notinemptyset = $true )
& ( emptysetimpfalse = $true )
& ( emptysetE = $true )
& ( prop2setE = $true )
& ( exuE1 = $true )
& ( dsetconstrER = $true )
& ( dsetconstrEL = $true )
& ( dsetconstrI = $true )
& ( descrp = $true )
& ( wellorderingAx = $true )
& ( foundationAx = $true )
& ( replAx = $true )
& ( omegaIndAx = $true )
& ( omegaSAx = $true )
& ( omega0Ax = $true )
& ( setunionAx = $true )
& ( powersetAx = $true )
& ( setadjoinAx = $true )
& ( emptysetAx = $true )
& ( setextAx = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f338]) ).
thf(f355,plain,
( dsetconstrER
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( Y1 @ Y0 ) ) ) ) ) ),
inference(cnf_transformation,[],[f146]) ).
thf(f447,plain,
( binintersect
= ( ^ [Y0: $i,Y1: $i] :
( dsetconstr @ Y0
@ ^ [Y2: $i] : ( in @ Y2 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f322]) ).
thf(f468,plain,
dsetconstrER = $true,
inference(cnf_transformation,[],[f339]) ).
thf(f565,plain,
( $true
= ( in @ sK2 @ ( binintersect @ sK0 @ sK1 ) ) ),
inference(cnf_transformation,[],[f339]) ).
thf(f566,plain,
( $true
!= ( in @ sK2 @ sK1 ) ),
inference(cnf_transformation,[],[f339]) ).
thf(f583,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( Y1 @ Y0 ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f355,f468]) ).
thf(f680,plain,
( $true
= ( in @ sK2
@ ( ^ [Y0: $i,Y1: $i] :
( dsetconstr @ Y0
@ ^ [Y2: $i] : ( in @ Y2 @ Y1 ) )
@ sK0
@ sK1 ) ) ),
inference(definition_unfolding,[],[f565,f447]) ).
thf(f681,plain,
( $true
= ( in @ sK2
@ ( dsetconstr @ sK0
@ ^ [Y0: $i] : ( in @ Y0 @ sK1 ) ) ) ),
inference(beta-eta_normalization,[],[f680]) ).
thf(f1698,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( Y1 @ Y0 ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f583]) ).
thf(f1699,plain,
! [X1: $i] :
( $true
= ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ ( dsetconstr @ Y1 @ Y0 ) )
=> ( Y0 @ X1 ) ) ) ) ),
inference(beta-eta_normalization,[],[f1698]) ).
thf(f1700,plain,
! [X2: $i > $o,X1: $i] :
( $true
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ ( dsetconstr @ Y1 @ Y0 ) )
=> ( Y0 @ X1 ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f1699]) ).
thf(f1701,plain,
! [X2: $i > $o,X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ X1 @ ( dsetconstr @ Y0 @ X2 ) )
=> ( X2 @ X1 ) ) ) ),
inference(beta-eta_normalization,[],[f1700]) ).
thf(f1702,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( in @ X1 @ ( dsetconstr @ Y0 @ X2 ) )
=> ( X2 @ X1 ) )
@ X3 ) ),
inference(pi_proxy_clausification,[],[f1701]) ).
thf(f1703,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( $true
= ( ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) )
=> ( X2 @ X1 ) ) ),
inference(beta-eta_normalization,[],[f1702]) ).
thf(f1704,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) ) )
| ( $true
= ( X2 @ X1 ) ) ),
inference(imp_proxy_clausification,[],[f1703]) ).
thf(f2801,plain,
( ( $false = $true )
| ( $true
= ( ^ [Y0: $i] : ( in @ Y0 @ sK1 )
@ sK2 ) ) ),
inference(constrained_superposition,[],[f1704,f681]) ).
thf(f2806,plain,
( $true
= ( ^ [Y0: $i] : ( in @ Y0 @ sK1 )
@ sK2 ) ),
inference(trivial_inequality_removal,[],[f2801]) ).
thf(f2807,plain,
( $true
= ( in @ sK2 @ sK1 ) ),
inference(beta-eta_normalization,[],[f2806]) ).
thf(f2814,plain,
$false,
inference(forward_subsumption_resolution,[],[f2807,f566]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU595^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.18 % Computer : n018.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Tue Sep 29 13:58:13 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.21 Running first-order model finding
% 0.09/0.21 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.34 % (116058)Will run a generic schedule for satisfiability detection.
% 0.20/0.34 % (116067)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=712152583:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.34 % (116064)% WARNING: option uhcvi not known.
% 0.20/0.34 % (116067)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.34 % (116065)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=7224872:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.34 % (116063)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3728312560_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.34 % (116064)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1925894386:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.34 % (116066)dis+10_1_sil=32000:sp=arity:random_seed=3503254302:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.34 % (116068)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3380634127:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.34 % (116069)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2058025343:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.34 % (116064)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.34 % Exception at run slice level
% 0.20/0.34 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.34 % (116064)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.20/0.34 % (116067)Instruction limit reached!
% 0.20/0.34 % (116067)------------------------------
% 0.20/0.34 % (116067)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.34 % (116067)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.34 % (116067)CaDiCaL version: 2.1.3
% 0.20/0.34 % (116067)Termination reason: Instruction limit
% 0.20/0.34 % (116067)Termination phase: Saturation
% 0.20/0.34 % (116067)Time elapsed: 0.030 s
% 0.20/0.34 % (116067)Peak memory usage: 13 MB
% 0.20/0.34 % (116067)Instructions burned: 119 (million)
% 0.20/0.34 % (116078)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2638592125:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.34 % (116077)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1590581722:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.20/0.34 % (116066)Instruction limit reached!
% 0.20/0.34 % (116066)------------------------------
% 0.20/0.34 % (116066)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.34 % (116066)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.34 % (116066)CaDiCaL version: 2.1.3
% 0.20/0.34 % (116066)Termination reason: Instruction limit
% 0.20/0.34 % (116066)Termination phase: Saturation
% 0.20/0.34 % (116066)Time elapsed: 0.048 s
% 0.20/0.34 % (116066)Peak memory usage: 13 MB
% 0.20/0.34 % (116066)Instructions burned: 104 (million)
% 0.20/0.34 % Exception at run slice level
% 0.20/0.34 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.34 % (116068)Instruction limit reached!
% 0.20/0.34 % (116068)------------------------------
% 0.20/0.34 % (116068)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.34 % (116068)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.34 % (116068)CaDiCaL version: 2.1.3
% 0.20/0.34 % (116068)Termination reason: Instruction limit
% 0.20/0.34 % (116068)Termination phase: Saturation
% 0.20/0.34 % (116068)Time elapsed: 0.061 s
% 0.20/0.34 % (116068)Peak memory usage: 13 MB
% 0.20/0.34 % (116068)Instructions burned: 133 (million)
% 0.20/0.34 % (116078)Instruction limit reached!
% 0.20/0.34 % (116078)------------------------------
% 0.20/0.34 % (116078)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.34 % (116078)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.34 % (116078)CaDiCaL version: 2.1.3
% 0.20/0.34 % (116078)Termination reason: Instruction limit
% 0.20/0.34 % (116078)Termination phase: Saturation
% 0.20/0.34 % (116078)Time elapsed: 0.032 s
% 0.20/0.34 % (116078)Peak memory usage: 13 MB
% 0.20/0.34 % (116078)Instructions burned: 132 (million)
% 0.20/0.34 % (116081)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=2954965636:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 0.20/0.34 % (116069)Instruction limit reached!
% 0.20/0.34 % (116069)------------------------------
% 0.20/0.34 % (116069)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.34 % (116069)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.34 % (116069)CaDiCaL version: 2.1.3
% 0.20/0.34 % (116069)Termination reason: Instruction limit
% 0.20/0.34 % (116069)Termination phase: Saturation
% 0.20/0.34 % (116069)Time elapsed: 0.070 s
% 0.20/0.34 % (116069)Peak memory usage: 14 MB
% 0.20/0.34 % (116069)Instructions burned: 159 (million)
% 0.20/0.34 % (116064) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-116058-116064"...
% 0.20/0.34 % (116084)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3727593449:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 0.20/0.34 % (116064)...printing done.
% 0.20/0.34 % (116082)ott-21_1_sil=16000:fs=off:random_seed=2506910363:i=180:av=off:fsr=off_2999 on theBenchmark for (2999ds/180Mi)
% 0.20/0.34 % (116064)Refutation found. Thanks to Tanya!
% 0.20/0.34 % SZS status Theorem for theBenchmark
% 0.20/0.34 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.34 % (116064)------------------------------
% 0.20/0.34 % (116064)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.34 % (116064)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.34 % (116064)CaDiCaL version: 2.1.3
% 0.20/0.34 % (116064)Termination reason: Refutation
% 0.20/0.34 % (116064)Time elapsed: 0.077 s
% 0.20/0.34 % (116064)Peak memory usage: 13 MB
% 0.20/0.34 % (116064)Instructions burned: 158 (million)
% 0.20/0.34 % (116058)Success in time 0.12 s
% 0.20/0.35 % Vampire exiting
%------------------------------------------------------------------------------