%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU506^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 : n017.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:13 AM UTC 2026
% Result : Theorem 0.20s 0.33s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 4
% Syntax : Number of formulae : 48 ( 27 unt; 0 typ; 1 def)
% Number of atoms : 631 ( 189 equ; 0 cnn)
% Maximal formula atoms : 24 ( 13 avg)
% Number of connectives : 427 ( 32 ~; 15 |; 69 &; 165 @)
% ( 3 <=>; 124 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 7 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 : 75 ( 71 usr; 28 con; 0-4 aty)
% ( 19 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 73 ( 0 sgn 47 !; 2 ?; 73 :)
% 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,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_34,type,
vAND: $o > $o > $o ).
thf(func_def_35,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_36,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_37,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_38,type,
vIMP: $o > $o > $o ).
thf(func_def_39,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_40,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_41,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_42,type,
vIFF: $o > $o > $o ).
thf(func_def_43,type,
vNOT: $o > $o ).
thf(func_def_44,type,
vOR: $o > $o > $o ).
thf(func_def_45,type,
db4:
!>[X0: $tType] : X0 ).
thf(func_def_46,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_50,type,
sK1: $i > $i > $i ).
thf(func_def_51,type,
sK2: $i > $i > $i ).
thf(func_def_52,type,
sK3: ( $i > $o ) > $i ).
thf(func_def_53,type,
sK4: ( $i > $o ) > $i > $i ).
thf(func_def_54,type,
sK5: ( $i > $o ) > $i ).
thf(func_def_55,type,
sK6: ( $i > $o ) > $i > $i ).
thf(func_def_56,type,
sK7: ( $i > $o ) > $i > $i ).
thf(func_def_57,type,
sK8: $i > $i ).
thf(func_def_58,type,
sK9: $i > $i > $i > $i ).
thf(func_def_59,type,
sK10: $i > $i > $i ).
thf(func_def_60,type,
sK11: $i > $i > $i ).
thf(func_def_61,type,
sK12: $i > $i > $i ).
thf(func_def_62,type,
sK13: $i > $i ).
thf(func_def_63,type,
sK14: $i > ( $i > $i > $o ) > $i ).
thf(func_def_64,type,
sK15: $i > ( $i > $i > $o ) > $i ).
thf(func_def_65,type,
sK16: $i > $i > ( $i > $i > $o ) > $i ).
thf(func_def_66,type,
sK17: $i > $i > ( $i > $i > $o ) > $i ).
thf(func_def_67,type,
sK18: $i > $i > ( $i > $i > $o ) > $i ).
thf(func_def_68,type,
sK19: $i > $i > ( $i > $i > $o ) > $i ).
thf(func_def_69,type,
sK20: $i > $i ).
thf(func_def_70,type,
sK21: $i > $i > $i ).
thf(func_def_71,type,
sK22: $i > $i > $i ).
thf(func_def_72,type,
sK23: $i > $i > $i ).
thf(f2,axiom,
( setextAx
= ( ! [X0: $i,X1: $i] :
( ! [X2: $i] :
( ( in @ X2 @ X0 )
<=> ( in @ X2 @ X1 ) )
=> ( X0 = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setextAx) ).
thf(f3,axiom,
( emptysetAx
= ( ! [X0: $i] :
~ ( in @ X0 @ emptyset ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',emptysetAx) ).
thf(f25,conjecture,
( setextAx
=> ( emptysetAx
=> ( setadjoinAx
=> ( powersetAx
=> ( setunionAx
=> ( omega0Ax
=> ( omegaSAx
=> ( omegaIndAx
=> ( replAx
=> ( foundationAx
=> ( wellorderingAx
=> ( descrp
=> ( dsetconstrI
=> ( dsetconstrEL
=> ( dsetconstrER
=> ( exuE1
=> ( prop2setE
=> ( emptysetE
=> ( emptysetimpfalse
=> ( notinemptyset
=> ( exuE3e
=> ( setext
=> ! [X0: $i] :
( ! [X1: $i] :
~ ( in @ X1 @ X0 )
=> ( X0 = emptyset ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',emptyI) ).
thf(f26,negated_conjecture,
~ ( setextAx
=> ( emptysetAx
=> ( setadjoinAx
=> ( powersetAx
=> ( setunionAx
=> ( omega0Ax
=> ( omegaSAx
=> ( omegaIndAx
=> ( replAx
=> ( foundationAx
=> ( wellorderingAx
=> ( descrp
=> ( dsetconstrI
=> ( dsetconstrEL
=> ( dsetconstrER
=> ( exuE1
=> ( prop2setE
=> ( emptysetE
=> ( emptysetimpfalse
=> ( notinemptyset
=> ( exuE3e
=> ( setext
=> ! [X0: $i] :
( ! [X1: $i] :
~ ( in @ X1 @ X0 )
=> ( X0 = emptyset ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f25]) ).
thf(f29,plain,
( setextAx
= ( ! [X0: $i,X1: $i] :
( ! [X2: $i] :
( ( in @ X2 @ X0 )
<=> ( in @ X2 @ X1 ) )
=> ( X0 = X1 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f30,plain,
( setextAx
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
= ( in @ Y2 @ Y0 ) ) )
=> ( Y1 = Y0 ) ) ) ) ),
inference(fool_elimination,[],[f29]) ).
thf(f31,plain,
( emptysetAx
= ( ! [X0: $i] :
~ ( in @ X0 @ emptyset ) ) ),
inference(rectify,[],[f3]) ).
thf(f32,plain,
( emptysetAx
= ( !! @ $i
@ ^ [Y0: $i] :
~ ( in @ Y0 @ emptyset ) ) ),
inference(fool_elimination,[],[f31]) ).
thf(f73,plain,
~ ( setextAx
=> ( emptysetAx
=> ( setadjoinAx
=> ( powersetAx
=> ( setunionAx
=> ( omega0Ax
=> ( omegaSAx
=> ( omegaIndAx
=> ( replAx
=> ( foundationAx
=> ( wellorderingAx
=> ( descrp
=> ( dsetconstrI
=> ( dsetconstrEL
=> ( dsetconstrER
=> ( exuE1
=> ( prop2setE
=> ( emptysetE
=> ( emptysetimpfalse
=> ( notinemptyset
=> ( exuE3e
=> ( setext
=> ! [X0: $i] :
( ! [X1: $i] :
~ ( in @ X1 @ X0 )
=> ( X0 = emptyset ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f26]) ).
thf(f74,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 )
=> ! [X0: $i] :
( ! [X1: $i] :
( ( in @ X1 @ X0 )
!= $true )
=> ( emptyset = X0 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f73]) ).
thf(f75,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 )
=> ! [X0: $i] :
( ! [X1: $i] :
( ( in @ X1 @ X0 )
!= $true )
=> ( emptyset = X0 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(flattening,[],[f74]) ).
thf(f76,plain,
( ? [X0: $i] :
( ( emptyset != X0 )
& ! [X1: $i] :
( ( in @ X1 @ X0 )
!= $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,[],[f75]) ).
thf(f77,plain,
( ? [X0: $i] :
( ( emptyset != X0 )
& ! [X1: $i] :
( ( in @ X1 @ X0 )
!= $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,[],[f76]) ).
thf(f78,plain,
( ( emptyset != sK0 )
& ! [X1: $i] :
( $true
!= ( in @ X1 @ sK0 ) )
& ( 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]),skolemize(X0,sK0)],[f77]) ).
thf(f80,plain,
( setextAx
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
= ( in @ Y2 @ Y0 ) ) )
=> ( Y1 = Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f30]) ).
thf(f81,plain,
( emptysetAx
= ( !! @ $i
@ ^ [Y0: $i] :
~ ( in @ Y0 @ emptyset ) ) ),
inference(cnf_transformation,[],[f32]) ).
thf(f103,plain,
setextAx = $true,
inference(cnf_transformation,[],[f78]) ).
thf(f104,plain,
emptysetAx = $true,
inference(cnf_transformation,[],[f78]) ).
thf(f125,plain,
! [X1: $i] :
( $true
!= ( in @ X1 @ sK0 ) ),
inference(cnf_transformation,[],[f78]) ).
thf(f126,plain,
emptyset != sK0,
inference(cnf_transformation,[],[f78]) ).
thf(f129,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
= ( in @ Y2 @ Y0 ) ) )
=> ( Y1 = Y0 ) ) ) )
= $true ),
inference(definition_unfolding,[],[f80,f103]) ).
thf(f130,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
~ ( in @ Y0 @ emptyset ) )
= $true ),
inference(definition_unfolding,[],[f81,f104]) ).
thf(f464,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
~ ( in @ Y0 @ emptyset )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f130]) ).
thf(f465,plain,
! [X1: $i] :
( $true
= ( ~ ( in @ X1 @ emptyset ) ) ),
inference(beta-eta_normalization,[],[f464]) ).
thf(f466,plain,
! [X1: $i] :
( $false
= ( in @ X1 @ emptyset ) ),
inference(not_proxy_clausification,[],[f465]) ).
thf(f467,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
= ( in @ Y2 @ Y0 ) ) )
=> ( Y1 = Y0 ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f129]) ).
thf(f468,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
= ( in @ Y1 @ X1 ) ) )
=> ( Y0 = X1 ) ) ) ),
inference(beta-eta_normalization,[],[f467]) ).
thf(f469,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
= ( in @ Y1 @ X1 ) ) )
=> ( Y0 = X1 ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f468]) ).
thf(f470,plain,
! [X2: $i,X1: $i] :
( $true
= ( ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
= ( in @ Y0 @ X1 ) ) )
=> ( X2 = X1 ) ) ),
inference(beta-eta_normalization,[],[f469]) ).
thf(f471,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
= ( in @ Y0 @ X1 ) ) ) )
| ( $true
= ( X2 = X1 ) ) ),
inference(imp_proxy_clausification,[],[f470]) ).
thf(f472,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
= ( in @ Y0 @ X1 ) )
@ ( sK23 @ X1 @ X2 ) ) )
| ( $true
= ( X2 = X1 ) ) ),
inference(sigma_proxy_clausification,[],[f471]) ).
thf(f473,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
= ( in @ Y0 @ X1 ) )
@ ( sK23 @ X1 @ X2 ) ) )
| ( X1 = X2 ) ),
inference(equality_proxy_clausification,[],[f472]) ).
thf(f474,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( ( in @ ( sK23 @ X1 @ X2 ) @ X2 )
= ( in @ ( sK23 @ X1 @ X2 ) @ X1 ) ) )
| ( X1 = X2 ) ),
inference(beta-eta_normalization,[],[f473]) ).
thf(f475,plain,
! [X2: $i,X1: $i] :
( ( ( in @ ( sK23 @ X1 @ X2 ) @ X2 )
!= ( in @ ( sK23 @ X1 @ X2 ) @ X1 ) )
| ( X1 = X2 ) ),
inference(iff_proxy_clausification,[],[f474]) ).
thf(f476,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( in @ ( sK23 @ X1 @ X2 ) @ X2 ) )
| ( $true
= ( in @ ( sK23 @ X1 @ X2 ) @ X1 ) )
| ( X1 = X2 ) ),
inference(xor_proxy_clausification,[],[f475]) ).
thf(f482,definition,
( spl24_2
<=> ! [X1: $i] :
( $false
= ( in @ X1 @ emptyset ) ) ),
introduced(definition,[new_symbols(definition,[spl24_2])],[avatar_definition]) ).
thf(f483,plain,
( ! [X1: $i] :
( $false
= ( in @ X1 @ emptyset ) )
| ~ spl24_2 ),
inference(avatar_component_clause,[],[f482]) ).
thf(f485,plain,
spl24_2,
inference(avatar_split_clause,[],[f466,f482]) ).
thf(f1046,plain,
! [X0: $i] :
( ( $true != $true )
| ( $true
= ( in @ ( sK23 @ sK0 @ X0 ) @ X0 ) )
| ( sK0 = X0 ) ),
inference(constrained_superposition,[],[f125,f476]) ).
thf(f1049,plain,
! [X0: $i] :
( ( $true
= ( in @ ( sK23 @ sK0 @ X0 ) @ X0 ) )
| ( sK0 = X0 ) ),
inference(trivial_inequality_removal,[],[f1046]) ).
thf(f1195,plain,
( ( $false = $true )
| ( emptyset = sK0 )
| ~ spl24_2 ),
inference(constrained_superposition,[],[f1049,f483]) ).
thf(f1228,plain,
( ( emptyset = sK0 )
| ~ spl24_2 ),
inference(trivial_inequality_removal,[],[f1195]) ).
thf(f1243,plain,
( $false
| ~ spl24_2 ),
inference(forward_subsumption_resolution,[],[f1228,f126]) ).
thf(f1244,plain,
~ spl24_2,
inference(avatar_contradiction_clause,[],[f1243]) ).
cnf(s2,plain,
spl24_2,
inference(sat_conversion,[],[f485]) ).
cnf(s9,plain,
~ spl24_2,
inference(sat_conversion,[],[f1244]) ).
cnf(s10,plain,
$false,
inference(rat,[],[s2,s9]) ).
thf(f1245,plain,
$false,
inference(avatar_sat_refutation,[],[s10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU506^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.18 % Computer : n017.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Tue Sep 29 13:42:22 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.22 Running first-order model finding
% 0.09/0.22 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.20/0.33 % (357118)Will run a generic schedule for satisfiability detection.
% 0.20/0.33 % (357126)dis+10_1_sil=32000:sp=arity:random_seed=2945142719:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.33 % (357124)% WARNING: option uhcvi not known.
% 0.20/0.33 % (357125)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2278386881:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.33 % (357123)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=987092090_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.33 % (357124)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1224172948:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.33 % (357127)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3692656759:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.33 % (357124)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.33 % (357127)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.33 % (357128)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2611348933:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.33 % Exception at run slice level
% 0.20/0.33 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.33 % (357124)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.20/0.33 % (357129)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2248770343:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.33 % (357126)Instruction limit reached!
% 0.20/0.33 % (357126)------------------------------
% 0.20/0.33 % (357126)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.33 % (357126)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.33 % (357126)CaDiCaL version: 2.1.3
% 0.20/0.33 % (357126)Termination reason: Instruction limit
% 0.20/0.33 % (357126)Time elapsed: 0.028 s
% 0.20/0.33 % (357126)Peak memory usage: 13 MB
% 0.20/0.33 % (357126)Instructions burned: 105 (million)
% 0.20/0.33 % (357137)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3076610580:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.20/0.33 % Exception at run slice level
% 0.20/0.33 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.33 % (357138)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=766575448:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.33 % (357140)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=367771137:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 0.20/0.33 % (357140)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.33 % (357140)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.20/0.33 % (357124) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-357118-357124"...
% 0.20/0.33 % (357127)Instruction limit reached!
% 0.20/0.33 % (357127)------------------------------
% 0.20/0.33 % (357127)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.33 % (357127)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.33 % (357127)CaDiCaL version: 2.1.3
% 0.20/0.33 % (357127)Termination reason: Instruction limit
% 0.20/0.33 % (357127)Termination phase: Saturation
% 0.20/0.33 % (357127)Time elapsed: 0.058 s
% 0.20/0.33 % (357127)Peak memory usage: 13 MB
% 0.20/0.33 % (357127)Instructions burned: 118 (million)
% 0.20/0.33 % (357124)...printing done.
% 0.20/0.33 % (357124)Refutation found. Thanks to Tanya!
% 0.20/0.33 % SZS status Theorem for theBenchmark
% 0.20/0.33 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.34 % (357124)------------------------------
% 0.20/0.34 % (357124)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.34 % (357124)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.34 % (357124)CaDiCaL version: 2.1.3
% 0.20/0.34 % (357124)Termination reason: Refutation
% 0.20/0.34 % (357124)Time elapsed: 0.058 s
% 0.20/0.34 % (357124)Peak memory usage: 14 MB
% 0.20/0.34 % (357124)Instructions burned: 116 (million)
% 0.20/0.34 % (357118)Success in time 0.106 s
% 0.20/0.34 % Vampire exiting
%------------------------------------------------------------------------------