%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU531^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 : n014.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:57 AM UTC 2026
% Result : Theorem 0.24s 0.34s
% Output : Refutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 11
% Syntax : Number of formulae : 75 ( 25 unt; 0 typ; 8 def)
% Number of atoms : 1291 ( 355 equ; 0 cnn)
% Maximal formula atoms : 51 ( 17 avg)
% Number of connectives : 788 ( 89 ~; 83 |; 208 &; 200 @)
% ( 13 <=>; 195 =>; 0 <=; 0 <~>)
% Maximal formula depth : 57 ( 9 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 145 ( 142 usr; 70 con; 0-4 aty)
% Number of variables : 72 ( 0 sgn 55 !; 17 ?; 72 :)
% 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_61,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_62,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_63,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_64,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_65,type,
vNOT: $o > $o ).
thf(func_def_66,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_67,type,
vAND: $o > $o > $o ).
thf(func_def_68,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_69,type,
vIMP: $o > $o > $o ).
thf(func_def_70,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_71,type,
sP0: $i > $i > $o ).
thf(func_def_72,type,
sP1: $i > $o ).
thf(func_def_73,type,
sP2: $o ).
thf(func_def_76,type,
sK5: $i > $o ).
thf(func_def_77,type,
sK6: $o ).
thf(func_def_82,type,
sK11: $o ).
thf(func_def_83,type,
sK12: $o > $i > $i > $i ).
thf(func_def_85,type,
sK14: $i > $i ).
thf(func_def_86,type,
sK15: $i > $i ).
thf(func_def_87,type,
sK16: $i > $i ).
thf(func_def_88,type,
sK17: $i > $i ).
thf(func_def_89,type,
sK18: $i > $i ).
thf(func_def_90,type,
sK19: $i > $i > $i > $i ).
thf(func_def_91,type,
sK20: $i > $i ).
thf(func_def_92,type,
sK21: $i > $i ).
thf(func_def_93,type,
sK22: $i > $i ).
thf(func_def_94,type,
sK23: $i > $i ).
thf(func_def_95,type,
sK24: $i > $i > $i ).
thf(func_def_96,type,
sK25: $i > $i > $i > $i ).
thf(func_def_97,type,
sK26: $i > $i > $i > $i ).
thf(func_def_98,type,
sK27: $i > $i > $i > $i ).
thf(func_def_99,type,
sK28: $i > $i > $i ).
thf(func_def_100,type,
sK29: $i > $i > $i ).
thf(func_def_101,type,
sK30: $i > $i > $i ).
thf(func_def_102,type,
sK31: $i > $i > $i ).
thf(func_def_112,type,
sK41: $o ).
thf(func_def_115,type,
sK44: $i > $i > $i ).
thf(func_def_121,type,
sK50: $i > $o ).
thf(func_def_123,type,
sK52: $i > $o ).
thf(func_def_128,type,
sK57: ( $i > $o ) > $i ).
thf(func_def_129,type,
sK58: $i > $o ).
thf(func_def_130,type,
sK59: $i > $i ).
thf(func_def_140,type,
sK69: $o ).
thf(func_def_146,type,
sK75: $i > $i > $o ).
thf(func_def_148,type,
sK77: $i > $i ).
thf(func_def_149,type,
sK78: $i > $i ).
thf(func_def_150,type,
sK79: $i > ( $i > $i > $o ) > $i ).
thf(func_def_151,type,
sK80: $i > ( $i > $i > $o ) > $i ).
thf(func_def_152,type,
sK81: $i > $i > ( $i > $i > $o ) > $i ).
thf(func_def_156,type,
sK85: $i > $i > $i ).
thf(func_def_161,type,
sK90: $i > $o ).
thf(func_def_162,type,
sK91: $i > $i > $i ).
thf(func_def_168,type,
sK97: $i > $i > $i ).
thf(func_def_172,type,
sK101: $i > $o ).
thf(func_def_176,type,
sK105: $i > $i ).
thf(func_def_178,type,
sK107: $i > $i ).
thf(func_def_182,type,
sK111: $i > $i ).
thf(func_def_184,type,
sK113: $i > $o ).
thf(func_def_187,type,
sK116: $i > $o ).
thf(func_def_188,type,
sK117: ( $i > $o ) > $i ).
thf(func_def_192,type,
sK121: $i > $i ).
thf(func_def_194,type,
sK123: $i > $i ).
thf(func_def_196,type,
sK125: $i > $i ).
thf(func_def_197,type,
sK126: $i > $i > $i ).
thf(func_def_198,type,
sK127: $i > $i > $i ).
thf(func_def_201,type,
sK130: $i > $i ).
thf(func_def_205,type,
sK134: $i > $o ).
thf(func_def_206,type,
sK135: $i > $i ).
thf(func_def_207,type,
sK136: ( $i > $o ) > $i ).
thf(f22,axiom,
( notinemptyset
= ( ! [X0: $i] :
~ ( in @ X0 @ emptyset ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',notinemptyset) ).
thf(f36,axiom,
! [X2: $i,X0: $i,X1: $i] :
( ( ( in @ X2 @ ( setadjoin @ X0 @ X1 ) )
=> ( ( in @ X2 @ X1 )
| ( X2 = X0 ) ) )
= setadjoinOr ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setadjoinOr) ).
thf(f51,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
=> ! [X2: $i,X0: $i,X1: $i] :
( ( in @ X2 @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) )
=> ( ( X2 = X0 )
| ( X2 = X1 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',upairsetE) ).
thf(f52,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
=> ! [X2: $i,X0: $i,X1: $i] :
( ( in @ X2 @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) )
=> ( ( X2 = X0 )
| ( X2 = X1 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f51]) ).
thf(f73,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X0 @ ( setadjoin @ X1 @ X2 ) )
=> ( ( in @ X0 @ X2 )
| ( X0 = X1 ) ) )
= setadjoinOr ),
inference(rectify,[],[f36]) ).
thf(f74,plain,
( ( setadjoinOr = $true )
<=> ! [X1: $i,X0: $i,X2: $i] :
( ( ( in @ X0 @ ( setadjoin @ X1 @ X2 ) )
= $true )
=> ( ( ( in @ X0 @ X2 )
= $true )
| ( X0 = X1 ) ) ) ),
inference(fool_elimination,[],[f73]) ).
thf(f110,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
=> ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X0 @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) )
=> ( ( X0 = X1 )
| ( X0 = X2 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f52]) ).
thf(f111,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 )
=> ! [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X0 @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) )
= $true )
=> ( ( X0 = X1 )
| ( X0 = X2 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f110]) ).
thf(f138,plain,
( notinemptyset
= ( ! [X0: $i] :
~ ( in @ X0 @ emptyset ) ) ),
inference(rectify,[],[f22]) ).
thf(f139,plain,
( ( notinemptyset = $true )
<=> ! [X0: $i] :
( ( in @ X0 @ emptyset )
!= $true ) ),
inference(fool_elimination,[],[f138]) ).
thf(f160,plain,
( ! [X0: $i] :
( ( in @ X0 @ emptyset )
!= $true )
<=> ( notinemptyset = $true ) ),
inference(flattening,[],[f139]) ).
thf(f194,plain,
( ( setadjoinOr = $true )
<=> ! [X1: $i,X0: $i,X2: $i] :
( ( ( in @ X0 @ X2 )
= $true )
| ( X0 = X1 )
| ( ( in @ X0 @ ( setadjoin @ X1 @ X2 ) )
!= $true ) ) ),
inference(ennf_transformation,[],[f74]) ).
thf(f195,plain,
( ! [X1: $i,X2: $i,X0: $i] :
( ( ( in @ X0 @ ( setadjoin @ X1 @ X2 ) )
!= $true )
| ( ( in @ X0 @ X2 )
= $true )
| ( X0 = X1 ) )
<=> ( setadjoinOr = $true ) ),
inference(flattening,[],[f194]) ).
thf(f202,plain,
( ? [X0: $i,X1: $i,X2: $i] :
( ( X0 != X1 )
& ( X0 != X2 )
& ( ( in @ X0 @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) )
= $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,[],[f111]) ).
thf(f203,plain,
( ( emptysetE = $true )
& ( emptyInPowerset = $true )
& ( exuE3e = $true )
& ( dsetconstrER = $true )
& ( setoftrueEq = $true )
& ( omegaIndAx = $true )
& ( setadjoinOr = $true )
& ( setadjoinE = $true )
& ( noeltsimpempty = $true )
& ? [X0: $i,X2: $i,X1: $i] :
( ( X0 != X1 )
& ( X0 != X2 )
& ( ( in @ X0 @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) )
= $true ) )
& ( emptysetAx = $true )
& ( prop2setE = $true )
& ( nonemptyI1 = $true )
& ( uniqinunit = $true )
& ( notinemptyset = $true )
& ( omega0Ax = $true )
& ( setadjoinAx = $true )
& ( subPowSU = $true )
& ( nonemptyE1 = $true )
& ( nonemptyImpWitness = $true )
& ( wellorderingAx = $true )
& ( setunionI = $true )
& ( exuE2 = $true )
& ( singletonsswitch = $true )
& ( foundationAx = $true )
& ( setadjoinIL = $true )
& ( exuE1 = $true )
& ( powersetAx = $true )
& ( replAx = $true )
& ( setext = $true )
& ( omegaSAx = $true )
& ( notinsingleton = $true )
& ( emptyI = $true )
& ( dsetconstrI = $true )
& ( eqinunit = $true )
& ( setunionE = $true )
& ( setextAx = $true )
& ( emptyinPowerset = $true )
& ( emptyinunitempty = $true )
& ( setadjoinIR = $true )
& ( nonemptyI = $true )
& ( descrp = $true )
& ( setbeta = $true )
& ( powersetI = $true )
& ( dsetconstrEL = $true )
& ( emptysetimpfalse = $true )
& ( setunionAx = $true )
& ( powersetE = $true ) ),
inference(flattening,[],[f202]) ).
thf(f239,plain,
( ( emptysetE = $true )
& ( emptyInPowerset = $true )
& ( exuE3e = $true )
& ( dsetconstrER = $true )
& ( setoftrueEq = $true )
& ( omegaIndAx = $true )
& ( setadjoinOr = $true )
& ( setadjoinE = $true )
& ( noeltsimpempty = $true )
& ? [X0: $i,X1: $i,X2: $i] :
( ( X0 != X2 )
& ( X0 != X1 )
& ( $true
= ( in @ X0 @ ( setadjoin @ X2 @ ( setadjoin @ X1 @ emptyset ) ) ) ) )
& ( emptysetAx = $true )
& ( prop2setE = $true )
& ( nonemptyI1 = $true )
& ( uniqinunit = $true )
& ( notinemptyset = $true )
& ( omega0Ax = $true )
& ( setadjoinAx = $true )
& ( subPowSU = $true )
& ( nonemptyE1 = $true )
& ( nonemptyImpWitness = $true )
& ( wellorderingAx = $true )
& ( setunionI = $true )
& ( exuE2 = $true )
& ( singletonsswitch = $true )
& ( foundationAx = $true )
& ( setadjoinIL = $true )
& ( exuE1 = $true )
& ( powersetAx = $true )
& ( replAx = $true )
& ( setext = $true )
& ( omegaSAx = $true )
& ( notinsingleton = $true )
& ( emptyI = $true )
& ( dsetconstrI = $true )
& ( eqinunit = $true )
& ( setunionE = $true )
& ( setextAx = $true )
& ( emptyinPowerset = $true )
& ( emptyinunitempty = $true )
& ( setadjoinIR = $true )
& ( nonemptyI = $true )
& ( descrp = $true )
& ( setbeta = $true )
& ( powersetI = $true )
& ( dsetconstrEL = $true )
& ( emptysetimpfalse = $true )
& ( setunionAx = $true )
& ( powersetE = $true ) ),
inference(rectify,[],[f203]) ).
thf(f240,plain,
( ( emptysetE = $true )
& ( emptyInPowerset = $true )
& ( exuE3e = $true )
& ( dsetconstrER = $true )
& ( setoftrueEq = $true )
& ( omegaIndAx = $true )
& ( setadjoinOr = $true )
& ( setadjoinE = $true )
& ( noeltsimpempty = $true )
& ( sK37 != sK35 )
& ( sK36 != sK35 )
& ( ( in @ sK35 @ ( setadjoin @ sK37 @ ( setadjoin @ sK36 @ emptyset ) ) )
= $true )
& ( emptysetAx = $true )
& ( prop2setE = $true )
& ( nonemptyI1 = $true )
& ( uniqinunit = $true )
& ( notinemptyset = $true )
& ( omega0Ax = $true )
& ( setadjoinAx = $true )
& ( subPowSU = $true )
& ( nonemptyE1 = $true )
& ( nonemptyImpWitness = $true )
& ( wellorderingAx = $true )
& ( setunionI = $true )
& ( exuE2 = $true )
& ( singletonsswitch = $true )
& ( foundationAx = $true )
& ( setadjoinIL = $true )
& ( exuE1 = $true )
& ( powersetAx = $true )
& ( replAx = $true )
& ( setext = $true )
& ( omegaSAx = $true )
& ( notinsingleton = $true )
& ( emptyI = $true )
& ( dsetconstrI = $true )
& ( eqinunit = $true )
& ( setunionE = $true )
& ( setextAx = $true )
& ( emptyinPowerset = $true )
& ( emptyinunitempty = $true )
& ( setadjoinIR = $true )
& ( nonemptyI = $true )
& ( descrp = $true )
& ( setbeta = $true )
& ( powersetI = $true )
& ( dsetconstrEL = $true )
& ( emptysetimpfalse = $true )
& ( setunionAx = $true )
& ( powersetE = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK35,sK36,sK37]),skolemize(X0,sK35),skolemize(X1,sK36),skolemize(X2,sK37)],[f239]) ).
thf(f244,plain,
( ( ! [X0: $i] :
( ( in @ X0 @ emptyset )
!= $true )
| ( notinemptyset != $true ) )
& ( ( notinemptyset = $true )
| ? [X0: $i] :
( ( in @ X0 @ emptyset )
= $true ) ) ),
inference(nnf_transformation,[],[f160]) ).
thf(f245,plain,
( ( ! [X0: $i] :
( ( in @ X0 @ emptyset )
!= $true )
| ( notinemptyset != $true ) )
& ( ( notinemptyset = $true )
| ? [X1: $i] :
( ( in @ X1 @ emptyset )
= $true ) ) ),
inference(rectify,[],[f244]) ).
thf(f246,plain,
( ( ! [X0: $i] :
( ( in @ X0 @ emptyset )
!= $true )
| ( notinemptyset != $true ) )
& ( ( notinemptyset = $true )
| ( ( in @ sK39 @ emptyset )
= $true ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK39]),skolemize(X1,sK39)],[f245]) ).
thf(f262,plain,
( ( ! [X1: $i,X2: $i,X0: $i] :
( ( ( in @ X0 @ ( setadjoin @ X1 @ X2 ) )
!= $true )
| ( ( in @ X0 @ X2 )
= $true )
| ( X0 = X1 ) )
| ( setadjoinOr != $true ) )
& ( ( setadjoinOr = $true )
| ? [X1: $i,X2: $i,X0: $i] :
( ( ( in @ X0 @ ( setadjoin @ X1 @ X2 ) )
= $true )
& ( ( in @ X0 @ X2 )
!= $true )
& ( X0 != X1 ) ) ) ),
inference(nnf_transformation,[],[f195]) ).
thf(f263,plain,
( ( ! [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X2 @ ( setadjoin @ X0 @ X1 ) )
!= $true )
| ( ( in @ X2 @ X1 )
= $true )
| ( X0 = X2 ) )
| ( setadjoinOr != $true ) )
& ( ( setadjoinOr = $true )
| ? [X3: $i,X4: $i,X5: $i] :
( ( ( in @ X5 @ ( setadjoin @ X3 @ X4 ) )
= $true )
& ( ( in @ X5 @ X4 )
!= $true )
& ( X3 != X5 ) ) ) ),
inference(rectify,[],[f262]) ).
thf(f264,plain,
( ( ! [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X2 @ ( setadjoin @ X0 @ X1 ) )
!= $true )
| ( ( in @ X2 @ X1 )
= $true )
| ( X0 = X2 ) )
| ( setadjoinOr != $true ) )
& ( ( setadjoinOr = $true )
| ( ( ( in @ sK56 @ ( setadjoin @ sK54 @ sK55 ) )
= $true )
& ( ( in @ sK56 @ sK55 )
!= $true )
& ( sK56 != sK54 ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK54,sK55,sK56]),skolemize(X3,sK54),skolemize(X4,sK55),skolemize(X5,sK56)],[f263]) ).
thf(f455,plain,
notinemptyset = $true,
inference(cnf_transformation,[],[f240]) ).
thf(f460,plain,
( ( in @ sK35 @ ( setadjoin @ sK37 @ ( setadjoin @ sK36 @ emptyset ) ) )
= $true ),
inference(cnf_transformation,[],[f240]) ).
thf(f461,plain,
sK36 != sK35,
inference(cnf_transformation,[],[f240]) ).
thf(f462,plain,
sK37 != sK35,
inference(cnf_transformation,[],[f240]) ).
thf(f465,plain,
setadjoinOr = $true,
inference(cnf_transformation,[],[f240]) ).
thf(f475,plain,
! [X0: $i] :
( ( ( in @ X0 @ emptyset )
!= $true )
| ( notinemptyset != $true ) ),
inference(cnf_transformation,[],[f246]) ).
thf(f499,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( setadjoinOr != $true )
| ( ( in @ X2 @ X1 )
= $true )
| ( ( in @ X2 @ ( setadjoin @ X0 @ X1 ) )
!= $true )
| ( X0 = X2 ) ),
inference(cnf_transformation,[],[f264]) ).
thf(f803,definition,
( spl137_29
<=> ! [X2: $i] :
( ( in @ X2 @ emptyset )
!= $true ) ),
introduced(definition,[new_symbols(definition,[spl137_29])],[avatar_definition]) ).
thf(f804,plain,
( ! [X2: $i] :
( ( in @ X2 @ emptyset )
!= $true )
| ~ spl137_29 ),
inference(avatar_component_clause,[],[f803]) ).
thf(f879,definition,
( spl137_47
<=> ( notinemptyset = $true ) ),
introduced(definition,[new_symbols(definition,[spl137_47])],[avatar_definition]) ).
thf(f976,definition,
( spl137_69
<=> ( ( in @ sK35 @ ( setadjoin @ sK37 @ ( setadjoin @ sK36 @ emptyset ) ) )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl137_69])],[avatar_definition]) ).
thf(f978,plain,
( ( ( in @ sK35 @ ( setadjoin @ sK37 @ ( setadjoin @ sK36 @ emptyset ) ) )
= $true )
| ~ spl137_69 ),
inference(avatar_component_clause,[],[f976]) ).
thf(f979,plain,
spl137_69,
inference(avatar_split_clause,[],[f460,f976]) ).
thf(f1119,definition,
( spl137_100
<=> ( setadjoinOr = $true ) ),
introduced(definition,[new_symbols(definition,[spl137_100])],[avatar_definition]) ).
thf(f1162,definition,
( spl137_109
<=> ( sK37 = sK35 ) ),
introduced(definition,[new_symbols(definition,[spl137_109])],[avatar_definition]) ).
thf(f1164,plain,
( ( sK37 != sK35 )
| spl137_109 ),
inference(avatar_component_clause,[],[f1162]) ).
thf(f1165,plain,
~ spl137_109,
inference(avatar_split_clause,[],[f462,f1162]) ).
thf(f1374,definition,
( spl137_156
<=> ! [X2: $i,X0: $i,X1: $i] :
( ( ( in @ X0 @ X1 )
= $true )
| ( $true
!= ( in @ X0 @ ( setadjoin @ X2 @ X1 ) ) )
| ( X0 = X2 ) ) ),
introduced(definition,[new_symbols(definition,[spl137_156])],[avatar_definition]) ).
thf(f1375,plain,
( ! [X2: $i,X0: $i,X1: $i] :
( ( $true
!= ( in @ X0 @ ( setadjoin @ X2 @ X1 ) ) )
| ( X0 = X2 )
| ( ( in @ X0 @ X1 )
= $true ) )
| ~ spl137_156 ),
inference(avatar_component_clause,[],[f1374]) ).
thf(f1452,definition,
( spl137_172
<=> ( sK36 = sK35 ) ),
introduced(definition,[new_symbols(definition,[spl137_172])],[avatar_definition]) ).
thf(f1454,plain,
( ( sK36 != sK35 )
| spl137_172 ),
inference(avatar_component_clause,[],[f1452]) ).
thf(f1455,plain,
~ spl137_172,
inference(avatar_split_clause,[],[f461,f1452]) ).
thf(f1460,plain,
spl137_47,
inference(avatar_split_clause,[],[f455,f879]) ).
thf(f1655,plain,
spl137_100,
inference(avatar_split_clause,[],[f465,f1119]) ).
thf(f1664,plain,
( spl137_156
| ~ spl137_100 ),
inference(avatar_split_clause,[],[f499,f1119,f1374]) ).
thf(f1740,plain,
( ~ spl137_47
| spl137_29 ),
inference(avatar_split_clause,[],[f475,f803,f879]) ).
thf(f1975,plain,
( ( sK37 = sK35 )
| ( $true != $true )
| ( ( in @ sK35 @ ( setadjoin @ sK36 @ emptyset ) )
= $true )
| ~ spl137_69
| ~ spl137_156 ),
inference(superposition,[],[f1375,f978]) ).
thf(f1982,plain,
( ( sK37 = sK35 )
| ( ( in @ sK35 @ ( setadjoin @ sK36 @ emptyset ) )
= $true )
| ~ spl137_69
| ~ spl137_156 ),
inference(trivial_inequality_removal,[],[f1975]) ).
thf(f1988,plain,
( ( ( in @ sK35 @ ( setadjoin @ sK36 @ emptyset ) )
= $true )
| ~ spl137_69
| spl137_109
| ~ spl137_156 ),
inference(forward_subsumption_resolution,[],[f1982,f1164]) ).
thf(f1990,definition,
( spl137_248
<=> ( ( in @ sK35 @ ( setadjoin @ sK36 @ emptyset ) )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl137_248])],[avatar_definition]) ).
thf(f1992,plain,
( ( ( in @ sK35 @ ( setadjoin @ sK36 @ emptyset ) )
= $true )
| ~ spl137_248 ),
inference(avatar_component_clause,[],[f1990]) ).
thf(f1993,plain,
( spl137_248
| ~ spl137_69
| spl137_109
| ~ spl137_156 ),
inference(avatar_split_clause,[],[f1988,f1374,f1162,f976,f1990]) ).
thf(f2101,plain,
( ( ( in @ sK35 @ emptyset )
= $true )
| ( sK36 = sK35 )
| ( $true != $true )
| ~ spl137_156
| ~ spl137_248 ),
inference(superposition,[],[f1375,f1992]) ).
thf(f2105,plain,
( ( ( in @ sK35 @ emptyset )
= $true )
| ( sK36 = sK35 )
| ~ spl137_156
| ~ spl137_248 ),
inference(trivial_inequality_removal,[],[f2101]) ).
thf(f2113,plain,
( ( sK36 = sK35 )
| ~ spl137_29
| ~ spl137_156
| ~ spl137_248 ),
inference(forward_subsumption_resolution,[],[f2105,f804]) ).
thf(f2114,plain,
( $false
| ~ spl137_29
| ~ spl137_156
| spl137_172
| ~ spl137_248 ),
inference(forward_subsumption_resolution,[],[f2113,f1454]) ).
thf(f2115,plain,
( ~ spl137_29
| ~ spl137_156
| spl137_172
| ~ spl137_248 ),
inference(avatar_contradiction_clause,[],[f2114]) ).
cnf(s40,plain,
spl137_69,
inference(sat_conversion,[],[f979]) ).
cnf(s81,plain,
~ spl137_109,
inference(sat_conversion,[],[f1165]) ).
cnf(s147,plain,
~ spl137_172,
inference(sat_conversion,[],[f1455]) ).
cnf(s149,plain,
spl137_47,
inference(sat_conversion,[],[f1460]) ).
cnf(s203,plain,
spl137_100,
inference(sat_conversion,[],[f1655]) ).
cnf(s209,plain,
( ~ spl137_100
| spl137_156 ),
inference(sat_conversion,[],[f1664]) ).
cnf(s231,plain,
( spl137_29
| ~ spl137_47 ),
inference(sat_conversion,[],[f1740]) ).
cnf(s258,plain,
( ~ spl137_69
| spl137_109
| ~ spl137_156
| spl137_248 ),
inference(sat_conversion,[],[f1993]) ).
cnf(s262,plain,
( ~ spl137_29
| ~ spl137_156
| spl137_172
| ~ spl137_248 ),
inference(sat_conversion,[],[f2115]) ).
cnf(s264,plain,
spl137_156,
inference(rat,[],[s209,s203]) ).
cnf(s275,plain,
spl137_29,
inference(rat,[],[s231,s149]) ).
cnf(s277,plain,
~ spl137_248,
inference(rat,[],[s262,s275,s264,s147]) ).
cnf(s298,plain,
~ spl137_69,
inference(rat,[],[s258,s277,s264,s81]) ).
cnf(s314,plain,
$false,
inference(rat,[],[s40,s298]) ).
thf(f2116,plain,
$false,
inference(avatar_sat_refutation,[],[s314]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU531^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.19 % Computer : n014.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 13:48:15 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 Running higher-order theorem proving
% 0.09/0.25 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.24/0.34 % (2688370)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.24/0.34 % (2688384)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=2406901959:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.24/0.34 % (2688386)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.24/0.34 % (2688386)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.24/0.34 % (2688380)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=2731058313:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.24/0.34 % (2688384)Instruction limit reached!
% 0.24/0.34 % (2688384)------------------------------
% 0.24/0.34 % (2688384)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.34 % (2688384)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.34 % (2688384)CaDiCaL version: 2.1.3
% 0.24/0.34 % (2688384)Termination reason: Instruction limit
% 0.24/0.34 % (2688384)Termination phase: Property scanning
% 0.24/0.34 % (2688384)Time elapsed: 0.007 s
% 0.24/0.34 % (2688384)Peak memory usage: 11 MB
% 0.24/0.34 % (2688384)Instructions burned: 25 (million)
% 0.24/0.34 % (2688381)lrs+10_16_si=on:nwc=1.5:random_seed=1927063533:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.24/0.34 % (2688382)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=1976870497:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.24/0.34 % (2688383)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=3815835251: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.24/0.34 % (2688385)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=266602201:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.24/0.34 % (2688386)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=2089385100:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.24/0.34 % (2688382)Instruction limit reached!
% 0.24/0.34 % (2688382)------------------------------
% 0.24/0.34 % (2688382)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.34 % (2688382)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.34 % (2688382)CaDiCaL version: 2.1.3
% 0.24/0.34 % (2688382)Termination reason: Instruction limit
% 0.24/0.34 % (2688382)Termination phase: shuffling
% 0.24/0.34 % (2688382)Time elapsed: 0.002 s
% 0.24/0.34 % (2688382)Peak memory usage: 9 MB
% 0.24/0.34 % (2688382)Instructions burned: 4 (million)
% 0.24/0.34 % (2688381)Instruction limit reached!
% 0.24/0.34 % (2688381)------------------------------
% 0.24/0.34 % (2688381)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.34 % (2688381)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.34 % (2688381)CaDiCaL version: 2.1.3
% 0.24/0.34 % (2688381)Termination reason: Instruction limit
% 0.24/0.34 % (2688381)Termination phase: Property scanning
% 0.24/0.34 % (2688381)Time elapsed: 0.008 s
% 0.24/0.34 % (2688381)Peak memory usage: 10 MB
% 0.24/0.34 % (2688381)Instructions burned: 19 (million)
% 0.24/0.34 % (2688403)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=303237607:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.24/0.34 % (2688403)Instruction limit reached!
% 0.24/0.34 % (2688403)------------------------------
% 0.24/0.34 % (2688403)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.34 % (2688403)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.34 % (2688403)CaDiCaL version: 2.1.3
% 0.24/0.34 % (2688403)Termination reason: Instruction limit
% 0.24/0.34 % (2688403)Termination phase: shuffling
% 0.24/0.34 % (2688403)Time elapsed: 0.001 s
% 0.24/0.34 % (2688403)Peak memory usage: 9 MB
% 0.24/0.34 % (2688403)Instructions burned: 5 (million)
% 0.24/0.34 % (2688407)lrs+1010_2:3_cha=on:si=on:uwa=off:nwc=1:random_seed=116104225:i=5:fgj=on:av=off:rtra=on:fe=axiom:ntd=on_2999 on theBenchmark for (2999ds/5Mi)
% 0.24/0.34 % (2688411)lrs+10_1_sil=128000:si=on:urr=on:slsqc=1:slsq=on:random_seed=379668996:i=12:s2at=2:kws=inv_frequency:bd=all:rtra=on_2999 on theBenchmark for (2999ds/12Mi)
% 0.24/0.34 % (2688408)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(5) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.24/0.34 % (2688407)Instruction limit reached!
% 0.24/0.34 % (2688407)------------------------------
% 0.24/0.34 % (2688407)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.34 % (2688407)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.34 % (2688407)CaDiCaL version: 2.1.3
% 0.24/0.34 % (2688407)Termination reason: Instruction limit
% 0.24/0.34 % (2688407)Termination phase: Property scanning
% 0.24/0.34 % (2688407)Time elapsed: 0.003 s
% 0.24/0.34 % (2688407)Peak memory usage: 10 MB
% 0.24/0.34 % (2688407)Instructions burned: 7 (million)
% 0.24/0.34 % (2688411)Instruction limit reached!
% 0.24/0.34 % (2688411)------------------------------
% 0.24/0.34 % (2688411)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.34 % (2688411)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.34 % (2688411)CaDiCaL version: 2.1.3
% 0.24/0.34 % (2688411)Termination reason: Instruction limit
% 0.24/0.34 % (2688411)Termination phase: Preprocessing 3
% 0.24/0.34 % (2688411)Time elapsed: 0.003 s
% 0.24/0.34 % (2688411)Peak memory usage: 10 MB
% 0.24/0.34 % (2688411)Instructions burned: 13 (million)
% 0.24/0.34 % (2688408)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=1144561752:uwa_fpi=on:i=7:fgj=on:hud=10:fsr=off:rtra=on:rawr=on:fsdmm=5_2999 on theBenchmark for (2999ds/7Mi)
% 0.24/0.34 % (2688408)Instruction limit reached!
% 0.24/0.34 % (2688408)------------------------------
% 0.24/0.34 % (2688408)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.34 % (2688408)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.34 % (2688408)CaDiCaL version: 2.1.3
% 0.24/0.34 % (2688408)Termination reason: Instruction limit
% 0.24/0.34 % (2688408)Termination phase: Property scanning
% 0.24/0.34 % (2688408)Time elapsed: 0.004 s
% 0.24/0.34 % (2688408)Peak memory usage: 9 MB
% 0.24/0.34 % (2688408)Instructions burned: 10 (million)
% 0.24/0.34 % (2688421)lrs+1002_64_sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:sp=occurrence:lma=off:plsqr=32,1:uwa=interpreted_only:random_seed=1311118390:i=86:piset=equals:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/86Mi)
% 0.24/0.34 % (2688385)Instruction limit reached!
% 0.24/0.34 % (2688385)------------------------------
% 0.24/0.34 % (2688385)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.34 % (2688385)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.34 % (2688385)CaDiCaL version: 2.1.3
% 0.24/0.34 % (2688385)Termination reason: Instruction limit
% 0.24/0.34 % (2688385)Termination phase: Saturation
% 0.24/0.34 % (2688385)Time elapsed: 0.039 s
% 0.24/0.34 % (2688385)Peak memory usage: 13 MB
% 0.24/0.34 % (2688385)Instructions burned: 76 (million)
% 0.24/0.34 % (2688419)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.24/0.34 % (2688419)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(1) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.24/0.34 % (2688383) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2688370-2688383"...
% 0.24/0.34 % (2688419)ott+1010_64_tgt=ground:cnfonf=lazy_simp:si=on:lma=off:spb=goal:lcm=predicate:random_seed=1271115028:i=28:s2at=5:piset=not:hud=10:bd=all:av=off:rtra=on:ixr=off:fsdmm=1_2999 on theBenchmark for (2999ds/28Mi)
% 0.24/0.34 % (2688380)Instruction limit reached!
% 0.24/0.34 % (2688380)------------------------------
% 0.24/0.34 % (2688380)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.34 % (2688380)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.34 % (2688380)CaDiCaL version: 2.1.3
% 0.24/0.34 % (2688380)Termination reason: Instruction limit
% 0.24/0.34 % (2688380)Termination phase: Saturation
% 0.24/0.34 % (2688380)Time elapsed: 0.047 s
% 0.24/0.34 % (2688380)Peak memory usage: 13 MB
% 0.24/0.34 % (2688380)Instructions burned: 87 (million)
% 0.24/0.34 % (2688383)...printing done.
% 0.24/0.34 % (2688383)Refutation found. Thanks to Tanya!
% 0.24/0.34 % SZS status Theorem for theBenchmark
% 0.24/0.34 % SZS output start Proof for theBenchmark
% See solution above
% 0.24/0.34 % (2688383)------------------------------
% 0.24/0.34 % (2688383)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.34 % (2688383)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.34 % (2688383)CaDiCaL version: 2.1.3
% 0.24/0.34 % (2688383)Termination reason: Refutation
% 0.24/0.34 % (2688383)Time elapsed: 0.047 s
% 0.24/0.34 % (2688383)Peak memory usage: 14 MB
% 0.24/0.34 % (2688383)Instructions burned: 85 (million)
% 0.24/0.34 % (2688370)Success in time 0.075 s
% 0.24/0.34 % Vampire exiting
%------------------------------------------------------------------------------