%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU521^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n015.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:17 AM UTC 2026
% Result : Theorem 0.66s 0.40s
% Output : Refutation 0.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 2
% Syntax : Number of formulae : 30 ( 16 unt; 0 typ; 0 def)
% Number of atoms : 760 ( 198 equ; 0 cnn)
% Maximal formula atoms : 40 ( 25 avg)
% Number of connectives : 524 ( 7 ~; 9 |; 117 &; 203 @)
% ( 2 <=>; 169 =>; 0 <=; 0 <~>)
% Maximal formula depth : 46 ( 12 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 95 ( 91 usr; 43 con; 0-4 aty)
% ( 17 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 65 ( 20 ^; 39 !; 6 ?; 65 :)
% 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,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_50,type,
vAND: $o > $o > $o ).
thf(func_def_51,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_52,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_53,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_54,type,
vIMP: $o > $o > $o ).
thf(func_def_55,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_56,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_57,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_58,type,
vIFF: $o > $o > $o ).
thf(func_def_59,type,
vNOT: $o > $o ).
thf(func_def_60,type,
vOR: $o > $o > $o ).
thf(func_def_61,type,
db4:
!>[X0: $tType] : X0 ).
thf(func_def_62,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_68,type,
sK3: $i > $i > $i ).
thf(func_def_69,type,
sK4: $i > $i ).
thf(func_def_70,type,
sK5: $i > $i ).
thf(func_def_71,type,
sK6: $i > $i ).
thf(func_def_72,type,
sK7: $i > $i > $i ).
thf(func_def_73,type,
sK8: $i > $i > $i ).
thf(func_def_74,type,
sK9: ( $i > $o ) > $i ).
thf(func_def_75,type,
sK10: ( $i > $o ) > $i > $i ).
thf(func_def_76,type,
sK11: ( $i > $o ) > $i ).
thf(func_def_77,type,
sK12: ( $i > $o ) > $i > $i ).
thf(func_def_78,type,
sK13: ( $i > $o ) > $i > $i ).
thf(func_def_79,type,
sK14: $i > $i ).
thf(func_def_80,type,
sK15: $i > $i > $i > $i ).
thf(func_def_81,type,
sK16: $i > $i > $i ).
thf(func_def_82,type,
sK17: $i > $i > $i ).
thf(func_def_83,type,
sK18: $i > $i > $i ).
thf(func_def_84,type,
sK19: $i > $i ).
thf(func_def_85,type,
sK20: $i > ( $i > $i > $o ) > $i ).
thf(func_def_86,type,
sK21: $i > ( $i > $i > $o ) > $i ).
thf(func_def_87,type,
sK22: $i > $i > ( $i > $i > $o ) > $i ).
thf(func_def_88,type,
sK23: $i > $i > ( $i > $i > $o ) > $i ).
thf(func_def_89,type,
sK24: $i > $i > ( $i > $i > $o ) > $i ).
thf(func_def_90,type,
sK25: $i > $i > ( $i > $i > $o ) > $i ).
thf(func_def_91,type,
sK26: $i > $i ).
thf(func_def_92,type,
sK27: $i > $i > $i ).
thf(func_def_93,type,
sK28: $i > $i > $i ).
thf(func_def_94,type,
sK29: $i > $i > $i ).
thf(f5,axiom,
( powersetAx
= ( ! [X0: $i,X1: $i] :
( ( in @ X1 @ ( powerset @ X0 ) )
<=> ! [X2: $i] :
( ( in @ X2 @ X1 )
=> ( in @ X2 @ X0 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',powersetAx) ).
thf(f41,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
=> ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X1 @ ( powerset @ X0 ) )
=> ( ( in @ X2 @ X1 )
=> ( in @ X2 @ X0 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',powersetE) ).
thf(f42,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
=> ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X1 @ ( powerset @ X0 ) )
=> ( ( in @ X2 @ X1 )
=> ( in @ X2 @ X0 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f41]) ).
thf(f51,plain,
( powersetAx
= ( ! [X0: $i,X1: $i] :
( ( in @ X1 @ ( powerset @ X0 ) )
<=> ! [X2: $i] :
( ( in @ X2 @ X1 )
=> ( in @ X2 @ X0 ) ) ) ) ),
inference(rectify,[],[f5]) ).
thf(f52,plain,
( powersetAx
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y0 @ ( powerset @ Y1 ) )
= ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y0 )
=> ( in @ Y2 @ Y1 ) ) ) ) ) ) ),
inference(fool_elimination,[],[f51]) ).
thf(f118,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
=> ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X1 @ ( powerset @ X0 ) )
=> ( ( in @ X2 @ X1 )
=> ( in @ X2 @ X0 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f42]) ).
thf(f119,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 )
=> ! [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X1 @ ( powerset @ X0 ) )
= $true )
=> ( ( ( in @ X2 @ X1 )
= $true )
=> ( ( in @ X2 @ X0 )
= $true ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f118]) ).
thf(f120,plain,
( ? [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X2 @ X0 )
!= $true )
& ( ( in @ X2 @ X1 )
= $true )
& ( ( in @ X1 @ ( powerset @ X0 ) )
= $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,[],[f119]) ).
thf(f121,plain,
( ? [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X2 @ X0 )
!= $true )
& ( ( in @ X2 @ X1 )
= $true )
& ( ( in @ X1 @ ( powerset @ X0 ) )
= $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,[],[f120]) ).
thf(f122,plain,
( ( $true
!= ( in @ sK2 @ sK0 ) )
& ( $true
= ( in @ sK2 @ sK1 ) )
& ( $true
= ( in @ sK1 @ ( powerset @ sK0 ) ) )
& ( 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)],[f121]) ).
thf(f127,plain,
( powersetAx
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y0 @ ( powerset @ Y1 ) )
= ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y0 )
=> ( in @ Y2 @ Y1 ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f52]) ).
thf(f166,plain,
powersetAx = $true,
inference(cnf_transformation,[],[f122]) ).
thf(f200,plain,
( $true
= ( in @ sK1 @ ( powerset @ sK0 ) ) ),
inference(cnf_transformation,[],[f122]) ).
thf(f201,plain,
( $true
= ( in @ sK2 @ sK1 ) ),
inference(cnf_transformation,[],[f122]) ).
thf(f202,plain,
( $true
!= ( in @ sK2 @ sK0 ) ),
inference(cnf_transformation,[],[f122]) ).
thf(f208,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y0 @ ( powerset @ Y1 ) )
= ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y0 )
=> ( in @ Y2 @ Y1 ) ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f127,f166]) ).
thf(f631,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y0 @ ( powerset @ Y1 ) )
= ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y0 )
=> ( in @ Y2 @ Y1 ) ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f208]) ).
thf(f632,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ X1 @ ( powerset @ Y0 ) )
= ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ X1 )
=> ( in @ Y1 @ Y0 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f631]) ).
thf(f633,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( in @ X1 @ ( powerset @ Y0 ) )
= ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ X1 )
=> ( in @ Y1 @ Y0 ) ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f632]) ).
thf(f634,plain,
! [X2: $i,X1: $i] :
( $true
= ( ( in @ X1 @ ( powerset @ X2 ) )
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X1 )
=> ( in @ Y0 @ X2 ) ) ) ) ),
inference(beta-eta_normalization,[],[f633]) ).
thf(f635,plain,
! [X2: $i,X1: $i] :
( ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X1 )
=> ( in @ Y0 @ X2 ) ) )
= ( in @ X1 @ ( powerset @ X2 ) ) ),
inference(iff_proxy_clausification,[],[f634]) ).
thf(f636,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X1 )
=> ( in @ Y0 @ X2 ) ) ) )
| ( $false
= ( in @ X1 @ ( powerset @ X2 ) ) ) ),
inference(iff_proxy_clausification,[],[f635]) ).
thf(f642,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( ( in @ Y0 @ X1 )
=> ( in @ Y0 @ X2 ) )
@ X3 ) )
| ( $false
= ( in @ X1 @ ( powerset @ X2 ) ) ) ),
inference(pi_proxy_clausification,[],[f636]) ).
thf(f643,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $true
= ( ( in @ X3 @ X1 )
=> ( in @ X3 @ X2 ) ) )
| ( $false
= ( in @ X1 @ ( powerset @ X2 ) ) ) ),
inference(beta-eta_normalization,[],[f642]) ).
thf(f644,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( ( in @ X3 @ X1 )
= $false )
| ( $false
= ( in @ X1 @ ( powerset @ X2 ) ) )
| ( ( in @ X3 @ X2 )
= $true ) ),
inference(imp_proxy_clausification,[],[f643]) ).
thf(f1662,plain,
! [X0: $i] :
( ( $false = $true )
| ( $false
= ( in @ X0 @ sK1 ) )
| ( $true
= ( in @ X0 @ sK0 ) ) ),
inference(constrained_superposition,[],[f200,f644]) ).
thf(f1707,plain,
! [X0: $i] :
( ( $false
= ( in @ X0 @ sK1 ) )
| ( $true
= ( in @ X0 @ sK0 ) ) ),
inference(trivial_inequality_removal,[],[f1662]) ).
thf(f1808,plain,
( ( $false = $true )
| ( $true
= ( in @ sK2 @ sK0 ) ) ),
inference(constrained_superposition,[],[f201,f1707]) ).
thf(f1824,plain,
( $true
= ( in @ sK2 @ sK0 ) ),
inference(trivial_inequality_removal,[],[f1808]) ).
thf(f1849,plain,
$false,
inference(forward_subsumption_resolution,[],[f1824,f202]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU521^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.21 % Computer : n015.cluster.edu
% 0.11/0.21 % Model : x86_64 x86_64
% 0.11/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.21 % Memory : 8046.5625MB
% 0.11/0.21 % OS : Linux 6.8.0-71-generic
% 0.11/0.21 % CPULimit : 300
% 0.11/0.21 % WCLimit : 300
% 0.11/0.21 % DateTime : Tue Sep 29 13:51:18 UTC 2026
% 0.11/0.21 % CPUTime :
% 0.11/0.21 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.24 Running first-order model finding
% 0.11/0.24 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.66/0.40 % (3552364)Will run a generic schedule for satisfiability detection.
% 0.66/0.40 % (3552370)% WARNING: option uhcvi not known.
% 0.66/0.40 % (3552369)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1637025520_2999 on theBenchmark for (2999ds/0Mi)
% 0.66/0.40 % (3552371)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2638378408:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.66/0.40 % (3552375)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3018149425:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.66/0.40 % (3552373)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3754843788:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.66/0.40 % (3552372)dis+10_1_sil=32000:sp=arity:random_seed=505310303:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.66/0.40 % (3552370)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2477075915:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.66/0.40 % (3552370)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.66/0.40 % (3552373)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.66/0.40 % Exception at run slice level
% 0.66/0.40 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.66/0.40 % (3552370)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.66/0.40 % (3552374)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=392981236:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.66/0.40 % (3552382)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3997317469:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.66/0.40 % Exception at run slice level
% 0.66/0.40 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.66/0.40 % (3552372)Instruction limit reached!
% 0.66/0.40 % (3552372)------------------------------
% 0.66/0.40 % (3552372)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.66/0.40 % (3552372)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.66/0.40 % (3552372)CaDiCaL version: 2.1.3
% 0.66/0.40 % (3552372)Termination reason: Instruction limit
% 0.66/0.40 % (3552372)Termination phase: Saturation
% 0.66/0.40 % (3552372)Time elapsed: 0.050 s
% 0.66/0.40 % (3552372)Peak memory usage: 13 MB
% 0.66/0.40 % (3552372)Instructions burned: 103 (million)
% 0.66/0.40 % (3552385)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2385294394:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.66/0.40 % (3552373)Instruction limit reached!
% 0.66/0.40 % (3552373)------------------------------
% 0.66/0.40 % (3552373)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.66/0.40 % (3552373)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.66/0.40 % (3552373)CaDiCaL version: 2.1.3
% 0.66/0.40 % (3552373)Termination reason: Instruction limit
% 0.66/0.40 % (3552373)Termination phase: Saturation
% 0.66/0.40 % (3552373)Time elapsed: 0.071 s
% 0.66/0.40 % (3552373)Peak memory usage: 13 MB
% 0.66/0.40 % (3552373)Instructions burned: 116 (million)
% 0.66/0.40 % (3552375)Instruction limit reached!
% 0.66/0.40 % (3552375)------------------------------
% 0.66/0.40 % (3552375)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.66/0.40 % (3552375)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.66/0.40 % (3552375)CaDiCaL version: 2.1.3
% 0.66/0.40 % (3552375)Termination reason: Instruction limit
% 0.66/0.40 % (3552375)Termination phase: Saturation
% 0.66/0.40 % (3552375)Time elapsed: 0.071 s
% 0.66/0.40 % (3552375)Peak memory usage: 13 MB
% 0.66/0.40 % (3552375)Instructions burned: 159 (million)
% 0.66/0.40 % (3552386)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=4158358152:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 0.66/0.40 % (3552386)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.66/0.40 % (3552386)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.66/0.40 % (3552389)ott-21_1_sil=16000:fs=off:random_seed=462100805:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 0.66/0.40 % (3552390)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1311756130:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 0.66/0.40 % (3552370) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3552364-3552370"...
% 0.66/0.40 % (3552370)...printing done.
% 0.66/0.40 % (3552370)Refutation found. Thanks to Tanya!
% 0.66/0.40 % SZS status Theorem for theBenchmark
% 0.66/0.40 % SZS output start Proof for theBenchmark
% See solution above
% 0.66/0.40 % (3552370)------------------------------
% 0.66/0.40 % (3552370)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.66/0.40 % (3552370)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.66/0.40 % (3552370)CaDiCaL version: 2.1.3
% 0.66/0.40 % (3552370)Termination reason: Refutation
% 0.66/0.40 % (3552370)Time elapsed: 0.105 s
% 0.66/0.40 % (3552370)Peak memory usage: 13 MB
% 0.66/0.40 % (3552370)Instructions burned: 196 (million)
% 0.66/0.40 % (3552364)Success in time 0.149 s
% 0.66/0.40 % Vampire exiting
%------------------------------------------------------------------------------