%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET352+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 : n007.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:40:49 PM UTC 2026
% Result : Theorem 2.74s 1.30s
% Output : Refutation 3.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 13
% Syntax : Number of formulae : 95 ( 14 unt; 7 def)
% Number of atoms : 251 ( 20 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 265 ( 109 ~; 118 |; 23 &)
% ( 13 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 8 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 103 ( 0 sgn 96 !; 7 ?)
% 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(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(f10,axiom,
! [X0,X1] :
( member(X0,sum(X1))
<=> ? [X2] :
( member(X2,X1)
& member(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum) ).
fof(f12,conjecture,
! [X0,X1] : equal_set(sum(unordered_pair(X0,X1)),union(X0,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI40) ).
fof(f13,negated_conjecture,
~ ! [X0,X1] : equal_set(sum(unordered_pair(X0,X1)),union(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(sum(unordered_pair(X0,X1)),union(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(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(f33,plain,
! [X0,X1] :
( ( member(X0,sum(X1))
| ! [X2] :
( ~ member(X2,X1)
| ~ member(X0,X2) ) )
& ( ? [X2] :
( member(X2,X1)
& member(X0,X2) )
| ~ member(X0,sum(X1)) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f34,plain,
! [X0,X1] :
( ( member(X0,sum(X1))
| ! [X2] :
( ~ member(X2,X1)
| ~ member(X0,X2) ) )
& ( ? [X3] :
( member(X3,X1)
& member(X0,X3) )
| ~ member(X0,sum(X1)) ) ),
inference(rectify,[],[f33]) ).
fof(f35,plain,
! [X0,X1] :
( ( member(X0,sum(X1))
| ! [X2] :
( ~ member(X2,X1)
| ~ member(X0,X2) ) )
& ( ( member(sK1(X0,X1),X1)
& member(X0,sK1(X0,X1)) )
| ~ member(X0,sum(X1)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X3,sK1(X0,X1))],[f34]) ).
fof(f39,plain,
~ equal_set(sum(unordered_pair(sK3,sK4)),union(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] :
( subset(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f43,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| equal_set(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(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(f61,plain,
! [X0,X1] :
( member(X0,sK1(X0,X1))
| ~ member(X0,sum(X1)) ),
inference(cnf_transformation,[],[f35]) ).
fof(f62,plain,
! [X0,X1] :
( ~ member(X0,sum(X1))
| member(sK1(X0,X1),X1) ),
inference(cnf_transformation,[],[f35]) ).
fof(f63,plain,
! [X2,X0,X1] :
( member(X0,sum(X1))
| ~ member(X2,X1)
| ~ member(X0,X2) ),
inference(cnf_transformation,[],[f35]) ).
fof(f67,plain,
~ equal_set(sum(unordered_pair(sK3,sK4)),union(sK3,sK4)),
inference(cnf_transformation,[],[f39]) ).
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,
! [X0,X1] :
( equal_set(X0,X1)
| member(sK0(X0,X1),X0)
| ~ subset(X1,X0) ),
inference(resolution,[],[f41,f43]) ).
fof(f76,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ member(sK0(X0,X1),X1)
| ~ subset(X1,X0) ),
inference(resolution,[],[f42,f43]) ).
fof(f103,plain,
( member(sK0(sum(unordered_pair(sK3,sK4)),union(sK3,sK4)),sum(unordered_pair(sK3,sK4)))
| ~ subset(union(sK3,sK4),sum(unordered_pair(sK3,sK4))) ),
inference(resolution,[],[f73,f67]) ).
fof(f105,definition,
( spl5_1
<=> subset(union(sK3,sK4),sum(unordered_pair(sK3,sK4))) ),
introduced(definition,[new_symbols(definition,[spl5_1])],[avatar_definition]) ).
fof(f107,plain,
( ~ subset(union(sK3,sK4),sum(unordered_pair(sK3,sK4)))
| spl5_1 ),
inference(avatar_component_clause,[],[f105]) ).
fof(f109,definition,
( spl5_2
<=> member(sK0(sum(unordered_pair(sK3,sK4)),union(sK3,sK4)),sum(unordered_pair(sK3,sK4))) ),
introduced(definition,[new_symbols(definition,[spl5_2])],[avatar_definition]) ).
fof(f111,plain,
( member(sK0(sum(unordered_pair(sK3,sK4)),union(sK3,sK4)),sum(unordered_pair(sK3,sK4)))
| ~ spl5_2 ),
inference(avatar_component_clause,[],[f109]) ).
fof(f112,plain,
( ~ spl5_1
| spl5_2 ),
inference(avatar_split_clause,[],[f103,f109,f105]) ).
fof(f113,plain,
( ~ member(sK0(sum(unordered_pair(sK3,sK4)),union(sK3,sK4)),union(sK3,sK4))
| ~ subset(union(sK3,sK4),sum(unordered_pair(sK3,sK4))) ),
inference(resolution,[],[f76,f67]) ).
fof(f115,definition,
( spl5_3
<=> member(sK0(sum(unordered_pair(sK3,sK4)),union(sK3,sK4)),union(sK3,sK4)) ),
introduced(definition,[new_symbols(definition,[spl5_3])],[avatar_definition]) ).
fof(f117,plain,
( ~ member(sK0(sum(unordered_pair(sK3,sK4)),union(sK3,sK4)),union(sK3,sK4))
| spl5_3 ),
inference(avatar_component_clause,[],[f115]) ).
fof(f118,plain,
( ~ spl5_1
| ~ spl5_3 ),
inference(avatar_split_clause,[],[f113,f115,f105]) ).
fof(f120,plain,
( member(sK0(union(sK3,sK4),sum(unordered_pair(sK3,sK4))),union(sK3,sK4))
| spl5_1 ),
inference(resolution,[],[f107,f41]) ).
fof(f131,plain,
( member(sK0(union(sK3,sK4),sum(unordered_pair(sK3,sK4))),sK4)
| member(sK0(union(sK3,sK4),sum(unordered_pair(sK3,sK4))),sK3)
| spl5_1 ),
inference(resolution,[],[f120,f49]) ).
fof(f133,definition,
( spl5_4
<=> member(sK0(union(sK3,sK4),sum(unordered_pair(sK3,sK4))),sK3) ),
introduced(definition,[new_symbols(definition,[spl5_4])],[avatar_definition]) ).
fof(f137,definition,
( spl5_5
<=> member(sK0(union(sK3,sK4),sum(unordered_pair(sK3,sK4))),sK4) ),
introduced(definition,[new_symbols(definition,[spl5_5])],[avatar_definition]) ).
fof(f139,plain,
( member(sK0(union(sK3,sK4),sum(unordered_pair(sK3,sK4))),sK4)
| ~ spl5_5 ),
inference(avatar_component_clause,[],[f137]) ).
fof(f140,plain,
( spl5_4
| spl5_5
| spl5_1 ),
inference(avatar_split_clause,[],[f131,f105,f137,f133]) ).
fof(f189,plain,
( ~ member(sK0(sum(unordered_pair(sK3,sK4)),union(sK3,sK4)),sK3)
| spl5_3 ),
inference(resolution,[],[f117,f51]) ).
fof(f190,plain,
( ~ member(sK0(sum(unordered_pair(sK3,sK4)),union(sK3,sK4)),sK4)
| spl5_3 ),
inference(resolution,[],[f117,f50]) ).
fof(f206,plain,
( member(sK1(sK0(sum(unordered_pair(sK3,sK4)),union(sK3,sK4)),unordered_pair(sK3,sK4)),unordered_pair(sK3,sK4))
| ~ spl5_2 ),
inference(resolution,[],[f111,f62]) ).
fof(f220,plain,
( sK4 = sK1(sK0(sum(unordered_pair(sK3,sK4)),union(sK3,sK4)),unordered_pair(sK3,sK4))
| sK3 = sK1(sK0(sum(unordered_pair(sK3,sK4)),union(sK3,sK4)),unordered_pair(sK3,sK4))
| ~ spl5_2 ),
inference(resolution,[],[f206,f58]) ).
fof(f222,definition,
( spl5_8
<=> sK3 = sK1(sK0(sum(unordered_pair(sK3,sK4)),union(sK3,sK4)),unordered_pair(sK3,sK4)) ),
introduced(definition,[new_symbols(definition,[spl5_8])],[avatar_definition]) ).
fof(f224,plain,
( sK3 = sK1(sK0(sum(unordered_pair(sK3,sK4)),union(sK3,sK4)),unordered_pair(sK3,sK4))
| ~ spl5_8 ),
inference(avatar_component_clause,[],[f222]) ).
fof(f226,definition,
( spl5_9
<=> sK4 = sK1(sK0(sum(unordered_pair(sK3,sK4)),union(sK3,sK4)),unordered_pair(sK3,sK4)) ),
introduced(definition,[new_symbols(definition,[spl5_9])],[avatar_definition]) ).
fof(f228,plain,
( sK4 = sK1(sK0(sum(unordered_pair(sK3,sK4)),union(sK3,sK4)),unordered_pair(sK3,sK4))
| ~ spl5_9 ),
inference(avatar_component_clause,[],[f226]) ).
fof(f229,plain,
( spl5_8
| spl5_9
| ~ spl5_2 ),
inference(avatar_split_clause,[],[f220,f109,f226,f222]) ).
fof(f236,plain,
( ~ member(sK0(union(sK3,sK4),sum(unordered_pair(sK3,sK4))),sum(unordered_pair(sK3,sK4)))
| spl5_1 ),
inference(resolution,[],[f107,f42]) ).
fof(f277,plain,
( ! [X0] :
( ~ member(X0,unordered_pair(sK3,sK4))
| ~ member(sK0(union(sK3,sK4),sum(unordered_pair(sK3,sK4))),X0) )
| spl5_1 ),
inference(resolution,[],[f236,f63]) ).
fof(f286,plain,
( ~ member(sK0(union(sK3,sK4),sum(unordered_pair(sK3,sK4))),sK3)
| spl5_1 ),
inference(resolution,[],[f277,f69]) ).
fof(f287,plain,
( ~ member(sK0(union(sK3,sK4),sum(unordered_pair(sK3,sK4))),sK4)
| spl5_1 ),
inference(resolution,[],[f277,f70]) ).
fof(f291,plain,
( $false
| spl5_1
| ~ spl5_5 ),
inference(forward_subsumption_resolution,[],[f287,f139]) ).
fof(f292,plain,
( spl5_1
| ~ spl5_5 ),
inference(avatar_contradiction_clause,[],[f291]) ).
fof(f293,plain,
( ~ spl5_4
| spl5_1 ),
inference(avatar_split_clause,[],[f286,f105,f133]) ).
fof(f352,plain,
( member(sK0(sum(unordered_pair(sK3,sK4)),union(sK3,sK4)),sK4)
| ~ member(sK0(sum(unordered_pair(sK3,sK4)),union(sK3,sK4)),sum(unordered_pair(sK3,sK4)))
| ~ spl5_9 ),
inference(superposition,[],[f61,f228]) ).
fof(f353,plain,
( ~ member(sK0(sum(unordered_pair(sK3,sK4)),union(sK3,sK4)),sum(unordered_pair(sK3,sK4)))
| spl5_3
| ~ spl5_9 ),
inference(forward_subsumption_resolution,[],[f352,f190]) ).
fof(f354,plain,
( $false
| ~ spl5_2
| spl5_3
| ~ spl5_9 ),
inference(forward_subsumption_resolution,[],[f353,f111]) ).
fof(f355,plain,
( ~ spl5_2
| spl5_3
| ~ spl5_9 ),
inference(avatar_contradiction_clause,[],[f354]) ).
fof(f364,plain,
( member(sK0(sum(unordered_pair(sK3,sK4)),union(sK3,sK4)),sK3)
| ~ member(sK0(sum(unordered_pair(sK3,sK4)),union(sK3,sK4)),sum(unordered_pair(sK3,sK4)))
| ~ spl5_8 ),
inference(superposition,[],[f61,f224]) ).
fof(f365,plain,
( ~ member(sK0(sum(unordered_pair(sK3,sK4)),union(sK3,sK4)),sum(unordered_pair(sK3,sK4)))
| spl5_3
| ~ spl5_8 ),
inference(forward_subsumption_resolution,[],[f364,f189]) ).
fof(f366,plain,
( $false
| ~ spl5_2
| spl5_3
| ~ spl5_8 ),
inference(forward_subsumption_resolution,[],[f365,f111]) ).
fof(f367,plain,
( ~ spl5_2
| spl5_3
| ~ spl5_8 ),
inference(avatar_contradiction_clause,[],[f366]) ).
cnf(s1,plain,
( ~ spl5_1
| spl5_2 ),
inference(sat_conversion,[],[f112]) ).
cnf(s2,plain,
( ~ spl5_1
| ~ spl5_3 ),
inference(sat_conversion,[],[f118]) ).
cnf(s3,plain,
( spl5_1
| spl5_4
| spl5_5 ),
inference(sat_conversion,[],[f140]) ).
cnf(s7,plain,
( ~ spl5_2
| spl5_8
| spl5_9 ),
inference(sat_conversion,[],[f229]) ).
cnf(s8,plain,
( spl5_1
| ~ spl5_5 ),
inference(sat_conversion,[],[f292]) ).
cnf(s9,plain,
( spl5_1
| ~ spl5_4 ),
inference(sat_conversion,[],[f293]) ).
cnf(s13,plain,
( ~ spl5_2
| spl5_3
| ~ spl5_9 ),
inference(sat_conversion,[],[f355]) ).
cnf(s14,plain,
( ~ spl5_2
| spl5_3
| ~ spl5_8 ),
inference(sat_conversion,[],[f367]) ).
cnf(s15,plain,
spl5_1,
inference(rat,[],[s3,s8,s9]) ).
cnf(s16,plain,
~ spl5_3,
inference(rat,[],[s2,s15]) ).
cnf(s17,plain,
spl5_2,
inference(rat,[],[s1,s15]) ).
cnf(s18,plain,
~ spl5_8,
inference(rat,[],[s14,s16,s17]) ).
cnf(s19,plain,
~ spl5_9,
inference(rat,[],[s13,s16,s17]) ).
cnf(s20,plain,
$false,
inference(rat,[],[s7,s19,s18,s17]) ).
fof(f368,plain,
$false,
inference(avatar_sat_refutation,[],[s20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET352+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n007.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 28 01:30:24 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.39 Running first-order theorem proving
% 0.10/0.39 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.74/1.30 % (1945096)Detected formulas, will run a generic FOF schedule.
% 2.74/1.30 % (1945102)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=1095852252:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.74/1.30 % (1945103)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=2302172095:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.74/1.30 % (1945101)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=3567680441:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.74/1.30 % (1945105)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3734611052:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.74/1.30 % (1945106)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3762047903:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.74/1.30 % (1945104)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2574970218:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.74/1.30 % (1945107)dis-21_1_sil=8000:lcm=predicate:random_seed=3674664345: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.74/1.30 % (1945104)Refutation not found, incomplete strategy
% 2.74/1.30 % (1945104)------------------------------
% 2.74/1.30 % (1945104)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.74/1.30 % (1945104)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.74/1.30 % (1945104)CaDiCaL version: 2.1.3
% 2.74/1.30 % (1945104)Termination reason: Refutation not found, incomplete strategy
% 2.74/1.30 % (1945104)Time elapsed: 0.001 s
% 2.74/1.30 % (1945104)Peak memory usage: 88 MB
% 2.74/1.30 % (1945106)First to succeed.
% 2.74/1.30 % (1945106)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1945096"
% 2.74/1.30 % (1945105)Instruction limit reached!
% 2.74/1.30 % (1945105)------------------------------
% 2.74/1.30 % (1945105)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.74/1.30 % (1945105)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.74/1.30 % (1945105)CaDiCaL version: 2.1.3
% 2.74/1.30 % (1945105)Termination reason: Instruction limit
% 2.74/1.30 % (1945105)Termination phase: Saturation
% 2.74/1.30 % (1945105)Time elapsed: 0.075 s
% 2.74/1.30 % (1945105)Peak memory usage: 88 MB
% 2.74/1.30 % (1945105)Instructions burned: 120 (million)
% 2.74/1.30 % (1945107)Instruction limit reached!
% 2.74/1.30 % (1945107)------------------------------
% 2.74/1.30 % (1945107)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.74/1.30 % (1945107)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.74/1.30 % (1945107)CaDiCaL version: 2.1.3
% 2.74/1.30 % (1945107)Termination reason: Instruction limit
% 2.74/1.30 % (1945107)Termination phase: Saturation
% 2.74/1.30 % (1945107)Time elapsed: 0.078 s
% 2.74/1.30 % (1945107)Peak memory usage: 89 MB
% 2.74/1.30 % (1945107)Instructions burned: 129 (million)
% 2.74/1.30 % (1945116)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3880214094:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.74/1.30 % (1945115)lrs+10_1_sil=8000:sp=occurrence:random_seed=2621831651:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.74/1.30 % (1945104)------------------------------
% 2.74/1.30 % (1945104)------------------------------
% 2.74/1.30 % (1945106)Refutation found. Thanks to Tanya!
% 2.74/1.30 % SZS status Theorem for theBenchmark
% 2.74/1.30 % SZS output start Proof for theBenchmark
% See solution above
% 3.87/1.50 % (1945106)------------------------------
% 3.87/1.50 % (1945106)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.87/1.50 % (1945106)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.87/1.50 % (1945106)CaDiCaL version: 2.1.3
% 3.87/1.50 % (1945106)Termination reason: Refutation
% 3.87/1.50 % (1945106)Time elapsed: 0.016 s
% 3.87/1.50 % (1945106)Peak memory usage: 89 MB
% 3.87/1.50 % (1945106)Instructions burned: 19 (million)
% 3.87/1.50 % (1945106)------------------------------
% 3.87/1.50 % (1945106)------------------------------
% 3.87/1.50 % (1945096)Success in time 0.458 s
% 3.87/1.50 % Vampire exiting
%------------------------------------------------------------------------------