%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO016^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n007.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:46:17 AM UTC 2026
% Result : Theorem 0.07s 0.25s
% Output : Refutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 11
% Syntax : Number of formulae : 95 ( 17 unt; 0 typ; 9 def)
% Number of atoms : 583 ( 94 equ; 0 cnn)
% Maximal formula atoms : 9 ( 6 avg)
% Number of connectives : 563 ( 106 ~; 143 |; 0 &; 277 @)
% ( 9 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 32 ( 32 >; 0 *; 0 +; 0 <<)
% Number of symbols : 25 ( 21 usr; 12 con; 0-4 aty)
% ( 11 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 72 ( 0 sgn 41 !; 0 ?; 72 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
leibeq: $o > $o > $o ).
thf(func_def_2,type,
h: $o > $o ).
thf(func_def_5,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_6,type,
vIMP: $o > $o > $o ).
thf(func_def_7,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_8,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_9,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_10,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_11,type,
vNOT: $o > $o ).
thf(func_def_13,type,
sK1: $o > $o > $o > $o ).
thf(func_def_14,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(f1,axiom,
( ( ^ [X0: $o,X1: $o] :
! [X2: $o > $o] :
( ( X2 @ X0 )
=> ( X2 @ X1 ) ) )
= leibeq ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leibeq) ).
thf(f2,conjecture,
leibeq @ ( h @ ( leibeq @ ( h @ $true ) @ ( h @ $false ) ) ) @ ( h @ $false ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
thf(f3,negated_conjecture,
~ ( leibeq @ ( h @ ( leibeq @ ( h @ $true ) @ ( h @ $false ) ) ) @ ( h @ $false ) ),
inference(negated_conjecture,[status(cth)],[f2]) ).
thf(f4,plain,
~ ( leibeq @ ( h @ ( leibeq @ ( h @ $true ) @ ( h @ $false ) ) ) @ ( h @ $false ) ),
inference(rectify,[],[f3]) ).
thf(f5,plain,
( $true
!= ( leibeq @ ( h @ ( leibeq @ ( h @ $true ) @ ( h @ $false ) ) ) @ ( h @ $false ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f6,plain,
( ( ^ [X0: $o,X1: $o] :
! [X2: $o > $o] :
( ( X2 @ X0 )
=> ( X2 @ X1 ) ) )
= leibeq ),
inference(rectify,[],[f1]) ).
thf(f7,plain,
( leibeq
= ( ^ [Y0: $o,Y1: $o] :
( !! @ ( $o > $o )
@ ^ [Y2: $o > $o] :
( ( Y2 @ Y0 )
=> ( Y2 @ Y1 ) ) ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f8,plain,
( $true
!= ( leibeq @ ( h @ ( leibeq @ ( h @ $true ) @ ( h @ $false ) ) ) @ ( h @ $false ) ) ),
inference(flattening,[],[f5]) ).
thf(f9,plain,
( $true
!= ( leibeq @ ( h @ ( leibeq @ ( h @ $true ) @ ( h @ $false ) ) ) @ ( h @ $false ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f10,plain,
( leibeq
= ( ^ [Y0: $o,Y1: $o] :
( !! @ ( $o > $o )
@ ^ [Y2: $o > $o] :
( ( Y2 @ Y0 )
=> ( Y2 @ Y1 ) ) ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f13,definition,
( spl0_1
<=> ( leibeq
= ( ^ [Y0: $o,Y1: $o] :
( !! @ ( $o > $o )
@ ^ [Y2: $o > $o] :
( ( Y2 @ Y0 )
=> ( Y2 @ Y1 ) ) ) ) ) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
thf(f15,plain,
( ( leibeq
= ( ^ [Y0: $o,Y1: $o] :
( !! @ ( $o > $o )
@ ^ [Y2: $o > $o] :
( ( Y2 @ Y0 )
=> ( Y2 @ Y1 ) ) ) ) )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f13]) ).
thf(f16,plain,
spl0_1,
inference(avatar_split_clause,[],[f10,f13]) ).
thf(f18,definition,
( spl0_2
<=> ( $true
= ( leibeq @ ( h @ ( leibeq @ ( h @ $true ) @ ( h @ $false ) ) ) @ ( h @ $false ) ) ) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
thf(f20,plain,
( ( $true
!= ( leibeq @ ( h @ ( leibeq @ ( h @ $true ) @ ( h @ $false ) ) ) @ ( h @ $false ) ) )
| spl0_2 ),
inference(avatar_component_clause,[],[f18]) ).
thf(f21,plain,
~ spl0_2,
inference(avatar_split_clause,[],[f9,f18]) ).
thf(f22,plain,
( ! [X1: $o] :
( ( ^ [Y0: $o,Y1: $o] :
( !! @ ( $o > $o )
@ ^ [Y2: $o > $o] :
( ( Y2 @ Y0 )
=> ( Y2 @ Y1 ) ) )
@ X1 )
= ( leibeq @ X1 ) )
| ~ spl0_1 ),
inference(argument_congruence,[],[f15]) ).
thf(f23,plain,
( ! [X1: $o] :
( ( ^ [Y0: $o] :
( !! @ ( $o > $o )
@ ^ [Y1: $o > $o] :
( ( Y1 @ X1 )
=> ( Y1 @ Y0 ) ) ) )
= ( leibeq @ X1 ) )
| ~ spl0_1 ),
inference(beta-eta_normalization,[],[f22]) ).
thf(f24,plain,
( ! [X2: $o,X1: $o] :
( ( ^ [Y0: $o] :
( !! @ ( $o > $o )
@ ^ [Y1: $o > $o] :
( ( Y1 @ X1 )
=> ( Y1 @ Y0 ) ) )
@ X2 )
= ( leibeq @ X1 @ X2 ) )
| ~ spl0_1 ),
inference(argument_congruence,[],[f23]) ).
thf(f25,plain,
( ! [X2: $o,X1: $o] :
( ( ( ^ [Y0: $o] :
( !! @ ( $o > $o )
@ ^ [Y1: $o > $o] :
( ( Y1 @ X1 )
=> ( Y1 @ Y0 ) ) )
@ X2 )
= $true )
| ( $false
= ( leibeq @ X1 @ X2 ) ) )
| ~ spl0_1 ),
inference(iff_proxy_clausification,[],[f24]) ).
thf(f26,plain,
( ! [X2: $o,X1: $o] :
( ( ( leibeq @ X1 @ X2 )
= $true )
| ( ( ^ [Y0: $o] :
( !! @ ( $o > $o )
@ ^ [Y1: $o > $o] :
( ( Y1 @ X1 )
=> ( Y1 @ Y0 ) ) )
@ X2 )
= $false ) )
| ~ spl0_1 ),
inference(iff_proxy_clausification,[],[f24]) ).
thf(f27,plain,
( ! [X2: $o,X1: $o] :
( ( $false
= ( !! @ ( $o > $o )
@ ^ [Y0: $o > $o] :
( ( Y0 @ X1 )
=> ( Y0 @ X2 ) ) ) )
| ( ( leibeq @ X1 @ X2 )
= $true ) )
| ~ spl0_1 ),
inference(beta-eta_normalization,[],[f26]) ).
thf(f28,plain,
( ! [X2: $o,X1: $o] :
( ( $false
= ( ^ [Y0: $o > $o] :
( ( Y0 @ X1 )
=> ( Y0 @ X2 ) )
@ ( sK1 @ X1 @ X2 ) ) )
| ( ( leibeq @ X1 @ X2 )
= $true ) )
| ~ spl0_1 ),
inference(sigma_proxy_clausification,[],[f27]) ).
thf(f29,plain,
( ! [X2: $o,X1: $o] :
( ( $false
= ( ( sK1 @ X1 @ X2 @ X1 )
=> ( sK1 @ X1 @ X2 @ X2 ) ) )
| ( ( leibeq @ X1 @ X2 )
= $true ) )
| ~ spl0_1 ),
inference(beta-eta_normalization,[],[f28]) ).
thf(f30,plain,
( ! [X2: $o,X1: $o] :
( ( $false
= ( sK1 @ X1 @ X2 @ X2 ) )
| ( ( leibeq @ X1 @ X2 )
= $true ) )
| ~ spl0_1 ),
inference(imp_proxy_clausification,[],[f29]) ).
thf(f31,plain,
( ! [X2: $o,X1: $o] :
( ( $true
= ( sK1 @ X1 @ X2 @ X1 ) )
| ( ( leibeq @ X1 @ X2 )
= $true ) )
| ~ spl0_1 ),
inference(imp_proxy_clausification,[],[f29]) ).
thf(f32,plain,
( ! [X2: $o,X1: $o] :
( ( $true
= ( !! @ ( $o > $o )
@ ^ [Y0: $o > $o] :
( ( Y0 @ X1 )
=> ( Y0 @ X2 ) ) ) )
| ( $false
= ( leibeq @ X1 @ X2 ) ) )
| ~ spl0_1 ),
inference(beta-eta_normalization,[],[f25]) ).
thf(f33,plain,
( ! [X2: $o,X3: $o > $o,X1: $o] :
( ( $false
= ( leibeq @ X1 @ X2 ) )
| ( $true
= ( ^ [Y0: $o > $o] :
( ( Y0 @ X1 )
=> ( Y0 @ X2 ) )
@ X3 ) ) )
| ~ spl0_1 ),
inference(pi_proxy_clausification,[],[f32]) ).
thf(f34,plain,
( ! [X2: $o,X3: $o > $o,X1: $o] :
( ( $true
= ( ( X3 @ X1 )
=> ( X3 @ X2 ) ) )
| ( $false
= ( leibeq @ X1 @ X2 ) ) )
| ~ spl0_1 ),
inference(beta-eta_normalization,[],[f33]) ).
thf(f35,plain,
( ! [X2: $o,X3: $o > $o,X1: $o] :
( ( $false
= ( leibeq @ X1 @ X2 ) )
| ( $false
= ( X3 @ X1 ) )
| ( $true
= ( X3 @ X2 ) ) )
| ~ spl0_1 ),
inference(imp_proxy_clausification,[],[f34]) ).
thf(f36,plain,
( ! [X0: $o] :
( ( $false = $true )
| ( ( leibeq @ X0 @ X0 )
= $true )
| ( ( leibeq @ X0 @ X0 )
= $true ) )
| ~ spl0_1 ),
inference(superposition,[],[f31,f30]) ).
thf(f38,plain,
( ! [X0: $o] :
( ( $false = $true )
| ( ( leibeq @ X0 @ X0 )
= $true ) )
| ~ spl0_1 ),
inference(duplicate_literal_removal,[],[f36]) ).
thf(f39,plain,
( ! [X0: $o] :
( ( leibeq @ X0 @ X0 )
= $true )
| ~ spl0_1 ),
inference(trivial_inequality_removal,[],[f38]) ).
thf(f44,plain,
( ( $false
= ( h @ ( leibeq @ ( h @ $true ) @ ( h @ $false ) ) ) )
| ( $true
!= ( leibeq @ $true @ ( h @ $false ) ) )
| spl0_2 ),
inference(fool_paramodulation,[],[f20]) ).
thf(f47,definition,
( spl0_3
<=> ( $false
= ( h @ $false ) ) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
thf(f49,plain,
( ( $false
= ( h @ $false ) )
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f47]) ).
thf(f65,definition,
( spl0_7
<=> ( $true
= ( leibeq @ $true @ ( h @ $false ) ) ) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
thf(f66,plain,
( ( $true
= ( leibeq @ $true @ ( h @ $false ) ) )
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f65]) ).
thf(f67,plain,
( ( $true
!= ( leibeq @ $true @ ( h @ $false ) ) )
| spl0_7 ),
inference(avatar_component_clause,[],[f65]) ).
thf(f69,definition,
( spl0_8
<=> ( $false
= ( h @ ( leibeq @ ( h @ $true ) @ ( h @ $false ) ) ) ) ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
thf(f71,plain,
( ( $false
= ( h @ ( leibeq @ ( h @ $true ) @ ( h @ $false ) ) ) )
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f69]) ).
thf(f72,plain,
( ~ spl0_7
| spl0_8
| spl0_2 ),
inference(avatar_split_clause,[],[f44,f18,f69,f65]) ).
thf(f74,definition,
( spl0_9
<=> ( $false
= ( h @ $true ) ) ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
thf(f76,plain,
( ( $false
= ( h @ $true ) )
| ~ spl0_9 ),
inference(avatar_component_clause,[],[f74]) ).
thf(f83,plain,
( ! [X0: $o,X1: $o] :
( ( X0 = X1 )
| ( $false
= ( leibeq @ X0 @ X1 ) ) )
| ~ spl0_1 ),
inference(leibniz_equality_elimination,[],[f35]) ).
thf(f91,plain,
( ! [X0: $o,X1: $o] :
( ( $false
= ( leibeq @ X0 @ X1 ) )
| ( $true = X1 )
| ( $false = X0 ) )
| ~ spl0_1 ),
inference(iff_proxy_clausification,[],[f83]) ).
thf(f95,plain,
( ( $true
!= ( leibeq @ $true @ $true ) )
| ( $false
= ( h @ $false ) )
| spl0_7 ),
inference(fool_paramodulation,[],[f67]) ).
thf(f97,plain,
( ( $false
= ( h @ $false ) )
| ~ spl0_1
| spl0_7 ),
inference(forward_subsumption_resolution,[],[f95,f39]) ).
thf(f98,plain,
( spl0_3
| ~ spl0_1
| spl0_7 ),
inference(avatar_split_clause,[],[f97,f65,f13,f47]) ).
thf(f104,plain,
( ( $false
= ( h @ $true ) )
| ( $false
= ( h @ ( leibeq @ $true @ ( h @ $false ) ) ) )
| ~ spl0_8 ),
inference(fool_paramodulation,[],[f71]) ).
thf(f109,plain,
( ( $false
= ( h @ $true ) )
| ( $false
= ( h @ $true ) )
| ~ spl0_7
| ~ spl0_8 ),
inference(forward_demodulation,[],[f104,f66]) ).
thf(f110,plain,
( ( $false
= ( h @ $true ) )
| ~ spl0_7
| ~ spl0_8 ),
inference(duplicate_literal_removal,[],[f109]) ).
thf(f126,plain,
( spl0_9
| ~ spl0_7
| ~ spl0_8 ),
inference(avatar_split_clause,[],[f110,f69,f65,f74]) ).
thf(f145,plain,
( ( $false
= ( h @ ( leibeq @ $false @ ( h @ $false ) ) ) )
| ~ spl0_8
| ~ spl0_9 ),
inference(superposition,[],[f71,f76]) ).
thf(f146,plain,
( ( ( leibeq @ ( h @ ( leibeq @ $false @ ( h @ $false ) ) ) @ ( h @ $false ) )
!= $true )
| spl0_2
| ~ spl0_9 ),
inference(superposition,[],[f20,f76]) ).
thf(f147,plain,
( ( $true
!= ( leibeq @ ( h @ ( leibeq @ $false @ $false ) ) @ $false ) )
| spl0_2
| ~ spl0_3
| ~ spl0_9 ),
inference(forward_demodulation,[],[f146,f49]) ).
thf(f149,plain,
( ( $true
!= ( leibeq @ ( h @ $true ) @ $false ) )
| ~ spl0_1
| spl0_2
| ~ spl0_3
| ~ spl0_9 ),
inference(forward_demodulation,[],[f147,f39]) ).
thf(f151,plain,
( ( $true
!= ( leibeq @ $false @ $false ) )
| ~ spl0_1
| spl0_2
| ~ spl0_3
| ~ spl0_9 ),
inference(forward_demodulation,[],[f149,f76]) ).
thf(f152,plain,
( $false
| ~ spl0_1
| spl0_2
| ~ spl0_3
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f151,f39]) ).
thf(f153,plain,
( ~ spl0_1
| spl0_2
| ~ spl0_3
| ~ spl0_9 ),
inference(avatar_contradiction_clause,[],[f152]) ).
thf(f155,definition,
( spl0_17
<=> ( $false
= ( h @ ( leibeq @ $false @ ( h @ $false ) ) ) ) ),
introduced(definition,[new_symbols(definition,[spl0_17])],[avatar_definition]) ).
thf(f157,plain,
( ( $false
= ( h @ ( leibeq @ $false @ ( h @ $false ) ) ) )
| ~ spl0_17 ),
inference(avatar_component_clause,[],[f155]) ).
thf(f158,plain,
( spl0_17
| ~ spl0_8
| ~ spl0_9 ),
inference(avatar_split_clause,[],[f145,f74,f69,f155]) ).
thf(f167,definition,
( spl0_19
<=> ( $false
= ( h @ ( leibeq @ $false @ $true ) ) ) ),
introduced(definition,[new_symbols(definition,[spl0_19])],[avatar_definition]) ).
thf(f169,plain,
( ( $false
= ( h @ ( leibeq @ $false @ $true ) ) )
| ~ spl0_19 ),
inference(avatar_component_clause,[],[f167]) ).
thf(f176,plain,
( ! [X0: $o > $o] :
( ( $false
= ( h @ $false ) )
| ( $false
= ( X0 @ $false ) )
| ( $true
= ( X0 @ $true ) ) )
| ~ spl0_1
| ~ spl0_19 ),
inference(superposition,[],[f169,f35]) ).
thf(f178,definition,
( spl0_20
<=> ! [X0: $o > $o] :
( ( $false
= ( X0 @ $false ) )
| ( $true
= ( X0 @ $true ) ) ) ),
introduced(definition,[new_symbols(definition,[spl0_20])],[avatar_definition]) ).
thf(f179,plain,
( ! [X0: $o > $o] :
( ( $true
= ( X0 @ $true ) )
| ( $false
= ( X0 @ $false ) ) )
| ~ spl0_20 ),
inference(avatar_component_clause,[],[f178]) ).
thf(f180,plain,
( spl0_20
| spl0_3
| ~ spl0_1
| ~ spl0_19 ),
inference(avatar_split_clause,[],[f176,f167,f13,f47,f178]) ).
thf(f183,plain,
( ( $false
= ( h @ ( leibeq @ $false @ $true ) ) )
| ( $false
= ( h @ $false ) )
| ~ spl0_17 ),
inference(fool_paramodulation,[],[f157]) ).
thf(f190,plain,
( ( $false = $true )
| ~ spl0_20 ),
inference(leibniz_equality_elimination,[],[f179]) ).
thf(f218,plain,
( $false
| ~ spl0_20 ),
inference(trivial_inequality_removal,[],[f190]) ).
thf(f219,plain,
~ spl0_20,
inference(avatar_contradiction_clause,[],[f218]) ).
thf(f227,plain,
( spl0_3
| spl0_19
| ~ spl0_17 ),
inference(avatar_split_clause,[],[f183,f155,f167,f47]) ).
thf(f275,plain,
( ( $false
= ( h @ $true ) )
| ( ( h @ $false )
= $true )
| ( $true
!= ( leibeq @ ( h @ $false ) @ ( h @ $false ) ) )
| ~ spl0_1
| spl0_2 ),
inference(superposition,[],[f20,f91]) ).
thf(f277,plain,
( ( $false
= ( h @ $true ) )
| ( ( h @ $false )
= $true )
| ~ spl0_1
| spl0_2 ),
inference(forward_subsumption_resolution,[],[f275,f39]) ).
thf(f278,plain,
( ( $false
= ( h @ $true ) )
| ( $false = $true )
| ~ spl0_1
| spl0_2
| ~ spl0_3 ),
inference(forward_demodulation,[],[f277,f49]) ).
thf(f279,plain,
( ( $false
= ( h @ $true ) )
| ~ spl0_1
| spl0_2
| ~ spl0_3 ),
inference(trivial_inequality_removal,[],[f278]) ).
thf(f280,plain,
( spl0_9
| ~ spl0_1
| spl0_2
| ~ spl0_3 ),
inference(avatar_split_clause,[],[f279,f47,f18,f13,f74]) ).
cnf(s1,plain,
spl0_1,
inference(sat_conversion,[],[f16]) ).
cnf(s2,plain,
~ spl0_2,
inference(sat_conversion,[],[f21]) ).
cnf(s5,plain,
( spl0_2
| ~ spl0_7
| spl0_8 ),
inference(sat_conversion,[],[f72]) ).
cnf(s7,plain,
( ~ spl0_1
| spl0_3
| spl0_7 ),
inference(sat_conversion,[],[f98]) ).
cnf(s12,plain,
( ~ spl0_7
| ~ spl0_8
| spl0_9 ),
inference(sat_conversion,[],[f126]) ).
cnf(s16,plain,
( ~ spl0_1
| spl0_2
| ~ spl0_3
| ~ spl0_9 ),
inference(sat_conversion,[],[f153]) ).
cnf(s17,plain,
( ~ spl0_8
| ~ spl0_9
| spl0_17 ),
inference(sat_conversion,[],[f158]) ).
cnf(s20,plain,
( ~ spl0_1
| spl0_3
| ~ spl0_19
| spl0_20 ),
inference(sat_conversion,[],[f180]) ).
cnf(s23,plain,
~ spl0_20,
inference(sat_conversion,[],[f219]) ).
cnf(s28,plain,
( spl0_3
| ~ spl0_17
| spl0_19 ),
inference(sat_conversion,[],[f227]) ).
cnf(s37,plain,
( ~ spl0_1
| spl0_2
| ~ spl0_3
| spl0_9 ),
inference(sat_conversion,[],[f280]) ).
cnf(s38,plain,
( ~ spl0_1
| spl0_3
| ~ spl0_19 ),
inference(rat,[],[s20,s23]) ).
cnf(s39,plain,
spl0_3,
inference(rat,[],[s12,s17,s5,s28,s7,s38,s2,s1]) ).
cnf(s41,plain,
spl0_9,
inference(rat,[],[s37,s1,s2,s39]) ).
cnf(s42,plain,
$false,
inference(rat,[],[s16,s1,s2,s41,s39]) ).
thf(f281,plain,
$false,
inference(avatar_sat_refutation,[],[s42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO016^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.18 % Computer : n007.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Tue Sep 29 16:19:27 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.21 Running higher-order theorem proving
% 0.07/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.07/0.25 % (3575219)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.07/0.25 % (3575231)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=465482058: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.07/0.25 % (3575234)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.07/0.25 % (3575231) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3575219-3575231"...
% 0.07/0.25 % (3575234)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.07/0.25 % (3575231)...printing done.
% 0.07/0.25 % (3575231)Refutation found. Thanks to Tanya!
% 0.07/0.25 % SZS status Theorem for theBenchmark
% 0.07/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.07/0.25 % (3575231)------------------------------
% 0.07/0.25 % (3575231)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.25 % (3575231)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.25 % (3575231)CaDiCaL version: 2.1.3
% 0.07/0.25 % (3575231)Termination reason: Refutation
% 0.07/0.25 % (3575231)Time elapsed: 0.006 s
% 0.07/0.25 % (3575231)Peak memory usage: 13 MB
% 0.07/0.25 % (3575231)Instructions burned: 14 (million)
% 0.07/0.25 % (3575219)Success in time 0.02 s
% 0.07/0.25 % Vampire exiting
%------------------------------------------------------------------------------