%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO555^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 : n001.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:24 AM UTC 2026
% Result : Theorem 0.22s 0.31s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 32
% Number of leaves : 15
% Syntax : Number of formulae : 146 ( 29 unt; 0 typ; 10 def)
% Number of atoms : 712 ( 347 equ; 0 cnn)
% Maximal formula atoms : 5 ( 4 avg)
% Number of connectives : 942 ( 223 ~; 258 |; 106 &; 339 @)
% ( 10 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 20 ( 20 >; 0 *; 0 +; 0 <<)
% Number of symbols : 30 ( 27 usr; 15 con; 0-4 aty)
% Number of variables : 328 ( 0 sgn 226 !; 6 ?; 328 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
eps1: ( $i > $o ) > $i ).
thf(func_def_2,type,
if1: $o > $i > $i > $i ).
thf(func_def_3,type,
eps2: ( $i > $o ) > $i ).
thf(func_def_4,type,
if2: $o > $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,
vNOT: $o > $o ).
thf(func_def_8,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_9,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_10,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_11,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
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_17,type,
sK1: $o ).
thf(f1,axiom,
! [X0: $i > $o] :
( ? [X1: $i] : ( X0 @ X1 )
=> ( X0 @ ( eps1 @ X0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',choiceax1) ).
thf(f2,axiom,
( ( ^ [X0: $o,X1: $i,X2: $i] :
( eps1
@ ^ [X3: $i] :
( ( X0
& ( X3 = X1 ) )
| ( ( X3 = X2 )
& ~ X0 ) ) ) )
= if1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',if1d) ).
thf(f3,axiom,
! [X0: $i > $o] :
( ? [X1: $i] : ( X0 @ X1 )
=> ( X0 @ ( eps2 @ X0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',choiceax2) ).
thf(f4,axiom,
( ( ^ [X0: $o,X1: $i,X2: $i] :
( eps2
@ ^ [X3: $i] :
( ( ( X3 = X1 )
& X0 )
| ( ( X3 = X2 )
& ~ X0 ) ) ) )
= if2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',if2d) ).
thf(f5,conjecture,
if1 = if2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
thf(f6,negated_conjecture,
if1 != if2,
inference(negated_conjecture,[status(cth)],[f5]) ).
thf(f7,plain,
( ( ^ [X0: $o,X1: $i,X2: $i] :
( eps2
@ ^ [X3: $i] :
( ( ( X3 = X1 )
& X0 )
| ( ( X3 = X2 )
& ~ X0 ) ) ) )
= if2 ),
inference(rectify,[],[f4]) ).
thf(f8,plain,
( if2
= ( ^ [Y0: $o,Y1: $i,Y2: $i] :
( eps2
@ ^ [Y3: $i] :
( ( ~ Y0
& ( Y2 = Y3 ) )
| ( Y0
& ( Y1 = Y3 ) ) ) ) ) ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
( ( ^ [X0: $o,X1: $i,X2: $i] :
( eps1
@ ^ [X3: $i] :
( ( X0
& ( X3 = X1 ) )
| ( ( X3 = X2 )
& ~ X0 ) ) ) )
= if1 ),
inference(rectify,[],[f2]) ).
thf(f10,plain,
( if1
= ( ^ [Y0: $o,Y1: $i,Y2: $i] :
( eps1
@ ^ [Y3: $i] :
( ( ~ Y0
& ( Y2 = Y3 ) )
| ( ( Y1 = Y3 )
& Y0 ) ) ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
! [X0: $i > $o] :
( ? [X1: $i] : ( X0 @ X1 )
=> ( X0 @ ( eps2 @ X0 ) ) ),
inference(rectify,[],[f3]) ).
thf(f12,plain,
! [X0: $i > $o] :
( ? [X1: $i] :
( ( X0 @ X1 )
= $true )
=> ( ( X0 @ ( eps2 @ X0 ) )
= $true ) ),
inference(fool_elimination,[],[f11]) ).
thf(f13,plain,
! [X0: $i > $o] :
( ? [X1: $i] : ( X0 @ X1 )
=> ( X0 @ ( eps1 @ X0 ) ) ),
inference(rectify,[],[f1]) ).
thf(f14,plain,
! [X0: $i > $o] :
( ? [X1: $i] :
( ( X0 @ X1 )
= $true )
=> ( ( X0 @ ( eps1 @ X0 ) )
= $true ) ),
inference(fool_elimination,[],[f13]) ).
thf(f15,plain,
if1 != if2,
inference(flattening,[],[f6]) ).
thf(f16,plain,
! [X0: $i > $o] :
( ( ( X0 @ ( eps1 @ X0 ) )
= $true )
| ! [X1: $i] :
( ( X0 @ X1 )
!= $true ) ),
inference(ennf_transformation,[],[f14]) ).
thf(f17,plain,
! [X0: $i > $o] :
( ! [X1: $i] :
( ( X0 @ X1 )
!= $true )
| ( ( X0 @ ( eps2 @ X0 ) )
= $true ) ),
inference(ennf_transformation,[],[f12]) ).
thf(f18,plain,
! [X0: $i > $o,X1: $i] :
( ( ( X0 @ ( eps2 @ X0 ) )
= $true )
| ( ( X0 @ X1 )
!= $true ) ),
inference(cnf_transformation,[],[f17]) ).
thf(f19,plain,
( if2
= ( ^ [Y0: $o,Y1: $i,Y2: $i] :
( eps2
@ ^ [Y3: $i] :
( ( ~ Y0
& ( Y2 = Y3 ) )
| ( Y0
& ( Y1 = Y3 ) ) ) ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f20,plain,
! [X0: $i > $o,X1: $i] :
( ( ( X0 @ ( eps1 @ X0 ) )
= $true )
| ( ( X0 @ X1 )
!= $true ) ),
inference(cnf_transformation,[],[f16]) ).
thf(f21,plain,
( if1
= ( ^ [Y0: $o,Y1: $i,Y2: $i] :
( eps1
@ ^ [Y3: $i] :
( ( ~ Y0
& ( Y2 = Y3 ) )
| ( ( Y1 = Y3 )
& Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f22,plain,
if1 != if2,
inference(cnf_transformation,[],[f15]) ).
thf(f25,definition,
( spl0_1
<=> ( if1
= ( ^ [Y0: $o,Y1: $i,Y2: $i] :
( eps1
@ ^ [Y3: $i] :
( ( ~ Y0
& ( Y2 = Y3 ) )
| ( ( Y1 = Y3 )
& Y0 ) ) ) ) ) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
thf(f27,plain,
( ( if1
= ( ^ [Y0: $o,Y1: $i,Y2: $i] :
( eps1
@ ^ [Y3: $i] :
( ( ~ Y0
& ( Y2 = Y3 ) )
| ( ( Y1 = Y3 )
& Y0 ) ) ) ) )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f25]) ).
thf(f28,plain,
spl0_1,
inference(avatar_split_clause,[],[f21,f25]) ).
thf(f30,definition,
( spl0_2
<=> ( if2
= ( ^ [Y0: $o,Y1: $i,Y2: $i] :
( eps2
@ ^ [Y3: $i] :
( ( ~ Y0
& ( Y2 = Y3 ) )
| ( Y0
& ( Y1 = Y3 ) ) ) ) ) ) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
thf(f32,plain,
( ( if2
= ( ^ [Y0: $o,Y1: $i,Y2: $i] :
( eps2
@ ^ [Y3: $i] :
( ( ~ Y0
& ( Y2 = Y3 ) )
| ( Y0
& ( Y1 = Y3 ) ) ) ) ) )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f30]) ).
thf(f33,plain,
spl0_2,
inference(avatar_split_clause,[],[f19,f30]) ).
thf(f35,definition,
( spl0_3
<=> ( if1 = if2 ) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
thf(f37,plain,
( ( if1 != if2 )
| spl0_3 ),
inference(avatar_component_clause,[],[f35]) ).
thf(f38,plain,
~ spl0_3,
inference(avatar_split_clause,[],[f22,f35]) ).
thf(f42,plain,
! [X2: $i > $o,X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
~ ( X2 @ Y0 )
@ ( eps2
@ ^ [Y0: $i] :
~ ( X2 @ Y0 ) ) ) )
| ( $true
!= ( ^ [Y0: $i] :
~ ( X2 @ Y0 )
@ X1 ) ) ),
inference(primitive_instantiation,[],[f18]) ).
thf(f45,plain,
! [X2: $i > $o,X1: $i] :
( ( $true
= ( ~ ( X2
@ ( eps2
@ ^ [Y0: $i] :
~ ( X2 @ Y0 ) ) ) ) )
| ( $true
!= ( ~ ( X2 @ X1 ) ) ) ),
inference(beta-eta_normalization,[],[f42]) ).
thf(f46,plain,
! [X2: $i > $o,X1: $i] :
( ( ( X2
@ ( eps2
@ ^ [Y0: $i] :
~ ( X2 @ Y0 ) ) )
= $false )
| ( $true
!= ( ~ ( X2 @ X1 ) ) ) ),
inference(not_proxy_clausification,[],[f45]) ).
thf(f47,plain,
! [X2: $i > $o,X1: $i] :
( ( ( X2
@ ( eps2
@ ^ [Y0: $i] :
~ ( X2 @ Y0 ) ) )
= $false )
| ( $true
= ( X2 @ X1 ) ) ),
inference(not_proxy_clausification,[],[f46]) ).
thf(f63,plain,
( ! [X1: $o] :
( ( if1 @ X1 )
= ( ^ [Y0: $o,Y1: $i,Y2: $i] :
( eps1
@ ^ [Y3: $i] :
( ( ~ Y0
& ( Y2 = Y3 ) )
| ( ( Y1 = Y3 )
& Y0 ) ) )
@ X1 ) )
| ~ spl0_1 ),
inference(argument_congruence,[],[f27]) ).
thf(f64,plain,
( ! [X1: $o] :
( ( ^ [Y0: $i,Y1: $i] :
( eps1
@ ^ [Y2: $i] :
( ( ~ X1
& ( Y1 = Y2 ) )
| ( ( Y0 = Y2 )
& X1 ) ) ) )
= ( if1 @ X1 ) )
| ~ spl0_1 ),
inference(beta-eta_normalization,[],[f63]) ).
thf(f65,plain,
( ! [X1: $o] :
( ( if2 @ X1 )
= ( ^ [Y0: $o,Y1: $i,Y2: $i] :
( eps2
@ ^ [Y3: $i] :
( ( ~ Y0
& ( Y2 = Y3 ) )
| ( Y0
& ( Y1 = Y3 ) ) ) )
@ X1 ) )
| ~ spl0_2 ),
inference(argument_congruence,[],[f32]) ).
thf(f66,plain,
( ! [X1: $o] :
( ( if2 @ X1 )
= ( ^ [Y0: $i,Y1: $i] :
( eps2
@ ^ [Y2: $i] :
( ( ~ X1
& ( Y1 = Y2 ) )
| ( X1
& ( Y0 = Y2 ) ) ) ) ) )
| ~ spl0_2 ),
inference(beta-eta_normalization,[],[f65]) ).
thf(f67,plain,
( ( ( if1 @ sK1 )
!= ( if2 @ sK1 ) )
| spl0_3 ),
inference(negative_extensionality,[],[f37]) ).
thf(f69,definition,
( spl0_4
<=> ( ( if1 @ sK1 )
= ( if2 @ sK1 ) ) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
thf(f71,plain,
( ( ( if1 @ sK1 )
!= ( if2 @ sK1 ) )
| spl0_4 ),
inference(avatar_component_clause,[],[f69]) ).
thf(f72,plain,
( ~ spl0_4
| spl0_3 ),
inference(avatar_split_clause,[],[f67,f35,f69]) ).
thf(f76,plain,
! [X3: $i > $o,X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
~ ( X3 @ Y0 )
@ X1 ) )
| ( ( ^ [Y0: $i] :
~ ( X3 @ Y0 )
@ ( eps2
@ ^ [Y0: $i] :
~ ( ^ [Y1: $i] :
~ ( X3 @ Y1 )
@ Y0 ) ) )
= $false ) ),
inference(primitive_instantiation,[],[f47]) ).
thf(f79,plain,
! [X3: $i > $o,X1: $i] :
( ( ( ~ ( X3
@ ( eps2
@ ^ [Y0: $i] :
~ ~ ( X3 @ Y0 ) ) ) )
= $false )
| ( $true
= ( ~ ( X3 @ X1 ) ) ) ),
inference(beta-eta_normalization,[],[f76]) ).
thf(f80,plain,
! [X3: $i > $o,X1: $i] :
( ( $true
= ( ~ ( X3 @ X1 ) ) )
| ( $true
= ( X3
@ ( eps2
@ ^ [Y0: $i] :
~ ~ ( X3 @ Y0 ) ) ) ) ),
inference(not_proxy_clausification,[],[f79]) ).
thf(f81,plain,
! [X3: $i > $o,X1: $i] :
( ( $true
= ( X3
@ ( eps2
@ ^ [Y0: $i] :
~ ~ ( X3 @ Y0 ) ) ) )
| ( $false
= ( X3 @ X1 ) ) ),
inference(not_proxy_clausification,[],[f80]) ).
thf(f82,plain,
! [X3: $i > $o,X1: $i] :
( ( $true
= ( X3
@ ( eps2
@ ^ [Y0: $i] : ( X3 @ Y0 ) ) ) )
| ( $false
= ( X3 @ X1 ) ) ),
inference(boolean_simplification,[],[f81]) ).
thf(f83,plain,
! [X3: $i > $o,X1: $i] :
( ( $true
= ( X3 @ ( eps2 @ X3 ) ) )
| ( $false
= ( X3 @ X1 ) ) ),
inference(beta-eta_normalization,[],[f82]) ).
thf(f101,plain,
( ! [X2: $i,X1: $o] :
( ( if1 @ X1 @ X2 )
= ( ^ [Y0: $i,Y1: $i] :
( eps1
@ ^ [Y2: $i] :
( ( ~ X1
& ( Y1 = Y2 ) )
| ( ( Y0 = Y2 )
& X1 ) ) )
@ X2 ) )
| ~ spl0_1 ),
inference(argument_congruence,[],[f64]) ).
thf(f102,plain,
( ! [X2: $i,X1: $o] :
( ( if1 @ X1 @ X2 )
= ( ^ [Y0: $i] :
( eps1
@ ^ [Y1: $i] :
( ( ~ X1
& ( Y0 = Y1 ) )
| ( ( X2 = Y1 )
& X1 ) ) ) ) )
| ~ spl0_1 ),
inference(beta-eta_normalization,[],[f101]) ).
thf(f103,plain,
( ! [X2: $i,X1: $o] :
( ( if2 @ X1 @ X2 )
= ( ^ [Y0: $i,Y1: $i] :
( eps2
@ ^ [Y2: $i] :
( ( ~ X1
& ( Y1 = Y2 ) )
| ( X1
& ( Y0 = Y2 ) ) ) )
@ X2 ) )
| ~ spl0_2 ),
inference(argument_congruence,[],[f66]) ).
thf(f104,plain,
( ! [X2: $i,X1: $o] :
( ( if2 @ X1 @ X2 )
= ( ^ [Y0: $i] :
( eps2
@ ^ [Y1: $i] :
( ( ~ X1
& ( Y0 = Y1 ) )
| ( X1
& ( X2 = Y1 ) ) ) ) ) )
| ~ spl0_2 ),
inference(beta-eta_normalization,[],[f103]) ).
thf(f149,plain,
( ( ( if2 @ sK1 @ sK2 )
!= ( if1 @ sK1 @ sK2 ) )
| spl0_4 ),
inference(negative_extensionality,[],[f71]) ).
thf(f151,definition,
( spl0_5
<=> ( ( if2 @ sK1 @ sK2 )
= ( if1 @ sK1 @ sK2 ) ) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
thf(f153,plain,
( ( ( if2 @ sK1 @ sK2 )
!= ( if1 @ sK1 @ sK2 ) )
| spl0_5 ),
inference(avatar_component_clause,[],[f151]) ).
thf(f154,plain,
( ~ spl0_5
| spl0_4 ),
inference(avatar_split_clause,[],[f149,f69,f151]) ).
thf(f156,definition,
( spl0_6
<=> ( sK1 = $false ) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
thf(f158,plain,
( ( sK1 = $false )
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f156]) ).
thf(f165,plain,
( ! [X2: $i,X3: $i,X1: $o] :
( ( ^ [Y0: $i] :
( eps1
@ ^ [Y1: $i] :
( ( ~ X1
& ( Y0 = Y1 ) )
| ( ( X2 = Y1 )
& X1 ) ) )
@ X3 )
= ( if1 @ X1 @ X2 @ X3 ) )
| ~ spl0_1 ),
inference(argument_congruence,[],[f102]) ).
thf(f166,plain,
( ! [X2: $i,X3: $i,X1: $o] :
( ( if1 @ X1 @ X2 @ X3 )
= ( eps1
@ ^ [Y0: $i] :
( ( ~ X1
& ( X3 = Y0 ) )
| ( ( X2 = Y0 )
& X1 ) ) ) )
| ~ spl0_1 ),
inference(beta-eta_normalization,[],[f165]) ).
thf(f167,plain,
( ! [X2: $i,X3: $i,X1: $o] :
( ( if2 @ X1 @ X2 @ X3 )
= ( ^ [Y0: $i] :
( eps2
@ ^ [Y1: $i] :
( ( ~ X1
& ( Y0 = Y1 ) )
| ( X1
& ( X2 = Y1 ) ) ) )
@ X3 ) )
| ~ spl0_2 ),
inference(argument_congruence,[],[f104]) ).
thf(f168,plain,
( ! [X2: $i,X3: $i,X1: $o] :
( ( if2 @ X1 @ X2 @ X3 )
= ( eps2
@ ^ [Y0: $i] :
( ( ~ X1
& ( X3 = Y0 ) )
| ( X1
& ( X2 = Y0 ) ) ) ) )
| ~ spl0_2 ),
inference(beta-eta_normalization,[],[f167]) ).
thf(f170,plain,
( ! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( $true
!= ( ^ [Y0: $i] :
( ( ~ X0
& ( X2 = Y0 ) )
| ( ( X1 = Y0 )
& X0 ) )
@ X3 ) )
| ( $true
= ( ^ [Y0: $i] :
( ( ~ X0
& ( X2 = Y0 ) )
| ( ( X1 = Y0 )
& X0 ) )
@ ( if1 @ X0 @ X1 @ X2 ) ) ) )
| ~ spl0_1 ),
inference(superposition,[],[f20,f166]) ).
thf(f171,plain,
( ! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( $true
!= ( ( ~ X0
& ( X2 = X3 ) )
| ( ( X1 = X3 )
& X0 ) ) )
| ( $true
= ( ( ~ X0
& ( X2
= ( if1 @ X0 @ X1 @ X2 ) ) )
| ( ( X1
= ( if1 @ X0 @ X1 @ X2 ) )
& X0 ) ) ) )
| ~ spl0_1 ),
inference(beta-eta_normalization,[],[f170]) ).
thf(f172,plain,
( ! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( $true
= ( ( ~ X0
& ( X2
= ( if1 @ X0 @ X1 @ X2 ) ) )
| ( ( X1
= ( if1 @ X0 @ X1 @ X2 ) )
& X0 ) ) )
| ( ( ( X1 = X3 )
& X0 )
= $false ) )
| ~ spl0_1 ),
inference(or_proxy_clausification,[],[f171]) ).
thf(f173,plain,
( ! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( $true
= ( ( ~ X0
& ( X2
= ( if1 @ X0 @ X1 @ X2 ) ) )
| ( ( X1
= ( if1 @ X0 @ X1 @ X2 ) )
& X0 ) ) )
| ( ( ~ X0
& ( X2 = X3 ) )
= $false ) )
| ~ spl0_1 ),
inference(or_proxy_clausification,[],[f171]) ).
thf(f174,plain,
( ! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( ( ~ X0
& ( X2 = X3 ) )
= $false )
| ( $true
= ( ( X1
= ( if1 @ X0 @ X1 @ X2 ) )
& X0 ) )
| ( $true
= ( ~ X0
& ( X2
= ( if1 @ X0 @ X1 @ X2 ) ) ) ) )
| ~ spl0_1 ),
inference(or_proxy_clausification,[],[f173]) ).
thf(f175,plain,
( ! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( $true
= ( ~ X0
& ( X2
= ( if1 @ X0 @ X1 @ X2 ) ) ) )
| ( ( X2 = X3 )
= $false )
| ( $true
= ( ( X1
= ( if1 @ X0 @ X1 @ X2 ) )
& X0 ) )
| ( ( ~ X0 ) = $false ) )
| ~ spl0_1 ),
inference(and_proxy_clausification,[],[f174]) ).
thf(f176,plain,
( ! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( ( ~ X0 ) = $false )
| ( $true
= ( X2
= ( if1 @ X0 @ X1 @ X2 ) ) )
| ( $true
= ( ( X1
= ( if1 @ X0 @ X1 @ X2 ) )
& X0 ) )
| ( ( X2 = X3 )
= $false ) )
| ~ spl0_1 ),
inference(and_proxy_clausification,[],[f175]) ).
thf(f188,plain,
( ! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( ( X2 = X3 )
= $false )
| ( $true
= ( ( X1
= ( if1 @ X0 @ X1 @ X2 ) )
& X0 ) )
| ( $true = X0 )
| ( $true
= ( X2
= ( if1 @ X0 @ X1 @ X2 ) ) ) )
| ~ spl0_1 ),
inference(not_proxy_clausification,[],[f176]) ).
thf(f189,plain,
( ! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( $true
= ( ( X1
= ( if1 @ X0 @ X1 @ X2 ) )
& X0 ) )
| ( X2 != X3 )
| ( $true = X0 )
| ( $true
= ( X2
= ( if1 @ X0 @ X1 @ X2 ) ) ) )
| ~ spl0_1 ),
inference(equality_proxy_clausification,[],[f188]) ).
thf(f190,plain,
( ! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( $true = X0 )
| ( $true = X0 )
| ( $true
= ( X2
= ( if1 @ X0 @ X1 @ X2 ) ) )
| ( X2 != X3 ) )
| ~ spl0_1 ),
inference(and_proxy_clausification,[],[f189]) ).
thf(f194,plain,
( ! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( $true = X0 )
| ( X2 != X3 )
| ( $true = X0 )
| ( ( if1 @ X0 @ X1 @ X2 )
= X2 ) )
| ~ spl0_1 ),
inference(equality_proxy_clausification,[],[f190]) ).
thf(f195,plain,
( ! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( ( if1 @ X0 @ X1 @ X2 )
= X2 )
| ( $true = X0 )
| ( X2 != X3 ) )
| ~ spl0_1 ),
inference(duplicate_literal_removal,[],[f194]) ).
thf(f196,plain,
( ! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( $true
= ( ~ X0
& ( X2
= ( if1 @ X0 @ X1 @ X2 ) ) ) )
| ( $true
= ( ( X1
= ( if1 @ X0 @ X1 @ X2 ) )
& X0 ) )
| ( ( ( X1 = X3 )
& X0 )
= $false ) )
| ~ spl0_1 ),
inference(or_proxy_clausification,[],[f172]) ).
thf(f198,plain,
( ! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( $true = ( ~ X0 ) )
| ( ( ( X1 = X3 )
& X0 )
= $false )
| ( $true
= ( ( X1
= ( if1 @ X0 @ X1 @ X2 ) )
& X0 ) ) )
| ~ spl0_1 ),
inference(and_proxy_clausification,[],[f196]) ).
thf(f199,plain,
( ! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( ( ( X1 = X3 )
& X0 )
= $false )
| ( $false = X0 )
| ( $true
= ( ( X1
= ( if1 @ X0 @ X1 @ X2 ) )
& X0 ) ) )
| ~ spl0_1 ),
inference(not_proxy_clausification,[],[f198]) ).
thf(f200,plain,
( ! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( $false = X0 )
| ( $false = X0 )
| ( $true
= ( ( X1
= ( if1 @ X0 @ X1 @ X2 ) )
& X0 ) )
| ( $false
= ( X1 = X3 ) ) )
| ~ spl0_1 ),
inference(and_proxy_clausification,[],[f199]) ).
thf(f202,plain,
( ! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( $false
= ( X1 = X3 ) )
| ( $true
= ( X1
= ( if1 @ X0 @ X1 @ X2 ) ) )
| ( $false = X0 )
| ( $false = X0 ) )
| ~ spl0_1 ),
inference(and_proxy_clausification,[],[f200]) ).
thf(f203,plain,
( ! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( $true
= ( X1
= ( if1 @ X0 @ X1 @ X2 ) ) )
| ( $false = X0 )
| ( X1 != X3 )
| ( $false = X0 ) )
| ~ spl0_1 ),
inference(equality_proxy_clausification,[],[f202]) ).
thf(f204,plain,
( ! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( X1 != X3 )
| ( $false = X0 )
| ( $false = X0 )
| ( ( if1 @ X0 @ X1 @ X2 )
= X1 ) )
| ~ spl0_1 ),
inference(equality_proxy_clausification,[],[f203]) ).
thf(f205,plain,
( ! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( ( if1 @ X0 @ X1 @ X2 )
= X1 )
| ( $false = X0 )
| ( X1 != X3 ) )
| ~ spl0_1 ),
inference(duplicate_literal_removal,[],[f204]) ).
thf(f271,plain,
( ! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( ( ~ X0
& ( X2 = Y0 ) )
| ( X0
& ( X1 = Y0 ) ) )
@ ( if2 @ X0 @ X1 @ X2 ) ) )
| ( ( ^ [Y0: $i] :
( ( ~ X0
& ( X2 = Y0 ) )
| ( X0
& ( X1 = Y0 ) ) )
@ X3 )
= $false ) )
| ~ spl0_2 ),
inference(superposition,[],[f83,f168]) ).
thf(f273,plain,
( ! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( $false
= ( ( ~ X0
& ( X2 = X3 ) )
| ( X0
& ( X1 = X3 ) ) ) )
| ( $true
= ( ( ~ X0
& ( X2
= ( if2 @ X0 @ X1 @ X2 ) ) )
| ( X0
& ( X1
= ( if2 @ X0 @ X1 @ X2 ) ) ) ) ) )
| ~ spl0_2 ),
inference(beta-eta_normalization,[],[f271]) ).
thf(f274,plain,
( ! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( $true
= ( ( ~ X0
& ( X2
= ( if2 @ X0 @ X1 @ X2 ) ) )
| ( X0
& ( X1
= ( if2 @ X0 @ X1 @ X2 ) ) ) ) )
| ( ( X0
& ( X1 = X3 ) )
= $false ) )
| ~ spl0_2 ),
inference(or_proxy_clausification,[],[f273]) ).
thf(f275,plain,
( ! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( $true
= ( ( ~ X0
& ( X2
= ( if2 @ X0 @ X1 @ X2 ) ) )
| ( X0
& ( X1
= ( if2 @ X0 @ X1 @ X2 ) ) ) ) )
| ( ( ~ X0
& ( X2 = X3 ) )
= $false ) )
| ~ spl0_2 ),
inference(or_proxy_clausification,[],[f273]) ).
thf(f276,plain,
( ! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( $true
= ( X0
& ( X1
= ( if2 @ X0 @ X1 @ X2 ) ) ) )
| ( $true
= ( ~ X0
& ( X2
= ( if2 @ X0 @ X1 @ X2 ) ) ) )
| ( ( ~ X0
& ( X2 = X3 ) )
= $false ) )
| ~ spl0_2 ),
inference(or_proxy_clausification,[],[f275]) ).
thf(f278,plain,
( ! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( $true = X0 )
| ( ( ~ X0
& ( X2 = X3 ) )
= $false )
| ( $true
= ( ~ X0
& ( X2
= ( if2 @ X0 @ X1 @ X2 ) ) ) ) )
| ~ spl0_2 ),
inference(and_proxy_clausification,[],[f276]) ).
thf(f279,plain,
( ! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( ( ~ X0 ) = $false )
| ( $true = X0 )
| ( $true
= ( ~ X0
& ( X2
= ( if2 @ X0 @ X1 @ X2 ) ) ) )
| ( ( X2 = X3 )
= $false ) )
| ~ spl0_2 ),
inference(and_proxy_clausification,[],[f278]) ).
thf(f280,plain,
( ! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( ( X2 = X3 )
= $false )
| ( $true = X0 )
| ( $true = X0 )
| ( $true
= ( ~ X0
& ( X2
= ( if2 @ X0 @ X1 @ X2 ) ) ) ) )
| ~ spl0_2 ),
inference(not_proxy_clausification,[],[f279]) ).
thf(f281,plain,
( ! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( X2 != X3 )
| ( $true
= ( ~ X0
& ( X2
= ( if2 @ X0 @ X1 @ X2 ) ) ) )
| ( $true = X0 )
| ( $true = X0 ) )
| ~ spl0_2 ),
inference(equality_proxy_clausification,[],[f280]) ).
thf(f282,plain,
( ! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( X2 != X3 )
| ( $true = X0 )
| ( $true = X0 )
| ( $true
= ( X2
= ( if2 @ X0 @ X1 @ X2 ) ) ) )
| ~ spl0_2 ),
inference(and_proxy_clausification,[],[f281]) ).
thf(f286,plain,
( ! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( ( if2 @ X0 @ X1 @ X2 )
= X2 )
| ( $true = X0 )
| ( X2 != X3 )
| ( $true = X0 ) )
| ~ spl0_2 ),
inference(equality_proxy_clausification,[],[f282]) ).
thf(f287,plain,
( ! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( ( if2 @ X0 @ X1 @ X2 )
= X2 )
| ( $true = X0 )
| ( X2 != X3 ) )
| ~ spl0_2 ),
inference(duplicate_literal_removal,[],[f286]) ).
thf(f298,plain,
( ! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( $true
= ( X0
& ( X1
= ( if2 @ X0 @ X1 @ X2 ) ) ) )
| ( $true
= ( ~ X0
& ( X2
= ( if2 @ X0 @ X1 @ X2 ) ) ) )
| ( ( X0
& ( X1 = X3 ) )
= $false ) )
| ~ spl0_2 ),
inference(or_proxy_clausification,[],[f274]) ).
thf(f299,plain,
( ! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( $true
= ( ~ X0
& ( X2
= ( if2 @ X0 @ X1 @ X2 ) ) ) )
| ( ( X0
& ( X1 = X3 ) )
= $false )
| ( $true
= ( X1
= ( if2 @ X0 @ X1 @ X2 ) ) ) )
| ~ spl0_2 ),
inference(and_proxy_clausification,[],[f298]) ).
thf(f310,plain,
( ! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( ( X0
& ( X1 = X3 ) )
= $false )
| ( $true
= ( X1
= ( if2 @ X0 @ X1 @ X2 ) ) )
| ( $true = ( ~ X0 ) ) )
| ~ spl0_2 ),
inference(and_proxy_clausification,[],[f299]) ).
thf(f311,plain,
( ! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( $false = X0 )
| ( $true
= ( X1
= ( if2 @ X0 @ X1 @ X2 ) ) )
| ( $true = ( ~ X0 ) )
| ( $false
= ( X1 = X3 ) ) )
| ~ spl0_2 ),
inference(and_proxy_clausification,[],[f310]) ).
thf(f312,plain,
( ! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( $true = ( ~ X0 ) )
| ( ( if2 @ X0 @ X1 @ X2 )
= X1 )
| ( $false
= ( X1 = X3 ) )
| ( $false = X0 ) )
| ~ spl0_2 ),
inference(equality_proxy_clausification,[],[f311]) ).
thf(f313,plain,
( ! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( $false = X0 )
| ( $false
= ( X1 = X3 ) )
| ( ( if2 @ X0 @ X1 @ X2 )
= X1 )
| ( $false = X0 ) )
| ~ spl0_2 ),
inference(not_proxy_clausification,[],[f312]) ).
thf(f314,plain,
( ! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( $false = X0 )
| ( $false = X0 )
| ( ( if2 @ X0 @ X1 @ X2 )
= X1 )
| ( X1 != X3 ) )
| ~ spl0_2 ),
inference(equality_proxy_clausification,[],[f313]) ).
thf(f315,plain,
( ! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( ( if2 @ X0 @ X1 @ X2 )
= X1 )
| ( $false = X0 )
| ( X1 != X3 ) )
| ~ spl0_2 ),
inference(duplicate_literal_removal,[],[f314]) ).
thf(f371,plain,
( ( ( if1 @ sK1 @ sK2 @ sK4 )
!= ( if2 @ sK1 @ sK2 @ sK4 ) )
| spl0_5 ),
inference(negative_extensionality,[],[f153]) ).
thf(f373,definition,
( spl0_9
<=> ( ( if1 @ sK1 @ sK2 @ sK4 )
= ( if2 @ sK1 @ sK2 @ sK4 ) ) ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
thf(f375,plain,
( ( ( if1 @ sK1 @ sK2 @ sK4 )
!= ( if2 @ sK1 @ sK2 @ sK4 ) )
| spl0_9 ),
inference(avatar_component_clause,[],[f373]) ).
thf(f376,plain,
( ~ spl0_9
| spl0_5 ),
inference(avatar_split_clause,[],[f371,f151,f373]) ).
thf(f397,plain,
( ! [X0: $i] :
( ( sK1 = $false )
| ( sK2 != X0 )
| ( sK2
!= ( if2 @ sK1 @ sK2 @ sK4 ) ) )
| ~ spl0_1
| spl0_9 ),
inference(superposition,[],[f375,f205]) ).
thf(f398,plain,
( ! [X0: $i] :
( ( sK4 != X0 )
| ( sK4
!= ( if2 @ sK1 @ sK2 @ sK4 ) )
| ( $true = sK1 ) )
| ~ spl0_1
| spl0_9 ),
inference(superposition,[],[f375,f195]) ).
thf(f405,plain,
( ! [X0: $i] :
( ( sK2 != X0 )
| ( sK1 = $false ) )
| ~ spl0_1
| ~ spl0_2
| spl0_9 ),
inference(forward_subsumption_resolution,[],[f397,f315]) ).
thf(f406,plain,
( ! [X0: $i] :
( ( sK4 != X0 )
| ( $true = sK1 ) )
| ~ spl0_1
| ~ spl0_2
| spl0_9 ),
inference(forward_subsumption_resolution,[],[f398,f287]) ).
thf(f408,definition,
( spl0_14
<=> ! [X0: $i] : ( sK2 != X0 ) ),
introduced(definition,[new_symbols(definition,[spl0_14])],[avatar_definition]) ).
thf(f409,plain,
( ! [X0: $i] : ( sK2 != X0 )
| ~ spl0_14 ),
inference(avatar_component_clause,[],[f408]) ).
thf(f410,plain,
( spl0_6
| spl0_14
| ~ spl0_1
| ~ spl0_2
| spl0_9 ),
inference(avatar_split_clause,[],[f405,f373,f30,f25,f408,f156]) ).
thf(f412,definition,
( spl0_15
<=> ( $true = sK1 ) ),
introduced(definition,[new_symbols(definition,[spl0_15])],[avatar_definition]) ).
thf(f414,plain,
( ( $true = sK1 )
| ~ spl0_15 ),
inference(avatar_component_clause,[],[f412]) ).
thf(f416,definition,
( spl0_16
<=> ! [X0: $i] : ( sK4 != X0 ) ),
introduced(definition,[new_symbols(definition,[spl0_16])],[avatar_definition]) ).
thf(f417,plain,
( ! [X0: $i] : ( sK4 != X0 )
| ~ spl0_16 ),
inference(avatar_component_clause,[],[f416]) ).
thf(f418,plain,
( spl0_15
| spl0_16
| ~ spl0_1
| ~ spl0_2
| spl0_9 ),
inference(avatar_split_clause,[],[f406,f373,f30,f25,f416,f412]) ).
thf(f437,plain,
( ( $true = $false )
| ~ spl0_6
| ~ spl0_15 ),
inference(forward_demodulation,[],[f414,f158]) ).
thf(f438,plain,
( $false
| ~ spl0_6
| ~ spl0_15 ),
inference(trivial_inequality_removal,[],[f437]) ).
thf(f439,plain,
( ~ spl0_6
| ~ spl0_15 ),
inference(avatar_contradiction_clause,[],[f438]) ).
thf(f482,plain,
( $false
| ~ spl0_14 ),
inference(equality_resolution,[],[f409]) ).
thf(f485,plain,
~ spl0_14,
inference(avatar_contradiction_clause,[],[f482]) ).
thf(f525,plain,
( $false
| ~ spl0_16 ),
inference(equality_resolution,[],[f417]) ).
thf(f528,plain,
~ spl0_16,
inference(avatar_contradiction_clause,[],[f525]) ).
cnf(s1,plain,
spl0_1,
inference(sat_conversion,[],[f28]) ).
cnf(s2,plain,
spl0_2,
inference(sat_conversion,[],[f33]) ).
cnf(s3,plain,
~ spl0_3,
inference(sat_conversion,[],[f38]) ).
cnf(s4,plain,
( spl0_3
| ~ spl0_4 ),
inference(sat_conversion,[],[f72]) ).
cnf(s5,plain,
( spl0_4
| ~ spl0_5 ),
inference(sat_conversion,[],[f154]) ).
cnf(s9,plain,
( spl0_5
| ~ spl0_9 ),
inference(sat_conversion,[],[f376]) ).
cnf(s16,plain,
( ~ spl0_1
| ~ spl0_2
| spl0_6
| spl0_9
| spl0_14 ),
inference(sat_conversion,[],[f410]) ).
cnf(s17,plain,
( ~ spl0_1
| ~ spl0_2
| spl0_9
| spl0_15
| spl0_16 ),
inference(sat_conversion,[],[f418]) ).
cnf(s21,plain,
( ~ spl0_6
| ~ spl0_15 ),
inference(sat_conversion,[],[f439]) ).
cnf(s29,plain,
~ spl0_14,
inference(sat_conversion,[],[f485]) ).
cnf(s36,plain,
~ spl0_16,
inference(sat_conversion,[],[f528]) ).
cnf(s39,plain,
( ~ spl0_1
| ~ spl0_2
| spl0_9
| spl0_15 ),
inference(rat,[],[s17,s36]) ).
cnf(s40,plain,
( ~ spl0_1
| ~ spl0_2
| spl0_6
| spl0_9 ),
inference(rat,[],[s16,s29]) ).
cnf(s41,plain,
~ spl0_4,
inference(rat,[],[s4,s3]) ).
cnf(s42,plain,
~ spl0_5,
inference(rat,[],[s5,s41]) ).
cnf(s43,plain,
~ spl0_9,
inference(rat,[],[s9,s42]) ).
cnf(s44,plain,
spl0_15,
inference(rat,[],[s39,s2,s43,s1]) ).
cnf(s45,plain,
spl0_6,
inference(rat,[],[s40,s43,s2,s1]) ).
cnf(s46,plain,
$false,
inference(rat,[],[s21,s44,s45]) ).
thf(f529,plain,
$false,
inference(avatar_sat_refutation,[],[s46]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO555^1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.20 % Computer : n001.cluster.edu
% 0.10/0.20 % Model : x86_64 x86_64
% 0.10/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.20 % Memory : 8046.5625MB
% 0.10/0.20 % OS : Linux 6.8.0-71-generic
% 0.10/0.20 % CPULimit : 300
% 0.10/0.20 % WCLimit : 300
% 0.10/0.20 % DateTime : Tue Sep 29 17:20:36 UTC 2026
% 0.10/0.20 % CPUTime :
% 0.10/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.24 Running higher-order theorem proving
% 0.10/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.31 % (1544139)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.22/0.31 % (1544144)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=4268358638:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.22/0.31 % (1544146)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=1263757189:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.22/0.31 % (1544146)Refutation not found, incomplete strategy
% 0.22/0.31 % (1544146)------------------------------
% 0.22/0.31 % (1544146)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.31 % (1544146)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.31 % (1544146)CaDiCaL version: 2.1.3
% 0.22/0.31 % (1544146)Termination reason: Refutation not found, incomplete strategy
% 0.22/0.31 % (1544146)Time elapsed: 0.002 s
% 0.22/0.31 % (1544146)Peak memory usage: 12 MB
% 0.22/0.31 % (1544146)Instructions burned: 3 (million)
% 0.22/0.31 % (1544145)lrs+10_16_si=on:nwc=1.5:random_seed=995779185:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.22/0.31 % (1544146)------------------------------
% 0.22/0.31 % (1544146)------------------------------
% 0.22/0.31 % (1544147)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=708811211: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.22/0.31 % (1544144)Refutation not found, incomplete strategy
% 0.22/0.31 % (1544144)------------------------------
% 0.22/0.31 % (1544144)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.31 % (1544144)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.31 % (1544144)CaDiCaL version: 2.1.3
% 0.22/0.31 % (1544144)Termination reason: Refutation not found, incomplete strategy
% 0.22/0.31 % (1544144)Time elapsed: 0.005 s
% 0.22/0.31 % (1544144)Peak memory usage: 12 MB
% 0.22/0.31 % (1544144)Instructions burned: 8 (million)
% 0.22/0.31 % (1544144)------------------------------
% 0.22/0.31 % (1544144)------------------------------
% 0.22/0.31 % (1544150)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.31 % (1544150)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.31 % (1544145)Instruction limit reached!
% 0.22/0.31 % (1544145)------------------------------
% 0.22/0.31 % (1544145)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.31 % (1544145)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.31 % (1544145)CaDiCaL version: 2.1.3
% 0.22/0.31 % (1544145)Termination reason: Instruction limit
% 0.22/0.31 % (1544145)Termination phase: Saturation
% 0.22/0.31 % (1544145)Time elapsed: 0.011 s
% 0.22/0.31 % (1544145)Peak memory usage: 12 MB
% 0.22/0.31 % (1544145)Instructions burned: 18 (million)
% 0.22/0.31 % (1544147) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1544139-1544147"...
% 0.22/0.31 % (1544150)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=735372857:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.22/0.31 % (1544147)...printing done.
% 0.22/0.31 % (1544147)Refutation found. Thanks to Tanya!
% 0.22/0.31 % SZS status Theorem for theBenchmark
% 0.22/0.31 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.31 % (1544147)------------------------------
% 0.22/0.31 % (1544147)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.31 % (1544147)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.31 % (1544147)CaDiCaL version: 2.1.3
% 0.22/0.31 % (1544147)Termination reason: Refutation
% 0.22/0.31 % (1544147)Time elapsed: 0.015 s
% 0.22/0.31 % (1544147)Peak memory usage: 13 MB
% 0.22/0.31 % (1544147)Instructions burned: 23 (million)
% 0.22/0.31 % (1544139)Success in time 0.051 s
% 0.22/0.31 % Vampire exiting
%------------------------------------------------------------------------------