%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET615^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n015.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:23:22 AM UTC 2026
% Result : Theorem 0.08s 0.25s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 7
% Syntax : Number of formulae : 77 ( 19 unt; 0 typ; 6 def)
% Number of atoms : 439 ( 107 equ; 0 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 520 ( 111 ~; 123 |; 61 &; 219 @)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 18 ( 18 >; 0 *; 0 +; 0 <<)
% Number of symbols : 19 ( 16 usr; 9 con; 0-4 aty)
% Number of variables : 40 ( 0 sgn 12 !; 6 ?; 40 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_1,type,
vOR: $o > $o > $o ).
thf(func_def_2,type,
vAND: $o > $o > $o ).
thf(func_def_3,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_4,type,
vNOT: $o > $o ).
thf(func_def_5,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_6,type,
sK0: a > $o ).
thf(func_def_7,type,
sK1: a > $o ).
thf(func_def_8,type,
sK2: a > $o ).
thf(func_def_11,type,
sK3: a ).
thf(f1,conjecture,
! [X1: a > $o,X2: a > $o,X0: a > $o] :
( ( ^ [X4: a] :
( ( ~ ( X2 @ X4 )
& ( X0 @ X4 ) )
| ( ~ ( X2 @ X4 )
& ( X1 @ X4 ) ) ) )
= ( ^ [X3: a] :
( ( ( X0 @ X3 )
| ( X1 @ X3 ) )
& ~ ( X2 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cBOOL_PROP_89_pme) ).
thf(f2,negated_conjecture,
~ ! [X1: a > $o,X2: a > $o,X0: a > $o] :
( ( ^ [X4: a] :
( ( ~ ( X2 @ X4 )
& ( X0 @ X4 ) )
| ( ~ ( X2 @ X4 )
& ( X1 @ X4 ) ) ) )
= ( ^ [X3: a] :
( ( ( X0 @ X3 )
| ( X1 @ X3 ) )
& ~ ( X2 @ X3 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [X3: a] :
( ( ~ ( X1 @ X3 )
& ( X2 @ X3 ) )
| ( ~ ( X1 @ X3 )
& ( X0 @ X3 ) ) ) )
= ( ^ [X4: a] :
( ( ( X2 @ X4 )
| ( X0 @ X4 ) )
& ~ ( X1 @ X4 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ! [X1: a > $o,X2: a > $o,X0: a > $o] :
( ( ^ [Y0: a] :
( ( ( X0 @ Y0 )
& ~ ( X1 @ Y0 ) )
| ( ( X2 @ Y0 )
& ~ ( X1 @ Y0 ) ) ) )
= ( ^ [Y0: a] :
( ~ ( X1 @ Y0 )
& ( ( X0 @ Y0 )
| ( X2 @ Y0 ) ) ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
? [X1: a > $o,X0: a > $o,X2: a > $o] :
( ( ^ [Y0: a] :
( ( ( X0 @ Y0 )
& ~ ( X1 @ Y0 ) )
| ( ( X2 @ Y0 )
& ~ ( X1 @ Y0 ) ) ) )
!= ( ^ [Y0: a] :
( ~ ( X1 @ Y0 )
& ( ( X0 @ Y0 )
| ( X2 @ Y0 ) ) ) ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [Y0: a] :
( ~ ( X0 @ Y0 )
& ( ( X1 @ Y0 )
| ( X2 @ Y0 ) ) ) )
!= ( ^ [Y0: a] :
( ( ( X1 @ Y0 )
& ~ ( X0 @ Y0 ) )
| ( ( X2 @ Y0 )
& ~ ( X0 @ Y0 ) ) ) ) ),
inference(rectify,[],[f5]) ).
thf(f7,plain,
( ( ^ [Y0: a] :
( ~ ( sK0 @ Y0 )
& ( ( sK1 @ Y0 )
| ( sK2 @ Y0 ) ) ) )
!= ( ^ [Y0: a] :
( ( ( sK1 @ Y0 )
& ~ ( sK0 @ Y0 ) )
| ( ( sK2 @ Y0 )
& ~ ( sK0 @ Y0 ) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f6]) ).
thf(f8,plain,
( ( ^ [Y0: a] :
( ~ ( sK0 @ Y0 )
& ( ( sK1 @ Y0 )
| ( sK2 @ Y0 ) ) ) )
!= ( ^ [Y0: a] :
( ( ( sK1 @ Y0 )
& ~ ( sK0 @ Y0 ) )
| ( ( sK2 @ Y0 )
& ~ ( sK0 @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f11,plain,
( ( ^ [Y0: a] :
( ~ ( sK0 @ Y0 )
& ( ( sK1 @ Y0 )
| ( sK2 @ Y0 ) ) )
@ sK3 )
!= ( ^ [Y0: a] :
( ( ( sK1 @ Y0 )
& ~ ( sK0 @ Y0 ) )
| ( ( sK2 @ Y0 )
& ~ ( sK0 @ Y0 ) ) )
@ sK3 ) ),
inference(negative_extensionality,[],[f8]) ).
thf(f12,plain,
( ( ( ^ [Y0: a] :
( ~ ( sK0 @ Y0 )
& ( ( sK1 @ Y0 )
| ( sK2 @ Y0 ) ) )
@ sK3 )
= $true )
| ( ( ^ [Y0: a] :
( ( ( sK1 @ Y0 )
& ~ ( sK0 @ Y0 ) )
| ( ( sK2 @ Y0 )
& ~ ( sK0 @ Y0 ) ) )
@ sK3 )
= $true ) ),
inference(xor_proxy_clausification,[],[f11]) ).
thf(f13,plain,
( ( ( ^ [Y0: a] :
( ( ( sK1 @ Y0 )
& ~ ( sK0 @ Y0 ) )
| ( ( sK2 @ Y0 )
& ~ ( sK0 @ Y0 ) ) )
@ sK3 )
= $false )
| ( ( ^ [Y0: a] :
( ~ ( sK0 @ Y0 )
& ( ( sK1 @ Y0 )
| ( sK2 @ Y0 ) ) )
@ sK3 )
= $false ) ),
inference(xor_proxy_clausification,[],[f11]) ).
thf(f14,plain,
( ( ( ~ ( sK0 @ sK3 )
& ( ( sK1 @ sK3 )
| ( sK2 @ sK3 ) ) )
= $false )
| ( ( ( ( sK1 @ sK3 )
& ~ ( sK0 @ sK3 ) )
| ( ( sK2 @ sK3 )
& ~ ( sK0 @ sK3 ) ) )
= $false ) ),
inference(beta-eta_normalization,[],[f13]) ).
thf(f15,plain,
( ( ( ( sK1 @ sK3 )
| ( sK2 @ sK3 ) )
= $false )
| ( ( ~ ( sK0 @ sK3 ) )
= $false )
| ( ( ( ( sK1 @ sK3 )
& ~ ( sK0 @ sK3 ) )
| ( ( sK2 @ sK3 )
& ~ ( sK0 @ sK3 ) ) )
= $false ) ),
inference(and_proxy_clausification,[],[f14]) ).
thf(f16,plain,
( ( ( ~ ( sK0 @ sK3 ) )
= $false )
| ( ( sK2 @ sK3 )
= $false )
| ( ( ( ( sK1 @ sK3 )
& ~ ( sK0 @ sK3 ) )
| ( ( sK2 @ sK3 )
& ~ ( sK0 @ sK3 ) ) )
= $false ) ),
inference(or_proxy_clausification,[],[f15]) ).
thf(f17,plain,
( ( ( ~ ( sK0 @ sK3 ) )
= $false )
| ( ( ( ( sK1 @ sK3 )
& ~ ( sK0 @ sK3 ) )
| ( ( sK2 @ sK3 )
& ~ ( sK0 @ sK3 ) ) )
= $false )
| ( ( sK1 @ sK3 )
= $false ) ),
inference(or_proxy_clausification,[],[f15]) ).
thf(f18,plain,
( ( ( sK1 @ sK3 )
= $false )
| ( ( sK0 @ sK3 )
= $true )
| ( ( ( ( sK1 @ sK3 )
& ~ ( sK0 @ sK3 ) )
| ( ( sK2 @ sK3 )
& ~ ( sK0 @ sK3 ) ) )
= $false ) ),
inference(not_proxy_clausification,[],[f17]) ).
thf(f20,plain,
( ( ( ( sK1 @ sK3 )
& ~ ( sK0 @ sK3 ) )
= $false )
| ( ( sK1 @ sK3 )
= $false )
| ( ( sK0 @ sK3 )
= $true ) ),
inference(or_proxy_clausification,[],[f18]) ).
thf(f21,plain,
( ( ( sK1 @ sK3 )
= $false )
| ( ( ~ ( sK0 @ sK3 ) )
= $false )
| ( ( sK1 @ sK3 )
= $false )
| ( ( sK0 @ sK3 )
= $true ) ),
inference(and_proxy_clausification,[],[f20]) ).
thf(f22,plain,
( ( ( sK0 @ sK3 )
= $true )
| ( ( sK0 @ sK3 )
= $true )
| ( ( sK1 @ sK3 )
= $false )
| ( ( sK1 @ sK3 )
= $false ) ),
inference(not_proxy_clausification,[],[f21]) ).
thf(f23,plain,
( ( ( sK1 @ sK3 )
= $false )
| ( ( sK0 @ sK3 )
= $true ) ),
inference(duplicate_literal_removal,[],[f22]) ).
thf(f27,plain,
( ( ( sK2 @ sK3 )
= $false )
| ( ( sK0 @ sK3 )
= $true )
| ( ( ( ( sK1 @ sK3 )
& ~ ( sK0 @ sK3 ) )
| ( ( sK2 @ sK3 )
& ~ ( sK0 @ sK3 ) ) )
= $false ) ),
inference(not_proxy_clausification,[],[f16]) ).
thf(f28,plain,
( ( ( sK0 @ sK3 )
= $true )
| ( ( sK2 @ sK3 )
= $false )
| ( ( ( sK2 @ sK3 )
& ~ ( sK0 @ sK3 ) )
= $false ) ),
inference(or_proxy_clausification,[],[f27]) ).
thf(f33,plain,
( ( ( sK2 @ sK3 )
= $false )
| ( ( sK0 @ sK3 )
= $true )
| ( ( ~ ( sK0 @ sK3 ) )
= $false )
| ( ( sK2 @ sK3 )
= $false ) ),
inference(and_proxy_clausification,[],[f28]) ).
thf(f34,plain,
( ( ( sK0 @ sK3 )
= $true )
| ( ( sK2 @ sK3 )
= $false )
| ( ( sK2 @ sK3 )
= $false )
| ( ( sK0 @ sK3 )
= $true ) ),
inference(not_proxy_clausification,[],[f33]) ).
thf(f35,plain,
( ( ( sK2 @ sK3 )
= $false )
| ( ( sK0 @ sK3 )
= $true ) ),
inference(duplicate_literal_removal,[],[f34]) ).
thf(f36,plain,
( ( ( ( ( sK1 @ sK3 )
& ~ ( sK0 @ sK3 ) )
| ( ( sK2 @ sK3 )
& ~ ( sK0 @ sK3 ) ) )
= $true )
| ( ( ~ ( sK0 @ sK3 )
& ( ( sK1 @ sK3 )
| ( sK2 @ sK3 ) ) )
= $true ) ),
inference(beta-eta_normalization,[],[f12]) ).
thf(f37,plain,
( ( ( ( sK1 @ sK3 )
& ~ ( sK0 @ sK3 ) )
= $true )
| ( ( ( sK2 @ sK3 )
& ~ ( sK0 @ sK3 ) )
= $true )
| ( ( ~ ( sK0 @ sK3 )
& ( ( sK1 @ sK3 )
| ( sK2 @ sK3 ) ) )
= $true ) ),
inference(or_proxy_clausification,[],[f36]) ).
thf(f38,plain,
( ( ( ( sK2 @ sK3 )
& ~ ( sK0 @ sK3 ) )
= $true )
| ( ( ~ ( sK0 @ sK3 ) )
= $true )
| ( ( ~ ( sK0 @ sK3 )
& ( ( sK1 @ sK3 )
| ( sK2 @ sK3 ) ) )
= $true ) ),
inference(and_proxy_clausification,[],[f37]) ).
thf(f39,plain,
( ( ( ( sK2 @ sK3 )
& ~ ( sK0 @ sK3 ) )
= $true )
| ( ( ~ ( sK0 @ sK3 )
& ( ( sK1 @ sK3 )
| ( sK2 @ sK3 ) ) )
= $true )
| ( ( sK1 @ sK3 )
= $true ) ),
inference(and_proxy_clausification,[],[f37]) ).
thf(f41,plain,
( ( ( sK1 @ sK3 )
= $true )
| ( ( ~ ( sK0 @ sK3 )
& ( ( sK1 @ sK3 )
| ( sK2 @ sK3 ) ) )
= $true )
| ( ( sK2 @ sK3 )
= $true ) ),
inference(and_proxy_clausification,[],[f39]) ).
thf(f42,plain,
( ( ( sK1 @ sK3 )
= $true )
| ( ( ( sK1 @ sK3 )
| ( sK2 @ sK3 ) )
= $true )
| ( ( sK2 @ sK3 )
= $true ) ),
inference(and_proxy_clausification,[],[f41]) ).
thf(f45,plain,
( ( ( sK1 @ sK3 )
= $true )
| ( ( sK1 @ sK3 )
= $true )
| ( ( sK2 @ sK3 )
= $true )
| ( ( sK2 @ sK3 )
= $true ) ),
inference(or_proxy_clausification,[],[f42]) ).
thf(f46,plain,
( ( ( sK1 @ sK3 )
= $true )
| ( ( sK2 @ sK3 )
= $true ) ),
inference(duplicate_literal_removal,[],[f45]) ).
thf(f54,plain,
( ( ( ~ ( sK0 @ sK3 ) )
= $true )
| ( ( ~ ( sK0 @ sK3 )
& ( ( sK1 @ sK3 )
| ( sK2 @ sK3 ) ) )
= $true )
| ( ( ~ ( sK0 @ sK3 ) )
= $true ) ),
inference(and_proxy_clausification,[],[f38]) ).
thf(f63,plain,
( ( ( ~ ( sK0 @ sK3 )
& ( ( sK1 @ sK3 )
| ( sK2 @ sK3 ) ) )
= $true )
| ( ( sK0 @ sK3 )
= $false )
| ( ( sK0 @ sK3 )
= $false ) ),
inference(not_proxy_clausification,[],[f54]) ).
thf(f65,plain,
( ( ( sK0 @ sK3 )
= $false )
| ( ( sK0 @ sK3 )
= $false )
| ( ( ~ ( sK0 @ sK3 ) )
= $true ) ),
inference(and_proxy_clausification,[],[f63]) ).
thf(f66,plain,
( ( ( sK0 @ sK3 )
= $false )
| ( ( sK0 @ sK3 )
= $false )
| ( ( sK0 @ sK3 )
= $false ) ),
inference(not_proxy_clausification,[],[f65]) ).
thf(f67,plain,
( ( sK0 @ sK3 )
= $false ),
inference(duplicate_literal_removal,[],[f66]) ).
thf(f71,definition,
( spl4_1
<=> ( ( sK0 @ sK3 )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition]) ).
thf(f73,plain,
( ( ( sK0 @ sK3 )
= $true )
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f71]) ).
thf(f75,definition,
( spl4_2
<=> ( ( sK1 @ sK3 )
= $false ) ),
introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition]) ).
thf(f77,plain,
( ( ( sK1 @ sK3 )
= $false )
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f75]) ).
thf(f78,plain,
( spl4_1
| spl4_2 ),
inference(avatar_split_clause,[],[f23,f75,f71]) ).
thf(f80,definition,
( spl4_3
<=> ( ( sK2 @ sK3 )
= $false ) ),
introduced(definition,[new_symbols(definition,[spl4_3])],[avatar_definition]) ).
thf(f82,plain,
( ( ( sK2 @ sK3 )
= $false )
| ~ spl4_3 ),
inference(avatar_component_clause,[],[f80]) ).
thf(f85,plain,
( spl4_3
| spl4_1 ),
inference(avatar_split_clause,[],[f35,f71,f80]) ).
thf(f87,definition,
( spl4_4
<=> ( ( sK2 @ sK3 )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl4_4])],[avatar_definition]) ).
thf(f89,plain,
( ( ( sK2 @ sK3 )
= $true )
| ~ spl4_4 ),
inference(avatar_component_clause,[],[f87]) ).
thf(f91,definition,
( spl4_5
<=> ( ( sK0 @ sK3 )
= $false ) ),
introduced(definition,[new_symbols(definition,[spl4_5])],[avatar_definition]) ).
thf(f93,plain,
( ( ( sK0 @ sK3 )
= $false )
| ~ spl4_5 ),
inference(avatar_component_clause,[],[f91]) ).
thf(f95,definition,
( spl4_6
<=> ( ( sK1 @ sK3 )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl4_6])],[avatar_definition]) ).
thf(f97,plain,
( ( ( sK1 @ sK3 )
= $true )
| ~ spl4_6 ),
inference(avatar_component_clause,[],[f95]) ).
thf(f99,plain,
( spl4_6
| spl4_4 ),
inference(avatar_split_clause,[],[f46,f87,f95]) ).
thf(f104,plain,
spl4_5,
inference(avatar_split_clause,[],[f67,f91]) ).
thf(f106,plain,
( ( $true = $false )
| ~ spl4_3
| ~ spl4_4 ),
inference(forward_demodulation,[],[f82,f89]) ).
thf(f107,plain,
( $false
| ~ spl4_3
| ~ spl4_4 ),
inference(trivial_inequality_removal,[],[f106]) ).
thf(f108,plain,
( ~ spl4_3
| ~ spl4_4 ),
inference(avatar_contradiction_clause,[],[f107]) ).
thf(f110,plain,
( ( $true = $false )
| ~ spl4_1
| ~ spl4_5 ),
inference(forward_demodulation,[],[f73,f93]) ).
thf(f111,plain,
( $false
| ~ spl4_1
| ~ spl4_5 ),
inference(trivial_inequality_removal,[],[f110]) ).
thf(f112,plain,
( ~ spl4_1
| ~ spl4_5 ),
inference(avatar_contradiction_clause,[],[f111]) ).
thf(f113,plain,
( ( $true = $false )
| ~ spl4_2
| ~ spl4_6 ),
inference(forward_demodulation,[],[f97,f77]) ).
thf(f114,plain,
( $false
| ~ spl4_2
| ~ spl4_6 ),
inference(trivial_inequality_removal,[],[f113]) ).
thf(f115,plain,
( ~ spl4_2
| ~ spl4_6 ),
inference(avatar_contradiction_clause,[],[f114]) ).
cnf(s1,plain,
( spl4_1
| spl4_2 ),
inference(sat_conversion,[],[f78]) ).
cnf(s4,plain,
( spl4_1
| spl4_3 ),
inference(sat_conversion,[],[f85]) ).
cnf(s6,plain,
( spl4_4
| spl4_6 ),
inference(sat_conversion,[],[f99]) ).
cnf(s11,plain,
spl4_5,
inference(sat_conversion,[],[f104]) ).
cnf(s13,plain,
( ~ spl4_3
| ~ spl4_4 ),
inference(sat_conversion,[],[f108]) ).
cnf(s14,plain,
( ~ spl4_1
| ~ spl4_5 ),
inference(sat_conversion,[],[f112]) ).
cnf(s15,plain,
( ~ spl4_2
| ~ spl4_6 ),
inference(sat_conversion,[],[f115]) ).
cnf(s16,plain,
~ spl4_1,
inference(rat,[],[s14,s11]) ).
cnf(s17,plain,
spl4_3,
inference(rat,[],[s4,s16]) ).
cnf(s18,plain,
~ spl4_4,
inference(rat,[],[s13,s17]) ).
cnf(s19,plain,
spl4_6,
inference(rat,[],[s6,s18]) ).
cnf(s20,plain,
~ spl4_2,
inference(rat,[],[s15,s19]) ).
cnf(s21,plain,
$false,
inference(rat,[],[s1,s20,s16]) ).
thf(f117,plain,
$false,
inference(avatar_sat_refutation,[],[s21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET615^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n015.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.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Tue Sep 29 13:42:48 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.21 Running higher-order theorem proving
% 0.08/0.21 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.08/0.25 % (3538828)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.08/0.25 % (3538836)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=3149292706:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.08/0.25 % (3538836) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3538828-3538836"...
% 0.08/0.25 % (3538836)...printing done.
% 0.08/0.25 % (3538836)Refutation found. Thanks to Tanya!
% 0.08/0.25 % SZS status Theorem for theBenchmark
% 0.08/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.25 % (3538836)------------------------------
% 0.08/0.25 % (3538836)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.25 % (3538836)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.25 % (3538836)CaDiCaL version: 2.1.3
% 0.08/0.25 % (3538836)Termination reason: Refutation
% 0.08/0.25 % (3538836)Time elapsed: 0.002 s
% 0.08/0.25 % (3538836)Peak memory usage: 13 MB
% 0.08/0.25 % (3538836)Instructions burned: 5 (million)
% 0.08/0.25 % (3538828)Success in time 0.03 s
% 0.08/0.25 % Vampire exiting
%------------------------------------------------------------------------------