%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU515^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 : n016.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:15 AM UTC 2026
% Result : Theorem 0.21s 0.29s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 5
% Syntax : Number of formulae : 48 ( 21 unt; 0 typ; 3 def)
% Number of atoms : 736 ( 212 equ; 0 cnn)
% Maximal formula atoms : 37 ( 15 avg)
% Number of connectives : 509 ( 24 ~; 40 |; 102 &; 179 @)
% ( 5 <=>; 144 =>; 0 <=; 0 <~>)
% Maximal formula depth : 43 ( 8 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 : 92 ( 88 usr; 41 con; 0-4 aty)
% ( 15 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 72 ( 0 sgn 46 !; 8 ?; 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,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_44,type,
vAND: $o > $o > $o ).
thf(func_def_45,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_46,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_47,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_48,type,
vIMP: $o > $o > $o ).
thf(func_def_49,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_50,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_51,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_52,type,
vIFF: $o > $o > $o ).
thf(func_def_53,type,
vNOT: $o > $o ).
thf(func_def_54,type,
vOR: $o > $o > $o ).
thf(func_def_55,type,
db4:
!>[X0: $tType] : X0 ).
thf(func_def_56,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_62,type,
sK3: $o ).
thf(func_def_63,type,
sK4: $i > $i ).
thf(func_def_64,type,
sK5: $i > $i ).
thf(func_def_65,type,
sK6: $i > $i ).
thf(func_def_66,type,
sK7: $i > $i > $i ).
thf(func_def_67,type,
sK8: $i > $i > $i ).
thf(func_def_68,type,
sK9: ( $i > $o ) > $i ).
thf(func_def_69,type,
sK10: ( $i > $o ) > $i > $i ).
thf(func_def_70,type,
sK11: ( $i > $o ) > $i ).
thf(func_def_71,type,
sK12: ( $i > $o ) > $i > $i ).
thf(func_def_72,type,
sK13: ( $i > $o ) > $i > $i ).
thf(func_def_73,type,
sK14: $i > $i ).
thf(func_def_74,type,
sK15: $i > $i > $i > $i ).
thf(func_def_75,type,
sK16: $i > $i > $i ).
thf(func_def_76,type,
sK17: $i > $i > $i ).
thf(func_def_77,type,
sK18: $i > $i > $i ).
thf(func_def_78,type,
sK19: $i > $i ).
thf(func_def_79,type,
sK20: $i > ( $i > $i > $o ) > $i ).
thf(func_def_80,type,
sK21: $i > ( $i > $i > $o ) > $i ).
thf(func_def_81,type,
sK22: $i > $i > ( $i > $i > $o ) > $i ).
thf(func_def_82,type,
sK23: $i > $i > ( $i > $i > $o ) > $i ).
thf(func_def_83,type,
sK24: $i > $i > ( $i > $i > $o ) > $i ).
thf(func_def_84,type,
sK25: $i > $i > ( $i > $i > $o ) > $i ).
thf(func_def_85,type,
sK26: $i > $i ).
thf(func_def_86,type,
sK27: $i > $i > $i ).
thf(func_def_87,type,
sK28: $i > $i > $i ).
thf(func_def_88,type,
sK29: $i > $i > $i ).
thf(f4,axiom,
( setadjoinAx
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ ( setadjoin @ X0 @ X1 ) )
<=> ( ( in @ X2 @ X1 )
| ( X2 = X0 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setadjoinAx) ).
thf(f35,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
=> ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ ( setadjoin @ X0 @ X1 ) )
=> ! [X3: $o] :
( ( ( X2 = X0 )
=> X3 )
=> ( ( ( in @ X2 @ X1 )
=> X3 )
=> X3 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setadjoinE) ).
thf(f36,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
=> ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ ( setadjoin @ X0 @ X1 ) )
=> ! [X3: $o] :
( ( ( X2 = X0 )
=> X3 )
=> ( ( ( in @ X2 @ X1 )
=> X3 )
=> X3 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f35]) ).
thf(f43,plain,
( setadjoinAx
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ ( setadjoin @ X0 @ X1 ) )
<=> ( ( in @ X2 @ X1 )
| ( X2 = X0 ) ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f44,plain,
( setadjoinAx
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ ( setadjoin @ Y2 @ Y1 ) )
= ( ( Y2 = Y0 )
| ( in @ Y0 @ Y1 ) ) ) ) ) ) ),
inference(fool_elimination,[],[f43]) ).
thf(f100,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
=> ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ ( setadjoin @ X0 @ X1 ) )
=> ! [X3: $o] :
( ( ( X2 = X0 )
=> X3 )
=> ( ( ( in @ X2 @ X1 )
=> X3 )
=> X3 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f36]) ).
thf(f101,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 )
=> ! [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X2 @ ( setadjoin @ X0 @ X1 ) )
= $true )
=> ! [X3: $o] :
( ( ( X0 = X2 )
=> ( $true = X3 ) )
=> ( ( ( ( in @ X2 @ X1 )
= $true )
=> ( $true = X3 ) )
=> ( $true = X3 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f100]) ).
thf(f102,plain,
( ? [X0: $i,X1: $i,X2: $i] :
( ? [X3: $o] :
( ( $true != X3 )
& ( ( $true = X3 )
| ( ( in @ X2 @ X1 )
!= $true ) )
& ( ( $true = X3 )
| ( X0 != X2 ) ) )
& ( ( in @ X2 @ ( setadjoin @ X0 @ X1 ) )
= $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,[],[f101]) ).
thf(f103,plain,
( ? [X0: $i,X1: $i,X2: $i] :
( ? [X3: $o] :
( ( $true != X3 )
& ( ( $true = X3 )
| ( ( in @ X2 @ X1 )
!= $true ) )
& ( ( $true = X3 )
| ( X0 != X2 ) ) )
& ( ( in @ X2 @ ( setadjoin @ X0 @ X1 ) )
= $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,[],[f102]) ).
thf(f104,plain,
( ( $true != sK3 )
& ( ( $true = sK3 )
| ( $true
!= ( in @ sK2 @ sK1 ) ) )
& ( ( $true = sK3 )
| ( sK0 != sK2 ) )
& ( $true
= ( in @ sK2 @ ( setadjoin @ sK0 @ sK1 ) ) )
& ( 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,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f103]) ).
thf(f108,plain,
( setadjoinAx
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ ( setadjoin @ Y2 @ Y1 ) )
= ( ( Y2 = Y0 )
| ( in @ Y0 @ Y1 ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f44]) ).
thf(f141,plain,
setadjoinAx = $true,
inference(cnf_transformation,[],[f104]) ).
thf(f170,plain,
( $true
= ( in @ sK2 @ ( setadjoin @ sK0 @ sK1 ) ) ),
inference(cnf_transformation,[],[f104]) ).
thf(f171,plain,
( ( $true = sK3 )
| ( sK0 != sK2 ) ),
inference(cnf_transformation,[],[f104]) ).
thf(f172,plain,
( ( $true = sK3 )
| ( $true
!= ( in @ sK2 @ sK1 ) ) ),
inference(cnf_transformation,[],[f104]) ).
thf(f173,plain,
$true != sK3,
inference(cnf_transformation,[],[f104]) ).
thf(f178,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ ( setadjoin @ Y2 @ Y1 ) )
= ( ( Y2 = Y0 )
| ( in @ Y0 @ Y1 ) ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f108,f141]) ).
thf(f565,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ ( setadjoin @ Y2 @ Y1 ) )
= ( ( Y2 = Y0 )
| ( in @ Y0 @ Y1 ) ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f178]) ).
thf(f566,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ ( setadjoin @ Y1 @ Y0 ) )
= ( ( Y1 = X1 )
| ( in @ X1 @ Y0 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f565]) ).
thf(f567,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ ( setadjoin @ Y1 @ Y0 ) )
= ( ( Y1 = X1 )
| ( in @ X1 @ Y0 ) ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f566]) ).
thf(f568,plain,
! [X2: $i,X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ X1 @ ( setadjoin @ Y0 @ X2 ) )
= ( ( Y0 = X1 )
| ( in @ X1 @ X2 ) ) ) ) ),
inference(beta-eta_normalization,[],[f567]) ).
thf(f569,plain,
! [X2: $i,X3: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( in @ X1 @ ( setadjoin @ Y0 @ X2 ) )
= ( ( Y0 = X1 )
| ( in @ X1 @ X2 ) ) )
@ X3 ) ),
inference(pi_proxy_clausification,[],[f568]) ).
thf(f570,plain,
! [X2: $i,X3: $i,X1: $i] :
( $true
= ( ( in @ X1 @ ( setadjoin @ X3 @ X2 ) )
= ( ( X3 = X1 )
| ( in @ X1 @ X2 ) ) ) ),
inference(beta-eta_normalization,[],[f569]) ).
thf(f571,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( in @ X1 @ ( setadjoin @ X3 @ X2 ) )
= ( ( X3 = X1 )
| ( in @ X1 @ X2 ) ) ),
inference(iff_proxy_clausification,[],[f570]) ).
thf(f573,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ ( setadjoin @ X3 @ X2 ) ) )
| ( $true
= ( ( X3 = X1 )
| ( in @ X1 @ X2 ) ) ) ),
inference(iff_proxy_clausification,[],[f571]) ).
thf(f574,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ ( setadjoin @ X3 @ X2 ) ) )
| ( ( in @ X1 @ X2 )
= $true )
| ( $true
= ( X3 = X1 ) ) ),
inference(or_proxy_clausification,[],[f573]) ).
thf(f575,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ ( setadjoin @ X3 @ X2 ) ) )
| ( ( in @ X1 @ X2 )
= $true )
| ( X1 = X3 ) ),
inference(equality_proxy_clausification,[],[f574]) ).
thf(f594,definition,
( spl30_1
<=> ( sK0 = sK2 ) ),
introduced(definition,[new_symbols(definition,[spl30_1])],[avatar_definition]) ).
thf(f596,plain,
( ( sK0 != sK2 )
| spl30_1 ),
inference(avatar_component_clause,[],[f594]) ).
thf(f598,definition,
( spl30_2
<=> ( $true = sK3 ) ),
introduced(definition,[new_symbols(definition,[spl30_2])],[avatar_definition]) ).
thf(f601,plain,
( ~ spl30_1
| spl30_2 ),
inference(avatar_split_clause,[],[f171,f598,f594]) ).
thf(f603,definition,
( spl30_3
<=> ( $true
= ( in @ sK2 @ sK1 ) ) ),
introduced(definition,[new_symbols(definition,[spl30_3])],[avatar_definition]) ).
thf(f605,plain,
( ( $true
!= ( in @ sK2 @ sK1 ) )
| spl30_3 ),
inference(avatar_component_clause,[],[f603]) ).
thf(f606,plain,
( ~ spl30_3
| spl30_2 ),
inference(avatar_split_clause,[],[f172,f598,f603]) ).
thf(f607,plain,
~ spl30_2,
inference(avatar_split_clause,[],[f173,f598]) ).
thf(f998,plain,
( ( $false = $true )
| ( $true
= ( in @ sK2 @ sK1 ) )
| ( sK0 = sK2 ) ),
inference(constrained_superposition,[],[f575,f170]) ).
thf(f1024,plain,
( ( $true
= ( in @ sK2 @ sK1 ) )
| ( sK0 = sK2 ) ),
inference(trivial_inequality_removal,[],[f998]) ).
thf(f1032,plain,
( ( sK0 = sK2 )
| spl30_3 ),
inference(forward_subsumption_resolution,[],[f1024,f605]) ).
thf(f1035,plain,
( $false
| spl30_1
| spl30_3 ),
inference(forward_subsumption_resolution,[],[f1032,f596]) ).
thf(f1036,plain,
( spl30_1
| spl30_3 ),
inference(avatar_contradiction_clause,[],[f1035]) ).
cnf(s1,plain,
( ~ spl30_1
| spl30_2 ),
inference(sat_conversion,[],[f601]) ).
cnf(s2,plain,
( spl30_2
| ~ spl30_3 ),
inference(sat_conversion,[],[f606]) ).
cnf(s3,plain,
~ spl30_2,
inference(sat_conversion,[],[f607]) ).
cnf(s11,plain,
( spl30_1
| spl30_3 ),
inference(sat_conversion,[],[f1036]) ).
cnf(s12,plain,
~ spl30_3,
inference(rat,[],[s2,s3]) ).
cnf(s13,plain,
spl30_1,
inference(rat,[],[s11,s12]) ).
cnf(s14,plain,
$false,
inference(rat,[],[s1,s3,s13]) ).
thf(f1037,plain,
$false,
inference(avatar_sat_refutation,[],[s14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU515^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.19 % Computer : n016.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:52:34 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.23 Running first-order model finding
% 0.09/0.23 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.21/0.29 % (379910)Will run a generic schedule for satisfiability detection.
% 0.21/0.29 % (379921)dis+10_1_sil=32000:sp=arity:random_seed=972771401:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.21/0.29 % (379919)% WARNING: option uhcvi not known.
% 0.21/0.29 % (379918)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3404020876_2999 on theBenchmark for (2999ds/0Mi)
% 0.21/0.29 % (379920)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1231843768:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.21/0.29 % (379922)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=812647311:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.21/0.29 % (379919)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=71704691:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.21/0.29 % (379923)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2195535225:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.21/0.29 % (379924)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2523448162:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.21/0.29 % (379922)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.21/0.29 % (379919)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.21/0.29 % Exception at run slice level
% 0.21/0.29 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.21/0.29 % (379919)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.21/0.29 % (379921) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-379910-379921"...
% 0.21/0.29 % (379921)...printing done.
% 0.21/0.29 % (379921)Refutation found. Thanks to Tanya!
% 0.21/0.29 % SZS status Theorem for theBenchmark
% 0.21/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.29 % (379921)------------------------------
% 0.21/0.29 % (379921)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.29 % (379921)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.29 % (379921)CaDiCaL version: 2.1.3
% 0.21/0.29 % (379921)Termination reason: Refutation
% 0.21/0.29 % (379921)Time elapsed: 0.024 s
% 0.21/0.29 % (379921)Peak memory usage: 13 MB
% 0.21/0.29 % (379921)Instructions burned: 87 (million)
% 0.21/0.29 % (379910)Success in time 0.053 s
% 0.21/0.29 % Vampire exiting
%------------------------------------------------------------------------------