%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU902^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 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:31:54 AM UTC 2026
% Result : Theorem 0.19s 0.27s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 37
% Number of leaves : 5
% Syntax : Number of formulae : 67 ( 19 unt; 0 typ; 4 def)
% Number of atoms : 368 ( 137 equ; 0 cnn)
% Maximal formula atoms : 5 ( 5 avg)
% Number of connectives : 483 ( 86 ~; 63 |; 41 &; 258 @)
% ( 4 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 86 ( 86 >; 0 *; 0 +; 0 <<)
% Number of symbols : 21 ( 17 usr; 7 con; 0-4 aty)
% ( 0 !!; 21 ??; 0 @@+; 0 @@-)
% Number of variables : 98 ( 0 sgn 48 !; 5 ?; 98 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
d: $i > $o ).
thf(func_def_2,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_3,type,
vAND: $o > $o > $o ).
thf(func_def_4,type,
vNOT: $o > $o ).
thf(func_def_5,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_6,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_7,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_8,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_11,type,
sK0: ( $i > $o ) > $i ).
thf(func_def_12,type,
sK1: $i > $o ).
thf(func_def_13,type,
sK2: $i > $i > $o ).
thf(func_def_14,type,
sK3: $i > $o ).
thf(f1,conjecture,
! [X0: ( $i > $o ) > $i] :
( ( ! [X1: $i > $o,X2: $i > $o] :
( ( ( X0 @ X1 )
= ( X0 @ X2 ) )
=> ( X1 = X2 ) )
& ( d
= ( ^ [X3: $i] :
? [X4: $i > $o] :
( ( X3
= ( X0 @ X4 ) )
& ~ ( X4 @ ( X0 @ X4 ) ) ) ) ) )
=> ~ ( d @ ( X0 @ d ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM143_pme) ).
thf(f2,negated_conjecture,
~ ! [X0: ( $i > $o ) > $i] :
( ( ! [X1: $i > $o,X2: $i > $o] :
( ( ( X0 @ X1 )
= ( X0 @ X2 ) )
=> ( X1 = X2 ) )
& ( d
= ( ^ [X3: $i] :
? [X4: $i > $o] :
( ( X3
= ( X0 @ X4 ) )
& ~ ( X4 @ ( X0 @ X4 ) ) ) ) ) )
=> ~ ( d @ ( X0 @ d ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ! [X0: ( $i > $o ) > $i] :
( ( ! [X1: $i > $o,X2: $i > $o] :
( ( ( X0 @ X1 )
= ( X0 @ X2 ) )
=> ( X1 = X2 ) )
& ( d
= ( ^ [X3: $i] :
? [X4: $i > $o] :
( ( X3
= ( X0 @ X4 ) )
& ~ ( X4 @ ( X0 @ X4 ) ) ) ) ) )
=> ~ ( d @ ( X0 @ d ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ! [X0: ( $i > $o ) > $i] :
( ( ( d
= ( ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ~ ( Y1 @ ( X0 @ Y1 ) )
& ( ( X0 @ Y1 )
= Y0 ) ) ) ) )
& ! [X2: $i > $o,X1: $i > $o] :
( ( ( X0 @ X1 )
= ( X0 @ X2 ) )
=> ( X1 = X2 ) ) )
=> ( ( d @ ( X0 @ d ) )
!= $true ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
~ ! [X0: ( $i > $o ) > $i] :
( ( ( d
= ( ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ~ ( Y1 @ ( X0 @ Y1 ) )
& ( ( X0 @ Y1 )
= Y0 ) ) ) ) )
& ! [X2: $i > $o,X1: $i > $o] :
( ( ( X0 @ X1 )
= ( X0 @ X2 ) )
=> ( X1 = X2 ) ) )
=> ( ( d @ ( X0 @ d ) )
!= $true ) ),
inference(flattening,[],[f4]) ).
thf(f6,plain,
? [X0: ( $i > $o ) > $i] :
( ( ( d @ ( X0 @ d ) )
= $true )
& ( d
= ( ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ~ ( Y1 @ ( X0 @ Y1 ) )
& ( ( X0 @ Y1 )
= Y0 ) ) ) ) )
& ! [X1: $i > $o,X2: $i > $o] :
( ( X1 = X2 )
| ( ( X0 @ X1 )
!= ( X0 @ X2 ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f7,plain,
? [X0: ( $i > $o ) > $i] :
( ! [X1: $i > $o,X2: $i > $o] :
( ( X1 = X2 )
| ( ( X0 @ X1 )
!= ( X0 @ X2 ) ) )
& ( d
= ( ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ~ ( Y1 @ ( X0 @ Y1 ) )
& ( ( X0 @ Y1 )
= Y0 ) ) ) ) )
& ( ( d @ ( X0 @ d ) )
= $true ) ),
inference(flattening,[],[f6]) ).
thf(f8,plain,
( ! [X1: $i > $o,X2: $i > $o] :
( ( X1 = X2 )
| ( ( sK0 @ X2 )
!= ( sK0 @ X1 ) ) )
& ( d
= ( ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ~ ( Y1 @ ( sK0 @ Y1 ) )
& ( ( sK0 @ Y1 )
= Y0 ) ) ) ) )
& ( ( d @ ( sK0 @ d ) )
= $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f7]) ).
thf(f9,plain,
( ( d @ ( sK0 @ d ) )
= $true ),
inference(cnf_transformation,[],[f8]) ).
thf(f10,plain,
( d
= ( ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ~ ( Y1 @ ( sK0 @ Y1 ) )
& ( ( sK0 @ Y1 )
= Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f11,plain,
! [X2: $i > $o,X1: $i > $o] :
( ( ( sK0 @ X2 )
!= ( sK0 @ X1 ) )
| ( X1 = X2 ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f14,plain,
( ( ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ~ ( Y1 @ ( sK0 @ Y1 ) )
& ( ( sK0 @ Y1 )
= Y0 ) ) )
@ ( sK0
@ ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ~ ( Y1 @ ( sK0 @ Y1 ) )
& ( ( sK0 @ Y1 )
= Y0 ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f9,f10,f10]) ).
thf(f15,plain,
( $true
= ( ?? @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( ~ ( Y0 @ ( sK0 @ Y0 ) )
& ( ( sK0 @ Y0 )
= ( sK0
@ ^ [Y1: $i] :
( ?? @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ~ ( Y2 @ ( sK0 @ Y2 ) )
& ( ( sK0 @ Y2 )
= Y1 ) ) ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f14]) ).
thf(f16,plain,
( ( ^ [Y0: $i > $o] :
( ~ ( Y0 @ ( sK0 @ Y0 ) )
& ( ( sK0 @ Y0 )
= ( sK0
@ ^ [Y1: $i] :
( ?? @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ~ ( Y2 @ ( sK0 @ Y2 ) )
& ( ( sK0 @ Y2 )
= Y1 ) ) ) ) ) )
@ sK1 )
= $true ),
inference(sigma_proxy_clausification,[],[f15]) ).
thf(f17,plain,
( ( ~ ( sK1 @ ( sK0 @ sK1 ) )
& ( ( sK0 @ sK1 )
= ( sK0
@ ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ~ ( Y1 @ ( sK0 @ Y1 ) )
& ( ( sK0 @ Y1 )
= Y0 ) ) ) ) ) )
= $true ),
inference(beta-eta_normalization,[],[f16]) ).
thf(f18,plain,
( ( ( sK0 @ sK1 )
= ( sK0
@ ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ~ ( Y1 @ ( sK0 @ Y1 ) )
& ( ( sK0 @ Y1 )
= Y0 ) ) ) ) )
= $true ),
inference(and_proxy_clausification,[],[f17]) ).
thf(f19,plain,
( ( ~ ( sK1 @ ( sK0 @ sK1 ) ) )
= $true ),
inference(and_proxy_clausification,[],[f17]) ).
thf(f20,plain,
( ( sK1 @ ( sK0 @ sK1 ) )
= $false ),
inference(not_proxy_clausification,[],[f19]) ).
thf(f21,plain,
( ( sK0
@ ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ~ ( Y1 @ ( sK0 @ Y1 ) )
& ( ( sK0 @ Y1 )
= Y0 ) ) ) )
= ( sK0 @ sK1 ) ),
inference(equality_proxy_clausification,[],[f18]) ).
thf(f23,plain,
! [X0: $i > $o] :
( ( ( sK0 @ X0 )
!= ( sK0 @ sK1 ) )
| ( ( ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ~ ( Y1 @ ( sK0 @ Y1 ) )
& ( ( sK0 @ Y1 )
= Y0 ) ) ) )
= X0 ) ),
inference(constrained_superposition,[],[f11,f21]) ).
thf(f25,plain,
( ( ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ~ ( Y1 @ ( sK0 @ Y1 ) )
& ( ( sK0 @ Y1 )
= Y0 ) ) ) )
= sK1 ),
inference(equality_resolution,[],[f23]) ).
thf(f26,plain,
! [X1: $i] :
( ( sK1 @ X1 )
= ( ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ~ ( Y1 @ ( sK0 @ Y1 ) )
& ( ( sK0 @ Y1 )
= Y0 ) ) )
@ X1 ) ),
inference(argument_congruence,[],[f25]) ).
thf(f27,plain,
! [X1: $i] :
( ( ( sK1 @ X1 )
= $true )
| ( ( ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ~ ( Y1 @ ( sK0 @ Y1 ) )
& ( ( sK0 @ Y1 )
= Y0 ) ) )
@ X1 )
= $false ) ),
inference(iff_proxy_clausification,[],[f26]) ).
thf(f36,plain,
! [X1: $i] :
( ( ( ?? @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( ~ ( Y0 @ ( sK0 @ Y0 ) )
& ( ( sK0 @ Y0 )
= X1 ) ) )
= $false )
| ( ( sK1 @ X1 )
= $true ) ),
inference(beta-eta_normalization,[],[f27]) ).
thf(f37,plain,
! [X2: $i > $o,X1: $i] :
( ( $false
= ( ^ [Y0: $i > $o] :
( ~ ( Y0 @ ( sK0 @ Y0 ) )
& ( ( sK0 @ Y0 )
= X1 ) )
@ X2 ) )
| ( ( sK1 @ X1 )
= $true ) ),
inference(pi_proxy_clausification,[],[f36]) ).
thf(f38,plain,
! [X2: $i > $o,X1: $i] :
( ( ( ~ ( X2 @ ( sK0 @ X2 ) )
& ( ( sK0 @ X2 )
= X1 ) )
= $false )
| ( ( sK1 @ X1 )
= $true ) ),
inference(beta-eta_normalization,[],[f37]) ).
thf(f39,plain,
! [X2: $i > $o,X1: $i] :
( ( ( ~ ( X2 @ ( sK0 @ X2 ) ) )
= $false )
| ( ( ( sK0 @ X2 )
= X1 )
= $false )
| ( ( sK1 @ X1 )
= $true ) ),
inference(and_proxy_clausification,[],[f38]) ).
thf(f40,plain,
! [X2: $i > $o,X1: $i] :
( ( ( ( sK0 @ X2 )
= X1 )
= $false )
| ( ( X2 @ ( sK0 @ X2 ) )
= $true )
| ( ( sK1 @ X1 )
= $true ) ),
inference(not_proxy_clausification,[],[f39]) ).
thf(f41,plain,
! [X2: $i > $o,X1: $i] :
( ( ( sK0 @ X2 )
!= X1 )
| ( ( X2 @ ( sK0 @ X2 ) )
= $true )
| ( ( sK1 @ X1 )
= $true ) ),
inference(equality_proxy_clausification,[],[f40]) ).
thf(f52,plain,
! [X0: $i] :
( ( ( sK0 @ sK1 )
!= X0 )
| ( ( ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ~ ( Y1 @ ( sK0 @ Y1 ) )
& ( ( sK0 @ Y1 )
= Y0 ) ) )
@ ( sK0 @ sK1 ) )
= $true )
| ( ( sK1 @ X0 )
= $true ) ),
inference(constrained_superposition,[],[f41,f21]) ).
thf(f55,plain,
! [X0: $i] :
( ( ( ?? @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( ~ ( Y0 @ ( sK0 @ Y0 ) )
& ( ( sK0 @ Y0 )
= ( sK0 @ sK1 ) ) ) )
= $true )
| ( ( sK1 @ X0 )
= $true )
| ( ( sK0 @ sK1 )
!= X0 ) ),
inference(beta-eta_normalization,[],[f52]) ).
thf(f56,plain,
! [X0: $i] :
( ( $true
= ( ^ [Y0: $i > $o] :
( ~ ( Y0 @ ( sK0 @ Y0 ) )
& ( ( sK0 @ Y0 )
= ( sK0 @ sK1 ) ) )
@ sK3 ) )
| ( ( sK1 @ X0 )
= $true )
| ( ( sK0 @ sK1 )
!= X0 ) ),
inference(sigma_proxy_clausification,[],[f55]) ).
thf(f57,plain,
! [X0: $i] :
( ( ( sK0 @ sK1 )
!= X0 )
| ( ( ~ ( sK3 @ ( sK0 @ sK3 ) )
& ( ( sK0 @ sK3 )
= ( sK0 @ sK1 ) ) )
= $true )
| ( ( sK1 @ X0 )
= $true ) ),
inference(beta-eta_normalization,[],[f56]) ).
thf(f58,plain,
! [X0: $i] :
( ( ( sK1 @ X0 )
= $true )
| ( ( sK0 @ sK1 )
!= X0 )
| ( ( ( sK0 @ sK3 )
= ( sK0 @ sK1 ) )
= $true ) ),
inference(and_proxy_clausification,[],[f57]) ).
thf(f59,plain,
! [X0: $i] :
( ( ( sK1 @ X0 )
= $true )
| ( ( ~ ( sK3 @ ( sK0 @ sK3 ) ) )
= $true )
| ( ( sK0 @ sK1 )
!= X0 ) ),
inference(and_proxy_clausification,[],[f57]) ).
thf(f60,plain,
! [X0: $i] :
( ( ( sK3 @ ( sK0 @ sK3 ) )
= $false )
| ( ( sK0 @ sK1 )
!= X0 )
| ( ( sK1 @ X0 )
= $true ) ),
inference(not_proxy_clausification,[],[f59]) ).
thf(f61,plain,
! [X0: $i] :
( ( ( sK0 @ sK1 )
!= X0 )
| ( ( sK1 @ X0 )
= $true )
| ( ( sK0 @ sK3 )
= ( sK0 @ sK1 ) ) ),
inference(equality_proxy_clausification,[],[f58]) ).
thf(f63,definition,
( spl4_1
<=> ( ( sK3 @ ( sK0 @ sK3 ) )
= $false ) ),
introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition]) ).
thf(f65,plain,
( ( ( sK3 @ ( sK0 @ sK3 ) )
= $false )
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f63]) ).
thf(f67,definition,
( spl4_2
<=> ! [X0: $i] :
( ( ( sK0 @ sK1 )
!= X0 )
| ( ( sK1 @ X0 )
= $true ) ) ),
introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition]) ).
thf(f68,plain,
( ! [X0: $i] :
( ( ( sK0 @ sK1 )
!= X0 )
| ( ( sK1 @ X0 )
= $true ) )
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f67]) ).
thf(f69,plain,
( spl4_1
| spl4_2 ),
inference(avatar_split_clause,[],[f60,f67,f63]) ).
thf(f71,definition,
( spl4_3
<=> ( ( sK0 @ sK3 )
= ( sK0 @ sK1 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_3])],[avatar_definition]) ).
thf(f73,plain,
( ( ( sK0 @ sK3 )
= ( sK0 @ sK1 ) )
| ~ spl4_3 ),
inference(avatar_component_clause,[],[f71]) ).
thf(f74,plain,
( spl4_2
| spl4_3 ),
inference(avatar_split_clause,[],[f61,f71,f67]) ).
thf(f76,plain,
( ( ( sK1 @ ( sK0 @ sK1 ) )
= $true )
| ~ spl4_2 ),
inference(equality_resolution,[],[f68]) ).
thf(f77,plain,
( ( $false = $true )
| ~ spl4_2 ),
inference(forward_demodulation,[],[f76,f20]) ).
thf(f78,plain,
( $false
| ~ spl4_2 ),
inference(trivial_inequality_removal,[],[f77]) ).
thf(f79,plain,
~ spl4_2,
inference(avatar_contradiction_clause,[],[f78]) ).
thf(f80,plain,
( ! [X0: $i] :
( ( ( sK0 @ sK1 )
!= X0 )
| ( ( sK3 @ ( sK0 @ sK1 ) )
= $true )
| ( ( sK1 @ X0 )
= $true ) )
| ~ spl4_3 ),
inference(constrained_superposition,[],[f41,f73]) ).
thf(f85,plain,
( ( ( sK3 @ ( sK0 @ sK1 ) )
= $false )
| ~ spl4_1
| ~ spl4_3 ),
inference(constrained_superposition,[],[f65,f73]) ).
thf(f89,definition,
( spl4_4
<=> ( ( sK3 @ ( sK0 @ sK1 ) )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl4_4])],[avatar_definition]) ).
thf(f91,plain,
( ( ( sK3 @ ( sK0 @ sK1 ) )
= $true )
| ~ spl4_4 ),
inference(avatar_component_clause,[],[f89]) ).
thf(f92,plain,
( spl4_4
| spl4_2
| ~ spl4_3 ),
inference(avatar_split_clause,[],[f80,f71,f67,f89]) ).
thf(f93,plain,
( ( $false = $true )
| ~ spl4_1
| ~ spl4_3
| ~ spl4_4 ),
inference(forward_demodulation,[],[f91,f85]) ).
thf(f94,plain,
( $false
| ~ spl4_1
| ~ spl4_3
| ~ spl4_4 ),
inference(trivial_inequality_removal,[],[f93]) ).
thf(f95,plain,
( ~ spl4_1
| ~ spl4_3
| ~ spl4_4 ),
inference(avatar_contradiction_clause,[],[f94]) ).
cnf(s1,plain,
( spl4_1
| spl4_2 ),
inference(sat_conversion,[],[f69]) ).
cnf(s2,plain,
( spl4_2
| spl4_3 ),
inference(sat_conversion,[],[f74]) ).
cnf(s3,plain,
~ spl4_2,
inference(sat_conversion,[],[f79]) ).
cnf(s4,plain,
( spl4_2
| ~ spl4_3
| spl4_4 ),
inference(sat_conversion,[],[f92]) ).
cnf(s5,plain,
( ~ spl4_1
| ~ spl4_3
| ~ spl4_4 ),
inference(sat_conversion,[],[f95]) ).
cnf(s6,plain,
spl4_3,
inference(rat,[],[s2,s3]) ).
cnf(s7,plain,
spl4_4,
inference(rat,[],[s4,s3,s6]) ).
cnf(s8,plain,
~ spl4_1,
inference(rat,[],[s5,s6,s7]) ).
cnf(s9,plain,
$false,
inference(rat,[],[s1,s3,s8]) ).
thf(f96,plain,
$false,
inference(avatar_sat_refutation,[],[s9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU902^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.17 % Computer : n016.cluster.edu
% 0.10/0.17 % Model : x86_64 x86_64
% 0.10/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.17 % Memory : 8046.5625MB
% 0.10/0.17 % OS : Linux 6.8.0-71-generic
% 0.10/0.17 % CPULimit : 300
% 0.10/0.17 % WCLimit : 300
% 0.10/0.17 % DateTime : Tue Sep 29 14:49:19 UTC 2026
% 0.10/0.18 % CPUTime :
% 0.10/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.21 Running higher-order theorem proving
% 0.10/0.22 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.19/0.27 % (445008)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.19/0.27 % (445013)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=2069559522:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.19/0.27 % (445013) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-445008-445013"...
% 0.19/0.27 % (445013)...printing done.
% 0.19/0.27 % (445013)Refutation found. Thanks to Tanya!
% 0.19/0.27 % SZS status Theorem for theBenchmark
% 0.19/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.27 % (445013)------------------------------
% 0.19/0.27 % (445013)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.27 % (445013)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.27 % (445013)CaDiCaL version: 2.1.3
% 0.19/0.27 % (445013)Termination reason: Refutation
% 0.19/0.27 % (445013)Time elapsed: 0.004 s
% 0.19/0.27 % (445013)Peak memory usage: 13 MB
% 0.19/0.27 % (445013)Instructions burned: 8 (million)
% 0.19/0.27 % (445008)Success in time 0.044 s
% 0.19/0.27 % Vampire exiting
%------------------------------------------------------------------------------