%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEV181^5 : TPTP v9.3.1. Bugfixed v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 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:37:58 AM UTC 2026
% Result : Theorem 0.09s 0.29s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 36
% Number of leaves : 5
% Syntax : Number of formulae : 65 ( 21 unt; 0 typ; 3 def)
% Number of atoms : 337 ( 128 equ; 0 cnn)
% Maximal formula atoms : 5 ( 5 avg)
% Number of connectives : 450 ( 78 ~; 59 |; 28 &; 255 @)
% ( 3 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 89 ( 89 >; 0 *; 0 +; 0 <<)
% Number of symbols : 22 ( 18 usr; 6 con; 0-4 aty)
% ( 0 !!; 17 ??; 0 @@+; 0 @@-)
% Number of variables : 96 ( 0 sgn 50 !; 4 ?; 96 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
cD_FOR_X5309: ( ( $i > $o ) > $i ) > $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,
db2:
!>[X0: $tType] : X0 ).
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,
vNOT: $o > $o ).
thf(func_def_9,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_12,type,
sK0: ( $i > $o ) > $i ).
thf(func_def_13,type,
sK1: $i > $o ).
thf(func_def_14,type,
sK2: $i > $i > $o ).
thf(func_def_15,type,
sK3: $i > $i ).
thf(func_def_16,type,
sK4: $i > $o ).
thf(f1,axiom,
( cD_FOR_X5309
= ( ^ [X0: ( $i > $o ) > $i,X1: $i] :
? [X2: $i > $o] :
( ~ ( X2 @ ( X0 @ X2 ) )
& ( X1
= ( X0 @ X2 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cD_FOR_X5309_def) ).
thf(f2,conjecture,
! [X0: ( $i > $o ) > $i] :
( ! [X1: $i > $o,X2: $i > $o] :
( ( ( X0 @ X1 )
= ( X0 @ X2 ) )
=> ( X1 = X2 ) )
=> ~ ( cD_FOR_X5309 @ X0 @ ( X0 @ ( cD_FOR_X5309 @ X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM143C_pme) ).
thf(f3,negated_conjecture,
~ ! [X0: ( $i > $o ) > $i] :
( ! [X1: $i > $o,X2: $i > $o] :
( ( ( X0 @ X1 )
= ( X0 @ X2 ) )
=> ( X1 = X2 ) )
=> ~ ( cD_FOR_X5309 @ X0 @ ( X0 @ ( cD_FOR_X5309 @ X0 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f2]) ).
thf(f4,plain,
( cD_FOR_X5309
= ( ^ [X0: ( $i > $o ) > $i,X1: $i] :
? [X2: $i > $o] :
( ~ ( X2 @ ( X0 @ X2 ) )
& ( X1
= ( X0 @ X2 ) ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f5,plain,
( cD_FOR_X5309
= ( ^ [Y0: ( $i > $o ) > $i,Y1: $i] :
( ?? @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ( ( Y0 @ Y2 )
= Y1 )
& ~ ( Y2 @ ( Y0 @ Y2 ) ) ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f6,plain,
~ ! [X0: ( $i > $o ) > $i] :
( ! [X1: $i > $o,X2: $i > $o] :
( ( ( X0 @ X1 )
= ( X0 @ X2 ) )
=> ( X1 = X2 ) )
=> ~ ( cD_FOR_X5309 @ X0 @ ( X0 @ ( cD_FOR_X5309 @ X0 ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f7,plain,
~ ! [X0: ( $i > $o ) > $i] :
( ! [X2: $i > $o,X1: $i > $o] :
( ( ( X0 @ X2 )
= ( X0 @ X1 ) )
=> ( X1 = X2 ) )
=> ( ( cD_FOR_X5309 @ X0 @ ( X0 @ ( cD_FOR_X5309 @ X0 ) ) )
!= $true ) ),
inference(fool_elimination,[],[f6]) ).
thf(f8,plain,
~ ! [X0: ( $i > $o ) > $i] :
( ! [X2: $i > $o,X1: $i > $o] :
( ( ( X0 @ X2 )
= ( X0 @ X1 ) )
=> ( X1 = X2 ) )
=> ( ( cD_FOR_X5309 @ X0 @ ( X0 @ ( cD_FOR_X5309 @ X0 ) ) )
!= $true ) ),
inference(flattening,[],[f7]) ).
thf(f9,plain,
? [X0: ( $i > $o ) > $i] :
( ( ( cD_FOR_X5309 @ X0 @ ( X0 @ ( cD_FOR_X5309 @ X0 ) ) )
= $true )
& ! [X2: $i > $o,X1: $i > $o] :
( ( ( X0 @ X2 )
!= ( X0 @ X1 ) )
| ( X1 = X2 ) ) ),
inference(ennf_transformation,[],[f8]) ).
thf(f10,plain,
? [X0: ( $i > $o ) > $i] :
( ( ( cD_FOR_X5309 @ X0 @ ( X0 @ ( cD_FOR_X5309 @ X0 ) ) )
= $true )
& ! [X1: $i > $o,X2: $i > $o] :
( ( ( X0 @ X2 )
!= ( X0 @ X1 ) )
| ( X1 = X2 ) ) ),
inference(rectify,[],[f9]) ).
thf(f11,plain,
( ( $true
= ( cD_FOR_X5309 @ sK0 @ ( sK0 @ ( cD_FOR_X5309 @ sK0 ) ) ) )
& ! [X1: $i > $o,X2: $i > $o] :
( ( ( sK0 @ X1 )
!= ( sK0 @ X2 ) )
| ( X1 = X2 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f10]) ).
thf(f12,plain,
( cD_FOR_X5309
= ( ^ [Y0: ( $i > $o ) > $i,Y1: $i] :
( ?? @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ( ( Y0 @ Y2 )
= Y1 )
& ~ ( Y2 @ ( Y0 @ Y2 ) ) ) ) ) ),
inference(cnf_transformation,[],[f5]) ).
thf(f13,plain,
! [X2: $i > $o,X1: $i > $o] :
( ( ( sK0 @ X1 )
!= ( sK0 @ X2 ) )
| ( X1 = X2 ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f14,plain,
( $true
= ( cD_FOR_X5309 @ sK0 @ ( sK0 @ ( cD_FOR_X5309 @ sK0 ) ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f17,plain,
( $true
= ( ^ [Y0: ( $i > $o ) > $i,Y1: $i] :
( ?? @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ( ( Y0 @ Y2 )
= Y1 )
& ~ ( Y2 @ ( Y0 @ Y2 ) ) ) )
@ sK0
@ ( sK0
@ ( ^ [Y0: ( $i > $o ) > $i,Y1: $i] :
( ?? @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ( ( Y0 @ Y2 )
= Y1 )
& ~ ( Y2 @ ( Y0 @ Y2 ) ) ) )
@ sK0 ) ) ) ),
inference(definition_unfolding,[],[f14,f12,f12]) ).
thf(f18,plain,
( $true
= ( ?? @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( ( ( sK0 @ Y0 )
= ( sK0
@ ^ [Y1: $i] :
( ?? @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ( ( sK0 @ Y2 )
= Y1 )
& ~ ( Y2 @ ( sK0 @ Y2 ) ) ) ) ) )
& ~ ( Y0 @ ( sK0 @ Y0 ) ) ) ) ),
inference(beta-eta_normalization,[],[f17]) ).
thf(f19,plain,
( ( ^ [Y0: $i > $o] :
( ( ( sK0 @ Y0 )
= ( sK0
@ ^ [Y1: $i] :
( ?? @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ( ( sK0 @ Y2 )
= Y1 )
& ~ ( Y2 @ ( sK0 @ Y2 ) ) ) ) ) )
& ~ ( Y0 @ ( sK0 @ Y0 ) ) )
@ sK1 )
= $true ),
inference(sigma_proxy_clausification,[],[f18]) ).
thf(f20,plain,
( ( ( ( sK0 @ sK1 )
= ( sK0
@ ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( ( sK0 @ Y1 )
= Y0 )
& ~ ( Y1 @ ( sK0 @ Y1 ) ) ) ) ) )
& ~ ( sK1 @ ( sK0 @ sK1 ) ) )
= $true ),
inference(beta-eta_normalization,[],[f19]) ).
thf(f21,plain,
( $true
= ( ~ ( sK1 @ ( sK0 @ sK1 ) ) ) ),
inference(and_proxy_clausification,[],[f20]) ).
thf(f22,plain,
( $true
= ( ( sK0 @ sK1 )
= ( sK0
@ ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( ( sK0 @ Y1 )
= Y0 )
& ~ ( Y1 @ ( sK0 @ Y1 ) ) ) ) ) ) ),
inference(and_proxy_clausification,[],[f20]) ).
thf(f23,plain,
( ( sK0
@ ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( ( sK0 @ Y1 )
= Y0 )
& ~ ( Y1 @ ( sK0 @ Y1 ) ) ) ) )
= ( sK0 @ sK1 ) ),
inference(equality_proxy_clausification,[],[f22]) ).
thf(f24,plain,
( ( sK1 @ ( sK0 @ sK1 ) )
= $false ),
inference(not_proxy_clausification,[],[f21]) ).
thf(f27,plain,
! [X0: $i > $o] :
( ( ( sK0 @ sK1 )
!= ( sK0 @ X0 ) )
| ( ( ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( ( sK0 @ Y1 )
= Y0 )
& ~ ( Y1 @ ( sK0 @ Y1 ) ) ) ) )
= X0 ) ),
inference(constrained_superposition,[],[f13,f23]) ).
thf(f28,plain,
( sK1
= ( ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( ( sK0 @ Y1 )
= Y0 )
& ~ ( Y1 @ ( sK0 @ Y1 ) ) ) ) ) ),
inference(equality_resolution,[],[f27]) ).
thf(f29,plain,
! [X1: $i] :
( ( sK1 @ X1 )
= ( ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( ( sK0 @ Y1 )
= Y0 )
& ~ ( Y1 @ ( sK0 @ Y1 ) ) ) )
@ X1 ) ),
inference(argument_congruence,[],[f28]) ).
thf(f30,plain,
! [X1: $i] :
( ( ( ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( ( sK0 @ Y1 )
= Y0 )
& ~ ( Y1 @ ( sK0 @ Y1 ) ) ) )
@ X1 )
= $false )
| ( ( sK1 @ X1 )
= $true ) ),
inference(iff_proxy_clausification,[],[f29]) ).
thf(f39,plain,
! [X1: $i] :
( ( ( sK1 @ X1 )
= $true )
| ( ( ?? @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( ( ( sK0 @ Y0 )
= X1 )
& ~ ( Y0 @ ( sK0 @ Y0 ) ) ) )
= $false ) ),
inference(beta-eta_normalization,[],[f30]) ).
thf(f40,plain,
! [X2: $i > $o,X1: $i] :
( ( ( ^ [Y0: $i > $o] :
( ( ( sK0 @ Y0 )
= X1 )
& ~ ( Y0 @ ( sK0 @ Y0 ) ) )
@ X2 )
= $false )
| ( ( sK1 @ X1 )
= $true ) ),
inference(pi_proxy_clausification,[],[f39]) ).
thf(f41,plain,
! [X2: $i > $o,X1: $i] :
( ( ( sK1 @ X1 )
= $true )
| ( ( ( ( sK0 @ X2 )
= X1 )
& ~ ( X2 @ ( sK0 @ X2 ) ) )
= $false ) ),
inference(beta-eta_normalization,[],[f40]) ).
thf(f42,plain,
! [X2: $i > $o,X1: $i] :
( ( ( ( sK0 @ X2 )
= X1 )
= $false )
| ( ( ~ ( X2 @ ( sK0 @ X2 ) ) )
= $false )
| ( ( sK1 @ X1 )
= $true ) ),
inference(and_proxy_clausification,[],[f41]) ).
thf(f43,plain,
! [X2: $i > $o,X1: $i] :
( ( ( sK1 @ X1 )
= $true )
| ( ( sK0 @ X2 )
!= X1 )
| ( ( ~ ( X2 @ ( sK0 @ X2 ) ) )
= $false ) ),
inference(equality_proxy_clausification,[],[f42]) ).
thf(f44,plain,
! [X2: $i > $o,X1: $i] :
( ( ( sK0 @ X2 )
!= X1 )
| ( $true
= ( X2 @ ( sK0 @ X2 ) ) )
| ( ( sK1 @ X1 )
= $true ) ),
inference(not_proxy_clausification,[],[f43]) ).
thf(f72,plain,
! [X0: $i] :
( ( ( ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( ( sK0 @ Y1 )
= Y0 )
& ~ ( Y1 @ ( sK0 @ Y1 ) ) ) )
@ ( sK0 @ sK1 ) )
= $true )
| ( $true
= ( sK1 @ X0 ) )
| ( ( sK0 @ sK1 )
!= X0 ) ),
inference(constrained_superposition,[],[f44,f23]) ).
thf(f75,plain,
! [X0: $i] :
( ( ( sK0 @ sK1 )
!= X0 )
| ( $true
= ( sK1 @ X0 ) )
| ( $true
= ( ?? @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( ( ( sK0 @ Y0 )
= ( sK0 @ sK1 ) )
& ~ ( Y0 @ ( sK0 @ Y0 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f72]) ).
thf(f76,plain,
! [X0: $i] :
( ( $true
= ( sK1 @ X0 ) )
| ( ( sK0 @ sK1 )
!= X0 )
| ( $true
= ( ^ [Y0: $i > $o] :
( ( ( sK0 @ Y0 )
= ( sK0 @ sK1 ) )
& ~ ( Y0 @ ( sK0 @ Y0 ) ) )
@ sK4 ) ) ),
inference(sigma_proxy_clausification,[],[f75]) ).
thf(f77,plain,
! [X0: $i] :
( ( ( ( ( sK0 @ sK4 )
= ( sK0 @ sK1 ) )
& ~ ( sK4 @ ( sK0 @ sK4 ) ) )
= $true )
| ( $true
= ( sK1 @ X0 ) )
| ( ( sK0 @ sK1 )
!= X0 ) ),
inference(beta-eta_normalization,[],[f76]) ).
thf(f78,plain,
! [X0: $i] :
( ( ( ~ ( sK4 @ ( sK0 @ sK4 ) ) )
= $true )
| ( ( sK0 @ sK1 )
!= X0 )
| ( $true
= ( sK1 @ X0 ) ) ),
inference(and_proxy_clausification,[],[f77]) ).
thf(f79,plain,
! [X0: $i] :
( ( $true
= ( ( sK0 @ sK4 )
= ( sK0 @ sK1 ) ) )
| ( $true
= ( sK1 @ X0 ) )
| ( ( sK0 @ sK1 )
!= X0 ) ),
inference(and_proxy_clausification,[],[f77]) ).
thf(f80,plain,
! [X0: $i] :
( ( ( sK0 @ sK1 )
= ( sK0 @ sK4 ) )
| ( $true
= ( sK1 @ X0 ) )
| ( ( sK0 @ sK1 )
!= X0 ) ),
inference(equality_proxy_clausification,[],[f79]) ).
thf(f81,plain,
! [X0: $i] :
( ( $true
= ( sK1 @ X0 ) )
| ( ( sK4 @ ( sK0 @ sK4 ) )
= $false )
| ( ( sK0 @ sK1 )
!= X0 ) ),
inference(not_proxy_clausification,[],[f78]) ).
thf(f83,definition,
( spl5_1
<=> ( ( sK0 @ sK1 )
= ( sK0 @ sK4 ) ) ),
introduced(definition,[new_symbols(definition,[spl5_1])],[avatar_definition]) ).
thf(f85,plain,
( ( ( sK0 @ sK1 )
= ( sK0 @ sK4 ) )
| ~ spl5_1 ),
inference(avatar_component_clause,[],[f83]) ).
thf(f87,definition,
( spl5_2
<=> ! [X0: $i] :
( ( $true
= ( sK1 @ X0 ) )
| ( ( sK0 @ sK1 )
!= X0 ) ) ),
introduced(definition,[new_symbols(definition,[spl5_2])],[avatar_definition]) ).
thf(f88,plain,
( ! [X0: $i] :
( ( ( sK0 @ sK1 )
!= X0 )
| ( $true
= ( sK1 @ X0 ) ) )
| ~ spl5_2 ),
inference(avatar_component_clause,[],[f87]) ).
thf(f89,plain,
( spl5_1
| spl5_2 ),
inference(avatar_split_clause,[],[f80,f87,f83]) ).
thf(f91,definition,
( spl5_3
<=> ( ( sK4 @ ( sK0 @ sK4 ) )
= $false ) ),
introduced(definition,[new_symbols(definition,[spl5_3])],[avatar_definition]) ).
thf(f93,plain,
( ( ( sK4 @ ( sK0 @ sK4 ) )
= $false )
| ~ spl5_3 ),
inference(avatar_component_clause,[],[f91]) ).
thf(f94,plain,
( spl5_2
| spl5_3 ),
inference(avatar_split_clause,[],[f81,f91,f87]) ).
thf(f96,plain,
( ( $true
= ( sK1 @ ( sK0 @ sK1 ) ) )
| ~ spl5_2 ),
inference(equality_resolution,[],[f88]) ).
thf(f97,plain,
( ( $true = $false )
| ~ spl5_2 ),
inference(forward_demodulation,[],[f96,f24]) ).
thf(f98,plain,
( $false
| ~ spl5_2 ),
inference(trivial_inequality_removal,[],[f97]) ).
thf(f99,plain,
~ spl5_2,
inference(avatar_contradiction_clause,[],[f98]) ).
thf(f100,plain,
( ( ( sK4 @ ( sK0 @ sK1 ) )
= $false )
| ~ spl5_1
| ~ spl5_3 ),
inference(forward_demodulation,[],[f93,f85]) ).
thf(f103,plain,
( ! [X0: $i] :
( ( ( sK0 @ sK1 )
!= X0 )
| ( ( sK4 @ ( sK0 @ sK1 ) )
= $true )
| ( $true
= ( sK1 @ X0 ) ) )
| ~ spl5_1 ),
inference(constrained_superposition,[],[f44,f85]) ).
thf(f111,plain,
( ! [X0: $i] :
( ( $true
= ( sK1 @ X0 ) )
| ( $true = $false )
| ( ( sK0 @ sK1 )
!= X0 ) )
| ~ spl5_1
| ~ spl5_3 ),
inference(forward_demodulation,[],[f103,f100]) ).
thf(f112,plain,
( ! [X0: $i] :
( ( ( sK0 @ sK1 )
!= X0 )
| ( $true
= ( sK1 @ X0 ) ) )
| ~ spl5_1
| ~ spl5_3 ),
inference(trivial_inequality_removal,[],[f111]) ).
thf(f115,plain,
( spl5_2
| ~ spl5_1
| ~ spl5_3 ),
inference(avatar_split_clause,[],[f112,f91,f83,f87]) ).
cnf(s1,plain,
( spl5_1
| spl5_2 ),
inference(sat_conversion,[],[f89]) ).
cnf(s2,plain,
( spl5_2
| spl5_3 ),
inference(sat_conversion,[],[f94]) ).
cnf(s3,plain,
~ spl5_2,
inference(sat_conversion,[],[f99]) ).
cnf(s4,plain,
( ~ spl5_1
| spl5_2
| ~ spl5_3 ),
inference(sat_conversion,[],[f115]) ).
cnf(s5,plain,
spl5_3,
inference(rat,[],[s2,s3]) ).
cnf(s6,plain,
~ spl5_1,
inference(rat,[],[s4,s3,s5]) ).
cnf(s7,plain,
$false,
inference(rat,[],[s1,s3,s6]) ).
thf(f116,plain,
$false,
inference(avatar_sat_refutation,[],[s7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV181^5 : TPTP v9.3.1. Bugfixed v5.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.20 % Computer : n014.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Tue Sep 29 15:18:45 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 Running higher-order theorem proving
% 0.09/0.24 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.09/0.29 % (2794337)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.09/0.29 % (2794343)lrs+10_16_si=on:nwc=1.5:random_seed=122006146:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.09/0.29 % (2794343) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2794337-2794343"...
% 0.09/0.29 % (2794348)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.09/0.29 % (2794348)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.09/0.29 % (2794343)...printing done.
% 0.09/0.29 % (2794346)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=3574342876:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.09/0.29 % (2794342)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=2192267250:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.09/0.29 % (2794344)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=1336314680:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.09/0.29 % (2794345)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=4183768599: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.09/0.29 % (2794348)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=1575539837:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.09/0.29 % (2794347)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=645101006:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.09/0.29 % (2794344)Refutation not found, incomplete strategy
% 0.09/0.29 % (2794344)------------------------------
% 0.09/0.29 % (2794344)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.29 % (2794344)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.29 % (2794344)CaDiCaL version: 2.1.3
% 0.09/0.29 % (2794344)Termination reason: Refutation not found, incomplete strategy
% 0.09/0.29 % (2794344)Time elapsed: 0.002 s
% 0.09/0.29 % (2794344)Peak memory usage: 12 MB
% 0.09/0.29 % (2794344)Instructions burned: 2 (million)
% 0.09/0.29 % (2794343)Refutation found. Thanks to Tanya!
% 0.09/0.29 % SZS status Theorem for theBenchmark
% 0.09/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.29 % (2794343)------------------------------
% 0.09/0.29 % (2794343)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.29 % (2794343)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.29 % (2794343)CaDiCaL version: 2.1.3
% 0.09/0.29 % (2794343)Termination reason: Refutation
% 0.09/0.29 % (2794343)Time elapsed: 0.004 s
% 0.09/0.29 % (2794343)Peak memory usage: 13 MB
% 0.09/0.29 % (2794343)Instructions burned: 10 (million)
% 0.09/0.29 % (2794337)Success in time 0.04 s
% 0.09/0.29 % Vampire exiting
%------------------------------------------------------------------------------