%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU502^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 : 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:32:12 AM UTC 2026
% Result : Theorem 0.10s 0.25s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 3
% Syntax : Number of formulae : 29 ( 16 unt; 0 typ; 1 def)
% Number of atoms : 478 ( 127 equ; 0 cnn)
% Maximal formula atoms : 21 ( 16 avg)
% Number of connectives : 239 ( 19 ~; 3 |; 54 &; 47 @)
% ( 1 <=>; 112 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 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 : 67 ( 63 usr; 24 con; 0-4 aty)
% ( 3 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 19 ( 0 sgn 13 !; 2 ?; 19 :)
% 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,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_30,type,
vAND: $o > $o > $o ).
thf(func_def_31,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_32,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_33,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_34,type,
vIMP: $o > $o > $o ).
thf(func_def_35,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_36,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_37,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_38,type,
vIFF: $o > $o > $o ).
thf(func_def_39,type,
vNOT: $o > $o ).
thf(func_def_40,type,
vOR: $o > $o > $o ).
thf(func_def_41,type,
db4:
!>[X0: $tType] : X0 ).
thf(func_def_42,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_46,type,
sK1: ( $i > $o ) > $i ).
thf(func_def_47,type,
sK2: ( $i > $o ) > $i > $i ).
thf(func_def_48,type,
sK3: ( $i > $o ) > $i > $i ).
thf(func_def_49,type,
sK4: $i > $i ).
thf(func_def_50,type,
sK5: $i > $i > $i > $i ).
thf(func_def_51,type,
sK6: $i > $i > $i ).
thf(func_def_52,type,
sK7: $i > $i > $i ).
thf(func_def_53,type,
sK8: $i > $i > $i ).
thf(func_def_54,type,
sK9: $i > $i ).
thf(func_def_55,type,
sK10: $i > ( $i > $i > $o ) > $i ).
thf(func_def_56,type,
sK11: $i > ( $i > $i > $o ) > $i ).
thf(func_def_57,type,
sK12: $i > $i > ( $i > $i > $o ) > $i ).
thf(func_def_58,type,
sK13: $i > $i > ( $i > $i > $o ) > $i ).
thf(func_def_59,type,
sK14: $i > $i > ( $i > $i > $o ) > $i ).
thf(func_def_60,type,
sK15: $i > $i > ( $i > $i > $o ) > $i ).
thf(func_def_61,type,
sK16: $i > $i ).
thf(func_def_62,type,
sK17: $i > $i > $i ).
thf(func_def_63,type,
sK18: $i > $i > $i ).
thf(func_def_64,type,
sK19: $i > $i > $i ).
thf(f3,axiom,
( emptysetAx
= ( ! [X0: $i] :
~ ( in @ X0 @ emptyset ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',emptysetAx) ).
thf(f21,conjecture,
( setextAx
=> ( emptysetAx
=> ( setadjoinAx
=> ( powersetAx
=> ( setunionAx
=> ( omega0Ax
=> ( omegaSAx
=> ( omegaIndAx
=> ( replAx
=> ( foundationAx
=> ( wellorderingAx
=> ( descrp
=> ( dsetconstrI
=> ( dsetconstrEL
=> ( dsetconstrER
=> ( exuE1
=> ( prop2setE
=> ( emptysetE
=> ! [X0: $i] :
( ( in @ X0 @ emptyset )
=> $false ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',emptysetimpfalse) ).
thf(f22,negated_conjecture,
~ ( setextAx
=> ( emptysetAx
=> ( setadjoinAx
=> ( powersetAx
=> ( setunionAx
=> ( omega0Ax
=> ( omegaSAx
=> ( omegaIndAx
=> ( replAx
=> ( foundationAx
=> ( wellorderingAx
=> ( descrp
=> ( dsetconstrI
=> ( dsetconstrEL
=> ( dsetconstrER
=> ( exuE1
=> ( prop2setE
=> ( emptysetE
=> ! [X0: $i] :
( ( in @ X0 @ emptyset )
=> $false ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f21]) ).
thf(f27,plain,
( emptysetAx
= ( ! [X0: $i] :
~ ( in @ X0 @ emptyset ) ) ),
inference(rectify,[],[f3]) ).
thf(f28,plain,
( emptysetAx
= ( !! @ $i
@ ^ [Y0: $i] :
~ ( in @ Y0 @ emptyset ) ) ),
inference(fool_elimination,[],[f27]) ).
thf(f61,plain,
~ ( setextAx
=> ( emptysetAx
=> ( setadjoinAx
=> ( powersetAx
=> ( setunionAx
=> ( omega0Ax
=> ( omegaSAx
=> ( omegaIndAx
=> ( replAx
=> ( foundationAx
=> ( wellorderingAx
=> ( descrp
=> ( dsetconstrI
=> ( dsetconstrEL
=> ( dsetconstrER
=> ( exuE1
=> ( prop2setE
=> ( emptysetE
=> ! [X0: $i] :
( ( in @ X0 @ emptyset )
=> $false ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f22]) ).
thf(f62,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 )
=> ! [X0: $i] :
( ( ( in @ X0 @ emptyset )
= $true )
=> $false ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f61]) ).
thf(f63,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 )
=> ! [X0: $i] :
( ( in @ X0 @ emptyset )
!= $true ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(true_and_false_elimination,[],[f62]) ).
thf(f64,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 )
=> ! [X0: $i] :
( ( in @ X0 @ emptyset )
!= $true ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(flattening,[],[f63]) ).
thf(f65,plain,
( ? [X0: $i] :
( ( in @ X0 @ emptyset )
= $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,[],[f64]) ).
thf(f66,plain,
( ? [X0: $i] :
( ( in @ X0 @ emptyset )
= $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,[],[f65]) ).
thf(f67,plain,
( ( $true
= ( in @ sK0 @ emptyset ) )
& ( 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]),skolemize(X0,sK0)],[f66]) ).
thf(f70,plain,
( emptysetAx
= ( !! @ $i
@ ^ [Y0: $i] :
~ ( in @ Y0 @ emptyset ) ) ),
inference(cnf_transformation,[],[f28]) ).
thf(f89,plain,
emptysetAx = $true,
inference(cnf_transformation,[],[f67]) ).
thf(f106,plain,
( $true
= ( in @ sK0 @ emptyset ) ),
inference(cnf_transformation,[],[f67]) ).
thf(f110,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
~ ( in @ Y0 @ emptyset ) )
= $true ),
inference(definition_unfolding,[],[f70,f89]) ).
thf(f405,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
~ ( in @ Y0 @ emptyset )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f110]) ).
thf(f406,plain,
! [X1: $i] :
( $true
= ( ~ ( in @ X1 @ emptyset ) ) ),
inference(beta-eta_normalization,[],[f405]) ).
thf(f407,plain,
! [X1: $i] :
( $false
= ( in @ X1 @ emptyset ) ),
inference(not_proxy_clausification,[],[f406]) ).
thf(f423,definition,
( spl20_2
<=> ! [X1: $i] :
( $false
= ( in @ X1 @ emptyset ) ) ),
introduced(definition,[new_symbols(definition,[spl20_2])],[avatar_definition]) ).
thf(f424,plain,
( ! [X1: $i] :
( $false
= ( in @ X1 @ emptyset ) )
| ~ spl20_2 ),
inference(avatar_component_clause,[],[f423]) ).
thf(f426,plain,
spl20_2,
inference(avatar_split_clause,[],[f407,f423]) ).
thf(f427,plain,
( ( $true = $false )
| ~ spl20_2 ),
inference(constrained_superposition,[],[f424,f106]) ).
thf(f431,plain,
( $false
| ~ spl20_2 ),
inference(trivial_inequality_removal,[],[f427]) ).
thf(f432,plain,
~ spl20_2,
inference(avatar_contradiction_clause,[],[f431]) ).
cnf(s2,plain,
spl20_2,
inference(sat_conversion,[],[f426]) ).
cnf(s4,plain,
~ spl20_2,
inference(sat_conversion,[],[f432]) ).
cnf(s5,plain,
$false,
inference(rat,[],[s2,s4]) ).
thf(f433,plain,
$false,
inference(avatar_sat_refutation,[],[s5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU502^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.18 % Computer : n014.cluster.edu
% 0.10/0.18 % Model : x86_64 x86_64
% 0.10/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.18 % Memory : 8046.5625MB
% 0.10/0.18 % OS : Linux 6.8.0-71-generic
% 0.10/0.18 % CPULimit : 300
% 0.10/0.18 % WCLimit : 300
% 0.10/0.18 % DateTime : Tue Sep 29 13:46:31 UTC 2026
% 0.10/0.18 % CPUTime :
% 0.10/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.22 Running first-order model finding
% 0.10/0.22 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.10/0.25 % (2682551)Will run a generic schedule for satisfiability detection.
% 0.10/0.25 % (2682561)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=500381686:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.10/0.25 % (2682557)% WARNING: option uhcvi not known.
% 0.10/0.25 % (2682556)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1698989660_2999 on theBenchmark for (2999ds/0Mi)
% 0.10/0.25 % (2682557)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2130169608:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.10/0.25 % (2682561) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2682551-2682561"...
% 0.10/0.25 % (2682558)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3922565014:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.25 % (2682559)dis+10_1_sil=32000:sp=arity:random_seed=3786420538:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.25 % (2682562)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3350284643:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.10/0.25 % (2682560)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2797681436:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.25 % (2682561)...printing done.
% 0.10/0.25 % (2682561)Refutation found. Thanks to Tanya!
% 0.10/0.25 % SZS status Theorem for theBenchmark
% 0.10/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.25 % (2682561)------------------------------
% 0.10/0.25 % (2682561)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.25 % (2682561)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.25 % (2682561)CaDiCaL version: 2.1.3
% 0.10/0.25 % (2682561)Termination reason: Refutation
% 0.10/0.25 % (2682561)Time elapsed: 0.007 s
% 0.10/0.25 % (2682561)Peak memory usage: 13 MB
% 0.10/0.25 % (2682561)Instructions burned: 26 (million)
% 0.10/0.25 % (2682551)Success in time 0.025 s
% 0.10/0.25 % Vampire exiting
%------------------------------------------------------------------------------