%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET608+3 : 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 : n016.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:20 PM UTC 2026
% Result : Theorem 3.04s 16.32s
% Output : Refutation 3.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 13
% Syntax : Number of formulae : 82 ( 12 unt; 7 def)
% Number of atoms : 219 ( 12 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 226 ( 89 ~; 98 |; 25 &)
% ( 13 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 7 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 87 ( 0 sgn 83 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2] :
( member(X2,union(X0,X1))
<=> ( member(X2,X0)
| member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union_defn) ).
fof(f2,axiom,
! [X0,X1,X2] :
( member(X2,intersection(X0,X1))
<=> ( member(X2,X0)
& member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_defn) ).
fof(f3,axiom,
! [X0,X1,X2] :
( member(X2,difference(X0,X1))
<=> ( member(X2,X0)
& ~ member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',difference_defn) ).
fof(f4,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_defn) ).
fof(f7,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_defn) ).
fof(f10,conjecture,
! [X0,X1] : union(intersection(X0,X1),difference(X0,X1)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_union_intersection_difference) ).
fof(f11,negated_conjecture,
~ ! [X0,X1] : union(intersection(X0,X1),difference(X0,X1)) = X0,
inference(negated_conjecture,[status(cth)],[f10]) ).
fof(f12,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f7]) ).
fof(f13,plain,
? [X0,X1] : union(intersection(X0,X1),difference(X0,X1)) != X0,
inference(ennf_transformation,[],[f11]) ).
fof(f14,plain,
! [X0,X1,X2] :
( ( member(X2,union(X0,X1))
| ( ~ member(X2,X0)
& ~ member(X2,X1) ) )
& ( member(X2,X0)
| member(X2,X1)
| ~ member(X2,union(X0,X1)) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f15,plain,
! [X0,X1,X2] :
( ( member(X2,union(X0,X1))
| ( ~ member(X2,X0)
& ~ member(X2,X1) ) )
& ( member(X2,X0)
| member(X2,X1)
| ~ member(X2,union(X0,X1)) ) ),
inference(flattening,[],[f14]) ).
fof(f16,plain,
! [X0,X1,X2] :
( ( member(X2,intersection(X0,X1))
| ~ member(X2,X0)
| ~ member(X2,X1) )
& ( ( member(X2,X0)
& member(X2,X1) )
| ~ member(X2,intersection(X0,X1)) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f17,plain,
! [X0,X1,X2] :
( ( member(X2,intersection(X0,X1))
| ~ member(X2,X0)
| ~ member(X2,X1) )
& ( ( member(X2,X0)
& member(X2,X1) )
| ~ member(X2,intersection(X0,X1)) ) ),
inference(flattening,[],[f16]) ).
fof(f18,plain,
! [X0,X1,X2] :
( ( member(X2,difference(X0,X1))
| ~ member(X2,X0)
| member(X2,X1) )
& ( ( member(X2,X0)
& ~ member(X2,X1) )
| ~ member(X2,difference(X0,X1)) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f19,plain,
! [X0,X1,X2] :
( ( member(X2,difference(X0,X1))
| ~ member(X2,X0)
| member(X2,X1) )
& ( ( member(X2,X0)
& ~ member(X2,X1) )
| ~ member(X2,difference(X0,X1)) ) ),
inference(flattening,[],[f18]) ).
fof(f20,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f21,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(flattening,[],[f20]) ).
fof(f22,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,[],[f12]) ).
fof(f23,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,[],[f22]) ).
fof(f24,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f23]) ).
fof(f28,plain,
sK2 != union(intersection(sK2,sK3),difference(sK2,sK3)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X0,sK2),skolemize(X1,sK3)],[f13]) ).
fof(f29,plain,
! [X2,X0,X1] :
( ~ member(X2,union(X0,X1))
| member(X2,X1)
| member(X2,X0) ),
inference(cnf_transformation,[],[f15]) ).
fof(f30,plain,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f31,plain,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f15]) ).
fof(f33,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X0,X1))
| member(X2,X0) ),
inference(cnf_transformation,[],[f17]) ).
fof(f34,plain,
! [X2,X0,X1] :
( member(X2,intersection(X0,X1))
| ~ member(X2,X0)
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f17]) ).
fof(f36,plain,
! [X2,X0,X1] :
( ~ member(X2,difference(X0,X1))
| member(X2,X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f37,plain,
! [X2,X0,X1] :
( member(X2,difference(X0,X1))
| ~ member(X2,X0)
| member(X2,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f40,plain,
! [X0,X1] :
( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f44,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f24]) ).
fof(f45,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f51,plain,
sK2 != union(intersection(sK2,sK3),difference(sK2,sK3)),
inference(cnf_transformation,[],[f28]) ).
fof(f56,definition,
! [X0,X1] :
( sQ4_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(definition,[new_symbols(definition,[sQ4_eqProxy])],[equality_proxy_definition]) ).
fof(f57,plain,
! [X0,X1] :
( sQ4_eqProxy(X0,X1)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(equality_proxy_replacement,[],[f40,f56]) ).
fof(f62,plain,
~ sQ4_eqProxy(sK2,union(intersection(sK2,sK3),difference(sK2,sK3))),
inference(equality_proxy_replacement,[],[f51,f56]) ).
fof(f70,plain,
( ~ subset(sK2,union(intersection(sK2,sK3),difference(sK2,sK3)))
| ~ subset(union(intersection(sK2,sK3),difference(sK2,sK3)),sK2) ),
inference(resolution,[],[f57,f62]) ).
fof(f73,definition,
( spl5_1
<=> subset(sK2,union(intersection(sK2,sK3),difference(sK2,sK3))) ),
introduced(definition,[new_symbols(definition,[spl5_1])],[avatar_definition]) ).
fof(f74,plain,
( ~ subset(sK2,union(intersection(sK2,sK3),difference(sK2,sK3)))
| spl5_1 ),
inference(avatar_component_clause,[],[f73]) ).
fof(f76,definition,
( spl5_2
<=> subset(union(intersection(sK2,sK3),difference(sK2,sK3)),sK2) ),
introduced(definition,[new_symbols(definition,[spl5_2])],[avatar_definition]) ).
fof(f77,plain,
( ~ subset(union(intersection(sK2,sK3),difference(sK2,sK3)),sK2)
| spl5_2 ),
inference(avatar_component_clause,[],[f76]) ).
fof(f79,plain,
( ~ spl5_2
| ~ spl5_1 ),
inference(avatar_split_clause,[],[f70,f73,f76]) ).
fof(f80,plain,
( ~ member(sK0(sK2,union(intersection(sK2,sK3),difference(sK2,sK3))),union(intersection(sK2,sK3),difference(sK2,sK3)))
| spl5_1 ),
inference(resolution,[],[f74,f45]) ).
fof(f81,plain,
( member(sK0(sK2,union(intersection(sK2,sK3),difference(sK2,sK3))),sK2)
| spl5_1 ),
inference(resolution,[],[f74,f44]) ).
fof(f82,plain,
( ~ member(sK0(sK2,union(intersection(sK2,sK3),difference(sK2,sK3))),intersection(sK2,sK3))
| spl5_1 ),
inference(resolution,[],[f80,f31]) ).
fof(f83,plain,
( ~ member(sK0(sK2,union(intersection(sK2,sK3),difference(sK2,sK3))),difference(sK2,sK3))
| spl5_1 ),
inference(resolution,[],[f80,f30]) ).
fof(f88,plain,
( ~ member(sK0(sK2,union(intersection(sK2,sK3),difference(sK2,sK3))),sK2)
| ~ member(sK0(sK2,union(intersection(sK2,sK3),difference(sK2,sK3))),sK3)
| spl5_1 ),
inference(resolution,[],[f34,f82]) ).
fof(f90,definition,
( spl5_3
<=> member(sK0(sK2,union(intersection(sK2,sK3),difference(sK2,sK3))),sK3) ),
introduced(definition,[new_symbols(definition,[spl5_3])],[avatar_definition]) ).
fof(f93,definition,
( spl5_4
<=> member(sK0(sK2,union(intersection(sK2,sK3),difference(sK2,sK3))),sK2) ),
introduced(definition,[new_symbols(definition,[spl5_4])],[avatar_definition]) ).
fof(f94,plain,
( ~ member(sK0(sK2,union(intersection(sK2,sK3),difference(sK2,sK3))),sK2)
| spl5_4 ),
inference(avatar_component_clause,[],[f93]) ).
fof(f95,plain,
( ~ spl5_3
| ~ spl5_4
| spl5_1 ),
inference(avatar_split_clause,[],[f88,f73,f93,f90]) ).
fof(f98,plain,
( ~ member(sK0(sK2,union(intersection(sK2,sK3),difference(sK2,sK3))),sK2)
| member(sK0(sK2,union(intersection(sK2,sK3),difference(sK2,sK3))),sK3)
| spl5_1 ),
inference(resolution,[],[f37,f83]) ).
fof(f100,plain,
( spl5_3
| ~ spl5_4
| spl5_1 ),
inference(avatar_split_clause,[],[f98,f73,f93,f90]) ).
fof(f101,plain,
( $false
| spl5_1
| spl5_4 ),
inference(resolution,[],[f94,f81]) ).
fof(f102,plain,
( spl5_1
| spl5_4 ),
inference(avatar_contradiction_clause,[],[f101]) ).
fof(f103,plain,
( ~ member(sK0(union(intersection(sK2,sK3),difference(sK2,sK3)),sK2),sK2)
| spl5_2 ),
inference(resolution,[],[f77,f45]) ).
fof(f104,plain,
( member(sK0(union(intersection(sK2,sK3),difference(sK2,sK3)),sK2),union(intersection(sK2,sK3),difference(sK2,sK3)))
| spl5_2 ),
inference(resolution,[],[f77,f44]) ).
fof(f105,plain,
( member(sK0(union(intersection(sK2,sK3),difference(sK2,sK3)),sK2),difference(sK2,sK3))
| member(sK0(union(intersection(sK2,sK3),difference(sK2,sK3)),sK2),intersection(sK2,sK3))
| spl5_2 ),
inference(resolution,[],[f104,f29]) ).
fof(f107,definition,
( spl5_5
<=> member(sK0(union(intersection(sK2,sK3),difference(sK2,sK3)),sK2),intersection(sK2,sK3)) ),
introduced(definition,[new_symbols(definition,[spl5_5])],[avatar_definition]) ).
fof(f108,plain,
( member(sK0(union(intersection(sK2,sK3),difference(sK2,sK3)),sK2),intersection(sK2,sK3))
| ~ spl5_5 ),
inference(avatar_component_clause,[],[f107]) ).
fof(f110,definition,
( spl5_6
<=> member(sK0(union(intersection(sK2,sK3),difference(sK2,sK3)),sK2),difference(sK2,sK3)) ),
introduced(definition,[new_symbols(definition,[spl5_6])],[avatar_definition]) ).
fof(f111,plain,
( member(sK0(union(intersection(sK2,sK3),difference(sK2,sK3)),sK2),difference(sK2,sK3))
| ~ spl5_6 ),
inference(avatar_component_clause,[],[f110]) ).
fof(f112,plain,
( spl5_5
| spl5_6
| spl5_2 ),
inference(avatar_split_clause,[],[f105,f76,f110,f107]) ).
fof(f113,plain,
( member(sK0(union(intersection(sK2,sK3),difference(sK2,sK3)),sK2),sK2)
| ~ spl5_6 ),
inference(resolution,[],[f111,f36]) ).
fof(f115,plain,
( $false
| spl5_2
| ~ spl5_6 ),
inference(resolution,[],[f113,f103]) ).
fof(f116,plain,
( spl5_2
| ~ spl5_6 ),
inference(avatar_contradiction_clause,[],[f115]) ).
fof(f124,plain,
( member(sK0(union(intersection(sK2,sK3),difference(sK2,sK3)),sK2),sK2)
| ~ spl5_5 ),
inference(resolution,[],[f108,f33]) ).
fof(f134,plain,
( $false
| spl5_2
| ~ spl5_5 ),
inference(resolution,[],[f124,f103]) ).
fof(f136,plain,
( spl5_2
| ~ spl5_5 ),
inference(avatar_contradiction_clause,[],[f134]) ).
cnf(s2,plain,
( ~ spl5_1
| ~ spl5_2 ),
inference(sat_conversion,[],[f79]) ).
cnf(s3,plain,
( spl5_1
| ~ spl5_3
| ~ spl5_4 ),
inference(sat_conversion,[],[f95]) ).
cnf(s4,plain,
( spl5_1
| spl5_3
| ~ spl5_4 ),
inference(sat_conversion,[],[f100]) ).
cnf(s5,plain,
( spl5_1
| spl5_4 ),
inference(sat_conversion,[],[f102]) ).
cnf(s6,plain,
( spl5_2
| spl5_5
| spl5_6 ),
inference(sat_conversion,[],[f112]) ).
cnf(s7,plain,
( spl5_2
| ~ spl5_6 ),
inference(sat_conversion,[],[f116]) ).
cnf(s8,plain,
( spl5_2
| ~ spl5_5 ),
inference(sat_conversion,[],[f136]) ).
cnf(s9,plain,
( spl5_1
| ~ spl5_4 ),
inference(rat,[],[s3,s4]) ).
cnf(s10,plain,
spl5_1,
inference(rat,[],[s9,s5]) ).
cnf(s11,plain,
~ spl5_2,
inference(rat,[],[s2,s10]) ).
cnf(s12,plain,
~ spl5_5,
inference(rat,[],[s8,s11]) ).
cnf(s13,plain,
~ spl5_6,
inference(rat,[],[s7,s11]) ).
cnf(s14,plain,
$false,
inference(rat,[],[s6,s12,s13,s11]) ).
fof(f137,plain,
$false,
inference(avatar_sat_refutation,[],[s14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET608+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.42 % Computer : n016.cluster.edu
% 0.13/0.42 % Model : x86_64 x86_64
% 0.13/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.42 % Memory : 8046.5625MB
% 0.13/0.42 % OS : Linux 6.8.0-71-generic
% 0.12/15.44 % CPULimit : 300
% 0.12/15.44 % WCLimit : 300
% 0.12/15.44 % DateTime : Mon Sep 28 02:18:27 UTC 2026
% 0.12/15.44 % CPUTime :
% 0.12/15.44 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/15.47 Running first-order theorem proving
% 0.12/15.47 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
% 3.04/16.32 % (3524331)Detected formulas, will run a generic FOF schedule.
% 3.04/16.32 % (3524337)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=4077616644:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.04/16.32 % (3524341)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1676073335:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.04/16.32 % (3524339)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3604031675:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.04/16.32 % (3524336)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=1160765481:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.04/16.32 % (3524340)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=688068511:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.04/16.32 % (3524338)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=783560123:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.04/16.32 % (3524339)Refutation not found, incomplete strategy
% 3.04/16.32 % (3524339)------------------------------
% 3.04/16.32 % (3524339)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.04/16.32 % (3524342)dis-21_1_sil=8000:lcm=predicate:random_seed=1010658767: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)
% 3.04/16.32 % (3524339)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.04/16.32 % (3524339)CaDiCaL version: 2.1.3
% 3.04/16.32 % (3524339)Termination reason: Refutation not found, incomplete strategy
% 3.04/16.32 % (3524339)Time elapsed: 0.001 s
% 3.04/16.32 % (3524339)Peak memory usage: 88 MB
% 3.04/16.32 % (3524339)Instructions burned: 1 (million)
% 3.04/16.32 % (3524342)First to succeed.
% 3.04/16.32 % (3524342)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3524331"
% 3.04/16.32 % (3524340)Instruction limit reached!
% 3.04/16.32 % (3524340)------------------------------
% 3.04/16.32 % (3524340)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.04/16.32 % (3524340)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.04/16.32 % (3524340)CaDiCaL version: 2.1.3
% 3.04/16.32 % (3524340)Termination reason: Instruction limit
% 3.04/16.32 % (3524340)Termination phase: Saturation
% 3.04/16.32 % (3524340)Time elapsed: 0.072 s
% 3.04/16.32 % (3524340)Peak memory usage: 89 MB
% 3.04/16.32 % (3524340)Instructions burned: 120 (million)
% 3.04/16.32 % (3524341)Instruction limit reached!
% 3.04/16.32 % (3524341)------------------------------
% 3.04/16.32 % (3524341)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.04/16.32 % (3524341)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.04/16.32 % (3524341)CaDiCaL version: 2.1.3
% 3.04/16.32 % (3524341)Termination reason: Instruction limit
% 3.04/16.32 % (3524341)Termination phase: Saturation
% 3.04/16.32 % (3524341)Time elapsed: 0.080 s
% 3.04/16.32 % (3524341)Peak memory usage: 89 MB
% 3.04/16.32 % (3524341)Instructions burned: 140 (million)
% 3.04/16.32 % (3524350)lrs+10_1_sil=8000:sp=occurrence:random_seed=102069767:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.04/16.32 % (3524351)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3599482273:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.04/16.32 % (3524351)Refutation not found, incomplete strategy
% 3.04/16.32 % (3524351)------------------------------
% 3.04/16.32 % (3524351)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.04/16.32 % (3524351)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.04/16.32 % (3524351)CaDiCaL version: 2.1.3
% 3.04/16.32 % (3524351)Termination reason: Refutation not found, incomplete strategy
% 3.04/16.32 % (3524351)Time elapsed: 0.002 s
% 3.04/16.32 % (3524351)Peak memory usage: 89 MB
% 3.04/16.32 % (3524351)Instructions burned: 1 (million)
% 3.04/16.32 % (3524339)------------------------------
% 3.04/16.32 % (3524339)------------------------------
% 3.04/16.32 % (3524342)Refutation found. Thanks to Tanya!
% 3.04/16.32 % SZS status Theorem for theBenchmark
% 3.04/16.32 % SZS output start Proof for theBenchmark
% See solution above
% 3.74/16.52 % (3524342)------------------------------
% 3.74/16.52 % (3524342)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.74/16.52 % (3524342)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.74/16.52 % (3524342)CaDiCaL version: 2.1.3
% 3.74/16.52 % (3524342)Termination reason: Refutation
% 3.74/16.52 % (3524342)Time elapsed: 0.004 s
% 3.74/16.52 % (3524342)Peak memory usage: 89 MB
% 3.74/16.52 % (3524342)Instructions burned: 4 (million)
% 3.74/16.52 % (3524342)------------------------------
% 3.74/16.52 % (3524342)------------------------------
% 3.74/16.52 % (3524331)Success in time 0.409 s
% 3.74/16.52 % Vampire exiting
%------------------------------------------------------------------------------