%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : KRS073+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n011.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 : Tue Sep 29 11:41:35 AM UTC 2026
% Result : Unsatisfiable 3.55s 1.47s
% Output : Refutation 3.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 9
% Syntax : Number of formulae : 61 ( 8 unt; 3 def)
% Number of atoms : 213 ( 9 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 252 ( 100 ~; 89 |; 48 &)
% ( 9 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 108 ( 0 sgn 88 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f21,axiom,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1] :
( rf(X0,X1)
& ! [X2] :
( rinvS(X1,X2)
=> cp(X2) )
& ! [X2] :
( rinvF(X1,X2)
=> ? [X3] :
( rs(X2,X3)
& cp(X3) ) ) )
& ~ cp(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(f22,axiom,
! [X0,X1,X2] :
( ( rf(X0,X1)
& rf(X0,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(f24,axiom,
! [X0,X1] :
( rinvF(X0,X1)
<=> rf(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(f26,axiom,
! [X0,X1] :
( rinvS(X0,X1)
<=> rs(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
fof(f28,axiom,
cUnsatisfiable(i2003_11_14_17_18_54369),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_9) ).
fof(f30,axiom,
! [X0,X1] :
( rs(X0,X1)
=> rf(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_11) ).
fof(f31,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1] :
( rf(X0,X1)
& ! [X2] :
( rinvS(X1,X2)
=> cp(X2) )
& ! [X3] :
( rinvF(X1,X3)
=> ? [X4] :
( rs(X3,X4)
& cp(X4) ) ) )
& ~ cp(X0) ) ),
inference(rectify,[],[f21]) ).
fof(f68,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1] :
( rf(X0,X1)
& ! [X2] :
( cp(X2)
| ~ rinvS(X1,X2) )
& ! [X3] :
( ? [X4] :
( rs(X3,X4)
& cp(X4) )
| ~ rinvF(X1,X3) ) )
& ~ cp(X0) ) ),
inference(ennf_transformation,[],[f31]) ).
fof(f69,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ rf(X0,X1)
| ~ rf(X0,X2) ),
inference(ennf_transformation,[],[f22]) ).
fof(f70,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ rf(X0,X1)
| ~ rf(X0,X2) ),
inference(flattening,[],[f69]) ).
fof(f76,plain,
! [X0,X1] :
( rf(X0,X1)
| ~ rs(X0,X1) ),
inference(ennf_transformation,[],[f30]) ).
fof(f77,definition,
! [X0] :
( sP0(X0)
<=> ( ? [X1] :
( rf(X0,X1)
& ! [X2] :
( cp(X2)
| ~ rinvS(X1,X2) )
& ! [X3] :
( ? [X4] :
( rs(X3,X4)
& cp(X4) )
| ~ rinvF(X1,X3) ) )
& ~ cp(X0) ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f78,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> sP0(X0) ),
inference(definition_folding,[],[f68,f77]) ).
fof(f80,plain,
! [X0] :
( ( sP0(X0)
| ! [X1] :
( ~ rf(X0,X1)
| ? [X2] :
( ~ cp(X2)
& rinvS(X1,X2) )
| ? [X3] :
( ! [X4] :
( ~ rs(X3,X4)
| ~ cp(X4) )
& rinvF(X1,X3) ) )
| cp(X0) )
& ( ( ? [X1] :
( rf(X0,X1)
& ! [X2] :
( cp(X2)
| ~ rinvS(X1,X2) )
& ! [X3] :
( ? [X4] :
( rs(X3,X4)
& cp(X4) )
| ~ rinvF(X1,X3) ) )
& ~ cp(X0) )
| ~ sP0(X0) ) ),
inference(nnf_transformation,[],[f77]) ).
fof(f81,plain,
! [X0] :
( ( sP0(X0)
| ! [X1] :
( ~ rf(X0,X1)
| ? [X2] :
( ~ cp(X2)
& rinvS(X1,X2) )
| ? [X3] :
( ! [X4] :
( ~ rs(X3,X4)
| ~ cp(X4) )
& rinvF(X1,X3) ) )
| cp(X0) )
& ( ( ? [X1] :
( rf(X0,X1)
& ! [X2] :
( cp(X2)
| ~ rinvS(X1,X2) )
& ! [X3] :
( ? [X4] :
( rs(X3,X4)
& cp(X4) )
| ~ rinvF(X1,X3) ) )
& ~ cp(X0) )
| ~ sP0(X0) ) ),
inference(flattening,[],[f80]) ).
fof(f82,plain,
! [X0] :
( ( sP0(X0)
| ! [X1] :
( ~ rf(X0,X1)
| ? [X2] :
( ~ cp(X2)
& rinvS(X1,X2) )
| ? [X3] :
( ! [X4] :
( ~ rs(X3,X4)
| ~ cp(X4) )
& rinvF(X1,X3) ) )
| cp(X0) )
& ( ( ? [X5] :
( rf(X0,X5)
& ! [X6] :
( cp(X6)
| ~ rinvS(X5,X6) )
& ! [X7] :
( ? [X8] :
( rs(X7,X8)
& cp(X8) )
| ~ rinvF(X5,X7) ) )
& ~ cp(X0) )
| ~ sP0(X0) ) ),
inference(rectify,[],[f81]) ).
fof(f83,plain,
! [X0] :
( ( sP0(X0)
| ! [X1] :
( ~ rf(X0,X1)
| ( ~ cp(sK1(X1))
& rinvS(X1,sK1(X1)) )
| ( ! [X4] :
( ~ rs(sK2(X1),X4)
| ~ cp(X4) )
& rinvF(X1,sK2(X1)) ) )
| cp(X0) )
& ( ( rf(X0,sK3(X0))
& ! [X6] :
( cp(X6)
| ~ rinvS(sK3(X0),X6) )
& ! [X7] :
( ( rs(X7,sK4(X7))
& cp(sK4(X7)) )
| ~ rinvF(sK3(X0),X7) )
& ~ cp(X0) )
| ~ sP0(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4]),skolemize(X2,sK1(X1)),skolemize(X3,sK2(X1)),skolemize(X5,sK3(X0)),skolemize(X8,sK4(X7))],[f82]) ).
fof(f84,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ~ sP0(X0) )
& ( sP0(X0)
| ~ cUnsatisfiable(X0) ) ),
inference(nnf_transformation,[],[f78]) ).
fof(f85,plain,
! [X0,X1] :
( ( rinvF(X0,X1)
| ~ rf(X1,X0) )
& ( rf(X1,X0)
| ~ rinvF(X0,X1) ) ),
inference(nnf_transformation,[],[f24]) ).
fof(f87,plain,
! [X0,X1] :
( ( rinvS(X0,X1)
| ~ rs(X1,X0) )
& ( rs(X1,X0)
| ~ rinvS(X0,X1) ) ),
inference(nnf_transformation,[],[f26]) ).
fof(f110,plain,
! [X0] :
( ~ sP0(X0)
| ~ cp(X0) ),
inference(cnf_transformation,[],[f83]) ).
fof(f112,plain,
! [X0,X7] :
( ~ sP0(X0)
| ~ rinvF(sK3(X0),X7)
| rs(X7,sK4(X7)) ),
inference(cnf_transformation,[],[f83]) ).
fof(f113,plain,
! [X0,X6] :
( ~ sP0(X0)
| ~ rinvS(sK3(X0),X6)
| cp(X6) ),
inference(cnf_transformation,[],[f83]) ).
fof(f114,plain,
! [X0] :
( rf(X0,sK3(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f83]) ).
fof(f119,plain,
! [X0] :
( sP0(X0)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f84]) ).
fof(f121,plain,
! [X2,X0,X1] :
( ~ rf(X0,X1)
| X1 = X2
| ~ rf(X0,X2) ),
inference(cnf_transformation,[],[f70]) ).
fof(f124,plain,
! [X0,X1] :
( rinvF(X0,X1)
| ~ rf(X1,X0) ),
inference(cnf_transformation,[],[f85]) ).
fof(f128,plain,
! [X0,X1] :
( rinvS(X0,X1)
| ~ rs(X1,X0) ),
inference(cnf_transformation,[],[f87]) ).
fof(f130,plain,
cUnsatisfiable(i2003_11_14_17_18_54369),
inference(cnf_transformation,[],[f28]) ).
fof(f132,plain,
! [X0,X1] :
( rf(X0,X1)
| ~ rs(X0,X1) ),
inference(cnf_transformation,[],[f76]) ).
fof(f151,plain,
! [X0] :
( ~ cp(X0)
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f119,f110]) ).
fof(f155,plain,
! [X0,X1] :
( cp(X1)
| ~ rinvS(sK3(X0),X1)
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f113,f119]) ).
fof(f156,plain,
! [X0,X1] :
( ~ rinvS(sK3(X0),X1)
| ~ cUnsatisfiable(X0)
| ~ cUnsatisfiable(X1) ),
inference(resolution,[],[f155,f151]) ).
fof(f158,plain,
! [X0,X1] :
( ~ rs(X1,sK3(X0))
| ~ cUnsatisfiable(X1)
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f156,f128]) ).
fof(f159,plain,
! [X0,X1] :
( ~ sP0(X0)
| ~ rf(X0,X1)
| sK3(X0) = X1 ),
inference(resolution,[],[f121,f114]) ).
fof(f166,plain,
! [X0,X1] :
( ~ cUnsatisfiable(X0)
| rs(X1,sK4(X1))
| ~ rinvF(sK3(X0),X1) ),
inference(resolution,[],[f112,f119]) ).
fof(f167,plain,
! [X0,X1] :
( ~ cUnsatisfiable(X0)
| sK3(X0) = X1
| ~ rf(X0,X1) ),
inference(resolution,[],[f159,f119]) ).
fof(f176,plain,
! [X0] :
( ~ rf(i2003_11_14_17_18_54369,X0)
| sK3(i2003_11_14_17_18_54369) = X0 ),
inference(resolution,[],[f167,f130]) ).
fof(f178,plain,
! [X0] :
( ~ rinvF(sK3(i2003_11_14_17_18_54369),X0)
| rs(X0,sK4(X0)) ),
inference(resolution,[],[f166,f130]) ).
fof(f181,plain,
! [X0] :
( ~ rs(i2003_11_14_17_18_54369,X0)
| sK3(i2003_11_14_17_18_54369) = X0 ),
inference(resolution,[],[f176,f132]) ).
fof(f187,plain,
! [X0] :
( ~ rf(X0,sK3(i2003_11_14_17_18_54369))
| rs(X0,sK4(X0)) ),
inference(resolution,[],[f178,f124]) ).
fof(f202,plain,
( rs(i2003_11_14_17_18_54369,sK4(i2003_11_14_17_18_54369))
| ~ sP0(i2003_11_14_17_18_54369) ),
inference(resolution,[],[f187,f114]) ).
fof(f207,definition,
( spl5_4
<=> sP0(i2003_11_14_17_18_54369) ),
introduced(definition,[new_symbols(definition,[spl5_4])],[avatar_definition]) ).
fof(f209,plain,
( ~ sP0(i2003_11_14_17_18_54369)
| spl5_4 ),
inference(avatar_component_clause,[],[f207]) ).
fof(f211,definition,
( spl5_5
<=> rs(i2003_11_14_17_18_54369,sK4(i2003_11_14_17_18_54369)) ),
introduced(definition,[new_symbols(definition,[spl5_5])],[avatar_definition]) ).
fof(f213,plain,
( rs(i2003_11_14_17_18_54369,sK4(i2003_11_14_17_18_54369))
| ~ spl5_5 ),
inference(avatar_component_clause,[],[f211]) ).
fof(f214,plain,
( ~ spl5_4
| spl5_5 ),
inference(avatar_split_clause,[],[f202,f211,f207]) ).
fof(f217,plain,
( ~ cUnsatisfiable(i2003_11_14_17_18_54369)
| spl5_4 ),
inference(resolution,[],[f209,f119]) ).
fof(f218,plain,
( $false
| spl5_4 ),
inference(forward_subsumption_resolution,[],[f217,f130]) ).
fof(f219,plain,
spl5_4,
inference(avatar_contradiction_clause,[],[f218]) ).
fof(f232,plain,
( sK3(i2003_11_14_17_18_54369) = sK4(i2003_11_14_17_18_54369)
| ~ spl5_5 ),
inference(resolution,[],[f213,f181]) ).
fof(f248,plain,
( rs(i2003_11_14_17_18_54369,sK3(i2003_11_14_17_18_54369))
| ~ spl5_5 ),
inference(superposition,[],[f213,f232]) ).
fof(f275,plain,
( ~ cUnsatisfiable(i2003_11_14_17_18_54369)
| ~ cUnsatisfiable(i2003_11_14_17_18_54369)
| ~ spl5_5 ),
inference(resolution,[],[f248,f158]) ).
fof(f280,plain,
( ~ cUnsatisfiable(i2003_11_14_17_18_54369)
| ~ spl5_5 ),
inference(duplicate_literal_removal,[],[f275]) ).
fof(f281,plain,
( $false
| ~ spl5_5 ),
inference(forward_subsumption_resolution,[],[f280,f130]) ).
fof(f282,plain,
~ spl5_5,
inference(avatar_contradiction_clause,[],[f281]) ).
cnf(s3,plain,
( ~ spl5_4
| spl5_5 ),
inference(sat_conversion,[],[f214]) ).
cnf(s4,plain,
spl5_4,
inference(sat_conversion,[],[f219]) ).
cnf(s8,plain,
~ spl5_5,
inference(sat_conversion,[],[f282]) ).
cnf(s9,plain,
$false,
inference(rat,[],[s3,s8,s4]) ).
fof(f283,plain,
$false,
inference(avatar_sat_refutation,[],[s9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KRS073+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n011.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Sun Sep 27 13:19:15 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/0.41 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.69/1.27 % (2406221)Detected formulas, will run a generic FOF schedule.
% 2.69/1.27 % (2406230)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2565051914:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.69/1.27 % (2406230)Refutation not found, incomplete strategy
% 2.69/1.27 % (2406230)------------------------------
% 2.69/1.27 % (2406230)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.69/1.27 % (2406230)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.69/1.27 % (2406230)CaDiCaL version: 2.1.3
% 2.69/1.27 % (2406230)Termination reason: Refutation not found, incomplete strategy
% 2.69/1.27 % (2406230)Time elapsed: 0.0000 s
% 2.69/1.27 % (2406230)Peak memory usage: 86 MB
% 2.69/1.27 % (2406232)dis-21_1_sil=8000:lcm=predicate:random_seed=1262307687:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.69/1.27 % (2406227)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=312334865:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.69/1.27 % (2406226)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=2769352738:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.69/1.27 % (2406229)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1896607106:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.69/1.27 % (2406228)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=506763748:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.69/1.27 % (2406229)Refutation not found, incomplete strategy
% 2.69/1.27 % (2406229)------------------------------
% 2.69/1.27 % (2406229)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.69/1.27 % (2406229)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.69/1.27 % (2406229)CaDiCaL version: 2.1.3
% 2.69/1.27 % (2406229)Termination reason: Refutation not found, incomplete strategy
% 2.69/1.27 % (2406229)Time elapsed: 0.0000 s
% 2.69/1.27 % (2406229)Peak memory usage: 86 MB
% 2.69/1.27 % (2406231)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2640289614:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.69/1.27 % (2406231)First to succeed.
% 2.69/1.27 % (2406231)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2406221"
% 2.69/1.27 % (2406232)Instruction limit reached!
% 2.69/1.27 % (2406232)------------------------------
% 2.69/1.27 % (2406232)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.69/1.27 % (2406232)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.69/1.27 % (2406232)CaDiCaL version: 2.1.3
% 2.69/1.27 % (2406232)Termination reason: Instruction limit
% 2.69/1.27 % (2406232)Termination phase: Saturation
% 2.69/1.27 % (2406232)Time elapsed: 0.070 s
% 2.69/1.27 % (2406232)Peak memory usage: 88 MB
% 2.69/1.27 % (2406232)Instructions burned: 130 (million)
% 2.69/1.27 % (2406230)------------------------------
% 2.69/1.27 % (2406230)------------------------------
% 2.69/1.27 % (2406241)lrs+10_1_sil=8000:sp=occurrence:random_seed=3132882799:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.69/1.27 % (2406241)Refutation not found, incomplete strategy
% 2.69/1.27 % (2406241)------------------------------
% 2.69/1.27 % (2406241)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.69/1.27 % (2406241)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.69/1.27 % (2406241)CaDiCaL version: 2.1.3
% 2.69/1.27 % (2406241)Termination reason: Refutation not found, incomplete strategy
% 2.69/1.27 % (2406241)Time elapsed: 0.001 s
% 2.69/1.27 % (2406241)Peak memory usage: 86 MB
% 2.69/1.27 % (2406242)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1894269690:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.69/1.27 % (2406242)Refutation not found, incomplete strategy
% 2.69/1.27 % (2406242)------------------------------
% 2.69/1.27 % (2406242)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.69/1.27 % (2406242)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.69/1.27 % (2406242)CaDiCaL version: 2.1.3
% 3.55/1.47 % (2406242)Termination reason: Refutation not found, incomplete strategy
% 3.55/1.47 % (2406242)Time elapsed: 0.0000 s
% 3.55/1.47 % (2406242)Peak memory usage: 87 MB
% 3.55/1.47 % (2406229)------------------------------
% 3.55/1.47 % (2406229)------------------------------
% 3.55/1.47 % (2406231)Refutation found. Thanks to Tanya!
% 3.55/1.47 % SZS status Unsatisfiable for theBenchmark
% 3.55/1.47 % SZS output start Proof for theBenchmark
% See solution above
% 3.55/1.47 % (2406231)------------------------------
% 3.55/1.47 % (2406231)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.55/1.47 % (2406231)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.55/1.47 % (2406231)CaDiCaL version: 2.1.3
% 3.55/1.47 % (2406231)Termination reason: Refutation
% 3.55/1.47 % (2406231)Time elapsed: 0.008 s
% 3.55/1.47 % (2406231)Peak memory usage: 89 MB
% 3.55/1.47 % (2406231)Instructions burned: 8 (million)
% 3.55/1.47 % (2406231)------------------------------
% 3.55/1.47 % (2406231)------------------------------
% 3.55/1.47 % (2406221)Success in time 0.42 s
% 3.55/1.47 % Vampire exiting
%------------------------------------------------------------------------------