%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET703+4 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n019.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.92s 1.25s
% Output : Refutation 3.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 12
% Syntax : Number of formulae : 89 ( 14 unt; 6 def)
% Number of atoms : 223 ( 27 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 224 ( 90 ~; 103 |; 17 &)
% ( 12 <=>; 2 =>; 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 : 86 ( 0 sgn 82 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset) ).
fof(f2,axiom,
! [X0,X1] :
( equal_set(X0,X1)
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_set) ).
fof(f5,axiom,
! [X0,X1,X2] :
( member(X0,union(X1,X2))
<=> ( member(X0,X1)
| member(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',union) ).
fof(f8,axiom,
! [X0,X1] :
( member(X0,singleton(X1))
<=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',singleton) ).
fof(f9,axiom,
! [X0,X1,X2] :
( member(X0,unordered_pair(X1,X2))
<=> ( X0 = X1
| X0 = X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unordered_pair) ).
fof(f12,conjecture,
! [X0,X1] : equal_set(union(singleton(X0),singleton(X1)),unordered_pair(X0,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI41) ).
fof(f13,negated_conjecture,
~ ! [X0,X1] : equal_set(union(singleton(X0),singleton(X1)),unordered_pair(X0,X1)),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f14,plain,
! [X0,X1] :
( ( subset(X0,X1)
& subset(X1,X0) )
=> equal_set(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f15,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f16,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(ennf_transformation,[],[f14]) ).
fof(f17,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(flattening,[],[f16]) ).
fof(f19,plain,
? [X0,X1] : ~ equal_set(union(singleton(X0),singleton(X1)),unordered_pair(X0,X1)),
inference(ennf_transformation,[],[f13]) ).
fof(f20,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,[],[f15]) ).
fof(f21,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,[],[f20]) ).
fof(f22,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))],[f21]) ).
fof(f26,plain,
! [X0,X1,X2] :
( ( member(X0,union(X1,X2))
| ( ~ member(X0,X1)
& ~ member(X0,X2) ) )
& ( member(X0,X1)
| member(X0,X2)
| ~ member(X0,union(X1,X2)) ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f27,plain,
! [X0,X1,X2] :
( ( member(X0,union(X1,X2))
| ( ~ member(X0,X1)
& ~ member(X0,X2) ) )
& ( member(X0,X1)
| member(X0,X2)
| ~ member(X0,union(X1,X2)) ) ),
inference(flattening,[],[f26]) ).
fof(f30,plain,
! [X0,X1] :
( ( member(X0,singleton(X1))
| X0 != X1 )
& ( X0 = X1
| ~ member(X0,singleton(X1)) ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f31,plain,
! [X0,X1,X2] :
( ( member(X0,unordered_pair(X1,X2))
| ( X0 != X1
& X0 != X2 ) )
& ( X0 = X1
| X0 = X2
| ~ member(X0,unordered_pair(X1,X2)) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f32,plain,
! [X0,X1,X2] :
( ( member(X0,unordered_pair(X1,X2))
| ( X0 != X1
& X0 != X2 ) )
& ( X0 = X1
| X0 = X2
| ~ member(X0,unordered_pair(X1,X2)) ) ),
inference(flattening,[],[f31]) ).
fof(f39,plain,
~ equal_set(union(singleton(sK3),singleton(sK4)),unordered_pair(sK3,sK4)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4]),skolemize(X0,sK3),skolemize(X1,sK4)],[f19]) ).
fof(f41,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f22]) ).
fof(f42,plain,
! [X0,X1] :
( ~ member(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f43,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(cnf_transformation,[],[f17]) ).
fof(f49,plain,
! [X2,X0,X1] :
( ~ member(X0,union(X1,X2))
| member(X0,X2)
| member(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f50,plain,
! [X2,X0,X1] :
( member(X0,union(X1,X2))
| ~ member(X0,X2) ),
inference(cnf_transformation,[],[f27]) ).
fof(f51,plain,
! [X2,X0,X1] :
( member(X0,union(X1,X2))
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f56,plain,
! [X0,X1] :
( ~ member(X0,singleton(X1))
| X0 = X1 ),
inference(cnf_transformation,[],[f30]) ).
fof(f57,plain,
! [X0,X1] :
( member(X0,singleton(X1))
| X0 != X1 ),
inference(cnf_transformation,[],[f30]) ).
fof(f58,plain,
! [X2,X0,X1] :
( ~ member(X0,unordered_pair(X1,X2))
| X0 = X2
| X0 = X1 ),
inference(cnf_transformation,[],[f32]) ).
fof(f59,plain,
! [X2,X0,X1] :
( member(X0,unordered_pair(X1,X2))
| X0 != X2 ),
inference(cnf_transformation,[],[f32]) ).
fof(f60,plain,
! [X2,X0,X1] :
( member(X0,unordered_pair(X1,X2))
| X0 != X1 ),
inference(cnf_transformation,[],[f32]) ).
fof(f67,plain,
~ equal_set(union(singleton(sK3),singleton(sK4)),unordered_pair(sK3,sK4)),
inference(cnf_transformation,[],[f39]) ).
fof(f68,plain,
! [X1] : member(X1,singleton(X1)),
inference(equality_resolution,[],[f57]) ).
fof(f69,plain,
! [X2,X1] : member(X1,unordered_pair(X1,X2)),
inference(equality_resolution,[],[f60]) ).
fof(f70,plain,
! [X2,X1] : member(X2,unordered_pair(X1,X2)),
inference(equality_resolution,[],[f59]) ).
fof(f73,plain,
( ~ subset(union(singleton(sK3),singleton(sK4)),unordered_pair(sK3,sK4))
| ~ subset(unordered_pair(sK3,sK4),union(singleton(sK3),singleton(sK4))) ),
inference(resolution,[],[f43,f67]) ).
fof(f75,definition,
( spl5_1
<=> subset(unordered_pair(sK3,sK4),union(singleton(sK3),singleton(sK4))) ),
introduced(definition,[new_symbols(definition,[spl5_1])],[avatar_definition]) ).
fof(f77,plain,
( ~ subset(unordered_pair(sK3,sK4),union(singleton(sK3),singleton(sK4)))
| spl5_1 ),
inference(avatar_component_clause,[],[f75]) ).
fof(f79,definition,
( spl5_2
<=> subset(union(singleton(sK3),singleton(sK4)),unordered_pair(sK3,sK4)) ),
introduced(definition,[new_symbols(definition,[spl5_2])],[avatar_definition]) ).
fof(f81,plain,
( ~ subset(union(singleton(sK3),singleton(sK4)),unordered_pair(sK3,sK4))
| spl5_2 ),
inference(avatar_component_clause,[],[f79]) ).
fof(f82,plain,
( ~ spl5_1
| ~ spl5_2 ),
inference(avatar_split_clause,[],[f73,f79,f75]) ).
fof(f83,plain,
( member(sK0(unordered_pair(sK3,sK4),union(singleton(sK3),singleton(sK4))),unordered_pair(sK3,sK4))
| spl5_1 ),
inference(resolution,[],[f77,f41]) ).
fof(f88,plain,
( sK4 = sK0(unordered_pair(sK3,sK4),union(singleton(sK3),singleton(sK4)))
| sK3 = sK0(unordered_pair(sK3,sK4),union(singleton(sK3),singleton(sK4)))
| spl5_1 ),
inference(resolution,[],[f58,f83]) ).
fof(f90,definition,
( spl5_3
<=> sK3 = sK0(unordered_pair(sK3,sK4),union(singleton(sK3),singleton(sK4))) ),
introduced(definition,[new_symbols(definition,[spl5_3])],[avatar_definition]) ).
fof(f92,plain,
( sK3 = sK0(unordered_pair(sK3,sK4),union(singleton(sK3),singleton(sK4)))
| ~ spl5_3 ),
inference(avatar_component_clause,[],[f90]) ).
fof(f94,definition,
( spl5_4
<=> sK4 = sK0(unordered_pair(sK3,sK4),union(singleton(sK3),singleton(sK4))) ),
introduced(definition,[new_symbols(definition,[spl5_4])],[avatar_definition]) ).
fof(f96,plain,
( sK4 = sK0(unordered_pair(sK3,sK4),union(singleton(sK3),singleton(sK4)))
| ~ spl5_4 ),
inference(avatar_component_clause,[],[f94]) ).
fof(f97,plain,
( spl5_3
| spl5_4
| spl5_1 ),
inference(avatar_split_clause,[],[f88,f75,f94,f90]) ).
fof(f99,plain,
( member(sK0(union(singleton(sK3),singleton(sK4)),unordered_pair(sK3,sK4)),union(singleton(sK3),singleton(sK4)))
| spl5_2 ),
inference(resolution,[],[f81,f41]) ).
fof(f103,plain,
( member(sK0(union(singleton(sK3),singleton(sK4)),unordered_pair(sK3,sK4)),singleton(sK4))
| member(sK0(union(singleton(sK3),singleton(sK4)),unordered_pair(sK3,sK4)),singleton(sK3))
| spl5_2 ),
inference(resolution,[],[f99,f49]) ).
fof(f105,definition,
( spl5_5
<=> member(sK0(union(singleton(sK3),singleton(sK4)),unordered_pair(sK3,sK4)),singleton(sK3)) ),
introduced(definition,[new_symbols(definition,[spl5_5])],[avatar_definition]) ).
fof(f107,plain,
( member(sK0(union(singleton(sK3),singleton(sK4)),unordered_pair(sK3,sK4)),singleton(sK3))
| ~ spl5_5 ),
inference(avatar_component_clause,[],[f105]) ).
fof(f109,definition,
( spl5_6
<=> member(sK0(union(singleton(sK3),singleton(sK4)),unordered_pair(sK3,sK4)),singleton(sK4)) ),
introduced(definition,[new_symbols(definition,[spl5_6])],[avatar_definition]) ).
fof(f111,plain,
( member(sK0(union(singleton(sK3),singleton(sK4)),unordered_pair(sK3,sK4)),singleton(sK4))
| ~ spl5_6 ),
inference(avatar_component_clause,[],[f109]) ).
fof(f112,plain,
( spl5_5
| spl5_6
| spl5_2 ),
inference(avatar_split_clause,[],[f103,f79,f109,f105]) ).
fof(f113,plain,
( sK3 = sK0(union(singleton(sK3),singleton(sK4)),unordered_pair(sK3,sK4))
| ~ spl5_5 ),
inference(resolution,[],[f107,f56]) ).
fof(f116,plain,
( ~ member(sK3,unordered_pair(sK3,sK4))
| subset(union(singleton(sK3),singleton(sK4)),unordered_pair(sK3,sK4))
| ~ spl5_5 ),
inference(superposition,[],[f42,f113]) ).
fof(f117,plain,
( subset(union(singleton(sK3),singleton(sK4)),unordered_pair(sK3,sK4))
| ~ spl5_5 ),
inference(forward_subsumption_resolution,[],[f116,f69]) ).
fof(f118,plain,
( $false
| spl5_2
| ~ spl5_5 ),
inference(forward_subsumption_resolution,[],[f117,f81]) ).
fof(f119,plain,
( spl5_2
| ~ spl5_5 ),
inference(avatar_contradiction_clause,[],[f118]) ).
fof(f120,plain,
( sK4 = sK0(union(singleton(sK3),singleton(sK4)),unordered_pair(sK3,sK4))
| ~ spl5_6 ),
inference(resolution,[],[f111,f56]) ).
fof(f126,plain,
( ~ member(sK4,unordered_pair(sK3,sK4))
| subset(union(singleton(sK3),singleton(sK4)),unordered_pair(sK3,sK4))
| ~ spl5_6 ),
inference(superposition,[],[f42,f120]) ).
fof(f127,plain,
( subset(union(singleton(sK3),singleton(sK4)),unordered_pair(sK3,sK4))
| ~ spl5_6 ),
inference(forward_subsumption_resolution,[],[f126,f70]) ).
fof(f128,plain,
( $false
| spl5_2
| ~ spl5_6 ),
inference(forward_subsumption_resolution,[],[f127,f81]) ).
fof(f129,plain,
( spl5_2
| ~ spl5_6 ),
inference(avatar_contradiction_clause,[],[f128]) ).
fof(f134,plain,
( ~ member(sK3,union(singleton(sK3),singleton(sK4)))
| subset(unordered_pair(sK3,sK4),union(singleton(sK3),singleton(sK4)))
| ~ spl5_3 ),
inference(superposition,[],[f42,f92]) ).
fof(f135,plain,
( ~ member(sK3,union(singleton(sK3),singleton(sK4)))
| spl5_1
| ~ spl5_3 ),
inference(forward_subsumption_resolution,[],[f134,f77]) ).
fof(f137,plain,
( ~ member(sK3,singleton(sK3))
| spl5_1
| ~ spl5_3 ),
inference(resolution,[],[f135,f51]) ).
fof(f139,plain,
( $false
| spl5_1
| ~ spl5_3 ),
inference(forward_subsumption_resolution,[],[f137,f68]) ).
fof(f140,plain,
( spl5_1
| ~ spl5_3 ),
inference(avatar_contradiction_clause,[],[f139]) ).
fof(f144,plain,
( ~ member(sK4,union(singleton(sK3),singleton(sK4)))
| subset(unordered_pair(sK3,sK4),union(singleton(sK3),singleton(sK4)))
| ~ spl5_4 ),
inference(superposition,[],[f42,f96]) ).
fof(f145,plain,
( ~ member(sK4,union(singleton(sK3),singleton(sK4)))
| spl5_1
| ~ spl5_4 ),
inference(forward_subsumption_resolution,[],[f144,f77]) ).
fof(f151,plain,
( ~ member(sK4,singleton(sK4))
| spl5_1
| ~ spl5_4 ),
inference(resolution,[],[f145,f50]) ).
fof(f152,plain,
( $false
| spl5_1
| ~ spl5_4 ),
inference(forward_subsumption_resolution,[],[f151,f68]) ).
fof(f153,plain,
( spl5_1
| ~ spl5_4 ),
inference(avatar_contradiction_clause,[],[f152]) ).
cnf(s1,plain,
( ~ spl5_1
| ~ spl5_2 ),
inference(sat_conversion,[],[f82]) ).
cnf(s2,plain,
( spl5_1
| spl5_3
| spl5_4 ),
inference(sat_conversion,[],[f97]) ).
cnf(s3,plain,
( spl5_2
| spl5_5
| spl5_6 ),
inference(sat_conversion,[],[f112]) ).
cnf(s4,plain,
( spl5_2
| ~ spl5_5 ),
inference(sat_conversion,[],[f119]) ).
cnf(s5,plain,
( spl5_2
| ~ spl5_6 ),
inference(sat_conversion,[],[f129]) ).
cnf(s6,plain,
( spl5_1
| ~ spl5_3 ),
inference(sat_conversion,[],[f140]) ).
cnf(s7,plain,
( spl5_1
| ~ spl5_4 ),
inference(sat_conversion,[],[f153]) ).
cnf(s8,plain,
spl5_1,
inference(rat,[],[s2,s6,s7]) ).
cnf(s9,plain,
~ spl5_2,
inference(rat,[],[s1,s8]) ).
cnf(s10,plain,
~ spl5_6,
inference(rat,[],[s5,s9]) ).
cnf(s11,plain,
~ spl5_5,
inference(rat,[],[s4,s9]) ).
cnf(s12,plain,
$false,
inference(rat,[],[s3,s10,s11,s9]) ).
fof(f154,plain,
$false,
inference(avatar_sat_refutation,[],[s12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET703+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n019.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 28 02:34:19 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.40 Running first-order theorem proving
% 0.11/0.40 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.92/1.25 % (3609993)Detected formulas, will run a generic FOF schedule.
% 2.92/1.25 % (3610004)dis-21_1_sil=8000:lcm=predicate:random_seed=4020146666: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.92/1.25 % (3609998)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=4189160012:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.92/1.25 % (3610003)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3987119373:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.92/1.25 % (3609999)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=1660924109:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.92/1.25 % (3610000)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=706088907:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.92/1.25 % (3610003)First to succeed.
% 2.92/1.25 % (3610001)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3347290219:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.92/1.25 % (3610003)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3609993"
% 2.92/1.25 % (3610001)Refutation not found, incomplete strategy
% 2.92/1.25 % (3610001)------------------------------
% 2.92/1.25 % (3610001)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.92/1.25 % (3610001)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/1.25 % (3610001)CaDiCaL version: 2.1.3
% 2.92/1.25 % (3610001)Termination reason: Refutation not found, incomplete strategy
% 2.92/1.25 % (3610001)Time elapsed: 0.001 s
% 2.92/1.25 % (3610001)Peak memory usage: 88 MB
% 2.92/1.25 % (3610004)Instruction limit reached!
% 2.92/1.25 % (3610004)------------------------------
% 2.92/1.25 % (3610004)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.92/1.25 % (3610004)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/1.25 % (3610004)CaDiCaL version: 2.1.3
% 2.92/1.25 % (3610004)Termination reason: Instruction limit
% 2.92/1.25 % (3610004)Termination phase: Saturation
% 2.92/1.25 % (3610004)Time elapsed: 0.045 s
% 2.92/1.25 % (3610004)Peak memory usage: 90 MB
% 2.92/1.25 % (3610004)Instructions burned: 132 (million)
% 2.92/1.25 % (3610002)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1490731822:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.92/1.25 % (3610002)Also succeeded, but the first one will report.
% 2.92/1.25 % (3610012)lrs+10_1_sil=8000:sp=occurrence:random_seed=3004028450:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 2.92/1.25 % (3610012)Instruction limit reached!
% 2.92/1.25 % (3610012)------------------------------
% 2.92/1.25 % (3610012)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.92/1.25 % (3610012)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/1.25 % (3610012)CaDiCaL version: 2.1.3
% 2.92/1.25 % (3610012)Termination reason: Instruction limit
% 2.92/1.25 % (3610012)Termination phase: Saturation
% 2.92/1.25 % (3610012)Time elapsed: 0.093 s
% 2.92/1.25 % (3610012)Peak memory usage: 91 MB
% 2.92/1.25 % (3610012)Instructions burned: 286 (million)
% 2.92/1.25 % (3610001)------------------------------
% 2.92/1.25 % (3610001)------------------------------
% 2.92/1.25 % (3610003)Refutation found. Thanks to Tanya!
% 2.92/1.25 % SZS status Theorem for theBenchmark
% 2.92/1.25 % SZS output start Proof for theBenchmark
% See solution above
% 3.47/1.45 % (3610003)------------------------------
% 3.47/1.45 % (3610003)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.47/1.45 % (3610003)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.47/1.45 % (3610003)CaDiCaL version: 2.1.3
% 3.47/1.45 % (3610003)Termination reason: Refutation
% 3.47/1.45 % (3610003)Time elapsed: 0.006 s
% 3.47/1.45 % (3610003)Peak memory usage: 89 MB
% 3.47/1.45 % (3610003)Instructions burned: 7 (million)
% 3.47/1.45 % (3610003)------------------------------
% 3.47/1.45 % (3610003)------------------------------
% 3.47/1.45 % (3609993)Success in time 0.408 s
% 3.47/1.45 % Vampire exiting
%------------------------------------------------------------------------------