%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET171+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 : n012.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:23 PM UTC 2026
% Result : Theorem 0.88s 0.80s
% Output : Refutation 2.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 14
% Syntax : Number of formulae : 102 ( 14 unt; 9 def)
% Number of atoms : 246 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 239 ( 95 ~; 111 |; 17 &)
% ( 14 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 13 ( 12 usr; 10 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 80 ( 0 sgn 75 !; 5 ?)
% 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(f4,axiom,
! [X0,X1,X2] :
( member(X0,intersection(X1,X2))
<=> ( member(X0,X1)
& member(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection) ).
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(f12,conjecture,
! [X0,X1,X2] : equal_set(union(X0,intersection(X1,X2)),intersection(union(X0,X1),union(X0,X2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI11) ).
fof(f13,negated_conjecture,
~ ! [X0,X1,X2] : equal_set(union(X0,intersection(X1,X2)),intersection(union(X0,X1),union(X0,X2))),
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,X2] : ~ equal_set(union(X0,intersection(X1,X2)),intersection(union(X0,X1),union(X0,X2))),
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(f24,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(f25,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,[],[f24]) ).
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(f39,plain,
~ equal_set(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK5]),skolemize(X0,sK3),skolemize(X1,sK4),skolemize(X2,sK5)],[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(f46,plain,
! [X2,X0,X1] :
( ~ member(X0,intersection(X1,X2))
| member(X0,X2) ),
inference(cnf_transformation,[],[f25]) ).
fof(f47,plain,
! [X2,X0,X1] :
( ~ member(X0,intersection(X1,X2))
| member(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f48,plain,
! [X2,X0,X1] :
( member(X0,intersection(X1,X2))
| ~ member(X0,X1)
| ~ member(X0,X2) ),
inference(cnf_transformation,[],[f25]) ).
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(f67,plain,
~ equal_set(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),
inference(cnf_transformation,[],[f39]) ).
fof(f78,plain,
! [X0,X1] :
( equal_set(X0,X1)
| member(sK0(X0,X1),X0)
| ~ subset(X1,X0) ),
inference(resolution,[],[f41,f43]) ).
fof(f80,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ member(sK0(X0,X1),X1)
| ~ subset(X1,X0) ),
inference(resolution,[],[f42,f43]) ).
fof(f92,plain,
( member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),union(sK3,intersection(sK4,sK5)))
| ~ subset(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5))) ),
inference(resolution,[],[f78,f67]) ).
fof(f94,definition,
( spl6_1
<=> subset(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5))) ),
introduced(definition,[new_symbols(definition,[spl6_1])],[avatar_definition]) ).
fof(f96,plain,
( ~ subset(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5)))
| spl6_1 ),
inference(avatar_component_clause,[],[f94]) ).
fof(f98,definition,
( spl6_2
<=> member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),union(sK3,intersection(sK4,sK5))) ),
introduced(definition,[new_symbols(definition,[spl6_2])],[avatar_definition]) ).
fof(f100,plain,
( member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),union(sK3,intersection(sK4,sK5)))
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f98]) ).
fof(f101,plain,
( ~ spl6_1
| spl6_2 ),
inference(avatar_split_clause,[],[f92,f98,f94]) ).
fof(f102,plain,
( ~ member(sK0(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5))),union(sK3,intersection(sK4,sK5)))
| spl6_1 ),
inference(resolution,[],[f96,f42]) ).
fof(f103,plain,
( member(sK0(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5))),intersection(union(sK3,sK4),union(sK3,sK5)))
| spl6_1 ),
inference(resolution,[],[f96,f41]) ).
fof(f104,plain,
( ~ member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),intersection(union(sK3,sK4),union(sK3,sK5)))
| ~ subset(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5))) ),
inference(resolution,[],[f80,f67]) ).
fof(f105,plain,
( ~ member(sK0(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5))),sK3)
| spl6_1 ),
inference(resolution,[],[f102,f51]) ).
fof(f106,plain,
( ~ member(sK0(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5))),intersection(sK4,sK5))
| spl6_1 ),
inference(resolution,[],[f102,f50]) ).
fof(f129,plain,
( ~ member(sK0(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5))),sK4)
| ~ member(sK0(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5))),sK5)
| spl6_1 ),
inference(resolution,[],[f106,f48]) ).
fof(f131,definition,
( spl6_3
<=> member(sK0(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5))),sK5) ),
introduced(definition,[new_symbols(definition,[spl6_3])],[avatar_definition]) ).
fof(f133,plain,
( ~ member(sK0(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5))),sK5)
| spl6_3 ),
inference(avatar_component_clause,[],[f131]) ).
fof(f135,definition,
( spl6_4
<=> member(sK0(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5))),sK4) ),
introduced(definition,[new_symbols(definition,[spl6_4])],[avatar_definition]) ).
fof(f138,plain,
( ~ spl6_3
| ~ spl6_4
| spl6_1 ),
inference(avatar_split_clause,[],[f129,f94,f135,f131]) ).
fof(f150,plain,
( member(sK0(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5))),union(sK3,sK4))
| spl6_1 ),
inference(resolution,[],[f103,f47]) ).
fof(f151,plain,
( member(sK0(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5))),union(sK3,sK5))
| spl6_1 ),
inference(resolution,[],[f103,f46]) ).
fof(f163,plain,
( member(sK0(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5))),sK4)
| member(sK0(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5))),sK3)
| spl6_1 ),
inference(resolution,[],[f150,f49]) ).
fof(f164,plain,
( member(sK0(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5))),sK4)
| spl6_1 ),
inference(forward_subsumption_resolution,[],[f163,f105]) ).
fof(f165,plain,
( spl6_4
| spl6_1 ),
inference(avatar_split_clause,[],[f164,f94,f135]) ).
fof(f171,plain,
( member(sK0(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5))),sK5)
| member(sK0(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5))),sK3)
| spl6_1 ),
inference(resolution,[],[f151,f49]) ).
fof(f172,plain,
( member(sK0(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5))),sK3)
| spl6_1
| spl6_3 ),
inference(forward_subsumption_resolution,[],[f171,f133]) ).
fof(f173,plain,
( $false
| spl6_1
| spl6_3 ),
inference(forward_subsumption_resolution,[],[f172,f105]) ).
fof(f174,plain,
( spl6_1
| spl6_3 ),
inference(avatar_contradiction_clause,[],[f173]) ).
fof(f176,definition,
( spl6_5
<=> member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),intersection(union(sK3,sK4),union(sK3,sK5))) ),
introduced(definition,[new_symbols(definition,[spl6_5])],[avatar_definition]) ).
fof(f178,plain,
( ~ member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),intersection(union(sK3,sK4),union(sK3,sK5)))
| spl6_5 ),
inference(avatar_component_clause,[],[f176]) ).
fof(f179,plain,
( ~ spl6_1
| ~ spl6_5 ),
inference(avatar_split_clause,[],[f104,f176,f94]) ).
fof(f196,plain,
( member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),intersection(sK4,sK5))
| member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),sK3)
| ~ spl6_2 ),
inference(resolution,[],[f100,f49]) ).
fof(f198,definition,
( spl6_8
<=> member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),sK3) ),
introduced(definition,[new_symbols(definition,[spl6_8])],[avatar_definition]) ).
fof(f202,definition,
( spl6_9
<=> member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),intersection(sK4,sK5)) ),
introduced(definition,[new_symbols(definition,[spl6_9])],[avatar_definition]) ).
fof(f204,plain,
( member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),intersection(sK4,sK5))
| ~ spl6_9 ),
inference(avatar_component_clause,[],[f202]) ).
fof(f205,plain,
( spl6_8
| spl6_9
| ~ spl6_2 ),
inference(avatar_split_clause,[],[f196,f98,f202,f198]) ).
fof(f207,plain,
( ~ member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),union(sK3,sK4))
| ~ member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),union(sK3,sK5))
| spl6_5 ),
inference(resolution,[],[f178,f48]) ).
fof(f209,definition,
( spl6_10
<=> member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),union(sK3,sK5)) ),
introduced(definition,[new_symbols(definition,[spl6_10])],[avatar_definition]) ).
fof(f211,plain,
( ~ member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),union(sK3,sK5))
| spl6_10 ),
inference(avatar_component_clause,[],[f209]) ).
fof(f213,definition,
( spl6_11
<=> member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),union(sK3,sK4)) ),
introduced(definition,[new_symbols(definition,[spl6_11])],[avatar_definition]) ).
fof(f215,plain,
( ~ member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),union(sK3,sK4))
| spl6_11 ),
inference(avatar_component_clause,[],[f213]) ).
fof(f216,plain,
( ~ spl6_10
| ~ spl6_11
| spl6_5 ),
inference(avatar_split_clause,[],[f207,f176,f213,f209]) ).
fof(f222,plain,
( member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),sK4)
| ~ spl6_9 ),
inference(resolution,[],[f204,f47]) ).
fof(f223,plain,
( member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),sK5)
| ~ spl6_9 ),
inference(resolution,[],[f204,f46]) ).
fof(f232,plain,
( ~ member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),sK3)
| spl6_10 ),
inference(resolution,[],[f211,f51]) ).
fof(f233,plain,
( ~ member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),sK5)
| spl6_10 ),
inference(resolution,[],[f211,f50]) ).
fof(f234,plain,
( $false
| ~ spl6_9
| spl6_10 ),
inference(forward_subsumption_resolution,[],[f233,f223]) ).
fof(f235,plain,
( ~ spl6_9
| spl6_10 ),
inference(avatar_contradiction_clause,[],[f234]) ).
fof(f236,plain,
( ~ spl6_8
| spl6_10 ),
inference(avatar_split_clause,[],[f232,f209,f198]) ).
fof(f243,plain,
( ~ member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),sK3)
| spl6_11 ),
inference(resolution,[],[f215,f51]) ).
fof(f244,plain,
( ~ member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),sK4)
| spl6_11 ),
inference(resolution,[],[f215,f50]) ).
fof(f245,plain,
( $false
| ~ spl6_9
| spl6_11 ),
inference(forward_subsumption_resolution,[],[f244,f222]) ).
fof(f246,plain,
( ~ spl6_9
| spl6_11 ),
inference(avatar_contradiction_clause,[],[f245]) ).
fof(f247,plain,
( ~ spl6_8
| spl6_11 ),
inference(avatar_split_clause,[],[f243,f213,f198]) ).
cnf(s1,plain,
( ~ spl6_1
| spl6_2 ),
inference(sat_conversion,[],[f101]) ).
cnf(s2,plain,
( spl6_1
| ~ spl6_3
| ~ spl6_4 ),
inference(sat_conversion,[],[f138]) ).
cnf(s3,plain,
( spl6_1
| spl6_4 ),
inference(sat_conversion,[],[f165]) ).
cnf(s4,plain,
( spl6_1
| spl6_3 ),
inference(sat_conversion,[],[f174]) ).
cnf(s5,plain,
( ~ spl6_1
| ~ spl6_5 ),
inference(sat_conversion,[],[f179]) ).
cnf(s9,plain,
( ~ spl6_2
| spl6_8
| spl6_9 ),
inference(sat_conversion,[],[f205]) ).
cnf(s10,plain,
( spl6_5
| ~ spl6_10
| ~ spl6_11 ),
inference(sat_conversion,[],[f216]) ).
cnf(s11,plain,
( ~ spl6_9
| spl6_10 ),
inference(sat_conversion,[],[f235]) ).
cnf(s12,plain,
( ~ spl6_8
| spl6_10 ),
inference(sat_conversion,[],[f236]) ).
cnf(s13,plain,
( ~ spl6_9
| spl6_11 ),
inference(sat_conversion,[],[f246]) ).
cnf(s14,plain,
( ~ spl6_8
| spl6_11 ),
inference(sat_conversion,[],[f247]) ).
cnf(s15,plain,
spl6_1,
inference(rat,[],[s2,s3,s4]) ).
cnf(s16,plain,
~ spl6_5,
inference(rat,[],[s5,s15]) ).
cnf(s17,plain,
spl6_2,
inference(rat,[],[s1,s15]) ).
cnf(s18,plain,
~ spl6_9,
inference(rat,[],[s10,s11,s13,s16]) ).
cnf(s19,plain,
spl6_8,
inference(rat,[],[s9,s17,s18]) ).
cnf(s20,plain,
spl6_11,
inference(rat,[],[s14,s19]) ).
cnf(s21,plain,
spl6_10,
inference(rat,[],[s12,s19]) ).
cnf(s22,plain,
$false,
inference(rat,[],[s10,s16,s20,s21]) ).
fof(f248,plain,
$false,
inference(avatar_sat_refutation,[],[s22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SET171+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.02 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.03/0.31 % Computer : n012.cluster.edu
% 0.03/0.31 % Model : x86_64 x86_64
% 0.03/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.31 % Memory : 8046.5625MB
% 0.03/0.31 % OS : Linux 6.8.0-71-generic
% 0.03/0.31 % CPULimit : 300
% 0.03/0.31 % WCLimit : 300
% 0.03/0.31 % DateTime : Mon Sep 28 01:00:04 UTC 2026
% 0.03/0.31 % CPUTime :
% 0.03/0.31 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.33 Running first-order theorem proving
% 0.07/0.33 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
% 0.88/0.80 % (2915646)Detected formulas, will run a generic FOF schedule.
% 0.88/0.80 % (2915655)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3641885901:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.88/0.80 % (2915652)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=4163962631:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.88/0.80 % (2915651)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=1877213145:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.88/0.80 % (2915654)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1918849682:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.88/0.80 % (2915653)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=3953090377:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.88/0.80 % (2915656)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=713361415:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.88/0.80 % (2915654)Refutation not found, incomplete strategy
% 0.88/0.80 % (2915654)------------------------------
% 0.88/0.80 % (2915654)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.88/0.80 % (2915654)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.88/0.80 % (2915654)CaDiCaL version: 2.1.3
% 0.88/0.80 % (2915654)Termination reason: Refutation not found, incomplete strategy
% 0.88/0.80 % (2915654)Time elapsed: 0.0000 s
% 0.88/0.80 % (2915654)Peak memory usage: 87 MB
% 0.88/0.80 % (2915656)First to succeed.
% 0.88/0.80 % (2915656)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2915646"
% 0.88/0.80 % (2915657)dis-21_1_sil=8000:lcm=predicate:random_seed=446531026: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)
% 0.88/0.80 % (2915657)Also succeeded, but the first one will report.
% 0.88/0.80 % (2915655)Instruction limit reached!
% 0.88/0.80 % (2915655)------------------------------
% 0.88/0.80 % (2915655)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.88/0.80 % (2915655)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.88/0.80 % (2915655)CaDiCaL version: 2.1.3
% 0.88/0.80 % (2915655)Termination reason: Instruction limit
% 0.88/0.80 % (2915655)Termination phase: Saturation
% 0.88/0.80 % (2915655)Time elapsed: 0.039 s
% 0.88/0.80 % (2915655)Peak memory usage: 89 MB
% 0.88/0.80 % (2915655)Instructions burned: 119 (million)
% 0.88/0.80 % (2915665)lrs+10_1_sil=8000:sp=occurrence:random_seed=885488906:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 0.88/0.80 % (2915654)------------------------------
% 0.88/0.80 % (2915654)------------------------------
% 0.88/0.80 % (2915656)Refutation found. Thanks to Tanya!
% 0.88/0.80 % SZS status Theorem for theBenchmark
% 0.88/0.80 % SZS output start Proof for theBenchmark
% See solution above
% 2.25/0.90 % (2915656)------------------------------
% 2.25/0.90 % (2915656)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.25/0.90 % (2915656)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.25/0.90 % (2915656)CaDiCaL version: 2.1.3
% 2.25/0.90 % (2915656)Termination reason: Refutation
% 2.25/0.90 % (2915656)Time elapsed: 0.005 s
% 2.25/0.90 % (2915656)Peak memory usage: 89 MB
% 2.25/0.90 % (2915656)Instructions burned: 12 (million)
% 2.25/0.90 % (2915656)------------------------------
% 2.25/0.90 % (2915656)------------------------------
% 2.25/0.90 % (2915646)Success in time 0.28 s
% 2.25/0.90 % Vampire exiting
%------------------------------------------------------------------------------