%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET697+4 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n013.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 12:41:41 PM UTC 2026
% Result : Theorem 2.84s 1.24s
% Output : Refutation 3.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 10
% Syntax : Number of formulae : 86 ( 10 unt; 4 def)
% Number of atoms : 246 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 263 ( 103 ~; 108 |; 36 &)
% ( 11 <=>; 3 =>; 0 <=; 2 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 5 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 95 ( 0 sgn 81 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset) ).
fof(f2,axiom,
! [X0,X1] :
( equal_set(X0,X1)
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_set) ).
fof(f4,axiom,
! [X0,X1,X2] :
( member(X0,intersection(X1,X2))
<=> ( member(X0,X1)
& member(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection) ).
fof(f6,axiom,
! [X0] : ~ member(X0,empty_set),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',empty_set) ).
fof(f7,axiom,
! [X0,X1,X2] :
( member(X0,difference(X2,X1))
<=> ( member(X0,X2)
& ~ member(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',difference) ).
fof(f12,conjecture,
! [X0,X1,X2] :
( ( subset(X0,X2)
& subset(X1,X2) )
=> ( subset(X0,X1)
<=> equal_set(intersection(X0,difference(X2,X1)),empty_set) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI31) ).
fof(f13,negated_conjecture,
~ ! [X0,X1,X2] :
( ( subset(X0,X2)
& subset(X1,X2) )
=> ( subset(X0,X1)
<=> equal_set(intersection(X0,difference(X2,X1)),empty_set) ) ),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f14,plain,
? [X0,X1,X2] :
( ( subset(X0,X1)
<~> equal_set(intersection(X0,difference(X2,X1)),empty_set) )
& subset(X0,X2)
& subset(X1,X2) ),
inference(ennf_transformation,[],[f13]) ).
fof(f15,plain,
? [X0,X1,X2] :
( ( subset(X0,X1)
<~> equal_set(intersection(X0,difference(X2,X1)),empty_set) )
& subset(X0,X2)
& subset(X1,X2) ),
inference(flattening,[],[f14]) ).
fof(f16,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f17,plain,
? [X0,X1,X2] :
( ( ~ equal_set(intersection(X0,difference(X2,X1)),empty_set)
| ~ subset(X0,X1) )
& ( equal_set(intersection(X0,difference(X2,X1)),empty_set)
| subset(X0,X1) )
& subset(X0,X2)
& subset(X1,X2) ),
inference(nnf_transformation,[],[f15]) ).
fof(f18,plain,
? [X0,X1,X2] :
( ( ~ equal_set(intersection(X0,difference(X2,X1)),empty_set)
| ~ subset(X0,X1) )
& ( equal_set(intersection(X0,difference(X2,X1)),empty_set)
| subset(X0,X1) )
& subset(X0,X2)
& subset(X1,X2) ),
inference(flattening,[],[f17]) ).
fof(f19,plain,
( ( ~ equal_set(intersection(sK0,difference(sK2,sK1)),empty_set)
| ~ subset(sK0,sK1) )
& ( equal_set(intersection(sK0,difference(sK2,sK1)),empty_set)
| subset(sK0,sK1) )
& subset(sK0,sK2)
& subset(sK1,sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f18]) ).
fof(f21,plain,
! [X0,X1] :
( ( equal_set(X0,X1)
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| ~ equal_set(X0,X1) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f22,plain,
! [X0,X1] :
( ( equal_set(X0,X1)
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| ~ equal_set(X0,X1) ) ),
inference(flattening,[],[f21]) ).
fof(f23,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f16]) ).
fof(f24,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f23]) ).
fof(f25,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK3(X0,X1),X1)
& member(sK3(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X2,sK3(X0,X1))],[f24]) ).
fof(f26,plain,
! [X0,X1,X2] :
( ( member(X0,intersection(X1,X2))
| ~ member(X0,X1)
| ~ member(X0,X2) )
& ( ( member(X0,X1)
& member(X0,X2) )
| ~ member(X0,intersection(X1,X2)) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f27,plain,
! [X0,X1,X2] :
( ( member(X0,intersection(X1,X2))
| ~ member(X0,X1)
| ~ member(X0,X2) )
& ( ( member(X0,X1)
& member(X0,X2) )
| ~ member(X0,intersection(X1,X2)) ) ),
inference(flattening,[],[f26]) ).
fof(f28,plain,
! [X0,X1,X2] :
( ( member(X0,difference(X2,X1))
| ~ member(X0,X2)
| member(X0,X1) )
& ( ( member(X0,X2)
& ~ member(X0,X1) )
| ~ member(X0,difference(X2,X1)) ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f29,plain,
! [X0,X1,X2] :
( ( member(X0,difference(X2,X1))
| ~ member(X0,X2)
| member(X0,X1) )
& ( ( member(X0,X2)
& ~ member(X0,X1) )
| ~ member(X0,difference(X2,X1)) ) ),
inference(flattening,[],[f28]) ).
fof(f31,plain,
subset(sK0,sK2),
inference(cnf_transformation,[],[f19]) ).
fof(f32,plain,
( equal_set(intersection(sK0,difference(sK2,sK1)),empty_set)
| subset(sK0,sK1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f33,plain,
( ~ equal_set(intersection(sK0,difference(sK2,sK1)),empty_set)
| ~ subset(sK0,sK1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f37,plain,
! [X0,X1] :
( ~ equal_set(X0,X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f38,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(cnf_transformation,[],[f22]) ).
fof(f39,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ member(X3,X0)
| member(X3,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f40,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK3(X0,X1),X0) ),
inference(cnf_transformation,[],[f25]) ).
fof(f41,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK3(X0,X1),X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f42,plain,
! [X2,X0,X1] :
( ~ member(X0,intersection(X1,X2))
| member(X0,X2) ),
inference(cnf_transformation,[],[f27]) ).
fof(f43,plain,
! [X2,X0,X1] :
( ~ member(X0,intersection(X1,X2))
| member(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f44,plain,
! [X2,X0,X1] :
( member(X0,intersection(X1,X2))
| ~ member(X0,X1)
| ~ member(X0,X2) ),
inference(cnf_transformation,[],[f27]) ).
fof(f45,plain,
! [X0] : ~ member(X0,empty_set),
inference(cnf_transformation,[],[f6]) ).
fof(f46,plain,
! [X2,X0,X1] :
( ~ member(X0,difference(X2,X1))
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f29]) ).
fof(f48,plain,
! [X2,X0,X1] :
( member(X0,difference(X2,X1))
| ~ member(X0,X2)
| member(X0,X1) ),
inference(cnf_transformation,[],[f29]) ).
fof(f50,definition,
( spl4_1
<=> subset(sK0,sK1) ),
introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition]) ).
fof(f51,plain,
( subset(sK0,sK1)
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f50]) ).
fof(f53,definition,
( spl4_2
<=> equal_set(intersection(sK0,difference(sK2,sK1)),empty_set) ),
introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition]) ).
fof(f54,plain,
( equal_set(intersection(sK0,difference(sK2,sK1)),empty_set)
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f53]) ).
fof(f55,plain,
( spl4_1
| spl4_2 ),
inference(avatar_split_clause,[],[f32,f53,f50]) ).
fof(f56,plain,
( ~ subset(sK0,sK1)
| spl4_1 ),
inference(avatar_component_clause,[],[f50]) ).
fof(f57,plain,
( ~ equal_set(intersection(sK0,difference(sK2,sK1)),empty_set)
| spl4_2 ),
inference(avatar_component_clause,[],[f53]) ).
fof(f58,plain,
( ~ spl4_1
| ~ spl4_2 ),
inference(avatar_split_clause,[],[f33,f53,f50]) ).
fof(f60,plain,
( subset(intersection(sK0,difference(sK2,sK1)),empty_set)
| ~ spl4_2 ),
inference(resolution,[],[f37,f54]) ).
fof(f67,plain,
( member(sK3(sK0,sK1),sK0)
| spl4_1 ),
inference(resolution,[],[f40,f56]) ).
fof(f69,plain,
( ~ member(sK3(sK0,sK1),sK1)
| spl4_1 ),
inference(resolution,[],[f41,f56]) ).
fof(f77,plain,
( ! [X0] :
( ~ member(X0,intersection(sK0,difference(sK2,sK1)))
| member(X0,empty_set) )
| ~ spl4_2 ),
inference(resolution,[],[f39,f60]) ).
fof(f79,plain,
! [X0] :
( member(X0,sK2)
| ~ member(X0,sK0) ),
inference(resolution,[],[f39,f31]) ).
fof(f82,plain,
( ! [X0] :
( ~ member(X0,difference(sK2,sK1))
| ~ member(X0,sK0)
| member(X0,empty_set) )
| ~ spl4_2 ),
inference(resolution,[],[f44,f77]) ).
fof(f85,plain,
( ! [X0] :
( member(X0,empty_set)
| member(X0,sK1)
| ~ member(X0,sK0)
| ~ member(X0,sK2) )
| ~ spl4_2 ),
inference(resolution,[],[f48,f82]) ).
fof(f86,plain,
( ! [X0] :
( ~ member(X0,sK2)
| ~ member(X0,sK0)
| member(X0,sK1) )
| ~ spl4_2 ),
inference(resolution,[],[f85,f45]) ).
fof(f88,plain,
( ! [X0] :
( ~ member(X0,sK0)
| ~ member(X0,sK0)
| member(X0,sK1) )
| ~ spl4_2 ),
inference(resolution,[],[f79,f86]) ).
fof(f89,plain,
( ! [X0] :
( member(X0,sK1)
| ~ member(X0,sK0) )
| ~ spl4_2 ),
inference(duplicate_literal_removal,[],[f88]) ).
fof(f99,plain,
( ~ member(sK3(sK0,sK1),sK0)
| spl4_1
| ~ spl4_2 ),
inference(resolution,[],[f89,f69]) ).
fof(f100,plain,
( $false
| spl4_1
| ~ spl4_2 ),
inference(resolution,[],[f99,f67]) ).
fof(f102,plain,
( spl4_1
| ~ spl4_2 ),
inference(avatar_contradiction_clause,[],[f100]) ).
fof(f103,plain,
( ! [X0] :
( member(X0,sK1)
| ~ member(X0,sK0) )
| ~ spl4_1 ),
inference(resolution,[],[f51,f39]) ).
fof(f105,plain,
( ~ subset(intersection(sK0,difference(sK2,sK1)),empty_set)
| ~ subset(empty_set,intersection(sK0,difference(sK2,sK1)))
| spl4_2 ),
inference(resolution,[],[f57,f38]) ).
fof(f107,definition,
( spl4_3
<=> subset(empty_set,intersection(sK0,difference(sK2,sK1))) ),
introduced(definition,[new_symbols(definition,[spl4_3])],[avatar_definition]) ).
fof(f108,plain,
( ~ subset(empty_set,intersection(sK0,difference(sK2,sK1)))
| spl4_3 ),
inference(avatar_component_clause,[],[f107]) ).
fof(f110,definition,
( spl4_4
<=> subset(intersection(sK0,difference(sK2,sK1)),empty_set) ),
introduced(definition,[new_symbols(definition,[spl4_4])],[avatar_definition]) ).
fof(f111,plain,
( ~ subset(intersection(sK0,difference(sK2,sK1)),empty_set)
| spl4_4 ),
inference(avatar_component_clause,[],[f110]) ).
fof(f112,plain,
( ~ spl4_3
| ~ spl4_4
| spl4_2 ),
inference(avatar_split_clause,[],[f105,f53,f110,f107]) ).
fof(f114,plain,
( member(sK3(empty_set,intersection(sK0,difference(sK2,sK1))),empty_set)
| spl4_3 ),
inference(resolution,[],[f108,f40]) ).
fof(f116,plain,
( $false
| spl4_3 ),
inference(resolution,[],[f114,f45]) ).
fof(f117,plain,
spl4_3,
inference(avatar_contradiction_clause,[],[f116]) ).
fof(f119,plain,
( member(sK3(intersection(sK0,difference(sK2,sK1)),empty_set),intersection(sK0,difference(sK2,sK1)))
| spl4_4 ),
inference(resolution,[],[f111,f40]) ).
fof(f121,plain,
( member(sK3(intersection(sK0,difference(sK2,sK1)),empty_set),sK0)
| spl4_4 ),
inference(resolution,[],[f119,f43]) ).
fof(f122,plain,
( member(sK3(intersection(sK0,difference(sK2,sK1)),empty_set),difference(sK2,sK1))
| spl4_4 ),
inference(resolution,[],[f119,f42]) ).
fof(f124,plain,
( ~ member(sK3(intersection(sK0,difference(sK2,sK1)),empty_set),sK1)
| spl4_4 ),
inference(resolution,[],[f122,f46]) ).
fof(f125,plain,
( ~ member(sK3(intersection(sK0,difference(sK2,sK1)),empty_set),sK0)
| ~ spl4_1
| spl4_4 ),
inference(resolution,[],[f124,f103]) ).
fof(f126,plain,
( $false
| ~ spl4_1
| spl4_4 ),
inference(resolution,[],[f125,f121]) ).
fof(f127,plain,
( ~ spl4_1
| spl4_4 ),
inference(avatar_contradiction_clause,[],[f126]) ).
cnf(s1,plain,
( spl4_1
| spl4_2 ),
inference(sat_conversion,[],[f55]) ).
cnf(s2,plain,
( ~ spl4_1
| ~ spl4_2 ),
inference(sat_conversion,[],[f58]) ).
cnf(s3,plain,
( spl4_1
| ~ spl4_2 ),
inference(sat_conversion,[],[f102]) ).
cnf(s4,plain,
( spl4_2
| ~ spl4_3
| ~ spl4_4 ),
inference(sat_conversion,[],[f112]) ).
cnf(s5,plain,
spl4_3,
inference(sat_conversion,[],[f117]) ).
cnf(s6,plain,
( ~ spl4_1
| spl4_4 ),
inference(sat_conversion,[],[f127]) ).
cnf(s7,plain,
( spl4_2
| ~ spl4_4 ),
inference(rat,[],[s4,s5]) ).
cnf(s8,plain,
spl4_1,
inference(rat,[],[s1,s3]) ).
cnf(s9,plain,
spl4_4,
inference(rat,[],[s6,s8]) ).
cnf(s10,plain,
~ spl4_2,
inference(rat,[],[s2,s8]) ).
cnf(s11,plain,
$false,
inference(rat,[],[s7,s9,s10]) ).
fof(f128,plain,
$false,
inference(avatar_sat_refutation,[],[s11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET697+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.35 % Computer : n013.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 28 02:32:52 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.39 Running first-order theorem proving
% 0.14/0.39 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.84/1.24 % (751333)Detected formulas, will run a generic FOF schedule.
% 2.84/1.24 % (751339)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=2975636875:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.84/1.24 % (751343)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=552055584:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.84/1.24 % (751338)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=1240789415:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.84/1.24 % (751340)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=250901387:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.84/1.24 % (751344)dis-21_1_sil=8000:lcm=predicate:random_seed=2785331871: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.84/1.24 % (751344)First to succeed.
% 2.84/1.24 % (751342)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2645674922:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.84/1.24 % (751341)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1041631165:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.84/1.24 % (751344)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-751333"
% 2.84/1.24 % (751343)Also succeeded, but the first one will report.
% 2.84/1.24 % (751341)Refutation not found, incomplete strategy
% 2.84/1.24 % (751341)------------------------------
% 2.84/1.24 % (751341)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.84/1.24 % (751341)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.84/1.24 % (751341)CaDiCaL version: 2.1.3
% 2.84/1.24 % (751341)Termination reason: Refutation not found, incomplete strategy
% 2.84/1.24 % (751341)Time elapsed: 0.002 s
% 2.84/1.24 % (751341)Peak memory usage: 88 MB
% 2.84/1.24 % (751341)Instructions burned: 1 (million)
% 2.84/1.24 % (751342)Instruction limit reached!
% 2.84/1.24 % (751342)------------------------------
% 2.84/1.24 % (751342)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.84/1.24 % (751342)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.84/1.24 % (751342)CaDiCaL version: 2.1.3
% 2.84/1.24 % (751342)Termination reason: Instruction limit
% 2.84/1.24 % (751342)Termination phase: Saturation
% 2.84/1.24 % (751342)Time elapsed: 0.071 s
% 2.84/1.24 % (751342)Peak memory usage: 88 MB
% 2.84/1.24 % (751342)Instructions burned: 119 (million)
% 2.84/1.24 % (751352)lrs+10_1_sil=8000:sp=occurrence:random_seed=875397135:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.84/1.24 % (751341)------------------------------
% 2.84/1.24 % (751341)------------------------------
% 2.84/1.24 % (751344)Refutation found. Thanks to Tanya!
% 2.84/1.24 % SZS status Theorem for theBenchmark
% 2.84/1.24 % SZS output start Proof for theBenchmark
% See solution above
% 3.49/1.45 % (751344)------------------------------
% 3.49/1.45 % (751344)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.49/1.45 % (751344)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.49/1.45 % (751344)CaDiCaL version: 2.1.3
% 3.49/1.45 % (751344)Termination reason: Refutation
% 3.49/1.45 % (751344)Time elapsed: 0.004 s
% 3.49/1.45 % (751344)Peak memory usage: 89 MB
% 3.49/1.45 % (751344)Instructions burned: 4 (million)
% 3.49/1.45 % (751344)------------------------------
% 3.49/1.45 % (751344)------------------------------
% 3.49/1.45 % (751333)Success in time 0.407 s
% 3.49/1.45 % Vampire exiting
%------------------------------------------------------------------------------