%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU510^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n001.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:51 AM UTC 2026
% Result : Theorem 0.83s 0.39s
% Output : Refutation 0.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 5
% Syntax : Number of formulae : 57 ( 37 unt; 0 typ; 1 def)
% Number of atoms : 761 ( 203 equ; 0 cnn)
% Maximal formula atoms : 29 ( 13 avg)
% Number of connectives : 559 ( 24 ~; 17 |; 112 &; 245 @)
% ( 1 <=>; 142 =>; 0 <=; 0 <~>)
% Maximal formula depth : 37 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 24 ( 24 >; 0 *; 0 +; 0 <<)
% Number of symbols : 86 ( 82 usr; 33 con; 0-4 aty)
% ( 18 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 98 ( 0 sgn 47 !; 9 ?; 98 :)
% 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,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_39,type,
vAND: $o > $o > $o ).
thf(func_def_40,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_41,type,
vIMP: $o > $o > $o ).
thf(func_def_42,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_43,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_44,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_45,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_46,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_47,type,
vNOT: $o > $o ).
thf(func_def_48,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_49,type,
vIFF: $o > $o > $o ).
thf(func_def_50,type,
db4:
!>[X0: $tType] : X0 ).
thf(func_def_51,type,
vOR: $o > $o > $o ).
thf(func_def_54,type,
sK0: $i > $o ).
thf(func_def_57,type,
sK3: $i > $i ).
thf(func_def_58,type,
sK4: $i > $i ).
thf(func_def_59,type,
sK5: $i > $i > $i ).
thf(func_def_60,type,
sK6: $i > $i > $i ).
thf(func_def_61,type,
sK7: ( $i > $o ) > $i ).
thf(func_def_62,type,
sK8: ( $i > $o ) > $i > $i ).
thf(func_def_63,type,
sK9: $i > $i ).
thf(func_def_64,type,
sK10: $i > $i > $i ).
thf(func_def_65,type,
sK11: $i > $i ).
thf(func_def_66,type,
sK12: ( $i > $o ) > $i > $i ).
thf(func_def_67,type,
sK13: ( $i > $o ) > $i ).
thf(func_def_68,type,
sK14: ( $i > $o ) > $i > $i ).
thf(func_def_69,type,
sK15: ( $i > $o ) > $i > $i ).
thf(func_def_70,type,
sK16: $i > $i > $i ).
thf(func_def_71,type,
sK17: $i > $i > $i ).
thf(func_def_72,type,
sK18: ( $i > $i > $o ) > $i > $i ).
thf(func_def_73,type,
sK19: ( $i > $i > $o ) > $i > $i ).
thf(func_def_74,type,
sK20: $i > ( $i > $i > $o ) > $i > $i ).
thf(func_def_75,type,
sK21: $i > ( $i > $i > $o ) > $i > $i ).
thf(func_def_76,type,
sK22: $i > ( $i > $i > $o ) > $i > $i ).
thf(func_def_77,type,
sK23: $i > ( $i > $i > $o ) > $i > $i ).
thf(func_def_78,type,
sK24: $i > $i ).
thf(func_def_79,type,
sK25: $i > $i ).
thf(func_def_80,type,
sK26: $i > $i > $i > $i ).
thf(func_def_81,type,
sK27: $i > $i > $i ).
thf(func_def_82,type,
sK28: $i > $i > $i ).
thf(func_def_83,type,
sK29: $i > $i > $i ).
thf(f14,axiom,
( dsetconstrI
= ( ! [X2: $i,X0: $i,X1: $i > $o] :
( ( in @ X2 @ X0 )
=> ( ( X1 @ X2 )
=> ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dsetconstrI) ).
thf(f21,axiom,
( emptysetimpfalse
= ( ! [X0: $i] :
( ( in @ X0 @ emptyset )
=> $false ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',emptysetimpfalse) ).
thf(f28,axiom,
( nonempty
= ( ^ [X0: $i] : ( X0 != emptyset ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nonempty) ).
thf(f30,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
=> ! [X1: $i > $o,X0: $i,X2: $i] :
( ( in @ X2 @ X0 )
=> ( ( X1 @ X2 )
=> ( nonempty
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nonemptyI) ).
thf(f31,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
=> ! [X1: $i > $o,X0: $i,X2: $i] :
( ( in @ X2 @ X0 )
=> ( ( X1 @ X2 )
=> ( nonempty
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f30]) ).
thf(f38,plain,
( nonempty
= ( ^ [Y0: $i] : ( emptyset != Y0 ) ) ),
inference(fool_elimination,[],[f28]) ).
thf(f51,plain,
( dsetconstrI
= ( ! [X0: $i,X1: $i,X2: $i > $o] :
( ( in @ X0 @ X1 )
=> ( ( X2 @ X0 )
=> ( in @ X0
@ ( dsetconstr @ X1
@ ^ [X3: $i] : ( X2 @ X3 ) ) ) ) ) ) ),
inference(rectify,[],[f14]) ).
thf(f52,plain,
( dsetconstrI
= ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( ( Y0 @ Y2 )
=> ( in @ Y2
@ ( dsetconstr @ Y1
@ ^ [Y3: $i] : ( Y0 @ Y3 ) ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f51]) ).
thf(f69,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
=> ! [X0: $i > $o,X1: $i,X2: $i] :
( ( in @ X2 @ X1 )
=> ( ( X0 @ X2 )
=> ( nonempty
@ ( dsetconstr @ X1
@ ^ [X3: $i] : ( X0 @ X3 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f31]) ).
thf(f70,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 )
=> ! [X2: $i,X0: $i > $o,X1: $i] :
( ( ( in @ X2 @ X1 )
= $true )
=> ( ( ( X0 @ X2 )
= $true )
=> ( $true
= ( nonempty
@ ( dsetconstr @ X1
@ ^ [Y0: $i] : ( X0 @ Y0 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f69]) ).
thf(f87,plain,
( emptysetimpfalse
= ( ! [X0: $i] :
( ( in @ X0 @ emptyset )
=> $false ) ) ),
inference(rectify,[],[f21]) ).
thf(f88,plain,
( emptysetimpfalse
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ emptyset )
=> $false ) ) ),
inference(fool_elimination,[],[f87]) ).
thf(f89,plain,
( ? [X2: $i,X0: $i > $o,X1: $i] :
( ( $true
!= ( nonempty
@ ( dsetconstr @ X1
@ ^ [Y0: $i] : ( X0 @ Y0 ) ) ) )
& ( ( X0 @ X2 )
= $true )
& ( ( in @ X2 @ X1 )
= $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,[],[f70]) ).
thf(f90,plain,
( ( descrp = $true )
& ( setadjoinAx = $true )
& ( noeltsimpempty = $true )
& ? [X0: $i > $o,X2: $i,X1: $i] :
( ( $true
!= ( nonempty
@ ( dsetconstr @ X1
@ ^ [Y0: $i] : ( X0 @ Y0 ) ) ) )
& ( ( in @ X2 @ X1 )
= $true )
& ( ( X0 @ X2 )
= $true ) )
& ( setbeta = $true )
& ( dsetconstrER = $true )
& ( emptysetAx = $true )
& ( powersetAx = $true )
& ( dsetconstrI = $true )
& ( omegaSAx = $true )
& ( emptysetE = $true )
& ( setext = $true )
& ( prop2setE = $true )
& ( emptyI = $true )
& ( omega0Ax = $true )
& ( omegaIndAx = $true )
& ( setextAx = $true )
& ( exuE3e = $true )
& ( dsetconstrEL = $true )
& ( notinemptyset = $true )
& ( emptysetimpfalse = $true )
& ( exuE1 = $true )
& ( wellorderingAx = $true )
& ( foundationAx = $true )
& ( replAx = $true )
& ( nonemptyE1 = $true )
& ( setunionAx = $true ) ),
inference(flattening,[],[f89]) ).
thf(f91,plain,
( ( descrp = $true )
& ( setadjoinAx = $true )
& ( noeltsimpempty = $true )
& ? [X0: $i > $o,X1: $i,X2: $i] :
( ( $true
!= ( nonempty
@ ( dsetconstr @ X2
@ ^ [Y0: $i] : ( X0 @ Y0 ) ) ) )
& ( ( in @ X1 @ X2 )
= $true )
& ( ( X0 @ X1 )
= $true ) )
& ( setbeta = $true )
& ( dsetconstrER = $true )
& ( emptysetAx = $true )
& ( powersetAx = $true )
& ( dsetconstrI = $true )
& ( omegaSAx = $true )
& ( emptysetE = $true )
& ( setext = $true )
& ( prop2setE = $true )
& ( emptyI = $true )
& ( omega0Ax = $true )
& ( omegaIndAx = $true )
& ( setextAx = $true )
& ( exuE3e = $true )
& ( dsetconstrEL = $true )
& ( notinemptyset = $true )
& ( emptysetimpfalse = $true )
& ( exuE1 = $true )
& ( wellorderingAx = $true )
& ( foundationAx = $true )
& ( replAx = $true )
& ( nonemptyE1 = $true )
& ( setunionAx = $true ) ),
inference(rectify,[],[f90]) ).
thf(f92,plain,
( ( descrp = $true )
& ( setadjoinAx = $true )
& ( noeltsimpempty = $true )
& ( $true
!= ( nonempty
@ ( dsetconstr @ sK2
@ ^ [Y0: $i] : ( sK0 @ Y0 ) ) ) )
& ( $true
= ( in @ sK1 @ sK2 ) )
& ( $true
= ( sK0 @ sK1 ) )
& ( setbeta = $true )
& ( dsetconstrER = $true )
& ( emptysetAx = $true )
& ( powersetAx = $true )
& ( dsetconstrI = $true )
& ( omegaSAx = $true )
& ( emptysetE = $true )
& ( setext = $true )
& ( prop2setE = $true )
& ( emptyI = $true )
& ( omega0Ax = $true )
& ( omegaIndAx = $true )
& ( setextAx = $true )
& ( exuE3e = $true )
& ( dsetconstrEL = $true )
& ( notinemptyset = $true )
& ( emptysetimpfalse = $true )
& ( exuE1 = $true )
& ( wellorderingAx = $true )
& ( foundationAx = $true )
& ( replAx = $true )
& ( nonemptyE1 = $true )
& ( setunionAx = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f91]) ).
thf(f96,plain,
( emptysetimpfalse
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ emptyset )
=> $false ) ) ),
inference(cnf_transformation,[],[f88]) ).
thf(f104,plain,
emptysetimpfalse = $true,
inference(cnf_transformation,[],[f92]) ).
thf(f116,plain,
dsetconstrI = $true,
inference(cnf_transformation,[],[f92]) ).
thf(f121,plain,
( $true
= ( sK0 @ sK1 ) ),
inference(cnf_transformation,[],[f92]) ).
thf(f122,plain,
( $true
= ( in @ sK1 @ sK2 ) ),
inference(cnf_transformation,[],[f92]) ).
thf(f123,plain,
( $true
!= ( nonempty
@ ( dsetconstr @ sK2
@ ^ [Y0: $i] : ( sK0 @ Y0 ) ) ) ),
inference(cnf_transformation,[],[f92]) ).
thf(f137,plain,
( dsetconstrI
= ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( ( Y0 @ Y2 )
=> ( in @ Y2
@ ( dsetconstr @ Y1
@ ^ [Y3: $i] : ( Y0 @ Y3 ) ) ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f52]) ).
thf(f140,plain,
( nonempty
= ( ^ [Y0: $i] : ( emptyset != Y0 ) ) ),
inference(cnf_transformation,[],[f38]) ).
thf(f156,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ emptyset )
=> $false ) ) ),
inference(definition_unfolding,[],[f96,f104]) ).
thf(f158,plain,
( $true
!= ( ^ [Y0: $i] : ( emptyset != Y0 )
@ ( dsetconstr @ sK2
@ ^ [Y0: $i] : ( sK0 @ Y0 ) ) ) ),
inference(definition_unfolding,[],[f123,f140]) ).
thf(f168,plain,
( ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( ( Y0 @ Y2 )
=> ( in @ Y2
@ ( dsetconstr @ Y1
@ ^ [Y3: $i] : ( Y0 @ Y3 ) ) ) ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f137,f116]) ).
thf(f281,plain,
! [X1: $i > $o] :
( ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( ( Y0 @ Y2 )
=> ( in @ Y2
@ ( dsetconstr @ Y1
@ ^ [Y3: $i] : ( Y0 @ Y3 ) ) ) ) ) ) )
@ X1 )
= $true ),
inference(pi_proxy_clausification,[],[f168]) ).
thf(f282,plain,
! [X1: $i > $o] :
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
=> ( ( X1 @ Y1 )
=> ( in @ Y1 @ ( dsetconstr @ Y0 @ X1 ) ) ) ) ) )
= $true ),
inference(beta-eta_normalization,[],[f281]) ).
thf(f283,plain,
! [X2: $i,X1: $i > $o] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
=> ( ( X1 @ Y1 )
=> ( in @ Y1 @ ( dsetconstr @ Y0 @ X1 ) ) ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f282]) ).
thf(f284,plain,
! [X2: $i,X1: $i > $o] :
( ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
=> ( ( X1 @ Y0 )
=> ( in @ Y0 @ ( dsetconstr @ X2 @ X1 ) ) ) ) )
= $true ),
inference(beta-eta_normalization,[],[f283]) ).
thf(f285,plain,
! [X2: $i,X3: $i,X1: $i > $o] :
( $true
= ( ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
=> ( ( X1 @ Y0 )
=> ( in @ Y0 @ ( dsetconstr @ X2 @ X1 ) ) ) )
@ X3 ) ),
inference(pi_proxy_clausification,[],[f284]) ).
thf(f286,plain,
! [X2: $i,X3: $i,X1: $i > $o] :
( $true
= ( ( in @ X3 @ X2 )
=> ( ( X1 @ X3 )
=> ( in @ X3 @ ( dsetconstr @ X2 @ X1 ) ) ) ) ),
inference(beta-eta_normalization,[],[f285]) ).
thf(f287,plain,
! [X2: $i,X3: $i,X1: $i > $o] :
( ( $true
= ( ( X1 @ X3 )
=> ( in @ X3 @ ( dsetconstr @ X2 @ X1 ) ) ) )
| ( ( in @ X3 @ X2 )
= $false ) ),
inference(imp_proxy_clausification,[],[f286]) ).
thf(f288,plain,
! [X2: $i,X3: $i,X1: $i > $o] :
( ( ( in @ X3 @ ( dsetconstr @ X2 @ X1 ) )
= $true )
| ( ( in @ X3 @ X2 )
= $false )
| ( ( X1 @ X3 )
= $false ) ),
inference(imp_proxy_clausification,[],[f287]) ).
thf(f425,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( in @ Y0 @ emptyset )
=> $false )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f156]) ).
thf(f426,plain,
! [X1: $i] :
( $true
= ( ( in @ X1 @ emptyset )
=> $false ) ),
inference(beta-eta_normalization,[],[f425]) ).
thf(f427,plain,
! [X1: $i] :
( ( ( in @ X1 @ emptyset )
= $false )
| ( $true = $false ) ),
inference(imp_proxy_clausification,[],[f426]) ).
thf(f428,plain,
! [X1: $i] :
( ( in @ X1 @ emptyset )
= $false ),
inference(trivial_inequality_removal,[],[f427]) ).
thf(f429,plain,
( $true
!= ( emptyset
!= ( dsetconstr @ sK2 @ sK0 ) ) ),
inference(beta-eta_normalization,[],[f158]) ).
thf(f430,plain,
( ( emptyset
= ( dsetconstr @ sK2 @ sK0 ) )
= $true ),
inference(not_proxy_clausification,[],[f429]) ).
thf(f431,plain,
( emptyset
= ( dsetconstr @ sK2 @ sK0 ) ),
inference(equality_proxy_clausification,[],[f430]) ).
thf(f544,definition,
( spl30_2
<=> ! [X1: $i] :
( ( in @ X1 @ emptyset )
= $false ) ),
introduced(definition,[new_symbols(definition,[spl30_2])],[avatar_definition]) ).
thf(f545,plain,
( ! [X1: $i] :
( ( in @ X1 @ emptyset )
= $false )
| ~ spl30_2 ),
inference(avatar_component_clause,[],[f544]) ).
thf(f547,plain,
spl30_2,
inference(avatar_split_clause,[],[f428,f544]) ).
thf(f615,plain,
! [X0: $i] :
( ( ( sK0 @ X0 )
= $false )
| ( ( in @ X0 @ emptyset )
= $true )
| ( ( in @ X0 @ sK2 )
= $false ) ),
inference(superposition,[],[f288,f431]) ).
thf(f641,plain,
( ! [X0: $i] :
( ( $true = $false )
| ( ( in @ X0 @ sK2 )
= $false )
| ( ( sK0 @ X0 )
= $false ) )
| ~ spl30_2 ),
inference(forward_demodulation,[],[f615,f545]) ).
thf(f642,plain,
( ! [X0: $i] :
( ( ( in @ X0 @ sK2 )
= $false )
| ( ( sK0 @ X0 )
= $false ) )
| ~ spl30_2 ),
inference(trivial_inequality_removal,[],[f641]) ).
thf(f660,plain,
( ( $true = $false )
| ( ( sK0 @ sK1 )
= $false )
| ~ spl30_2 ),
inference(superposition,[],[f642,f122]) ).
thf(f672,plain,
( ( ( sK0 @ sK1 )
= $false )
| ~ spl30_2 ),
inference(trivial_inequality_removal,[],[f660]) ).
thf(f719,plain,
( ( $true = $false )
| ~ spl30_2 ),
inference(superposition,[],[f672,f121]) ).
thf(f724,plain,
( $false
| ~ spl30_2 ),
inference(trivial_inequality_removal,[],[f719]) ).
thf(f725,plain,
~ spl30_2,
inference(avatar_contradiction_clause,[],[f724]) ).
cnf(s2,plain,
spl30_2,
inference(sat_conversion,[],[f547]) ).
cnf(s19,plain,
~ spl30_2,
inference(sat_conversion,[],[f725]) ).
cnf(s20,plain,
$false,
inference(rat,[],[s2,s19]) ).
thf(f727,plain,
$false,
inference(avatar_sat_refutation,[],[s20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU510^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.06/0.17 % Computer : n001.cluster.edu
% 0.06/0.17 % Model : x86_64 x86_64
% 0.06/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.17 % Memory : 8046.5625MB
% 0.06/0.17 % OS : Linux 6.8.0-71-generic
% 0.06/0.17 % CPULimit : 300
% 0.06/0.17 % WCLimit : 300
% 0.06/0.17 % DateTime : Tue Sep 29 13:53:06 UTC 2026
% 0.06/0.17 % CPUTime :
% 0.06/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.06/0.20 Running higher-order theorem proving
% 0.06/0.22 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.36 % (1269794)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.19/0.36 % (1269802)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=3251229093: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.19/0.36 % (1269805)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.19/0.36 % (1269805)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.19/0.36 % (1269801)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=3326776528:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.19/0.36 % (1269799)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=2693279965:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.19/0.36 % (1269800)lrs+10_16_si=on:nwc=1.5:random_seed=1224225821:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.19/0.36 % (1269803)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=3651960598:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.19/0.36 % (1269804)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=1214571079:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.19/0.36 % (1269805)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=1215469784:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.19/0.36 % (1269801)Instruction limit reached!
% 0.19/0.36 % (1269801)------------------------------
% 0.19/0.36 % (1269801)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.36 % (1269801)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.36 % (1269801)CaDiCaL version: 2.1.3
% 0.19/0.36 % (1269801)Termination reason: Instruction limit
% 0.19/0.36 % (1269801)Termination phase: Property scanning
% 0.19/0.36 % (1269801)Time elapsed: 0.002 s
% 0.19/0.36 % (1269801)Peak memory usage: 10 MB
% 0.19/0.36 % (1269801)Instructions burned: 4 (million)
% 0.19/0.36 % (1269800)Instruction limit reached!
% 0.19/0.36 % (1269800)------------------------------
% 0.19/0.36 % (1269800)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.36 % (1269800)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.36 % (1269800)CaDiCaL version: 2.1.3
% 0.19/0.36 % (1269800)Termination reason: Instruction limit
% 0.19/0.36 % (1269800)Termination phase: Saturation
% 0.19/0.36 % (1269800)Time elapsed: 0.008 s
% 0.19/0.36 % (1269800)Peak memory usage: 11 MB
% 0.19/0.36 % (1269800)Instructions burned: 18 (million)
% 0.19/0.36 % (1269803)Instruction limit reached!
% 0.19/0.36 % (1269803)------------------------------
% 0.19/0.36 % (1269803)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.36 % (1269803)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.36 % (1269803)CaDiCaL version: 2.1.3
% 0.19/0.36 % (1269803)Termination reason: Instruction limit
% 0.19/0.36 % (1269803)Termination phase: Saturation
% 0.19/0.36 % (1269803)Time elapsed: 0.011 s
% 0.19/0.36 % (1269803)Peak memory usage: 11 MB
% 0.19/0.36 % (1269803)Instructions burned: 25 (million)
% 0.19/0.36 % (1269813)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=2730332648:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.19/0.36 % (1269813)Instruction limit reached!
% 0.19/0.36 % (1269813)------------------------------
% 0.19/0.36 % (1269813)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.36 % (1269813)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.36 % (1269813)CaDiCaL version: 2.1.3
% 0.19/0.36 % (1269813)Termination reason: Instruction limit
% 0.19/0.36 % (1269813)Termination phase: Property scanning
% 0.19/0.36 % (1269813)Time elapsed: 0.002 s
% 0.19/0.36 % (1269813)Peak memory usage: 10 MB
% 0.19/0.36 % (1269813)Instructions burned: 4 (million)
% 0.19/0.36 % (1269815)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(5) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.83/0.38 % (1269814)lrs+1010_2:3_cha=on:si=on:uwa=off:nwc=1:random_seed=2139836286:i=5:fgj=on:av=off:rtra=on:fe=axiom:ntd=on_2999 on theBenchmark for (2999ds/5Mi)
% 0.83/0.38 % (1269814)Instruction limit reached!
% 0.83/0.38 % (1269814)------------------------------
% 0.83/0.38 % (1269814)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.83/0.38 % (1269814)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.83/0.38 % (1269814)CaDiCaL version: 2.1.3
% 0.83/0.38 % (1269814)Termination reason: Instruction limit
% 0.83/0.38 % (1269814)Termination phase: shuffling
% 0.83/0.38 % (1269814)Time elapsed: 0.003 s
% 0.83/0.38 % (1269814)Peak memory usage: 10 MB
% 0.83/0.38 % (1269814)Instructions burned: 7 (million)
% 0.83/0.38 % (1269815)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=467392450:uwa_fpi=on:i=7:fgj=on:hud=10:fsr=off:rtra=on:rawr=on:fsdmm=5_2999 on theBenchmark for (2999ds/7Mi)
% 0.83/0.38 % (1269815)Instruction limit reached!
% 0.83/0.38 % (1269815)------------------------------
% 0.83/0.38 % (1269815)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.83/0.38 % (1269815)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.83/0.38 % (1269815)CaDiCaL version: 2.1.3
% 0.83/0.38 % (1269815)Termination reason: Instruction limit
% 0.83/0.38 % (1269815)Termination phase: Property scanning
% 0.83/0.38 % (1269815)Time elapsed: 0.003 s
% 0.83/0.38 % (1269815)Peak memory usage: 9 MB
% 0.83/0.38 % (1269815)Instructions burned: 7 (million)
% 0.83/0.38 % (1269804)Instruction limit reached!
% 0.83/0.38 % (1269804)------------------------------
% 0.83/0.38 % (1269804)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.83/0.38 % (1269804)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.83/0.38 % (1269804)CaDiCaL version: 2.1.3
% 0.83/0.38 % (1269804)Termination reason: Instruction limit
% 0.83/0.38 % (1269804)Termination phase: Saturation
% 0.83/0.38 % (1269804)Time elapsed: 0.039 s
% 0.83/0.38 % (1269804)Peak memory usage: 13 MB
% 0.83/0.38 % (1269804)Instructions burned: 75 (million)
% 0.83/0.38 % (1269817)lrs+10_1_sil=128000:si=on:urr=on:slsqc=1:slsq=on:random_seed=669425949:i=12:s2at=2:kws=inv_frequency:bd=all:rtra=on_2999 on theBenchmark for (2999ds/12Mi)
% 0.83/0.38 % (1269799)Instruction limit reached!
% 0.83/0.38 % (1269799)------------------------------
% 0.83/0.38 % (1269799)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.83/0.38 % (1269799)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.83/0.38 % (1269799)CaDiCaL version: 2.1.3
% 0.83/0.38 % (1269799)Termination reason: Instruction limit
% 0.83/0.38 % (1269799)Termination phase: Saturation
% 0.83/0.38 % (1269799)Time elapsed: 0.047 s
% 0.83/0.38 % (1269799)Peak memory usage: 13 MB
% 0.83/0.38 % (1269799)Instructions burned: 87 (million)
% 0.83/0.38 % (1269820)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.83/0.38 % (1269820)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(1) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.83/0.38 % (1269817)Instruction limit reached!
% 0.83/0.38 % (1269817)------------------------------
% 0.83/0.38 % (1269817)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.83/0.38 % (1269817)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.83/0.38 % (1269817)CaDiCaL version: 2.1.3
% 0.83/0.38 % (1269817)Termination reason: Instruction limit
% 0.83/0.38 % (1269817)Termination phase: Property scanning
% 0.83/0.38 % (1269817)Time elapsed: 0.006 s
% 0.83/0.38 % (1269817)Peak memory usage: 11 MB
% 0.83/0.38 % (1269817)Instructions burned: 14 (million)
% 0.83/0.38 % (1269820)ott+1010_64_tgt=ground:cnfonf=lazy_simp:si=on:lma=off:spb=goal:lcm=predicate:random_seed=892096130: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.83/0.38 % (1269821)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=2855462000:i=86:piset=equals:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/86Mi)
% 0.83/0.38 % (1269822)lrs+10_1_si=on:cs=on:random_seed=14738576:i=8:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/8Mi)
% 0.83/0.38 % (1269824)WARNING Broken Constraint: if positive_literal_split_queue_ratios(1,32) has been set then positive_literal_split_queue(off) is equal to on
% 0.83/0.38 % (1269820)Instruction limit reached!
% 0.83/0.38 % (1269820)------------------------------
% 0.83/0.38 % (1269820)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.83/0.38 % (1269820)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.83/0.38 % (1269820)CaDiCaL version: 2.1.3
% 0.83/0.38 % (1269820)Termination reason: Instruction limit
% 0.83/0.38 % (1269820)Termination phase: Saturation
% 0.83/0.38 % (1269820)Time elapsed: 0.012 s
% 0.83/0.38 % (1269820)Peak memory usage: 11 MB
% 0.83/0.38 % (1269820)Instructions burned: 28 (million)
% 0.83/0.38 % (1269822)Instruction limit reached!
% 0.83/0.38 % (1269822)------------------------------
% 0.83/0.38 % (1269822)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.83/0.38 % (1269822)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.83/0.38 % (1269822)CaDiCaL version: 2.1.3
% 0.83/0.38 % (1269822)Termination reason: Instruction limit
% 0.83/0.38 % (1269822)Termination phase: Function definition elimination
% 0.83/0.39 % (1269822)Time elapsed: 0.005 s
% 0.83/0.39 % (1269822)Peak memory usage: 10 MB
% 0.83/0.39 % (1269822)Instructions burned: 10 (million)
% 0.83/0.39 % (1269824)ott+1002_20_sil=128000:cnfonf=lazy_not_gen_be_off:si=on:sp=unary_frequency:plsqr=1,32:bce=on:uwa=interpreted_only:foolp=on:random_seed=6668886:i=2:add=on:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.83/0.39 % (1269825)lrs+1002_3:1_sil=128000:e2e=on:si=on:urr=on:uwa=one_side_constant:nwc=1.5:random_seed=1681758771:i=38:bd=all:rtra=on:amm=off:ss=axioms:ntd=on_2999 on theBenchmark for (2999ds/38Mi)
% 0.83/0.39 % (1269805)Instruction limit reached!
% 0.83/0.39 % (1269805)------------------------------
% 0.83/0.39 % (1269805)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.83/0.39 % (1269805)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.83/0.39 % (1269805)CaDiCaL version: 2.1.3
% 0.83/0.39 % (1269805)Termination reason: Instruction limit
% 0.83/0.39 % (1269805)Termination phase: Saturation
% 0.83/0.39 % (1269805)Time elapsed: 0.067 s
% 0.83/0.39 % (1269805)Peak memory usage: 14 MB
% 0.83/0.39 % (1269805)Instructions burned: 157 (million)
% 0.83/0.39 % (1269824)Instruction limit reached!
% 0.83/0.39 % (1269824)------------------------------
% 0.83/0.39 % (1269824)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.83/0.39 % (1269824)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.83/0.39 % (1269824)CaDiCaL version: 2.1.3
% 0.83/0.39 % (1269824)Termination reason: Instruction limit
% 0.83/0.39 % (1269824)Termination phase: Property scanning
% 0.83/0.39 % (1269824)Time elapsed: 0.003 s
% 0.83/0.39 % (1269824)Peak memory usage: 10 MB
% 0.83/0.39 % (1269824)Instructions burned: 8 (million)
% 0.83/0.39 % (1269829)lrs+1002_1_to=lpo:sil=128000:si=on:sos=on:spb=goal_then_units:uwa=off:random_seed=136631364:st=2:i=249:sd=1:rtra=on:ss=axioms_2998 on theBenchmark for (2998ds/249Mi)
% 0.83/0.39 % (1269830)dis+1002_1_sil=128000:fde=unused:e2e=on:si=on:cbe=off:uwa=off:random_seed=2104591668:hsq=on:st=2:i=25:kws=inv_frequency:rtra=on:ss=axioms:ntd=on_2998 on theBenchmark for (2998ds/25Mi)
% 0.83/0.39 % (1269825)Instruction limit reached!
% 0.83/0.39 % (1269825)------------------------------
% 0.83/0.39 % (1269825)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.83/0.39 % (1269825)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.83/0.39 % (1269825)CaDiCaL version: 2.1.3
% 0.83/0.39 % (1269825)Termination reason: Instruction limit
% 0.83/0.39 % (1269825)Termination phase: Saturation
% 0.83/0.39 % (1269825)Time elapsed: 0.019 s
% 0.83/0.39 % (1269825)Peak memory usage: 12 MB
% 0.83/0.39 % (1269825)Instructions burned: 38 (million)
% 0.83/0.39 % (1269833)lrs+10_16:1_sil=128000:si=on:lma=off:urr=on:uwa=interpreted_only:random_seed=1636808229:i=14:kws=precedence:aac=none:nm=10:rtra=on:er=filter:ntd=on_2998 on theBenchmark for (2998ds/14Mi)
% 0.83/0.39 % (1269834)dis+1010_1_sil=128000:si=on:uwa=off:random_seed=961024757:st=3:s2a=on:i=327:sd=3:rtra=on:ss=axioms_2998 on theBenchmark for (2998ds/327Mi)
% 0.83/0.39 % (1269821)Instruction limit reached!
% 0.83/0.39 % (1269821)------------------------------
% 0.83/0.39 % (1269821)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.83/0.39 % (1269821)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.83/0.39 % (1269821)CaDiCaL version: 2.1.3
% 0.83/0.39 % (1269821)Termination reason: Instruction limit
% 0.83/0.39 % (1269821)Termination phase: Saturation
% 0.83/0.39 % (1269821)Time elapsed: 0.037 s
% 0.83/0.39 % (1269821)Peak memory usage: 12 MB
% 0.83/0.39 % (1269821)Instructions burned: 87 (million)
% 0.83/0.39 % (1269833)Instruction limit reached!
% 0.83/0.39 % (1269833)------------------------------
% 0.83/0.39 % (1269833)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.83/0.39 % (1269833)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.83/0.39 % (1269833)CaDiCaL version: 2.1.3
% 0.83/0.39 % (1269833)Termination reason: Instruction limit
% 0.83/0.39 % (1269833)Termination phase: Saturation
% 0.83/0.39 % (1269833)Time elapsed: 0.006 s
% 0.83/0.39 % (1269833)Peak memory usage: 12 MB
% 0.83/0.39 % (1269833)Instructions burned: 14 (million)
% 0.83/0.39 % (1269830)Instruction limit reached!
% 0.83/0.39 % (1269830)------------------------------
% 0.83/0.39 % (1269830)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.83/0.39 % (1269830)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.83/0.39 % (1269830)CaDiCaL version: 2.1.3
% 0.83/0.39 % (1269830)Termination reason: Instruction limit
% 0.83/0.39 % (1269830)Termination phase: Saturation
% 0.83/0.39 % (1269830)Time elapsed: 0.013 s
% 0.83/0.39 % (1269830)Peak memory usage: 12 MB
% 0.83/0.39 % (1269830)Instructions burned: 26 (million)
% 0.83/0.39 % (1269837)dis+10_1_anc=all_dependent:to=kbo:sil=128000:si=on:chr=on:random_seed=2536720233:uwa_fpi=on:i=14:aac=none:rtra=on:fe=abstraction_2998 on theBenchmark for (2998ds/14Mi)
% 0.83/0.39 % (1269834) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1269794-1269834"...
% 0.83/0.39 % (1269840)ott+21_20_to=lpo:sil=128000:tgt=ground:si=on:sp=arity:lma=off:uwa=off:foolp=on:random_seed=2396619448:st=4:i=2:add=off:sd=3:nm=16:fsr=off:rtra=on:ss=axioms:sgt=8:ntd=on_2998 on theBenchmark for (2998ds/2Mi)
% 0.83/0.39 % (1269837)Instruction limit reached!
% 0.83/0.39 % (1269837)------------------------------
% 0.83/0.39 % (1269837)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.83/0.39 % (1269837)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.83/0.39 % (1269837)CaDiCaL version: 2.1.3
% 0.83/0.39 % (1269837)Termination reason: Instruction limit
% 0.83/0.39 % (1269837)Termination phase: Saturation
% 0.83/0.39 % (1269837)Time elapsed: 0.006 s
% 0.83/0.39 % (1269837)Peak memory usage: 12 MB
% 0.83/0.39 % (1269837)Instructions burned: 14 (million)
% 0.83/0.39 % (1269834)...printing done.
% 0.83/0.39 % (1269840)Instruction limit reached!
% 0.83/0.39 % (1269840)------------------------------
% 0.83/0.39 % (1269840)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.83/0.39 % (1269840)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.83/0.39 % (1269840)CaDiCaL version: 2.1.3
% 0.83/0.39 % (1269840)Termination reason: Instruction limit
% 0.83/0.39 % (1269840)Termination phase: Property scanning
% 0.83/0.39 % (1269840)Time elapsed: 0.002 s
% 0.83/0.39 % (1269840)Peak memory usage: 10 MB
% 0.83/0.39 % (1269840)Instructions burned: 4 (million)
% 0.83/0.39 % (1269834)Refutation found. Thanks to Tanya!
% 0.83/0.39 % SZS status Theorem for theBenchmark
% 0.83/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.83/0.39 % (1269834)------------------------------
% 0.83/0.39 % (1269834)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.83/0.39 % (1269834)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.83/0.39 % (1269834)CaDiCaL version: 2.1.3
% 0.83/0.39 % (1269834)Termination reason: Refutation
% 0.83/0.39 % (1269834)Time elapsed: 0.021 s
% 0.83/0.39 % (1269834)Peak memory usage: 13 MB
% 0.83/0.39 % (1269834)Instructions burned: 41 (million)
% 0.83/0.39 % (1269794)Success in time 0.155 s
% 0.83/0.39 % Vampire exiting
%------------------------------------------------------------------------------