%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO539^1 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/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:22 AM UTC 2026
% Result : Theorem 0.24s 0.35s
% Output : Refutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 32
% Number of leaves : 3
% Syntax : Number of formulae : 61 ( 16 unt; 0 typ; 0 def)
% Number of atoms : 303 ( 188 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 453 ( 87 ~; 85 |; 54 &; 224 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 15 ( 15 >; 0 *; 0 +; 0 <<)
% Number of symbols : 18 ( 15 usr; 5 con; 0-4 aty)
% Number of variables : 186 ( 47 ^; 130 !; 9 ?; 186 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
eps: ( $i > $o ) > $i ).
thf(func_def_2,type,
if: $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,
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(f1,axiom,
! [X0: $i > $o] :
( ? [X1: $i] : ( X0 @ X1 )
=> ( X0 @ ( eps @ X0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',choiceax) ).
thf(f2,axiom,
( ( ^ [X0: $o,X1: $i,X2: $i] :
( eps
@ ^ [X3: $i] :
( ( X0
& ( X3 = X1 ) )
| ( ~ X0
& ( X3 = X2 ) ) ) ) )
= if ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifd) ).
thf(f3,conjecture,
! [X1: $i,X0: $o,X2: $i] :
( ( ( if @ X0 @ X1 @ X2 )
= X1 )
| ( ( if @ X0 @ X1 @ X2 )
= X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
thf(f4,negated_conjecture,
~ ! [X1: $i,X0: $o,X2: $i] :
( ( ( if @ X0 @ X1 @ X2 )
= X1 )
| ( ( if @ X0 @ X1 @ X2 )
= X2 ) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
thf(f5,plain,
! [X0: $i > $o] :
( ? [X1: $i] : ( X0 @ X1 )
=> ( X0 @ ( eps @ X0 ) ) ),
inference(rectify,[],[f1]) ).
thf(f6,plain,
! [X0: $i > $o] :
( ? [X1: $i] :
( ( X0 @ X1 )
= $true )
=> ( ( X0 @ ( eps @ X0 ) )
= $true ) ),
inference(fool_elimination,[],[f5]) ).
thf(f7,plain,
( ( ^ [X0: $o,X1: $i,X2: $i] :
( eps
@ ^ [X3: $i] :
( ( X0
& ( X3 = X1 ) )
| ( ~ X0
& ( X3 = X2 ) ) ) ) )
= if ),
inference(rectify,[],[f2]) ).
thf(f8,plain,
( if
= ( ^ [Y0: $o,Y1: $i,Y2: $i] :
( eps
@ ^ [Y3: $i] :
( ( ( Y2 = Y3 )
& ~ Y0 )
| ( ( Y1 = Y3 )
& Y0 ) ) ) ) ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
~ ! [X1: $o,X2: $i,X0: $i] :
( ( ( if @ X1 @ X0 @ X2 )
= X2 )
| ( ( if @ X1 @ X0 @ X2 )
= X0 ) ),
inference(rectify,[],[f4]) ).
thf(f10,plain,
? [X1: $o,X0: $i,X2: $i] :
( ( ( if @ X1 @ X0 @ X2 )
!= X2 )
& ( ( if @ X1 @ X0 @ X2 )
!= X0 ) ),
inference(ennf_transformation,[],[f9]) ).
thf(f11,plain,
! [X0: $i > $o] :
( ! [X1: $i] :
( ( X0 @ X1 )
!= $true )
| ( ( X0 @ ( eps @ X0 ) )
= $true ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f12,plain,
? [X0: $o,X1: $i,X2: $i] :
( ( ( if @ X0 @ X1 @ X2 )
!= X2 )
& ( ( if @ X0 @ X1 @ X2 )
!= X1 ) ),
inference(rectify,[],[f10]) ).
thf(f13,plain,
( ( ( if @ sK0 @ sK1 @ sK2 )
!= sK2 )
& ( ( if @ sK0 @ sK1 @ sK2 )
!= sK1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f12]) ).
thf(f14,plain,
( ( if @ sK0 @ sK1 @ sK2 )
!= sK1 ),
inference(cnf_transformation,[],[f13]) ).
thf(f15,plain,
( ( if @ sK0 @ sK1 @ sK2 )
!= sK2 ),
inference(cnf_transformation,[],[f13]) ).
thf(f16,plain,
( if
= ( ^ [Y0: $o,Y1: $i,Y2: $i] :
( eps
@ ^ [Y3: $i] :
( ( ( Y2 = Y3 )
& ~ Y0 )
| ( ( Y1 = Y3 )
& Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f17,plain,
! [X0: $i > $o,X1: $i] :
( ( ( X0 @ X1 )
!= $true )
| ( ( X0 @ ( eps @ X0 ) )
= $true ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f24,plain,
! [X2: $i > $o,X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
~ ( X2 @ Y0 )
@ ( eps
@ ^ [Y0: $i] :
~ ( X2 @ Y0 ) ) ) )
| ( $true
!= ( ^ [Y0: $i] :
~ ( X2 @ Y0 )
@ X1 ) ) ),
inference(primitive_instantiation,[],[f17]) ).
thf(f26,plain,
! [X2: $i > $o,X1: $i] :
( ( ( ~ ( X2
@ ( eps
@ ^ [Y0: $i] :
~ ( X2 @ Y0 ) ) ) )
= $true )
| ( $true
!= ( ~ ( X2 @ X1 ) ) ) ),
inference(beta-eta_normalization,[],[f24]) ).
thf(f27,plain,
! [X2: $i > $o,X1: $i] :
( ( ( X2
@ ( eps
@ ^ [Y0: $i] :
~ ( X2 @ Y0 ) ) )
= $false )
| ( $true
!= ( ~ ( X2 @ X1 ) ) ) ),
inference(not_proxy_clausification,[],[f26]) ).
thf(f28,plain,
! [X2: $i > $o,X1: $i] :
( ( ( X2
@ ( eps
@ ^ [Y0: $i] :
~ ( X2 @ Y0 ) ) )
= $false )
| ( $true
= ( X2 @ X1 ) ) ),
inference(not_proxy_clausification,[],[f27]) ).
thf(f32,plain,
! [X1: $o] :
( ( ^ [Y0: $o,Y1: $i,Y2: $i] :
( eps
@ ^ [Y3: $i] :
( ( ( Y2 = Y3 )
& ~ Y0 )
| ( ( Y1 = Y3 )
& Y0 ) ) )
@ X1 )
= ( if @ X1 ) ),
inference(argument_congruence,[],[f16]) ).
thf(f33,plain,
! [X1: $o] :
( ( ^ [Y0: $i,Y1: $i] :
( eps
@ ^ [Y2: $i] :
( ( ( Y1 = Y2 )
& ~ X1 )
| ( ( Y0 = Y2 )
& X1 ) ) ) )
= ( if @ X1 ) ),
inference(beta-eta_normalization,[],[f32]) ).
thf(f40,plain,
! [X3: $i > $o,X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
~ ( X3 @ Y0 )
@ X1 ) )
| ( ( ^ [Y0: $i] :
~ ( X3 @ Y0 )
@ ( eps
@ ^ [Y0: $i] :
~ ( ^ [Y1: $i] :
~ ( X3 @ Y1 )
@ Y0 ) ) )
= $false ) ),
inference(primitive_instantiation,[],[f28]) ).
thf(f48,plain,
! [X3: $i > $o,X1: $i] :
( ( ( ~ ( X3
@ ( eps
@ ^ [Y0: $i] :
~ ~ ( X3 @ Y0 ) ) ) )
= $false )
| ( $true
= ( ~ ( X3 @ X1 ) ) ) ),
inference(beta-eta_normalization,[],[f40]) ).
thf(f49,plain,
! [X3: $i > $o,X1: $i] :
( ( $true
= ( ~ ( X3 @ X1 ) ) )
| ( ( X3
@ ( eps
@ ^ [Y0: $i] :
~ ~ ( X3 @ Y0 ) ) )
= $true ) ),
inference(not_proxy_clausification,[],[f48]) ).
thf(f50,plain,
! [X3: $i > $o,X1: $i] :
( ( ( X3
@ ( eps
@ ^ [Y0: $i] :
~ ~ ( X3 @ Y0 ) ) )
= $true )
| ( $false
= ( X3 @ X1 ) ) ),
inference(not_proxy_clausification,[],[f49]) ).
thf(f51,plain,
! [X3: $i > $o,X1: $i] :
( ( ( X3
@ ( eps
@ ^ [Y0: $i] : ( X3 @ Y0 ) ) )
= $true )
| ( $false
= ( X3 @ X1 ) ) ),
inference(boolean_simplification,[],[f50]) ).
thf(f52,plain,
! [X3: $i > $o,X1: $i] :
( ( $false
= ( X3 @ X1 ) )
| ( ( X3 @ ( eps @ X3 ) )
= $true ) ),
inference(beta-eta_normalization,[],[f51]) ).
thf(f90,plain,
! [X2: $i,X1: $o] :
( ( if @ X1 @ X2 )
= ( ^ [Y0: $i,Y1: $i] :
( eps
@ ^ [Y2: $i] :
( ( ( Y1 = Y2 )
& ~ X1 )
| ( ( Y0 = Y2 )
& X1 ) ) )
@ X2 ) ),
inference(argument_congruence,[],[f33]) ).
thf(f91,plain,
! [X2: $i,X1: $o] :
( ( if @ X1 @ X2 )
= ( ^ [Y0: $i] :
( eps
@ ^ [Y1: $i] :
( ( ( Y0 = Y1 )
& ~ X1 )
| ( ( X2 = Y1 )
& X1 ) ) ) ) ),
inference(beta-eta_normalization,[],[f90]) ).
thf(f96,plain,
! [X2: $i,X3: $i,X1: $o] :
( ( ^ [Y0: $i] :
( eps
@ ^ [Y1: $i] :
( ( ( Y0 = Y1 )
& ~ X1 )
| ( ( X2 = Y1 )
& X1 ) ) )
@ X3 )
= ( if @ X1 @ X2 @ X3 ) ),
inference(argument_congruence,[],[f91]) ).
thf(f97,plain,
! [X2: $i,X3: $i,X1: $o] :
( ( if @ X1 @ X2 @ X3 )
= ( eps
@ ^ [Y0: $i] :
( ( ( X3 = Y0 )
& ~ X1 )
| ( ( X2 = Y0 )
& X1 ) ) ) ),
inference(beta-eta_normalization,[],[f96]) ).
thf(f98,plain,
! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( ( ^ [Y0: $i] :
( ( ( X2 = Y0 )
& ~ X0 )
| ( ( X1 = Y0 )
& X0 ) )
@ X3 )
= $false )
| ( $true
= ( ^ [Y0: $i] :
( ( ( X2 = Y0 )
& ~ X0 )
| ( ( X1 = Y0 )
& X0 ) )
@ ( if @ X0 @ X1 @ X2 ) ) ) ),
inference(superposition,[],[f52,f97]) ).
thf(f99,plain,
! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( ( ( ( X2
= ( if @ X0 @ X1 @ X2 ) )
& ~ X0 )
| ( ( X1
= ( if @ X0 @ X1 @ X2 ) )
& X0 ) )
= $true )
| ( ( ( ( X2 = X3 )
& ~ X0 )
| ( ( X1 = X3 )
& X0 ) )
= $false ) ),
inference(beta-eta_normalization,[],[f98]) ).
thf(f100,plain,
! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( ( ( ( X2 = X3 )
& ~ X0 )
| ( ( X1 = X3 )
& X0 ) )
= $false )
| ( ( ( X1
= ( if @ X0 @ X1 @ X2 ) )
& X0 )
= $true )
| ( ( ( X2
= ( if @ X0 @ X1 @ X2 ) )
& ~ X0 )
= $true ) ),
inference(or_proxy_clausification,[],[f99]) ).
thf(f101,plain,
! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( $false
= ( ( X1 = X3 )
& X0 ) )
| ( ( ( X2
= ( if @ X0 @ X1 @ X2 ) )
& ~ X0 )
= $true )
| ( ( ( X1
= ( if @ X0 @ X1 @ X2 ) )
& X0 )
= $true ) ),
inference(or_proxy_clausification,[],[f100]) ).
thf(f102,plain,
! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( ( ( X2 = X3 )
& ~ X0 )
= $false )
| ( ( ( X2
= ( if @ X0 @ X1 @ X2 ) )
& ~ X0 )
= $true )
| ( ( ( X1
= ( if @ X0 @ X1 @ X2 ) )
& X0 )
= $true ) ),
inference(or_proxy_clausification,[],[f100]) ).
thf(f103,plain,
! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( ( X2 = X3 )
= $false )
| ( ( ( X2
= ( if @ X0 @ X1 @ X2 ) )
& ~ X0 )
= $true )
| ( ( ~ X0 ) = $false )
| ( ( ( X1
= ( if @ X0 @ X1 @ X2 ) )
& X0 )
= $true ) ),
inference(and_proxy_clausification,[],[f102]) ).
thf(f104,plain,
! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( ( ( X2
= ( if @ X0 @ X1 @ X2 ) )
& ~ X0 )
= $true )
| ( ( ( X1
= ( if @ X0 @ X1 @ X2 ) )
& X0 )
= $true )
| ( X2 != X3 )
| ( ( ~ X0 ) = $false ) ),
inference(equality_proxy_clausification,[],[f103]) ).
thf(f106,plain,
! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( X2 != X3 )
| ( ( ~ X0 ) = $false )
| ( ( ( X1
= ( if @ X0 @ X1 @ X2 ) )
& X0 )
= $true )
| ( ( X2
= ( if @ X0 @ X1 @ X2 ) )
= $true ) ),
inference(and_proxy_clausification,[],[f104]) ).
thf(f107,plain,
! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( X2 != X3 )
| ( ( X2
= ( if @ X0 @ X1 @ X2 ) )
= $true )
| ( $true = X0 )
| ( ( ( X1
= ( if @ X0 @ X1 @ X2 ) )
& X0 )
= $true ) ),
inference(not_proxy_clausification,[],[f106]) ).
thf(f108,plain,
! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( ( ( X1
= ( if @ X0 @ X1 @ X2 ) )
& X0 )
= $true )
| ( X2 != X3 )
| ( $true = X0 )
| ( ( if @ X0 @ X1 @ X2 )
= X2 ) ),
inference(equality_proxy_clausification,[],[f107]) ).
thf(f109,plain,
! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( X2 != X3 )
| ( ( if @ X0 @ X1 @ X2 )
= X2 )
| ( $true = X0 )
| ( $true = X0 ) ),
inference(and_proxy_clausification,[],[f108]) ).
thf(f112,plain,
! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( ( if @ X0 @ X1 @ X2 )
= X2 )
| ( $true = X0 )
| ( X2 != X3 ) ),
inference(duplicate_literal_removal,[],[f109]) ).
thf(f119,plain,
! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( $false = X0 )
| ( ( X1 = X3 )
= $false )
| ( ( ( X1
= ( if @ X0 @ X1 @ X2 ) )
& X0 )
= $true )
| ( ( ( X2
= ( if @ X0 @ X1 @ X2 ) )
& ~ X0 )
= $true ) ),
inference(and_proxy_clausification,[],[f101]) ).
thf(f120,plain,
! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( ( ( X1
= ( if @ X0 @ X1 @ X2 ) )
& X0 )
= $true )
| ( ( ( X2
= ( if @ X0 @ X1 @ X2 ) )
& ~ X0 )
= $true )
| ( X1 != X3 )
| ( $false = X0 ) ),
inference(equality_proxy_clausification,[],[f119]) ).
thf(f122,plain,
! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( $true
= ( X1
= ( if @ X0 @ X1 @ X2 ) ) )
| ( $false = X0 )
| ( X1 != X3 )
| ( ( ( X2
= ( if @ X0 @ X1 @ X2 ) )
& ~ X0 )
= $true ) ),
inference(and_proxy_clausification,[],[f120]) ).
thf(f123,plain,
! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( $false = X0 )
| ( ( ( X2
= ( if @ X0 @ X1 @ X2 ) )
& ~ X0 )
= $true )
| ( X1 != X3 )
| ( ( if @ X0 @ X1 @ X2 )
= X1 ) ),
inference(equality_proxy_clausification,[],[f122]) ).
thf(f124,plain,
! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( X1 != X3 )
| ( ( ~ X0 ) = $true )
| ( $false = X0 )
| ( ( if @ X0 @ X1 @ X2 )
= X1 ) ),
inference(and_proxy_clausification,[],[f123]) ).
thf(f127,plain,
! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( X1 != X3 )
| ( ( if @ X0 @ X1 @ X2 )
= X1 )
| ( $false = X0 )
| ( $false = X0 ) ),
inference(not_proxy_clausification,[],[f124]) ).
thf(f128,plain,
! [X2: $i,X3: $i,X0: $o,X1: $i] :
( ( ( if @ X0 @ X1 @ X2 )
= X1 )
| ( $false = X0 )
| ( X1 != X3 ) ),
inference(duplicate_literal_removal,[],[f127]) ).
thf(f151,plain,
! [X0: $i] :
( ( sK0 = $true )
| ( sK2 != X0 )
| ( sK2 != sK2 ) ),
inference(superposition,[],[f15,f112]) ).
thf(f155,plain,
! [X0: $i] :
( ( sK2 != X0 )
| ( sK0 = $true ) ),
inference(trivial_inequality_removal,[],[f151]) ).
thf(f158,plain,
sK0 = $true,
inference(equality_resolution,[],[f155]) ).
thf(f162,plain,
! [X0: $i] :
( ( sK1 != X0 )
| ( sK0 = $false )
| ( sK1 != sK1 ) ),
inference(superposition,[],[f14,f128]) ).
thf(f171,plain,
! [X0: $i] :
( ( sK1 != X0 )
| ( sK0 = $false ) ),
inference(trivial_inequality_removal,[],[f162]) ).
thf(f177,plain,
! [X0: $i] :
( ( sK1 != X0 )
| ( $true = $false ) ),
inference(forward_demodulation,[],[f171,f158]) ).
thf(f178,plain,
! [X0: $i] : ( sK1 != X0 ),
inference(trivial_inequality_removal,[],[f177]) ).
thf(f179,plain,
sK1 != sK1,
inference(imitation,[],[f178]) ).
thf(f181,plain,
$false,
inference(trivial_inequality_removal,[],[f179]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO539^1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.23 % Computer : n001.cluster.edu
% 0.11/0.23 % Model : x86_64 x86_64
% 0.11/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.23 % Memory : 8046.5625MB
% 0.11/0.23 % OS : Linux 6.8.0-71-generic
% 0.11/0.23 % CPULimit : 300
% 0.11/0.23 % WCLimit : 300
% 0.11/0.23 % DateTime : Tue Sep 29 17:19:36 UTC 2026
% 0.11/0.24 % CPUTime :
% 0.11/0.24 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.29 Running higher-order theorem proving
% 0.24/0.30 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.24/0.35 % (1541547)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.24/0.35 % (1541556)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=1447317518:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.24/0.35 % (1541556) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1541547-1541556"...
% 0.24/0.35 % (1541556)...printing done.
% 0.24/0.35 % (1541558)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.24/0.35 % (1541558)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.24/0.35 % (1541556)Refutation found. Thanks to Tanya!
% 0.24/0.35 % SZS status Theorem for theBenchmark
% 0.24/0.35 % SZS output start Proof for theBenchmark
% See solution above
% 0.24/0.35 % (1541556)------------------------------
% 0.24/0.35 % (1541556)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.35 % (1541556)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.35 % (1541556)CaDiCaL version: 2.1.3
% 0.24/0.35 % (1541556)Termination reason: Refutation
% 0.24/0.35 % (1541556)Time elapsed: 0.007 s
% 0.24/0.35 % (1541556)Peak memory usage: 12 MB
% 0.24/0.35 % (1541556)Instructions burned: 11 (million)
% 0.24/0.35 % (1541547)Success in time 0.032 s
% 0.24/0.35 % Vampire exiting
%------------------------------------------------------------------------------