%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU514^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n008.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:29:52 AM UTC 2026
% Result : Theorem 0.22s 0.30s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 2
% Syntax : Number of formulae : 24 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 710 ( 207 equ; 0 cnn)
% Maximal formula atoms : 32 ( 29 avg)
% Number of connectives : 512 ( 42 ~; 41 |; 113 &; 188 @)
% ( 4 <=>; 124 =>; 0 <=; 0 <~>)
% Maximal formula depth : 39 ( 14 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 120 ( 117 usr; 41 con; 0-4 aty)
% Number of variables : 59 ( 0 ^; 44 !; 15 ?; 59 :)
% 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_44,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_45,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_46,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_47,type,
vAND: $o > $o > $o ).
thf(func_def_48,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_49,type,
vIMP: $o > $o > $o ).
thf(func_def_50,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_51,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_52,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_53,type,
vNOT: $o > $o ).
thf(func_def_54,type,
sP0: $i > $i > $o ).
thf(func_def_55,type,
sP1: $i > $o ).
thf(func_def_56,type,
sP2: $i > $i > $o ).
thf(func_def_57,type,
sP3: $i > $i > $o ).
thf(func_def_58,type,
sP4: $o ).
thf(func_def_60,type,
sK6: $i > $i > $i ).
thf(func_def_61,type,
sK7: $i > $i > $i ).
thf(func_def_62,type,
sK8: $i > $i > $i ).
thf(func_def_63,type,
sK9: $i > $i > $i ).
thf(func_def_64,type,
sK10: $i > $i > $i > $i ).
thf(func_def_65,type,
sK11: $i > $i ).
thf(func_def_66,type,
sK12: $i > $i ).
thf(func_def_67,type,
sK13: $i > $i ).
thf(func_def_68,type,
sK14: $i > $i ).
thf(func_def_69,type,
sK15: $i > $i > $i ).
thf(func_def_70,type,
sK16: $i > $i > $i > $i ).
thf(func_def_71,type,
sK17: $i > $i > $i > $i ).
thf(func_def_72,type,
sK18: $i > $i > $i ).
thf(func_def_73,type,
sK19: $i > $i > $i ).
thf(func_def_74,type,
sK20: $i > $i ).
thf(func_def_75,type,
sK21: $i > $i > $i ).
thf(func_def_77,type,
sK23: $i > $i ).
thf(func_def_78,type,
sK24: $i > $i ).
thf(func_def_80,type,
sK26: $i > $o ).
thf(func_def_85,type,
sK31: $i > $i ).
thf(func_def_90,type,
sK36: $i > $i ).
thf(func_def_91,type,
sK37: $i > $o ).
thf(func_def_96,type,
sK42: $o ).
thf(func_def_99,type,
sK45: ( $i > $o ) > $i ).
thf(func_def_100,type,
sK46: $i > $o ).
thf(func_def_101,type,
sK47: $i > $i > $o ).
thf(func_def_103,type,
sK49: $i > $i ).
thf(func_def_104,type,
sK50: $i > $i ).
thf(func_def_105,type,
sK51: $i > ( $i > $i > $o ) > $i ).
thf(func_def_106,type,
sK52: $i > $i > ( $i > $i > $o ) > $i ).
thf(func_def_107,type,
sK53: $i > ( $i > $i > $o ) > $i ).
thf(func_def_108,type,
sK54: $i > $i ).
thf(func_def_112,type,
sK58: $i > $i ).
thf(func_def_115,type,
sK61: $i > $i ).
thf(func_def_116,type,
sK62: $i > $i ).
thf(func_def_117,type,
sK63: $o ).
thf(func_def_122,type,
sK68: $i > $i > $i ).
thf(func_def_123,type,
sK69: $i > $o ).
thf(func_def_124,type,
sK70: $i > $o ).
thf(func_def_129,type,
sK75: $i > $i > $i ).
thf(func_def_131,type,
sK77: $i > $o ).
thf(func_def_136,type,
sK82: ( $i > $o ) > $i ).
thf(func_def_137,type,
sK83: $i > $o ).
thf(func_def_138,type,
sK84: $i > $i ).
thf(func_def_142,type,
sK88: $i > $i > $i ).
thf(func_def_145,type,
sK91: $i > $o ).
thf(func_def_146,type,
sK92: $i > $i > $i ).
thf(func_def_147,type,
sK93: $i > $i > $i ).
thf(func_def_152,type,
sK98: $i > ( $i > $o ) > $i ).
thf(func_def_153,type,
sK99: $i > ( $i > $i > $o ) > $i > $i ).
thf(func_def_154,type,
sK100: $i > ( $i > $o ) > $i ).
thf(func_def_155,type,
sK101: ( $i > $o ) > $i > $i ).
thf(func_def_156,type,
sK102: $i > ( $i > $i > $o ) > $i > $i ).
thf(func_def_157,type,
sK103: $i > $i ).
thf(func_def_158,type,
sK104: $i > ( $i > $i > $o ) > $i > $i ).
thf(func_def_159,type,
sK105: $i > ( $i > $o ) > $i ).
thf(f4,axiom,
! [X0: $i,X1: $i,X2: $i] :
( ( ( ( X2 = X0 )
| ( in @ X2 @ X1 ) )
<=> ( in @ X2 @ ( setadjoin @ X0 @ X1 ) ) )
= setadjoinAx ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setadjoinAx) ).
thf(f34,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
=> ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ X1 )
=> ( in @ X2 @ ( setadjoin @ X0 @ X1 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setadjoinIR) ).
thf(f35,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
=> ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ X1 )
=> ( in @ X2 @ ( setadjoin @ X0 @ X1 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f34]) ).
thf(f44,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( ( ( X2 = X0 )
| ( in @ X2 @ X1 ) )
<=> ( in @ X2 @ ( setadjoin @ X0 @ X1 ) ) )
= setadjoinAx ),
inference(rectify,[],[f4]) ).
thf(f45,plain,
( ( setadjoinAx = $true )
<=> ! [X2: $i,X0: $i,X1: $i] :
( ( ( ( in @ X2 @ X1 )
= $true )
| ( X0 = X2 ) )
<=> ( ( in @ X2 @ ( setadjoin @ X0 @ X1 ) )
= $true ) ) ),
inference(fool_elimination,[],[f44]) ).
thf(f87,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
=> ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ X1 )
=> ( in @ X2 @ ( setadjoin @ X0 @ X1 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f35]) ).
thf(f88,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 )
=> ! [X1: $i,X2: $i,X0: $i] :
( ( ( in @ X2 @ X1 )
= $true )
=> ( ( in @ X2 @ ( setadjoin @ X0 @ X1 ) )
= $true ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f87]) ).
thf(f114,plain,
( ? [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X2 @ ( setadjoin @ X0 @ X1 ) )
!= $true )
& ( ( in @ X2 @ X1 )
= $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,[],[f88]) ).
thf(f115,plain,
( ( exuE3e = $true )
& ( setext = $true )
& ( nonemptyI = $true )
& ( emptysetimpfalse = $true )
& ( foundationAx = $true )
& ( replAx = $true )
& ( exuE1 = $true )
& ( emptyinunitempty = $true )
& ( setadjoinIL = $true )
& ( setadjoinAx = $true )
& ( dsetconstrI = $true )
& ( notinemptyset = $true )
& ( emptyI = $true )
& ( noeltsimpempty = $true )
& ( setunionAx = $true )
& ( setbeta = $true )
& ( setextAx = $true )
& ? [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X2 @ ( setadjoin @ X0 @ X1 ) )
!= $true )
& ( ( in @ X2 @ X1 )
= $true ) )
& ( powersetAx = $true )
& ( wellorderingAx = $true )
& ( omegaSAx = $true )
& ( nonemptyI1 = $true )
& ( descrp = $true )
& ( dsetconstrEL = $true )
& ( nonemptyE1 = $true )
& ( emptysetE = $true )
& ( omegaIndAx = $true )
& ( emptysetAx = $true )
& ( prop2setE = $true )
& ( dsetconstrER = $true )
& ( omega0Ax = $true ) ),
inference(flattening,[],[f114]) ).
thf(f174,plain,
( ( ( setadjoinAx = $true )
| ? [X2: $i,X0: $i,X1: $i] :
( ( ( ( in @ X2 @ ( setadjoin @ X0 @ X1 ) )
!= $true )
| ( ( ( in @ X2 @ X1 )
!= $true )
& ( X0 != X2 ) ) )
& ( ( ( in @ X2 @ ( setadjoin @ X0 @ X1 ) )
= $true )
| ( ( in @ X2 @ X1 )
= $true )
| ( X0 = X2 ) ) ) )
& ( ! [X2: $i,X0: $i,X1: $i] :
( ( ( ( in @ X2 @ X1 )
= $true )
| ( X0 = X2 )
| ( ( in @ X2 @ ( setadjoin @ X0 @ X1 ) )
!= $true ) )
& ( ( ( in @ X2 @ ( setadjoin @ X0 @ X1 ) )
= $true )
| ( ( ( in @ X2 @ X1 )
!= $true )
& ( X0 != X2 ) ) ) )
| ( setadjoinAx != $true ) ) ),
inference(nnf_transformation,[],[f45]) ).
thf(f175,plain,
( ( ( setadjoinAx = $true )
| ? [X2: $i,X0: $i,X1: $i] :
( ( ( ( in @ X2 @ ( setadjoin @ X0 @ X1 ) )
!= $true )
| ( ( ( in @ X2 @ X1 )
!= $true )
& ( X0 != X2 ) ) )
& ( ( ( in @ X2 @ ( setadjoin @ X0 @ X1 ) )
= $true )
| ( ( in @ X2 @ X1 )
= $true )
| ( X0 = X2 ) ) ) )
& ( ! [X2: $i,X0: $i,X1: $i] :
( ( ( ( in @ X2 @ X1 )
= $true )
| ( X0 = X2 )
| ( ( in @ X2 @ ( setadjoin @ X0 @ X1 ) )
!= $true ) )
& ( ( ( in @ X2 @ ( setadjoin @ X0 @ X1 ) )
= $true )
| ( ( ( in @ X2 @ X1 )
!= $true )
& ( X0 != X2 ) ) ) )
| ( setadjoinAx != $true ) ) ),
inference(flattening,[],[f174]) ).
thf(f176,plain,
( ( ( setadjoinAx = $true )
| ? [X0: $i,X1: $i,X2: $i] :
( ( ( $true
!= ( in @ X0 @ ( setadjoin @ X1 @ X2 ) ) )
| ( ( $true
!= ( in @ X0 @ X2 ) )
& ( X0 != X1 ) ) )
& ( ( $true
= ( in @ X0 @ ( setadjoin @ X1 @ X2 ) ) )
| ( $true
= ( in @ X0 @ X2 ) )
| ( X0 = X1 ) ) ) )
& ( ! [X3: $i,X4: $i,X5: $i] :
( ( ( ( in @ X3 @ X5 )
= $true )
| ( X3 = X4 )
| ( $true
!= ( in @ X3 @ ( setadjoin @ X4 @ X5 ) ) ) )
& ( ( $true
= ( in @ X3 @ ( setadjoin @ X4 @ X5 ) ) )
| ( ( ( in @ X3 @ X5 )
!= $true )
& ( X3 != X4 ) ) ) )
| ( setadjoinAx != $true ) ) ),
inference(rectify,[],[f175]) ).
thf(f177,plain,
( ( ( setadjoinAx = $true )
| ( ( ( ( in @ sK32 @ ( setadjoin @ sK33 @ sK34 ) )
!= $true )
| ( ( $true
!= ( in @ sK32 @ sK34 ) )
& ( sK33 != sK32 ) ) )
& ( ( ( in @ sK32 @ ( setadjoin @ sK33 @ sK34 ) )
= $true )
| ( $true
= ( in @ sK32 @ sK34 ) )
| ( sK33 = sK32 ) ) ) )
& ( ! [X3: $i,X4: $i,X5: $i] :
( ( ( ( in @ X3 @ X5 )
= $true )
| ( X3 = X4 )
| ( $true
!= ( in @ X3 @ ( setadjoin @ X4 @ X5 ) ) ) )
& ( ( $true
= ( in @ X3 @ ( setadjoin @ X4 @ X5 ) ) )
| ( ( ( in @ X3 @ X5 )
!= $true )
& ( X3 != X4 ) ) ) )
| ( setadjoinAx != $true ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK32,sK33,sK34]),skolemize(X0,sK32),skolemize(X1,sK33),skolemize(X2,sK34)],[f176]) ).
thf(f227,plain,
( ( exuE3e = $true )
& ( setext = $true )
& ( nonemptyI = $true )
& ( emptysetimpfalse = $true )
& ( foundationAx = $true )
& ( replAx = $true )
& ( exuE1 = $true )
& ( emptyinunitempty = $true )
& ( setadjoinIL = $true )
& ( setadjoinAx = $true )
& ( dsetconstrI = $true )
& ( notinemptyset = $true )
& ( emptyI = $true )
& ( noeltsimpempty = $true )
& ( setunionAx = $true )
& ( setbeta = $true )
& ( setextAx = $true )
& ( ( in @ sK81 @ ( setadjoin @ sK79 @ sK80 ) )
!= $true )
& ( $true
= ( in @ sK81 @ sK80 ) )
& ( powersetAx = $true )
& ( wellorderingAx = $true )
& ( omegaSAx = $true )
& ( nonemptyI1 = $true )
& ( descrp = $true )
& ( dsetconstrEL = $true )
& ( nonemptyE1 = $true )
& ( emptysetE = $true )
& ( omegaIndAx = $true )
& ( emptysetAx = $true )
& ( prop2setE = $true )
& ( dsetconstrER = $true )
& ( omega0Ax = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK79,sK80,sK81]),skolemize(X0,sK79),skolemize(X1,sK80),skolemize(X2,sK81)],[f115]) ).
thf(f296,plain,
! [X3: $i,X4: $i,X5: $i] :
( ( $true
= ( in @ X3 @ ( setadjoin @ X4 @ X5 ) ) )
| ( ( in @ X3 @ X5 )
!= $true )
| ( setadjoinAx != $true ) ),
inference(cnf_transformation,[],[f177]) ).
thf(f384,plain,
( $true
= ( in @ sK81 @ sK80 ) ),
inference(cnf_transformation,[],[f227]) ).
thf(f385,plain,
( ( in @ sK81 @ ( setadjoin @ sK79 @ sK80 ) )
!= $true ),
inference(cnf_transformation,[],[f227]) ).
thf(f393,plain,
setadjoinAx = $true,
inference(cnf_transformation,[],[f227]) ).
thf(f454,plain,
! [X3: $i,X4: $i,X5: $i] :
( ( $true != $true )
| ( $true
= ( in @ X3 @ ( setadjoin @ X4 @ X5 ) ) )
| ( ( in @ X3 @ X5 )
!= $true ) ),
inference(definition_unfolding,[],[f296,f393]) ).
thf(f585,plain,
! [X3: $i,X4: $i,X5: $i] :
( ( ( in @ X3 @ X5 )
!= $true )
| ( $true
= ( in @ X3 @ ( setadjoin @ X4 @ X5 ) ) ) ),
inference(trivial_inequality_removal,[],[f454]) ).
thf(f797,plain,
! [X0: $i] :
( ( ( in @ sK81 @ ( setadjoin @ X0 @ sK80 ) )
= $true )
| ( $true != $true ) ),
inference(constrained_superposition,[],[f585,f384]) ).
thf(f800,plain,
! [X0: $i] :
( ( in @ sK81 @ ( setadjoin @ X0 @ sK80 ) )
= $true ),
inference(trivial_inequality_removal,[],[f797]) ).
thf(f812,plain,
$true != $true,
inference(constrained_superposition,[],[f385,f800]) ).
thf(f813,plain,
$false,
inference(trivial_inequality_removal,[],[f812]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU514^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n008.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Tue Sep 29 13:48:09 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running higher-order theorem proving
% 0.08/0.24 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.30 % (3178301)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.22/0.30 % (3178312)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.22/0.30 % (3178312)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.22/0.30 % (3178312)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=4135484274:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.22/0.30 % (3178307)lrs+10_16_si=on:nwc=1.5:random_seed=2077284892:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.22/0.30 % (3178308)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=1117633088:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.22/0.30 % (3178306)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=1933972715:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.22/0.30 % (3178309)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=712342966:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.22/0.30 % (3178311)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=1493260118:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.22/0.30 % (3178310)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=2503427128:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.22/0.30 % (3178308)Instruction limit reached!
% 0.22/0.30 % (3178308)------------------------------
% 0.22/0.30 % (3178308)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.30 % (3178308)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.30 % (3178308)CaDiCaL version: 2.1.3
% 0.22/0.30 % (3178308)Termination reason: Instruction limit
% 0.22/0.30 % (3178308)Termination phase: Property scanning
% 0.22/0.30 % (3178308)Time elapsed: 0.002 s
% 0.22/0.30 % (3178308)Peak memory usage: 9 MB
% 0.22/0.30 % (3178308)Instructions burned: 4 (million)
% 0.22/0.30 % (3178307)Instruction limit reached!
% 0.22/0.30 % (3178307)------------------------------
% 0.22/0.30 % (3178307)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.30 % (3178307)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.30 % (3178307)CaDiCaL version: 2.1.3
% 0.22/0.30 % (3178307)Termination reason: Instruction limit
% 0.22/0.30 % (3178307)Termination phase: Saturation
% 0.22/0.30 % (3178307)Time elapsed: 0.008 s
% 0.22/0.30 % (3178307)Peak memory usage: 12 MB
% 0.22/0.30 % (3178307)Instructions burned: 19 (million)
% 0.22/0.30 % (3178310)Instruction limit reached!
% 0.22/0.30 % (3178310)------------------------------
% 0.22/0.30 % (3178310)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.30 % (3178310)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.30 % (3178310)CaDiCaL version: 2.1.3
% 0.22/0.30 % (3178310)Termination reason: Instruction limit
% 0.22/0.30 % (3178310)Termination phase: Saturation
% 0.22/0.30 % (3178310)Time elapsed: 0.011 s
% 0.22/0.30 % (3178310)Peak memory usage: 11 MB
% 0.22/0.30 % (3178310)Instructions burned: 25 (million)
% 0.22/0.30 % (3178320)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=15722269:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.22/0.30 % (3178306) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3178301-3178306"...
% 0.22/0.30 % (3178320)Instruction limit reached!
% 0.22/0.30 % (3178320)------------------------------
% 0.22/0.30 % (3178320)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.30 % (3178320)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.30 % (3178320)CaDiCaL version: 2.1.3
% 0.22/0.30 % (3178320)Termination reason: Instruction limit
% 0.22/0.30 % (3178320)Termination phase: Property scanning
% 0.22/0.30 % (3178320)Time elapsed: 0.002 s
% 0.22/0.30 % (3178320)Peak memory usage: 10 MB
% 0.22/0.30 % (3178320)Instructions burned: 4 (million)
% 0.22/0.30 % (3178309) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3178301-3178309"...
% 0.22/0.30 % (3178306)...printing done.
% 0.22/0.30 % (3178306)Refutation found. Thanks to Tanya!
% 0.22/0.30 % SZS status Theorem for theBenchmark
% 0.22/0.30 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.30 % (3178306)------------------------------
% 0.22/0.30 % (3178306)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.30 % (3178306)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.30 % (3178306)CaDiCaL version: 2.1.3
% 0.22/0.30 % (3178306)Termination reason: Refutation
% 0.22/0.30 % (3178306)Time elapsed: 0.025 s
% 0.22/0.30 % (3178306)Peak memory usage: 13 MB
% 0.22/0.30 % (3178306)Instructions burned: 48 (million)
% 0.22/0.30 % (3178301)Success in time 0.058 s
% 0.22/0.30 % Vampire exiting
%------------------------------------------------------------------------------