%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET609^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n004.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:42 AM UTC 2026
% Result : Theorem 0.10s 0.23s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 7
% Syntax : Number of formulae : 77 ( 18 unt; 0 typ; 6 def)
% Number of atoms : 451 ( 108 equ; 0 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 515 ( 101 ~; 107 |; 80 &; 221 @)
% ( 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 : 15 ( 15 >; 0 *; 0 +; 0 <<)
% Number of symbols : 19 ( 16 usr; 9 con; 0-4 aty)
% Number of variables : 35 ( 0 sgn 12 !; 3 ?; 35 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_1,type,
vAND: $o > $o > $o ).
thf(func_def_2,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_3,type,
vNOT: $o > $o ).
thf(func_def_4,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_5,type,
vOR: $o > $o > $o ).
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,
! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [X3: a] :
( ~ ( ~ ( X2 @ X3 )
& ( X1 @ X3 ) )
& ( X0 @ X3 ) ) )
= ( ^ [X4: a] :
( ( ( X2 @ X4 )
& ( X0 @ X4 ) )
| ( ~ ( X1 @ X4 )
& ( X0 @ X4 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBOOL_PROP_81_pme) ).
thf(f2,negated_conjecture,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [X3: a] :
( ~ ( ~ ( X2 @ X3 )
& ( X1 @ X3 ) )
& ( X0 @ X3 ) ) )
= ( ^ [X4: a] :
( ( ( X2 @ X4 )
& ( X0 @ X4 ) )
| ( ~ ( X1 @ X4 )
& ( X0 @ X4 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [X3: a] :
( ~ ( ~ ( X2 @ X3 )
& ( X1 @ X3 ) )
& ( X0 @ X3 ) ) )
= ( ^ [X4: a] :
( ( ( X2 @ X4 )
& ( X0 @ X4 ) )
| ( ~ ( X1 @ X4 )
& ( X0 @ X4 ) ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [Y0: a] :
( ( X0 @ Y0 )
& ~ ( ( X1 @ Y0 )
& ~ ( X2 @ Y0 ) ) ) )
= ( ^ [Y0: a] :
( ( ( X0 @ Y0 )
& ~ ( X1 @ Y0 ) )
| ( ( X0 @ Y0 )
& ( X2 @ Y0 ) ) ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [Y0: a] :
( ( X0 @ Y0 )
& ~ ( ( X1 @ Y0 )
& ~ ( X2 @ Y0 ) ) ) )
!= ( ^ [Y0: a] :
( ( ( X0 @ Y0 )
& ~ ( X1 @ Y0 ) )
| ( ( X0 @ Y0 )
& ( X2 @ Y0 ) ) ) ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ~ ( ( sK1 @ Y0 )
& ~ ( sK2 @ Y0 ) ) ) )
!= ( ^ [Y0: a] :
( ( ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 ) )
| ( ( sK0 @ Y0 )
& ( sK2 @ Y0 ) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f5]) ).
thf(f7,plain,
( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ~ ( ( sK1 @ Y0 )
& ~ ( sK2 @ Y0 ) ) ) )
!= ( ^ [Y0: a] :
( ( ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 ) )
| ( ( sK0 @ Y0 )
& ( sK2 @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f17,plain,
( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ~ ( ( sK1 @ Y0 )
& ~ ( sK2 @ Y0 ) ) )
@ sK3 )
!= ( ^ [Y0: a] :
( ( ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 ) )
| ( ( sK0 @ Y0 )
& ( sK2 @ Y0 ) ) )
@ sK3 ) ),
inference(negative_extensionality,[],[f7]) ).
thf(f18,plain,
( ( $true
= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ~ ( ( sK1 @ Y0 )
& ~ ( sK2 @ Y0 ) ) )
@ sK3 ) )
| ( $true
= ( ^ [Y0: a] :
( ( ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 ) )
| ( ( sK0 @ Y0 )
& ( sK2 @ Y0 ) ) )
@ sK3 ) ) ),
inference(xor_proxy_clausification,[],[f17]) ).
thf(f19,plain,
( ( $false
= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ~ ( ( sK1 @ Y0 )
& ~ ( sK2 @ Y0 ) ) )
@ sK3 ) )
| ( $false
= ( ^ [Y0: a] :
( ( ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 ) )
| ( ( sK0 @ Y0 )
& ( sK2 @ Y0 ) ) )
@ sK3 ) ) ),
inference(xor_proxy_clausification,[],[f17]) ).
thf(f20,plain,
( ( $false
= ( ( sK0 @ sK3 )
& ~ ( ( sK1 @ sK3 )
& ~ ( sK2 @ sK3 ) ) ) )
| ( $false
= ( ( ( sK0 @ sK3 )
& ~ ( sK1 @ sK3 ) )
| ( ( sK0 @ sK3 )
& ( sK2 @ sK3 ) ) ) ) ),
inference(beta-eta_normalization,[],[f19]) ).
thf(f21,plain,
( ( $false
= ( ~ ( ( sK1 @ sK3 )
& ~ ( sK2 @ sK3 ) ) ) )
| ( $false
= ( ( ( sK0 @ sK3 )
& ~ ( sK1 @ sK3 ) )
| ( ( sK0 @ sK3 )
& ( sK2 @ sK3 ) ) ) )
| ( $false
= ( sK0 @ sK3 ) ) ),
inference(and_proxy_clausification,[],[f20]) ).
thf(f22,plain,
( ( $true
= ( ( sK1 @ sK3 )
& ~ ( sK2 @ sK3 ) ) )
| ( $false
= ( ( ( sK0 @ sK3 )
& ~ ( sK1 @ sK3 ) )
| ( ( sK0 @ sK3 )
& ( sK2 @ sK3 ) ) ) )
| ( $false
= ( sK0 @ sK3 ) ) ),
inference(not_proxy_clausification,[],[f21]) ).
thf(f23,plain,
( ( $true
= ( ~ ( sK2 @ sK3 ) ) )
| ( $false
= ( ( ( sK0 @ sK3 )
& ~ ( sK1 @ sK3 ) )
| ( ( sK0 @ sK3 )
& ( sK2 @ sK3 ) ) ) )
| ( $false
= ( sK0 @ sK3 ) ) ),
inference(and_proxy_clausification,[],[f22]) ).
thf(f24,plain,
( ( $true
= ( sK1 @ sK3 ) )
| ( $false
= ( ( ( sK0 @ sK3 )
& ~ ( sK1 @ sK3 ) )
| ( ( sK0 @ sK3 )
& ( sK2 @ sK3 ) ) ) )
| ( $false
= ( sK0 @ sK3 ) ) ),
inference(and_proxy_clausification,[],[f22]) ).
thf(f26,plain,
( ( $true
= ( sK1 @ sK3 ) )
| ( $false
= ( ( sK0 @ sK3 )
& ~ ( sK1 @ sK3 ) ) )
| ( $false
= ( sK0 @ sK3 ) ) ),
inference(or_proxy_clausification,[],[f24]) ).
thf(f27,plain,
( ( $true
= ( sK1 @ sK3 ) )
| ( $false
= ( ~ ( sK1 @ sK3 ) ) )
| ( $false
= ( sK0 @ sK3 ) )
| ( $false
= ( sK0 @ sK3 ) ) ),
inference(and_proxy_clausification,[],[f26]) ).
thf(f28,plain,
( ( $true
= ( sK1 @ sK3 ) )
| ( $true
= ( sK1 @ sK3 ) )
| ( $false
= ( sK0 @ sK3 ) )
| ( $false
= ( sK0 @ sK3 ) ) ),
inference(not_proxy_clausification,[],[f27]) ).
thf(f29,plain,
( ( $true
= ( sK1 @ sK3 ) )
| ( $false
= ( sK0 @ sK3 ) ) ),
inference(duplicate_literal_removal,[],[f28]) ).
thf(f32,plain,
( ( $false
= ( sK2 @ sK3 ) )
| ( $false
= ( ( ( sK0 @ sK3 )
& ~ ( sK1 @ sK3 ) )
| ( ( sK0 @ sK3 )
& ( sK2 @ sK3 ) ) ) )
| ( $false
= ( sK0 @ sK3 ) ) ),
inference(not_proxy_clausification,[],[f23]) ).
thf(f33,plain,
( ( $false
= ( sK2 @ sK3 ) )
| ( $false
= ( ( sK0 @ sK3 )
& ( sK2 @ sK3 ) ) )
| ( $false
= ( sK0 @ sK3 ) ) ),
inference(or_proxy_clausification,[],[f32]) ).
thf(f38,plain,
( ( $false
= ( sK2 @ sK3 ) )
| ( $false
= ( sK2 @ sK3 ) )
| ( $false
= ( sK0 @ sK3 ) )
| ( $false
= ( sK0 @ sK3 ) ) ),
inference(and_proxy_clausification,[],[f33]) ).
thf(f39,plain,
( ( $false
= ( sK2 @ sK3 ) )
| ( $false
= ( sK0 @ sK3 ) ) ),
inference(duplicate_literal_removal,[],[f38]) ).
thf(f40,plain,
( ( $true
= ( ( sK0 @ sK3 )
& ~ ( ( sK1 @ sK3 )
& ~ ( sK2 @ sK3 ) ) ) )
| ( $true
= ( ( ( sK0 @ sK3 )
& ~ ( sK1 @ sK3 ) )
| ( ( sK0 @ sK3 )
& ( sK2 @ sK3 ) ) ) ) ),
inference(beta-eta_normalization,[],[f18]) ).
thf(f41,plain,
( ( $true
= ( ~ ( ( sK1 @ sK3 )
& ~ ( sK2 @ sK3 ) ) ) )
| ( $true
= ( ( ( sK0 @ sK3 )
& ~ ( sK1 @ sK3 ) )
| ( ( sK0 @ sK3 )
& ( sK2 @ sK3 ) ) ) ) ),
inference(and_proxy_clausification,[],[f40]) ).
thf(f42,plain,
( ( $true
= ( sK0 @ sK3 ) )
| ( $true
= ( ( ( sK0 @ sK3 )
& ~ ( sK1 @ sK3 ) )
| ( ( sK0 @ sK3 )
& ( sK2 @ sK3 ) ) ) ) ),
inference(and_proxy_clausification,[],[f40]) ).
thf(f43,plain,
( ( $true
= ( sK0 @ sK3 ) )
| ( $true
= ( ( sK0 @ sK3 )
& ( sK2 @ sK3 ) ) )
| ( $true
= ( ( sK0 @ sK3 )
& ~ ( sK1 @ sK3 ) ) ) ),
inference(or_proxy_clausification,[],[f42]) ).
thf(f45,plain,
( ( $true
= ( sK0 @ sK3 ) )
| ( $true
= ( sK0 @ sK3 ) )
| ( $true
= ( ( sK0 @ sK3 )
& ~ ( sK1 @ sK3 ) ) ) ),
inference(and_proxy_clausification,[],[f43]) ).
thf(f47,plain,
( ( $true
= ( sK0 @ sK3 ) )
| ( $true
= ( sK0 @ sK3 ) )
| ( $true
= ( sK0 @ sK3 ) ) ),
inference(and_proxy_clausification,[],[f45]) ).
thf(f48,plain,
( $true
= ( sK0 @ sK3 ) ),
inference(duplicate_literal_removal,[],[f47]) ).
thf(f55,plain,
( ( $false
= ( ( sK1 @ sK3 )
& ~ ( sK2 @ sK3 ) ) )
| ( $true
= ( ( ( sK0 @ sK3 )
& ~ ( sK1 @ sK3 ) )
| ( ( sK0 @ sK3 )
& ( sK2 @ sK3 ) ) ) ) ),
inference(not_proxy_clausification,[],[f41]) ).
thf(f56,plain,
( ( $false
= ( ~ ( sK2 @ sK3 ) ) )
| ( $true
= ( ( ( sK0 @ sK3 )
& ~ ( sK1 @ sK3 ) )
| ( ( sK0 @ sK3 )
& ( sK2 @ sK3 ) ) ) )
| ( $false
= ( sK1 @ sK3 ) ) ),
inference(and_proxy_clausification,[],[f55]) ).
thf(f57,plain,
( ( $true
= ( sK2 @ sK3 ) )
| ( $true
= ( ( ( sK0 @ sK3 )
& ~ ( sK1 @ sK3 ) )
| ( ( sK0 @ sK3 )
& ( sK2 @ sK3 ) ) ) )
| ( $false
= ( sK1 @ sK3 ) ) ),
inference(not_proxy_clausification,[],[f56]) ).
thf(f58,plain,
( ( $true
= ( sK2 @ sK3 ) )
| ( $true
= ( ( sK0 @ sK3 )
& ( sK2 @ sK3 ) ) )
| ( $false
= ( sK1 @ sK3 ) )
| ( $true
= ( ( sK0 @ sK3 )
& ~ ( sK1 @ sK3 ) ) ) ),
inference(or_proxy_clausification,[],[f57]) ).
thf(f59,plain,
( ( $true
= ( sK2 @ sK3 ) )
| ( $true
= ( sK2 @ sK3 ) )
| ( $false
= ( sK1 @ sK3 ) )
| ( $true
= ( ( sK0 @ sK3 )
& ~ ( sK1 @ sK3 ) ) ) ),
inference(and_proxy_clausification,[],[f58]) ).
thf(f66,plain,
( ( $true
= ( sK2 @ sK3 ) )
| ( $true
= ( sK2 @ sK3 ) )
| ( $false
= ( sK1 @ sK3 ) )
| ( $true
= ( ~ ( sK1 @ sK3 ) ) ) ),
inference(and_proxy_clausification,[],[f59]) ).
thf(f69,plain,
( ( $true
= ( sK2 @ sK3 ) )
| ( $true
= ( sK2 @ sK3 ) )
| ( $false
= ( sK1 @ sK3 ) )
| ( $false
= ( sK1 @ sK3 ) ) ),
inference(not_proxy_clausification,[],[f66]) ).
thf(f70,plain,
( ( $true
= ( sK2 @ sK3 ) )
| ( $false
= ( sK1 @ sK3 ) ) ),
inference(duplicate_literal_removal,[],[f69]) ).
thf(f72,definition,
( spl4_1
<=> ( $false
= ( sK0 @ sK3 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition]) ).
thf(f74,plain,
( ( $false
= ( sK0 @ sK3 ) )
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f72]) ).
thf(f76,definition,
( spl4_2
<=> ( $true
= ( sK1 @ sK3 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition]) ).
thf(f78,plain,
( ( $true
= ( sK1 @ sK3 ) )
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f76]) ).
thf(f79,plain,
( spl4_1
| spl4_2 ),
inference(avatar_split_clause,[],[f29,f76,f72]) ).
thf(f81,definition,
( spl4_3
<=> ( $false
= ( sK2 @ sK3 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_3])],[avatar_definition]) ).
thf(f83,plain,
( ( $false
= ( sK2 @ sK3 ) )
| ~ spl4_3 ),
inference(avatar_component_clause,[],[f81]) ).
thf(f86,plain,
( spl4_1
| spl4_3 ),
inference(avatar_split_clause,[],[f39,f81,f72]) ).
thf(f88,definition,
( spl4_4
<=> ( $false
= ( sK1 @ sK3 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_4])],[avatar_definition]) ).
thf(f90,plain,
( ( $false
= ( sK1 @ sK3 ) )
| ~ spl4_4 ),
inference(avatar_component_clause,[],[f88]) ).
thf(f92,definition,
( spl4_5
<=> ( $true
= ( sK0 @ sK3 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_5])],[avatar_definition]) ).
thf(f94,plain,
( ( $true
= ( sK0 @ sK3 ) )
| ~ spl4_5 ),
inference(avatar_component_clause,[],[f92]) ).
thf(f97,definition,
( spl4_6
<=> ( $true
= ( sK2 @ sK3 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_6])],[avatar_definition]) ).
thf(f99,plain,
( ( $true
= ( sK2 @ sK3 ) )
| ~ spl4_6 ),
inference(avatar_component_clause,[],[f97]) ).
thf(f105,plain,
( spl4_4
| spl4_6 ),
inference(avatar_split_clause,[],[f70,f97,f88]) ).
thf(f108,plain,
spl4_5,
inference(avatar_split_clause,[],[f48,f92]) ).
thf(f110,plain,
( ( $true = $false )
| ~ spl4_2
| ~ spl4_4 ),
inference(constrained_superposition,[],[f90,f78]) ).
thf(f114,plain,
( $false
| ~ spl4_2
| ~ spl4_4 ),
inference(trivial_inequality_removal,[],[f110]) ).
thf(f115,plain,
( ~ spl4_2
| ~ spl4_4 ),
inference(avatar_contradiction_clause,[],[f114]) ).
thf(f120,plain,
( ( $true = $false )
| ~ spl4_1
| ~ spl4_5 ),
inference(forward_demodulation,[],[f94,f74]) ).
thf(f121,plain,
( $false
| ~ spl4_1
| ~ spl4_5 ),
inference(trivial_inequality_removal,[],[f120]) ).
thf(f122,plain,
( ~ spl4_1
| ~ spl4_5 ),
inference(avatar_contradiction_clause,[],[f121]) ).
thf(f123,plain,
( ( $true = $false )
| ~ spl4_3
| ~ spl4_6 ),
inference(forward_demodulation,[],[f99,f83]) ).
thf(f124,plain,
( $false
| ~ spl4_3
| ~ spl4_6 ),
inference(trivial_inequality_removal,[],[f123]) ).
thf(f125,plain,
( ~ spl4_3
| ~ spl4_6 ),
inference(avatar_contradiction_clause,[],[f124]) ).
cnf(s1,plain,
( spl4_1
| spl4_2 ),
inference(sat_conversion,[],[f79]) ).
cnf(s4,plain,
( spl4_1
| spl4_3 ),
inference(sat_conversion,[],[f86]) ).
cnf(s11,plain,
( spl4_4
| spl4_6 ),
inference(sat_conversion,[],[f105]) ).
cnf(s12,plain,
spl4_5,
inference(sat_conversion,[],[f108]) ).
cnf(s14,plain,
( ~ spl4_2
| ~ spl4_4 ),
inference(sat_conversion,[],[f115]) ).
cnf(s15,plain,
( ~ spl4_1
| ~ spl4_5 ),
inference(sat_conversion,[],[f122]) ).
cnf(s16,plain,
( ~ spl4_3
| ~ spl4_6 ),
inference(sat_conversion,[],[f125]) ).
cnf(s17,plain,
~ spl4_1,
inference(rat,[],[s15,s12]) ).
cnf(s18,plain,
spl4_3,
inference(rat,[],[s4,s17]) ).
cnf(s19,plain,
~ spl4_6,
inference(rat,[],[s16,s18]) ).
cnf(s20,plain,
spl4_4,
inference(rat,[],[s11,s19]) ).
cnf(s21,plain,
~ spl4_2,
inference(rat,[],[s14,s20]) ).
cnf(s22,plain,
$false,
inference(rat,[],[s1,s21,s17]) ).
thf(f126,plain,
$false,
inference(avatar_sat_refutation,[],[s22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET609^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.17 % Computer : n004.cluster.edu
% 0.10/0.17 % Model : x86_64 x86_64
% 0.10/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.17 % Memory : 8046.5625MB
% 0.10/0.17 % OS : Linux 6.8.0-71-generic
% 0.10/0.17 % CPULimit : 300
% 0.10/0.17 % WCLimit : 300
% 0.10/0.17 % DateTime : Tue Sep 29 13:38:52 UTC 2026
% 0.10/0.18 % CPUTime :
% 0.10/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.21 Running first-order model finding
% 0.10/0.21 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.23 % (1293882)Will run a generic schedule for satisfiability detection.
% 0.10/0.23 % (1293892)dis+10_1_sil=32000:sp=arity:random_seed=226635464:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.10/0.23 % (1293892) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1293882-1293892"...
% 0.10/0.23 % (1293892)...printing done.
% 0.10/0.23 % (1293892)Refutation found. Thanks to Tanya!
% 0.10/0.23 % SZS status Theorem for theBenchmark
% 0.10/0.23 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.24 % (1293892)------------------------------
% 0.10/0.24 % (1293892)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.24 % (1293892)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.24 % (1293892)CaDiCaL version: 2.1.3
% 0.10/0.24 % (1293892)Termination reason: Refutation
% 0.10/0.24 % (1293892)Time elapsed: 0.002 s
% 0.10/0.24 % (1293892)Peak memory usage: 12 MB
% 0.10/0.24 % (1293892)Instructions burned: 6 (million)
% 0.10/0.24 % (1293882)Success in time 0.016 s
% 0.10/0.24 % Vampire exiting
%------------------------------------------------------------------------------