%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU474^1 : TPTP v9.3.1. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n003.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:45 AM UTC 2026
% Result : Theorem 0.22s 0.29s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 6
% Syntax : Number of formulae : 67 ( 29 unt; 0 typ; 3 def)
% Number of atoms : 680 ( 164 equ; 0 cnn)
% Maximal formula atoms : 7 ( 10 avg)
% Number of connectives : 441 ( 28 ~; 148 |; 0 &; 262 @)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 30 ( 30 >; 0 *; 0 +; 0 <<)
% Number of symbols : 51 ( 48 usr; 7 con; 0-4 aty)
% Number of variables : 55 ( 0 sgn 2 !; 1 ?; 55 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
subrel: ( $i > $i > $o ) > ( $i > $i > $o ) > $o ).
thf(func_def_2,type,
inv: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_3,type,
idem: ( ( $i > $i > $o ) > $i > $i > $o ) > $o ).
thf(func_def_4,type,
infl: ( ( $i > $i > $o ) > $i > $i > $o ) > $o ).
thf(func_def_5,type,
mono: ( ( $i > $i > $o ) > $i > $i > $o ) > $o ).
thf(func_def_6,type,
refl: ( $i > $i > $o ) > $o ).
thf(func_def_7,type,
irrefl: ( $i > $i > $o ) > $o ).
thf(func_def_8,type,
rc: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_9,type,
symm: ( $i > $i > $o ) > $o ).
thf(func_def_10,type,
antisymm: ( $i > $i > $o ) > $o ).
thf(func_def_11,type,
asymm: ( $i > $i > $o ) > $o ).
thf(func_def_12,type,
sc: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_13,type,
trans: ( $i > $i > $o ) > $o ).
thf(func_def_14,type,
tc: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_15,type,
trc: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_16,type,
trsc: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_17,type,
po: ( $i > $i > $o ) > $o ).
thf(func_def_18,type,
so: ( $i > $i > $o ) > $o ).
thf(func_def_19,type,
total: ( $i > $i > $o ) > $o ).
thf(func_def_20,type,
term: ( $i > $i > $o ) > $o ).
thf(func_def_21,type,
ind: ( $i > $i > $o ) > $o ).
thf(func_def_22,type,
innf: ( $i > $i > $o ) > $i > $o ).
thf(func_def_23,type,
nfof: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_24,type,
norm: ( $i > $i > $o ) > $o ).
thf(func_def_25,type,
join: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_26,type,
lconfl: ( $i > $i > $o ) > $o ).
thf(func_def_27,type,
sconfl: ( $i > $i > $o ) > $o ).
thf(func_def_28,type,
confl: ( $i > $i > $o ) > $o ).
thf(func_def_29,type,
cr: ( $i > $i > $o ) > $o ).
thf(func_def_30,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_31,type,
vIMP: $o > $o > $o ).
thf(func_def_32,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_33,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_34,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_35,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_36,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_37,type,
vNOT: $o > $o ).
thf(func_def_38,type,
vAND: $o > $o > $o ).
thf(func_def_39,type,
vOR: $o > $o > $o ).
thf(func_def_40,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_41,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_42,type,
sK0: $i > $i > $o ).
thf(f8,axiom,
( ( ^ [X0: $i > $i > $o,X1: $i,X2: $i] :
( ( X1 = X2 )
| ( X0 @ X1 @ X2 ) ) )
= rc ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET009^0.ax',reflexive_closure) ).
thf(f12,axiom,
( ( ^ [X0: $i > $i > $o,X1: $i,X2: $i] :
( ( X0 @ X2 @ X1 )
| ( X0 @ X1 @ X2 ) ) )
= sc ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET009^0.ax',symmetric_closure) ).
thf(f30,conjecture,
! [X0: $i > $i > $o] :
( ( sc @ ( rc @ X0 ) )
= ( rc @ ( sc @ X0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',composing_symmetric_closure_and_reflexive_closure) ).
thf(f31,negated_conjecture,
~ ! [X0: $i > $i > $o] :
( ( sc @ ( rc @ X0 ) )
= ( rc @ ( sc @ X0 ) ) ),
inference(negated_conjecture,[status(cth)],[f30]) ).
thf(f42,plain,
( ( ^ [X0: $i > $i > $o,X1: $i,X2: $i] :
( ( X1 = X2 )
| ( X0 @ X1 @ X2 ) ) )
= rc ),
inference(rectify,[],[f8]) ).
thf(f43,plain,
( rc
= ( ^ [Y0: $i > $i > $o,Y1: $i,Y2: $i] :
( ( Y0 @ Y1 @ Y2 )
| ( Y1 = Y2 ) ) ) ),
inference(fool_elimination,[],[f42]) ).
thf(f84,plain,
( ( ^ [X0: $i > $i > $o,X1: $i,X2: $i] :
( ( X0 @ X2 @ X1 )
| ( X0 @ X1 @ X2 ) ) )
= sc ),
inference(rectify,[],[f12]) ).
thf(f85,plain,
( sc
= ( ^ [Y0: $i > $i > $o,Y1: $i,Y2: $i] :
( ( Y0 @ Y1 @ Y2 )
| ( Y0 @ Y2 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f84]) ).
thf(f86,plain,
? [X0: $i > $i > $o] :
( ( sc @ ( rc @ X0 ) )
!= ( rc @ ( sc @ X0 ) ) ),
inference(ennf_transformation,[],[f31]) ).
thf(f87,plain,
( ( rc @ ( sc @ sK0 ) )
!= ( sc @ ( rc @ sK0 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f86]) ).
thf(f90,plain,
( ( rc @ ( sc @ sK0 ) )
!= ( sc @ ( rc @ sK0 ) ) ),
inference(cnf_transformation,[],[f87]) ).
thf(f93,plain,
( sc
= ( ^ [Y0: $i > $i > $o,Y1: $i,Y2: $i] :
( ( Y0 @ Y1 @ Y2 )
| ( Y0 @ Y2 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f85]) ).
thf(f94,plain,
( rc
= ( ^ [Y0: $i > $i > $o,Y1: $i,Y2: $i] :
( ( Y0 @ Y1 @ Y2 )
| ( Y1 = Y2 ) ) ) ),
inference(cnf_transformation,[],[f43]) ).
thf(f135,plain,
( ( ^ [Y0: $i > $i > $o,Y1: $i,Y2: $i] :
( ( Y0 @ Y1 @ Y2 )
| ( Y1 = Y2 ) )
@ ( ^ [Y0: $i > $i > $o,Y1: $i,Y2: $i] :
( ( Y0 @ Y1 @ Y2 )
| ( Y0 @ Y2 @ Y1 ) )
@ sK0 ) )
!= ( ^ [Y0: $i > $i > $o,Y1: $i,Y2: $i] :
( ( Y0 @ Y1 @ Y2 )
| ( Y0 @ Y2 @ Y1 ) )
@ ( ^ [Y0: $i > $i > $o,Y1: $i,Y2: $i] :
( ( Y0 @ Y1 @ Y2 )
| ( Y1 = Y2 ) )
@ sK0 ) ) ),
inference(definition_unfolding,[],[f90,f94,f93,f93,f94]) ).
thf(f136,plain,
( ( ^ [Y0: $i,Y1: $i] :
( ( sK0 @ Y0 @ Y1 )
| ( sK0 @ Y1 @ Y0 )
| ( Y0 = Y1 ) ) )
!= ( ^ [Y0: $i,Y1: $i] :
( ( sK0 @ Y0 @ Y1 )
| ( Y0 = Y1 )
| ( sK0 @ Y1 @ Y0 )
| ( Y1 = Y0 ) ) ) ),
inference(beta-eta_normalization,[],[f135]) ).
thf(f137,plain,
( ( ^ [Y0: $i,Y1: $i] :
( ( sK0 @ Y0 @ Y1 )
| ( sK0 @ Y1 @ Y0 )
| ( Y0 = Y1 ) )
@ sK1 )
!= ( ^ [Y0: $i,Y1: $i] :
( ( sK0 @ Y0 @ Y1 )
| ( Y0 = Y1 )
| ( sK0 @ Y1 @ Y0 )
| ( Y1 = Y0 ) )
@ sK1 ) ),
inference(negative_extensionality,[],[f136]) ).
thf(f138,plain,
( ( ^ [Y0: $i] :
( ( sK0 @ sK1 @ Y0 )
| ( sK0 @ Y0 @ sK1 )
| ( sK1 = Y0 ) ) )
!= ( ^ [Y0: $i] :
( ( sK0 @ sK1 @ Y0 )
| ( sK1 = Y0 )
| ( sK0 @ Y0 @ sK1 )
| ( Y0 = sK1 ) ) ) ),
inference(beta-eta_normalization,[],[f137]) ).
thf(f139,plain,
( ( ^ [Y0: $i] :
( ( sK0 @ sK1 @ Y0 )
| ( sK0 @ Y0 @ sK1 )
| ( sK1 = Y0 ) )
@ sK2 )
!= ( ^ [Y0: $i] :
( ( sK0 @ sK1 @ Y0 )
| ( sK1 = Y0 )
| ( sK0 @ Y0 @ sK1 )
| ( Y0 = sK1 ) )
@ sK2 ) ),
inference(negative_extensionality,[],[f138]) ).
thf(f140,plain,
( ( ( ^ [Y0: $i] :
( ( sK0 @ sK1 @ Y0 )
| ( sK0 @ Y0 @ sK1 )
| ( sK1 = Y0 ) )
@ sK2 )
= $true )
| ( $true
= ( ^ [Y0: $i] :
( ( sK0 @ sK1 @ Y0 )
| ( sK1 = Y0 )
| ( sK0 @ Y0 @ sK1 )
| ( Y0 = sK1 ) )
@ sK2 ) ) ),
inference(xor_proxy_clausification,[],[f139]) ).
thf(f141,plain,
( ( ( ^ [Y0: $i] :
( ( sK0 @ sK1 @ Y0 )
| ( sK0 @ Y0 @ sK1 )
| ( sK1 = Y0 ) )
@ sK2 )
= $false )
| ( $false
= ( ^ [Y0: $i] :
( ( sK0 @ sK1 @ Y0 )
| ( sK1 = Y0 )
| ( sK0 @ Y0 @ sK1 )
| ( Y0 = sK1 ) )
@ sK2 ) ) ),
inference(xor_proxy_clausification,[],[f139]) ).
thf(f142,plain,
( ( $false
= ( ( sK0 @ sK1 @ sK2 )
| ( sK0 @ sK2 @ sK1 )
| ( sK1 = sK2 ) ) )
| ( ( ( sK0 @ sK1 @ sK2 )
| ( sK1 = sK2 )
| ( sK0 @ sK2 @ sK1 )
| ( sK2 = sK1 ) )
= $false ) ),
inference(beta-eta_normalization,[],[f141]) ).
thf(f143,plain,
( ( ( sK1 = sK2 )
= $false )
| ( ( ( sK0 @ sK1 @ sK2 )
| ( sK1 = sK2 )
| ( sK0 @ sK2 @ sK1 )
| ( sK2 = sK1 ) )
= $false ) ),
inference(or_proxy_clausification,[],[f142]) ).
thf(f144,plain,
( ( ( ( sK0 @ sK1 @ sK2 )
| ( sK1 = sK2 )
| ( sK0 @ sK2 @ sK1 )
| ( sK2 = sK1 ) )
= $false )
| ( ( ( sK0 @ sK1 @ sK2 )
| ( sK0 @ sK2 @ sK1 ) )
= $false ) ),
inference(or_proxy_clausification,[],[f142]) ).
thf(f145,plain,
( ( ( ( sK0 @ sK1 @ sK2 )
| ( sK0 @ sK2 @ sK1 ) )
= $false )
| ( ( ( sK0 @ sK2 @ sK1 )
| ( sK2 = sK1 ) )
= $false ) ),
inference(or_proxy_clausification,[],[f144]) ).
thf(f146,plain,
( ( ( ( sK0 @ sK1 @ sK2 )
| ( sK0 @ sK2 @ sK1 ) )
= $false )
| ( ( ( sK0 @ sK1 @ sK2 )
| ( sK1 = sK2 ) )
= $false ) ),
inference(or_proxy_clausification,[],[f144]) ).
thf(f148,plain,
( ( ( ( sK0 @ sK1 @ sK2 )
| ( sK1 = sK2 ) )
= $false )
| ( ( sK0 @ sK1 @ sK2 )
= $false ) ),
inference(or_proxy_clausification,[],[f146]) ).
thf(f150,plain,
( ( ( sK0 @ sK1 @ sK2 )
= $false )
| ( ( sK0 @ sK1 @ sK2 )
= $false ) ),
inference(or_proxy_clausification,[],[f148]) ).
thf(f151,plain,
( ( sK0 @ sK1 @ sK2 )
= $false ),
inference(duplicate_literal_removal,[],[f150]) ).
thf(f156,plain,
( ( ( ( sK0 @ sK2 @ sK1 )
| ( sK2 = sK1 ) )
= $false )
| ( ( sK0 @ sK2 @ sK1 )
= $false ) ),
inference(or_proxy_clausification,[],[f145]) ).
thf(f162,plain,
( ( ( sK0 @ sK2 @ sK1 )
= $false )
| ( ( sK0 @ sK2 @ sK1 )
= $false ) ),
inference(or_proxy_clausification,[],[f156]) ).
thf(f163,plain,
( ( sK0 @ sK2 @ sK1 )
= $false ),
inference(duplicate_literal_removal,[],[f162]) ).
thf(f165,plain,
( ( ( ( sK0 @ sK1 @ sK2 )
| ( sK1 = sK2 )
| ( sK0 @ sK2 @ sK1 )
| ( sK2 = sK1 ) )
= $false )
| ( sK1 != sK2 ) ),
inference(equality_proxy_clausification,[],[f143]) ).
thf(f167,plain,
( ( sK1 != sK2 )
| ( ( ( sK0 @ sK1 @ sK2 )
| ( sK1 = sK2 ) )
= $false ) ),
inference(or_proxy_clausification,[],[f165]) ).
thf(f168,plain,
( ( ( sK1 = sK2 )
= $false )
| ( sK1 != sK2 ) ),
inference(or_proxy_clausification,[],[f167]) ).
thf(f170,plain,
( ( sK1 != sK2 )
| ( sK1 != sK2 ) ),
inference(equality_proxy_clausification,[],[f168]) ).
thf(f171,plain,
sK1 != sK2,
inference(duplicate_literal_removal,[],[f170]) ).
thf(f176,plain,
( ( $true
= ( ( sK0 @ sK1 @ sK2 )
| ( sK0 @ sK2 @ sK1 )
| ( sK1 = sK2 ) ) )
| ( ( ( sK0 @ sK1 @ sK2 )
| ( sK1 = sK2 )
| ( sK0 @ sK2 @ sK1 )
| ( sK2 = sK1 ) )
= $true ) ),
inference(beta-eta_normalization,[],[f140]) ).
thf(f177,plain,
( ( ( ( sK0 @ sK1 @ sK2 )
| ( sK1 = sK2 )
| ( sK0 @ sK2 @ sK1 )
| ( sK2 = sK1 ) )
= $true )
| ( $true
= ( sK1 = sK2 ) )
| ( ( ( sK0 @ sK1 @ sK2 )
| ( sK0 @ sK2 @ sK1 ) )
= $true ) ),
inference(or_proxy_clausification,[],[f176]) ).
thf(f178,plain,
( ( $true
= ( sK1 = sK2 ) )
| ( $true
= ( ( sK0 @ sK1 @ sK2 )
| ( sK1 = sK2 ) ) )
| ( ( ( sK0 @ sK2 @ sK1 )
| ( sK2 = sK1 ) )
= $true )
| ( ( ( sK0 @ sK1 @ sK2 )
| ( sK0 @ sK2 @ sK1 ) )
= $true ) ),
inference(or_proxy_clausification,[],[f177]) ).
thf(f179,plain,
( ( $true
= ( ( sK0 @ sK1 @ sK2 )
| ( sK1 = sK2 ) ) )
| ( ( ( sK0 @ sK1 @ sK2 )
| ( sK0 @ sK2 @ sK1 ) )
= $true )
| ( ( ( sK0 @ sK2 @ sK1 )
| ( sK2 = sK1 ) )
= $true )
| ( sK1 = sK2 ) ),
inference(equality_proxy_clausification,[],[f178]) ).
thf(f180,plain,
( ( $true
= ( sK1 = sK2 ) )
| ( ( ( sK0 @ sK2 @ sK1 )
| ( sK2 = sK1 ) )
= $true )
| ( ( ( sK0 @ sK1 @ sK2 )
| ( sK0 @ sK2 @ sK1 ) )
= $true )
| ( sK1 = sK2 )
| ( $true
= ( sK0 @ sK1 @ sK2 ) ) ),
inference(or_proxy_clausification,[],[f179]) ).
thf(f181,plain,
( ( ( ( sK0 @ sK1 @ sK2 )
| ( sK0 @ sK2 @ sK1 ) )
= $true )
| ( ( ( sK0 @ sK2 @ sK1 )
| ( sK2 = sK1 ) )
= $true )
| ( sK1 = sK2 )
| ( $true
= ( sK0 @ sK1 @ sK2 ) )
| ( sK1 = sK2 ) ),
inference(equality_proxy_clausification,[],[f180]) ).
thf(f182,plain,
( ( $true
= ( sK0 @ sK1 @ sK2 ) )
| ( ( ( sK0 @ sK2 @ sK1 )
| ( sK2 = sK1 ) )
= $true )
| ( ( sK0 @ sK2 @ sK1 )
= $true )
| ( sK1 = sK2 )
| ( sK1 = sK2 )
| ( $true
= ( sK0 @ sK1 @ sK2 ) ) ),
inference(or_proxy_clausification,[],[f181]) ).
thf(f183,plain,
( ( $true
= ( sK0 @ sK1 @ sK2 ) )
| ( sK1 = sK2 )
| ( $true
= ( sK0 @ sK1 @ sK2 ) )
| ( sK1 = sK2 )
| ( ( sK2 = sK1 )
= $true )
| ( ( sK0 @ sK2 @ sK1 )
= $true )
| ( ( sK0 @ sK2 @ sK1 )
= $true ) ),
inference(or_proxy_clausification,[],[f182]) ).
thf(f184,plain,
( ( sK1 = sK2 )
| ( sK1 = sK2 )
| ( $true
= ( sK0 @ sK1 @ sK2 ) )
| ( $true
= ( sK0 @ sK1 @ sK2 ) )
| ( sK1 = sK2 )
| ( ( sK0 @ sK2 @ sK1 )
= $true )
| ( ( sK0 @ sK2 @ sK1 )
= $true ) ),
inference(equality_proxy_clausification,[],[f183]) ).
thf(f185,plain,
( ( $true
= ( sK0 @ sK1 @ sK2 ) )
| ( sK1 = sK2 )
| ( ( sK0 @ sK2 @ sK1 )
= $true ) ),
inference(duplicate_literal_removal,[],[f184]) ).
thf(f187,definition,
( spl3_1
<=> ( ( sK0 @ sK2 @ sK1 )
= $false ) ),
introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition]) ).
thf(f189,plain,
( ( ( sK0 @ sK2 @ sK1 )
= $false )
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f187]) ).
thf(f191,definition,
( spl3_2
<=> ( sK1 = sK2 ) ),
introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition]) ).
thf(f195,plain,
spl3_1,
inference(avatar_split_clause,[],[f163,f187]) ).
thf(f197,plain,
~ spl3_2,
inference(avatar_split_clause,[],[f171,f191]) ).
thf(f199,plain,
( ( $true = $false )
| ( ( sK0 @ sK2 @ sK1 )
= $true )
| ( sK1 = sK2 ) ),
inference(forward_demodulation,[],[f185,f151]) ).
thf(f200,plain,
( ( ( sK0 @ sK2 @ sK1 )
= $true )
| ( sK1 = sK2 ) ),
inference(trivial_inequality_removal,[],[f199]) ).
thf(f202,definition,
( spl3_3
<=> ( ( sK0 @ sK2 @ sK1 )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl3_3])],[avatar_definition]) ).
thf(f204,plain,
( ( ( sK0 @ sK2 @ sK1 )
= $true )
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f202]) ).
thf(f205,plain,
( spl3_2
| spl3_3 ),
inference(avatar_split_clause,[],[f200,f202,f191]) ).
thf(f206,plain,
( ( $true = $false )
| ~ spl3_1
| ~ spl3_3 ),
inference(forward_demodulation,[],[f204,f189]) ).
thf(f207,plain,
( $false
| ~ spl3_1
| ~ spl3_3 ),
inference(trivial_inequality_removal,[],[f206]) ).
thf(f208,plain,
( ~ spl3_1
| ~ spl3_3 ),
inference(avatar_contradiction_clause,[],[f207]) ).
cnf(s2,plain,
spl3_1,
inference(sat_conversion,[],[f195]) ).
cnf(s4,plain,
~ spl3_2,
inference(sat_conversion,[],[f197]) ).
cnf(s7,plain,
( spl3_2
| spl3_3 ),
inference(sat_conversion,[],[f205]) ).
cnf(s8,plain,
( ~ spl3_1
| ~ spl3_3 ),
inference(sat_conversion,[],[f208]) ).
cnf(s9,plain,
spl3_3,
inference(rat,[],[s7,s4]) ).
cnf(s10,plain,
~ spl3_1,
inference(rat,[],[s8,s9]) ).
cnf(s11,plain,
$false,
inference(rat,[],[s2,s10]) ).
thf(f209,plain,
$false,
inference(avatar_sat_refutation,[],[s11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU474^1 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.19 % Computer : n003.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:43:59 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 Running higher-order theorem proving
% 0.09/0.25 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.29 % (2519508)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.22/0.29 % (2519526)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=1030791266:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.22/0.29 % (2519526) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2519508-2519526"...
% 0.22/0.29 % (2519533)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.22/0.29 % (2519533)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.22/0.29 % (2519526)...printing done.
% 0.22/0.29 % (2519526)Refutation found. Thanks to Tanya!
% 0.22/0.29 % SZS status Theorem for theBenchmark
% 0.22/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.29 % (2519526)------------------------------
% 0.22/0.29 % (2519526)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.29 % (2519526)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.29 % (2519526)CaDiCaL version: 2.1.3
% 0.22/0.29 % (2519526)Termination reason: Refutation
% 0.22/0.29 % (2519526)Time elapsed: 0.005 s
% 0.22/0.29 % (2519526)Peak memory usage: 13 MB
% 0.22/0.29 % (2519526)Instructions burned: 15 (million)
% 0.22/0.29 % (2519508)Success in time 0.032 s
% 0.22/0.29 % Vampire exiting
%------------------------------------------------------------------------------