%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO542^1 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:48:23 AM UTC 2026
% Result : Theorem 0.20s 0.27s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 31
% Number of leaves : 3
% Syntax : Number of formulae : 60 ( 15 unt; 0 typ; 0 def)
% Number of atoms : 280 ( 183 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 414 ( 78 ~; 82 |; 48 &; 203 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 164 ( 164 >; 0 *; 0 +; 0 <<)
% Number of symbols : 22 ( 19 usr; 3 con; 0-4 aty)
% Number of variables : 183 ( 47 ^; 127 !; 9 ?; 183 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
epsii: ( ( $i > $i ) > $o ) > $i > $i ).
thf(func_def_2,type,
if: $o > ( $i > $i ) > ( $i > $i ) > $i > $i ).
thf(func_def_5,type,
vOR: $o > $o > $o ).
thf(func_def_6,type,
vAND: $o > $o > $o ).
thf(func_def_7,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_8,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_9,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_10,type,
vNOT: $o > $o ).
thf(func_def_11,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_12,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_13,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_14,type,
sK0: $o ).
thf(func_def_15,type,
sK1: $i > $i ).
thf(func_def_16,type,
sK2: $i > $i ).
thf(func_def_21,type,
sK7: $o > $i ).
thf(func_def_22,type,
sK8: $o > $i ).
thf(func_def_23,type,
sK9: ( $i > $i ) > $i ).
thf(func_def_24,type,
sK10: ( $i > $i ) > $i ).
thf(f1,axiom,
! [X0: ( $i > $i ) > $o] :
( ? [X1: $i > $i] : ( X0 @ X1 )
=> ( X0 @ ( epsii @ X0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',choiceaxii) ).
thf(f2,axiom,
( if
= ( ^ [X0: $o,X1: $i > $i,X2: $i > $i] :
( epsii
@ ^ [X3: $i > $i] :
( ( ( X3 = X1 )
& X0 )
| ( ~ X0
& ( X3 = X2 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifd) ).
thf(f3,conjecture,
! [X0: $o,X2: $i > $i,X1: $i > $i] :
( ( ( if @ X0 @ X1 @ X2 )
= X2 )
| ( ( if @ X0 @ X1 @ X2 )
= X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
thf(f4,negated_conjecture,
~ ! [X0: $o,X2: $i > $i,X1: $i > $i] :
( ( ( if @ X0 @ X1 @ X2 )
= X2 )
| ( ( if @ X0 @ X1 @ X2 )
= X1 ) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
thf(f5,plain,
! [X0: ( $i > $i ) > $o] :
( ? [X1: $i > $i] : ( X0 @ X1 )
=> ( X0 @ ( epsii @ X0 ) ) ),
inference(rectify,[],[f1]) ).
thf(f6,plain,
! [X0: ( $i > $i ) > $o] :
( ? [X1: $i > $i] :
( ( X0 @ X1 )
= $true )
=> ( ( X0 @ ( epsii @ X0 ) )
= $true ) ),
inference(fool_elimination,[],[f5]) ).
thf(f7,plain,
( if
= ( ^ [X0: $o,X1: $i > $i,X2: $i > $i] :
( epsii
@ ^ [X3: $i > $i] :
( ( ( X3 = X1 )
& X0 )
| ( ~ X0
& ( X3 = X2 ) ) ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f8,plain,
( if
= ( ^ [Y0: $o,Y1: $i > $i,Y2: $i > $i] :
( epsii
@ ^ [Y3: $i > $i] :
( ( ( Y2 = Y3 )
& ~ Y0 )
| ( Y0
& ( Y1 = Y3 ) ) ) ) ) ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
! [X0: ( $i > $i ) > $o] :
( ( ( X0 @ ( epsii @ X0 ) )
= $true )
| ! [X1: $i > $i] :
( ( X0 @ X1 )
!= $true ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f10,plain,
? [X0: $o,X2: $i > $i,X1: $i > $i] :
( ( ( if @ X0 @ X1 @ X2 )
!= X1 )
& ( ( if @ X0 @ X1 @ X2 )
!= X2 ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f11,plain,
? [X0: $o,X1: $i > $i,X2: $i > $i] :
( ( ( if @ X0 @ X2 @ X1 )
!= X2 )
& ( ( if @ X0 @ X2 @ X1 )
!= X1 ) ),
inference(rectify,[],[f10]) ).
thf(f12,plain,
( ( sK2
!= ( if @ sK0 @ sK2 @ sK1 ) )
& ( ( if @ sK0 @ sK2 @ sK1 )
!= sK1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f11]) ).
thf(f13,plain,
! [X0: ( $i > $i ) > $o,X1: $i > $i] :
( ( ( X0 @ X1 )
!= $true )
| ( ( X0 @ ( epsii @ X0 ) )
= $true ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f14,plain,
( ( if @ sK0 @ sK2 @ sK1 )
!= sK1 ),
inference(cnf_transformation,[],[f12]) ).
thf(f15,plain,
( sK2
!= ( if @ sK0 @ sK2 @ sK1 ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f16,plain,
( if
= ( ^ [Y0: $o,Y1: $i > $i,Y2: $i > $i] :
( epsii
@ ^ [Y3: $i > $i] :
( ( ( Y2 = Y3 )
& ~ Y0 )
| ( Y0
& ( Y1 = Y3 ) ) ) ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f20,plain,
( ( sK2
!= ( if @ $true @ sK2 @ sK1 ) )
| ( $false = sK0 ) ),
inference(fool_paramodulation,[],[f15]) ).
thf(f28,plain,
! [X2: ( $i > $i ) > $o,X1: $i > $i] :
( ( ( ^ [Y0: $i > $i] :
~ ( X2 @ Y0 )
@ X1 )
!= $true )
| ( ( ^ [Y0: $i > $i] :
~ ( X2 @ Y0 )
@ ( epsii
@ ^ [Y0: $i > $i] :
~ ( X2 @ Y0 ) ) )
= $true ) ),
inference(primitive_instantiation,[],[f13]) ).
thf(f30,plain,
! [X2: ( $i > $i ) > $o,X1: $i > $i] :
( ( ( ~ ( X2
@ ( epsii
@ ^ [Y0: $i > $i] :
~ ( X2 @ Y0 ) ) ) )
= $true )
| ( $true
!= ( ~ ( X2 @ X1 ) ) ) ),
inference(beta-eta_normalization,[],[f28]) ).
thf(f31,plain,
! [X2: ( $i > $i ) > $o,X1: $i > $i] :
( ( $false
= ( X2
@ ( epsii
@ ^ [Y0: $i > $i] :
~ ( X2 @ Y0 ) ) ) )
| ( $true
!= ( ~ ( X2 @ X1 ) ) ) ),
inference(not_proxy_clausification,[],[f30]) ).
thf(f32,plain,
! [X2: ( $i > $i ) > $o,X1: $i > $i] :
( ( $false
= ( X2
@ ( epsii
@ ^ [Y0: $i > $i] :
~ ( X2 @ Y0 ) ) ) )
| ( $true
= ( X2 @ X1 ) ) ),
inference(not_proxy_clausification,[],[f31]) ).
thf(f37,plain,
! [X1: $o] :
( ( ^ [Y0: $o,Y1: $i > $i,Y2: $i > $i] :
( epsii
@ ^ [Y3: $i > $i] :
( ( ( Y2 = Y3 )
& ~ Y0 )
| ( Y0
& ( Y1 = Y3 ) ) ) )
@ X1 )
= ( if @ X1 ) ),
inference(argument_congruence,[],[f16]) ).
thf(f38,plain,
! [X1: $o] :
( ( if @ X1 )
= ( ^ [Y0: $i > $i,Y1: $i > $i] :
( epsii
@ ^ [Y2: $i > $i] :
( ( ( Y1 = Y2 )
& ~ X1 )
| ( X1
& ( Y0 = Y2 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f37]) ).
thf(f46,plain,
! [X3: ( $i > $i ) > $o,X1: $i > $i] :
( ( $false
= ( ^ [Y0: $i > $i] :
~ ( X3 @ Y0 )
@ ( epsii
@ ^ [Y0: $i > $i] :
~ ( ^ [Y1: $i > $i] :
~ ( X3 @ Y1 )
@ Y0 ) ) ) )
| ( $true
= ( ^ [Y0: $i > $i] :
~ ( X3 @ Y0 )
@ X1 ) ) ),
inference(primitive_instantiation,[],[f32]) ).
thf(f57,plain,
! [X3: ( $i > $i ) > $o,X1: $i > $i] :
( ( $false
= ( ~ ( X3
@ ( epsii
@ ^ [Y0: $i > $i] :
~ ~ ( X3 @ Y0 ) ) ) ) )
| ( $true
= ( ~ ( X3 @ X1 ) ) ) ),
inference(beta-eta_normalization,[],[f46]) ).
thf(f58,plain,
! [X3: ( $i > $i ) > $o,X1: $i > $i] :
( ( ( X3
@ ( epsii
@ ^ [Y0: $i > $i] :
~ ~ ( X3 @ Y0 ) ) )
= $true )
| ( $true
= ( ~ ( X3 @ X1 ) ) ) ),
inference(not_proxy_clausification,[],[f57]) ).
thf(f59,plain,
! [X3: ( $i > $i ) > $o,X1: $i > $i] :
( ( ( X3
@ ( epsii
@ ^ [Y0: $i > $i] :
~ ~ ( X3 @ Y0 ) ) )
= $true )
| ( ( X3 @ X1 )
= $false ) ),
inference(not_proxy_clausification,[],[f58]) ).
thf(f60,plain,
! [X3: ( $i > $i ) > $o,X1: $i > $i] :
( ( ( X3
@ ( epsii
@ ^ [Y0: $i > $i] : ( X3 @ Y0 ) ) )
= $true )
| ( ( X3 @ X1 )
= $false ) ),
inference(boolean_simplification,[],[f59]) ).
thf(f61,plain,
! [X3: ( $i > $i ) > $o,X1: $i > $i] :
( ( ( X3 @ ( epsii @ X3 ) )
= $true )
| ( ( X3 @ X1 )
= $false ) ),
inference(beta-eta_normalization,[],[f60]) ).
thf(f69,plain,
! [X2: $i > $i,X1: $o] :
( ( ^ [Y0: $i > $i,Y1: $i > $i] :
( epsii
@ ^ [Y2: $i > $i] :
( ( ( Y1 = Y2 )
& ~ X1 )
| ( X1
& ( Y0 = Y2 ) ) ) )
@ X2 )
= ( if @ X1 @ X2 ) ),
inference(argument_congruence,[],[f38]) ).
thf(f70,plain,
! [X2: $i > $i,X1: $o] :
( ( if @ X1 @ X2 )
= ( ^ [Y0: $i > $i] :
( epsii
@ ^ [Y1: $i > $i] :
( ( ( Y0 = Y1 )
& ~ X1 )
| ( X1
& ( X2 = Y1 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f69]) ).
thf(f103,plain,
! [X2: $i > $i,X3: $i > $i,X1: $o] :
( ( if @ X1 @ X2 @ X3 )
= ( ^ [Y0: $i > $i] :
( epsii
@ ^ [Y1: $i > $i] :
( ( ( Y0 = Y1 )
& ~ X1 )
| ( X1
& ( X2 = Y1 ) ) ) )
@ X3 ) ),
inference(argument_congruence,[],[f70]) ).
thf(f104,plain,
! [X2: $i > $i,X3: $i > $i,X1: $o] :
( ( if @ X1 @ X2 @ X3 )
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ( X3 = Y0 )
& ~ X1 )
| ( X1
& ( X2 = Y0 ) ) ) ) ),
inference(beta-eta_normalization,[],[f103]) ).
thf(f106,plain,
! [X2: $i > $i,X3: $i > $i,X0: $o,X1: $i > $i] :
( ( ( ^ [Y0: $i > $i] :
( ( ( X2 = Y0 )
& ~ X0 )
| ( X0
& ( X1 = Y0 ) ) )
@ ( if @ X0 @ X1 @ X2 ) )
= $true )
| ( $false
= ( ^ [Y0: $i > $i] :
( ( ( X2 = Y0 )
& ~ X0 )
| ( X0
& ( X1 = Y0 ) ) )
@ X3 ) ) ),
inference(superposition,[],[f61,f104]) ).
thf(f107,plain,
! [X2: $i > $i,X3: $i > $i,X0: $o,X1: $i > $i] :
( ( $true
= ( ( ( X2
= ( if @ X0 @ X1 @ X2 ) )
& ~ X0 )
| ( X0
& ( X1
= ( if @ X0 @ X1 @ X2 ) ) ) ) )
| ( $false
= ( ( ( X2 = X3 )
& ~ X0 )
| ( X0
& ( X1 = X3 ) ) ) ) ),
inference(beta-eta_normalization,[],[f106]) ).
thf(f108,plain,
! [X2: $i > $i,X3: $i > $i,X0: $o,X1: $i > $i] :
( ( $false
= ( ( ( X2 = X3 )
& ~ X0 )
| ( X0
& ( X1 = X3 ) ) ) )
| ( ( ( X2
= ( if @ X0 @ X1 @ X2 ) )
& ~ X0 )
= $true )
| ( ( X0
& ( X1
= ( if @ X0 @ X1 @ X2 ) ) )
= $true ) ),
inference(or_proxy_clausification,[],[f107]) ).
thf(f109,plain,
! [X2: $i > $i,X3: $i > $i,X0: $o,X1: $i > $i] :
( ( ( X0
& ( X1
= ( if @ X0 @ X1 @ X2 ) ) )
= $true )
| ( ( ( X2
= ( if @ X0 @ X1 @ X2 ) )
& ~ X0 )
= $true )
| ( $false
= ( X0
& ( X1 = X3 ) ) ) ),
inference(or_proxy_clausification,[],[f108]) ).
thf(f110,plain,
! [X2: $i > $i,X3: $i > $i,X0: $o,X1: $i > $i] :
( ( ( ( X2
= ( if @ X0 @ X1 @ X2 ) )
& ~ X0 )
= $true )
| ( ( ( X2 = X3 )
& ~ X0 )
= $false )
| ( ( X0
& ( X1
= ( if @ X0 @ X1 @ X2 ) ) )
= $true ) ),
inference(or_proxy_clausification,[],[f108]) ).
thf(f112,plain,
! [X2: $i > $i,X3: $i > $i,X0: $o,X1: $i > $i] :
( ( ( X0
& ( X1
= ( if @ X0 @ X1 @ X2 ) ) )
= $true )
| ( ( ( X2 = X3 )
& ~ X0 )
= $false )
| ( ( X2
= ( if @ X0 @ X1 @ X2 ) )
= $true ) ),
inference(and_proxy_clausification,[],[f110]) ).
thf(f114,plain,
! [X2: $i > $i,X3: $i > $i,X0: $o,X1: $i > $i] :
( ( $true = X0 )
| ( ( X2
= ( if @ X0 @ X1 @ X2 ) )
= $true )
| ( ( ( X2 = X3 )
& ~ X0 )
= $false ) ),
inference(and_proxy_clausification,[],[f112]) ).
thf(f115,plain,
! [X2: $i > $i,X3: $i > $i,X0: $o,X1: $i > $i] :
( ( ( ( X2 = X3 )
& ~ X0 )
= $false )
| ( ( if @ X0 @ X1 @ X2 )
= X2 )
| ( $true = X0 ) ),
inference(equality_proxy_clausification,[],[f114]) ).
thf(f116,plain,
! [X2: $i > $i,X3: $i > $i,X0: $o,X1: $i > $i] :
( ( ( if @ X0 @ X1 @ X2 )
= X2 )
| ( $true = X0 )
| ( ( ~ X0 ) = $false )
| ( ( X2 = X3 )
= $false ) ),
inference(and_proxy_clausification,[],[f115]) ).
thf(f117,plain,
! [X2: $i > $i,X3: $i > $i,X0: $o,X1: $i > $i] :
( ( ( X2 = X3 )
= $false )
| ( ( if @ X0 @ X1 @ X2 )
= X2 )
| ( $true = X0 )
| ( $true = X0 ) ),
inference(not_proxy_clausification,[],[f116]) ).
thf(f118,plain,
! [X2: $i > $i,X3: $i > $i,X0: $o,X1: $i > $i] :
( ( $true = X0 )
| ( ( if @ X0 @ X1 @ X2 )
= X2 )
| ( X2 != X3 )
| ( $true = X0 ) ),
inference(equality_proxy_clausification,[],[f117]) ).
thf(f119,plain,
! [X2: $i > $i,X3: $i > $i,X0: $o,X1: $i > $i] :
( ( ( if @ X0 @ X1 @ X2 )
= X2 )
| ( $true = X0 )
| ( X2 != X3 ) ),
inference(duplicate_literal_removal,[],[f118]) ).
thf(f134,plain,
! [X2: $i > $i,X3: $i > $i,X0: $o,X1: $i > $i] :
( ( $false
= ( X0
& ( X1 = X3 ) ) )
| ( ( ( X2
= ( if @ X0 @ X1 @ X2 ) )
& ~ X0 )
= $true )
| ( ( X1
= ( if @ X0 @ X1 @ X2 ) )
= $true ) ),
inference(and_proxy_clausification,[],[f109]) ).
thf(f145,plain,
! [X2: $i > $i,X3: $i > $i,X0: $o,X1: $i > $i] :
( ( ( ( X2
= ( if @ X0 @ X1 @ X2 ) )
& ~ X0 )
= $true )
| ( ( X1
= ( if @ X0 @ X1 @ X2 ) )
= $true )
| ( ( X1 = X3 )
= $false )
| ( $false = X0 ) ),
inference(and_proxy_clausification,[],[f134]) ).
thf(f146,plain,
! [X2: $i > $i,X3: $i > $i,X0: $o,X1: $i > $i] :
( ( ( X1
= ( if @ X0 @ X1 @ X2 ) )
= $true )
| ( ( ~ X0 ) = $true )
| ( ( X1 = X3 )
= $false )
| ( $false = X0 ) ),
inference(and_proxy_clausification,[],[f145]) ).
thf(f151,plain,
! [X2: $i > $i,X3: $i > $i,X0: $o,X1: $i > $i] :
( ( ( X1 = X3 )
= $false )
| ( ( if @ X0 @ X1 @ X2 )
= X1 )
| ( $false = X0 )
| ( ( ~ X0 ) = $true ) ),
inference(equality_proxy_clausification,[],[f146]) ).
thf(f152,plain,
! [X2: $i > $i,X3: $i > $i,X0: $o,X1: $i > $i] :
( ( ( ~ X0 ) = $true )
| ( X1 != X3 )
| ( ( if @ X0 @ X1 @ X2 )
= X1 )
| ( $false = X0 ) ),
inference(equality_proxy_clausification,[],[f151]) ).
thf(f153,plain,
! [X2: $i > $i,X3: $i > $i,X0: $o,X1: $i > $i] :
( ( $false = X0 )
| ( ( if @ X0 @ X1 @ X2 )
= X1 )
| ( X1 != X3 )
| ( $false = X0 ) ),
inference(not_proxy_clausification,[],[f152]) ).
thf(f154,plain,
! [X2: $i > $i,X3: $i > $i,X0: $o,X1: $i > $i] :
( ( ( if @ X0 @ X1 @ X2 )
= X1 )
| ( $false = X0 )
| ( X1 != X3 ) ),
inference(duplicate_literal_removal,[],[f153]) ).
thf(f182,plain,
! [X0: $i > $i] :
( ( sK1 != X0 )
| ( sK0 = $true )
| ( sK1 != sK1 ) ),
inference(superposition,[],[f14,f119]) ).
thf(f185,plain,
! [X0: $i > $i] :
( ( sK1 != X0 )
| ( sK0 = $true ) ),
inference(trivial_inequality_removal,[],[f182]) ).
thf(f189,plain,
sK0 = $true,
inference(equality_resolution,[],[f185]) ).
thf(f194,plain,
! [X0: $i > $i] :
( ( sK2 != X0 )
| ( sK2 != sK2 )
| ( $false = sK0 )
| ( $false = $true ) ),
inference(superposition,[],[f20,f154]) ).
thf(f203,plain,
! [X0: $i > $i] :
( ( sK2 != X0 )
| ( $false = sK0 ) ),
inference(trivial_inequality_removal,[],[f194]) ).
thf(f210,plain,
! [X0: $i > $i] :
( ( sK2 != X0 )
| ( $false = $true ) ),
inference(forward_demodulation,[],[f203,f189]) ).
thf(f211,plain,
! [X0: $i > $i] : ( sK2 != X0 ),
inference(trivial_inequality_removal,[],[f210]) ).
thf(f214,plain,
$false,
inference(equality_resolution,[],[f211]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO542^1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n020.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 17:14:50 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.21 Running higher-order theorem proving
% 0.08/0.23 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.20/0.27 % (1339799)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.20/0.27 % (1339808)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=620118306:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.20/0.27 % (1339808) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1339799-1339808"...
% 0.20/0.27 % (1339810)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.20/0.27 % (1339810)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.20/0.27 % (1339808)...printing done.
% 0.20/0.27 % (1339808)Refutation found. Thanks to Tanya!
% 0.20/0.27 % SZS status Theorem for theBenchmark
% 0.20/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.27 % (1339808)------------------------------
% 0.20/0.27 % (1339808)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (1339808)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (1339808)CaDiCaL version: 2.1.3
% 0.20/0.27 % (1339808)Termination reason: Refutation
% 0.20/0.27 % (1339808)Time elapsed: 0.005 s
% 0.20/0.27 % (1339808)Peak memory usage: 12 MB
% 0.20/0.27 % (1339808)Instructions burned: 16 (million)
% 0.20/0.27 % (1339799)Success in time 0.034 s
% 0.20/0.27 % Vampire exiting
%------------------------------------------------------------------------------