%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET769+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 : 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:41:52 PM UTC 2026
% Result : Theorem 3.60s 11.37s
% Output : Refutation 4.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 15
% Syntax : Number of formulae : 170 ( 14 unt; 9 def)
% Number of atoms : 582 ( 4 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 722 ( 310 ~; 307 |; 67 &)
% ( 17 <=>; 19 =>; 0 <=; 2 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 8 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-3 aty)
% Number of variables : 228 ( 0 sgn 207 !; 21 ?)
% 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(f12,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> ~ ? [X2] :
( member(X2,X0)
& member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',disjoint) ).
fof(f14,axiom,
! [X0,X1] :
( equivalence(X1,X0)
<=> ( ! [X2] :
( member(X2,X0)
=> apply(X1,X2,X2) )
& ! [X2,X3] :
( ( member(X2,X0)
& member(X3,X0) )
=> ( apply(X1,X2,X3)
=> apply(X1,X3,X2) ) )
& ! [X2,X3,X4] :
( ( member(X2,X0)
& member(X3,X0)
& member(X4,X0) )
=> ( ( apply(X1,X2,X3)
& apply(X1,X3,X4) )
=> apply(X1,X2,X4) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equivalence) ).
fof(f15,axiom,
! [X0,X1,X2,X3] :
( member(X3,equivalence_class(X2,X1,X0))
<=> ( member(X3,X1)
& apply(X0,X2,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equivalence_class) ).
fof(f17,conjecture,
! [X0,X1,X2,X3] :
( ( equivalence(X1,X0)
& member(X2,X0)
& member(X3,X0) )
=> ( equal_set(equivalence_class(X2,X0,X1),equivalence_class(X3,X0,X1))
<=> ~ disjoint(equivalence_class(X2,X0,X1),equivalence_class(X3,X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thIII05) ).
fof(f18,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( equivalence(X1,X0)
& member(X2,X0)
& member(X3,X0) )
=> ( equal_set(equivalence_class(X2,X0,X1),equivalence_class(X3,X0,X1))
<=> ~ disjoint(equivalence_class(X2,X0,X1),equivalence_class(X3,X0,X1)) ) ),
inference(negated_conjecture,[status(cth)],[f17]) ).
fof(f20,plain,
! [X0,X1] :
( equivalence(X1,X0)
<=> ( ! [X2] :
( member(X2,X0)
=> apply(X1,X2,X2) )
& ! [X3,X4] :
( ( member(X3,X0)
& member(X4,X0) )
=> ( apply(X1,X3,X4)
=> apply(X1,X4,X3) ) )
& ! [X5,X6,X7] :
( ( member(X5,X0)
& member(X6,X0)
& member(X7,X0) )
=> ( ( apply(X1,X5,X6)
& apply(X1,X6,X7) )
=> apply(X1,X5,X7) ) ) ) ),
inference(rectify,[],[f14]) ).
fof(f22,plain,
! [X0,X1] :
( equivalence(X1,X0)
=> ( ! [X2] :
( member(X2,X0)
=> apply(X1,X2,X2) )
& ! [X3,X4] :
( ( member(X3,X0)
& member(X4,X0) )
=> ( apply(X1,X3,X4)
=> apply(X1,X4,X3) ) )
& ! [X5,X6,X7] :
( ( member(X5,X0)
& member(X6,X0)
& member(X7,X0) )
=> ( ( apply(X1,X5,X6)
& apply(X1,X6,X7) )
=> apply(X1,X5,X7) ) ) ) ),
inference(unused_predicate_definition_removal,[],[f20]) ).
fof(f23,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f25,plain,
! [X0,X1] :
( disjoint(X0,X1)
<=> ! [X2] :
( ~ member(X2,X0)
| ~ member(X2,X1) ) ),
inference(ennf_transformation,[],[f12]) ).
fof(f26,plain,
! [X0,X1] :
( ( ! [X2] :
( apply(X1,X2,X2)
| ~ member(X2,X0) )
& ! [X3,X4] :
( apply(X1,X4,X3)
| ~ apply(X1,X3,X4)
| ~ member(X3,X0)
| ~ member(X4,X0) )
& ! [X5,X6,X7] :
( apply(X1,X5,X7)
| ~ apply(X1,X5,X6)
| ~ apply(X1,X6,X7)
| ~ member(X5,X0)
| ~ member(X6,X0)
| ~ member(X7,X0) ) )
| ~ equivalence(X1,X0) ),
inference(ennf_transformation,[],[f22]) ).
fof(f27,plain,
! [X0,X1] :
( ( ! [X2] :
( apply(X1,X2,X2)
| ~ member(X2,X0) )
& ! [X3,X4] :
( apply(X1,X4,X3)
| ~ apply(X1,X3,X4)
| ~ member(X3,X0)
| ~ member(X4,X0) )
& ! [X5,X6,X7] :
( apply(X1,X5,X7)
| ~ apply(X1,X5,X6)
| ~ apply(X1,X6,X7)
| ~ member(X5,X0)
| ~ member(X6,X0)
| ~ member(X7,X0) ) )
| ~ equivalence(X1,X0) ),
inference(flattening,[],[f26]) ).
fof(f28,plain,
? [X0,X1,X2,X3] :
( ( equal_set(equivalence_class(X2,X0,X1),equivalence_class(X3,X0,X1))
<~> ~ disjoint(equivalence_class(X2,X0,X1),equivalence_class(X3,X0,X1)) )
& equivalence(X1,X0)
& member(X2,X0)
& member(X3,X0) ),
inference(ennf_transformation,[],[f18]) ).
fof(f29,plain,
? [X0,X1,X2,X3] :
( ( equal_set(equivalence_class(X2,X0,X1),equivalence_class(X3,X0,X1))
<~> ~ disjoint(equivalence_class(X2,X0,X1),equivalence_class(X3,X0,X1)) )
& equivalence(X1,X0)
& member(X2,X0)
& member(X3,X0) ),
inference(flattening,[],[f28]) ).
fof(f30,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,[],[f23]) ).
fof(f31,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,[],[f30]) ).
fof(f32,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))],[f31]) ).
fof(f33,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(f34,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,[],[f33]) ).
fof(f51,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| ? [X2] :
( member(X2,X0)
& member(X2,X1) ) )
& ( ! [X2] :
( ~ member(X2,X0)
| ~ member(X2,X1) )
| ~ disjoint(X0,X1) ) ),
inference(nnf_transformation,[],[f25]) ).
fof(f52,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| ? [X2] :
( member(X2,X0)
& member(X2,X1) ) )
& ( ! [X3] :
( ~ member(X3,X0)
| ~ member(X3,X1) )
| ~ disjoint(X0,X1) ) ),
inference(rectify,[],[f51]) ).
fof(f53,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| ( member(sK3(X0,X1),X0)
& member(sK3(X0,X1),X1) ) )
& ( ! [X3] :
( ~ member(X3,X0)
| ~ member(X3,X1) )
| ~ disjoint(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X2,sK3(X0,X1))],[f52]) ).
fof(f54,plain,
! [X0,X1,X2,X3] :
( ( member(X3,equivalence_class(X2,X1,X0))
| ~ member(X3,X1)
| ~ apply(X0,X2,X3) )
& ( ( member(X3,X1)
& apply(X0,X2,X3) )
| ~ member(X3,equivalence_class(X2,X1,X0)) ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f55,plain,
! [X0,X1,X2,X3] :
( ( member(X3,equivalence_class(X2,X1,X0))
| ~ member(X3,X1)
| ~ apply(X0,X2,X3) )
& ( ( member(X3,X1)
& apply(X0,X2,X3) )
| ~ member(X3,equivalence_class(X2,X1,X0)) ) ),
inference(flattening,[],[f54]) ).
fof(f56,plain,
? [X0,X1,X2,X3] :
( ( disjoint(equivalence_class(X2,X0,X1),equivalence_class(X3,X0,X1))
| ~ equal_set(equivalence_class(X2,X0,X1),equivalence_class(X3,X0,X1)) )
& ( ~ disjoint(equivalence_class(X2,X0,X1),equivalence_class(X3,X0,X1))
| equal_set(equivalence_class(X2,X0,X1),equivalence_class(X3,X0,X1)) )
& equivalence(X1,X0)
& member(X2,X0)
& member(X3,X0) ),
inference(nnf_transformation,[],[f29]) ).
fof(f57,plain,
? [X0,X1,X2,X3] :
( ( disjoint(equivalence_class(X2,X0,X1),equivalence_class(X3,X0,X1))
| ~ equal_set(equivalence_class(X2,X0,X1),equivalence_class(X3,X0,X1)) )
& ( ~ disjoint(equivalence_class(X2,X0,X1),equivalence_class(X3,X0,X1))
| equal_set(equivalence_class(X2,X0,X1),equivalence_class(X3,X0,X1)) )
& equivalence(X1,X0)
& member(X2,X0)
& member(X3,X0) ),
inference(flattening,[],[f56]) ).
fof(f58,plain,
( ( disjoint(equivalence_class(sK6,sK4,sK5),equivalence_class(sK7,sK4,sK5))
| ~ equal_set(equivalence_class(sK6,sK4,sK5),equivalence_class(sK7,sK4,sK5)) )
& ( ~ disjoint(equivalence_class(sK6,sK4,sK5),equivalence_class(sK7,sK4,sK5))
| equal_set(equivalence_class(sK6,sK4,sK5),equivalence_class(sK7,sK4,sK5)) )
& equivalence(sK5,sK4)
& member(sK6,sK4)
& member(sK7,sK4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7]),skolemize(X0,sK4),skolemize(X1,sK5),skolemize(X2,sK6),skolemize(X3,sK7)],[f57]) ).
fof(f59,plain,
! [X3,X0,X1] :
( ~ member(X3,X0)
| member(X3,X1)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f32]) ).
fof(f60,plain,
! [X0,X1] :
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f32]) ).
fof(f61,plain,
! [X0,X1] :
( ~ member(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f32]) ).
fof(f63,plain,
! [X0,X1] :
( ~ equal_set(X0,X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f34]) ).
fof(f64,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| equal_set(X0,X1) ),
inference(cnf_transformation,[],[f34]) ).
fof(f88,plain,
! [X3,X0,X1] :
( ~ disjoint(X0,X1)
| ~ member(X3,X1)
| ~ member(X3,X0) ),
inference(cnf_transformation,[],[f53]) ).
fof(f89,plain,
! [X0,X1] :
( member(sK3(X0,X1),X1)
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f53]) ).
fof(f90,plain,
! [X0,X1] :
( member(sK3(X0,X1),X0)
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f53]) ).
fof(f91,plain,
! [X0,X1,X6,X7,X5] :
( ~ apply(X1,X6,X7)
| ~ apply(X1,X5,X6)
| apply(X1,X5,X7)
| ~ member(X5,X0)
| ~ member(X6,X0)
| ~ member(X7,X0)
| ~ equivalence(X1,X0) ),
inference(cnf_transformation,[],[f27]) ).
fof(f92,plain,
! [X3,X0,X1,X4] :
( ~ apply(X1,X3,X4)
| apply(X1,X4,X3)
| ~ member(X3,X0)
| ~ member(X4,X0)
| ~ equivalence(X1,X0) ),
inference(cnf_transformation,[],[f27]) ).
fof(f93,plain,
! [X2,X0,X1] :
( ~ equivalence(X1,X0)
| ~ member(X2,X0)
| apply(X1,X2,X2) ),
inference(cnf_transformation,[],[f27]) ).
fof(f94,plain,
! [X2,X3,X0,X1] :
( ~ member(X3,equivalence_class(X2,X1,X0))
| apply(X0,X2,X3) ),
inference(cnf_transformation,[],[f55]) ).
fof(f95,plain,
! [X2,X3,X0,X1] :
( ~ member(X3,equivalence_class(X2,X1,X0))
| member(X3,X1) ),
inference(cnf_transformation,[],[f55]) ).
fof(f96,plain,
! [X2,X3,X0,X1] :
( member(X3,equivalence_class(X2,X1,X0))
| ~ member(X3,X1)
| ~ apply(X0,X2,X3) ),
inference(cnf_transformation,[],[f55]) ).
fof(f97,plain,
member(sK7,sK4),
inference(cnf_transformation,[],[f58]) ).
fof(f98,plain,
member(sK6,sK4),
inference(cnf_transformation,[],[f58]) ).
fof(f99,plain,
equivalence(sK5,sK4),
inference(cnf_transformation,[],[f58]) ).
fof(f100,plain,
( ~ disjoint(equivalence_class(sK6,sK4,sK5),equivalence_class(sK7,sK4,sK5))
| equal_set(equivalence_class(sK6,sK4,sK5),equivalence_class(sK7,sK4,sK5)) ),
inference(cnf_transformation,[],[f58]) ).
fof(f101,plain,
( disjoint(equivalence_class(sK6,sK4,sK5),equivalence_class(sK7,sK4,sK5))
| ~ equal_set(equivalence_class(sK6,sK4,sK5),equivalence_class(sK7,sK4,sK5)) ),
inference(cnf_transformation,[],[f58]) ).
fof(f105,definition,
sF8 = equivalence_class(sK6,sK4,sK5),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
fof(f106,plain,
equivalence_class(sK6,sK4,sK5) = sF8,
inference(reorient_equations,[],[f105]) ).
fof(f107,definition,
sF9 = equivalence_class(sK7,sK4,sK5),
introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).
fof(f108,plain,
equivalence_class(sK7,sK4,sK5) = sF9,
inference(reorient_equations,[],[f107]) ).
fof(f109,plain,
( disjoint(sF8,sF9)
| ~ equal_set(sF8,sF9) ),
inference(definition_folding,[],[f101,f108,f106,f108,f106]) ).
fof(f110,plain,
( ~ disjoint(sF8,sF9)
| equal_set(sF8,sF9) ),
inference(definition_folding,[],[f100,f108,f106,f108,f106]) ).
fof(f112,definition,
( spl10_1
<=> equal_set(sF8,sF9) ),
introduced(definition,[new_symbols(definition,[spl10_1])],[avatar_definition]) ).
fof(f113,plain,
( ~ equal_set(sF8,sF9)
| spl10_1 ),
inference(avatar_component_clause,[],[f112]) ).
fof(f114,plain,
( equal_set(sF8,sF9)
| ~ spl10_1 ),
inference(avatar_component_clause,[],[f112]) ).
fof(f116,definition,
( spl10_2
<=> disjoint(sF8,sF9) ),
introduced(definition,[new_symbols(definition,[spl10_2])],[avatar_definition]) ).
fof(f117,plain,
( disjoint(sF8,sF9)
| ~ spl10_2 ),
inference(avatar_component_clause,[],[f116]) ).
fof(f118,plain,
( ~ disjoint(sF8,sF9)
| spl10_2 ),
inference(avatar_component_clause,[],[f116]) ).
fof(f119,plain,
( spl10_1
| ~ spl10_2 ),
inference(avatar_split_clause,[],[f110,f116,f112]) ).
fof(f120,plain,
( ~ spl10_1
| spl10_2 ),
inference(avatar_split_clause,[],[f109,f116,f112]) ).
fof(f121,plain,
! [X0] :
( apply(sK5,sK6,X0)
| ~ member(X0,sF8) ),
inference(superposition,[],[f94,f106]) ).
fof(f122,plain,
! [X0] :
( apply(sK5,sK7,X0)
| ~ member(X0,sF9) ),
inference(superposition,[],[f94,f108]) ).
fof(f123,plain,
! [X0] :
( ~ member(X0,sF8)
| member(X0,sK4) ),
inference(superposition,[],[f95,f106]) ).
fof(f124,plain,
! [X0] :
( ~ member(X0,sF9)
| member(X0,sK4) ),
inference(superposition,[],[f95,f108]) ).
fof(f127,plain,
! [X0] :
( ~ apply(sK5,sK6,X0)
| ~ member(X0,sK4)
| member(X0,sF8) ),
inference(superposition,[],[f96,f106]) ).
fof(f128,plain,
! [X0] :
( ~ apply(sK5,sK7,X0)
| ~ member(X0,sK4)
| member(X0,sF9) ),
inference(superposition,[],[f96,f108]) ).
fof(f131,plain,
! [X0] :
( apply(sK5,X0,X0)
| ~ member(X0,sK4) ),
inference(resolution,[],[f93,f99]) ).
fof(f132,plain,
( ~ member(sK6,sK4)
| ~ member(sK6,sK4)
| member(sK6,sF8) ),
inference(resolution,[],[f131,f127]) ).
fof(f133,plain,
( ~ member(sK7,sK4)
| ~ member(sK7,sK4)
| member(sK7,sF9) ),
inference(resolution,[],[f131,f128]) ).
fof(f134,plain,
( ~ member(sK7,sK4)
| member(sK7,sF9) ),
inference(duplicate_literal_removal,[],[f133]) ).
fof(f135,plain,
( ~ member(sK6,sK4)
| member(sK6,sF8) ),
inference(duplicate_literal_removal,[],[f132]) ).
fof(f136,plain,
member(sK7,sF9),
inference(forward_subsumption_resolution,[],[f134,f97]) ).
fof(f137,plain,
member(sK6,sF8),
inference(forward_subsumption_resolution,[],[f135,f98]) ).
fof(f141,plain,
! [X0,X1] :
( ~ equivalence(sK5,X1)
| ~ member(sK7,X1)
| ~ member(X0,X1)
| apply(sK5,X0,sK7)
| ~ member(X0,sF9) ),
inference(resolution,[],[f92,f122]) ).
fof(f142,plain,
! [X0,X1] :
( ~ equivalence(sK5,X1)
| ~ member(sK6,X1)
| ~ member(X0,X1)
| apply(sK5,X0,sK6)
| ~ member(X0,sF8) ),
inference(resolution,[],[f92,f121]) ).
fof(f145,plain,
! [X0] :
( ~ member(sK7,sK4)
| ~ member(X0,sK4)
| apply(sK5,X0,sK7)
| ~ member(X0,sF9) ),
inference(resolution,[],[f141,f99]) ).
fof(f146,plain,
! [X0] :
( ~ member(sK7,sK4)
| apply(sK5,X0,sK7)
| ~ member(X0,sF9) ),
inference(forward_subsumption_resolution,[],[f145,f124]) ).
fof(f147,plain,
! [X0] :
( apply(sK5,X0,sK7)
| ~ member(X0,sF9) ),
inference(forward_subsumption_resolution,[],[f146,f97]) ).
fof(f153,definition,
( spl10_3
<=> member(sK7,sF8) ),
introduced(definition,[new_symbols(definition,[spl10_3])],[avatar_definition]) ).
fof(f154,plain,
( ~ member(sK7,sF8)
| spl10_3 ),
inference(avatar_component_clause,[],[f153]) ).
fof(f155,plain,
( member(sK7,sF8)
| ~ spl10_3 ),
inference(avatar_component_clause,[],[f153]) ).
fof(f157,definition,
( spl10_4
<=> member(sK6,sF9) ),
introduced(definition,[new_symbols(definition,[spl10_4])],[avatar_definition]) ).
fof(f158,plain,
( member(sK6,sF9)
| ~ spl10_4 ),
inference(avatar_component_clause,[],[f157]) ).
fof(f159,plain,
( ~ member(sK6,sF9)
| spl10_4 ),
inference(avatar_component_clause,[],[f157]) ).
fof(f161,plain,
! [X0] :
( ~ member(sK6,sK4)
| ~ member(X0,sK4)
| apply(sK5,X0,sK6)
| ~ member(X0,sF8) ),
inference(resolution,[],[f142,f99]) ).
fof(f162,plain,
! [X0] :
( ~ member(sK6,sK4)
| apply(sK5,X0,sK6)
| ~ member(X0,sF8) ),
inference(forward_subsumption_resolution,[],[f161,f123]) ).
fof(f163,plain,
! [X0] :
( apply(sK5,X0,sK6)
| ~ member(X0,sF8) ),
inference(forward_subsumption_resolution,[],[f162,f98]) ).
fof(f165,plain,
( ~ member(sK7,sF8)
| ~ member(sK6,sK4)
| member(sK6,sF9) ),
inference(resolution,[],[f163,f128]) ).
fof(f167,plain,
( ~ member(sK7,sF8)
| member(sK6,sF9) ),
inference(forward_subsumption_resolution,[],[f165,f98]) ).
fof(f168,plain,
( ~ member(sK7,sF8)
| spl10_4 ),
inference(forward_subsumption_resolution,[],[f167,f159]) ).
fof(f169,plain,
( ~ spl10_3
| spl10_4 ),
inference(avatar_split_clause,[],[f168,f157,f153]) ).
fof(f176,plain,
! [X2,X0,X1] :
( ~ apply(sK5,X0,sK7)
| apply(sK5,X0,X1)
| ~ member(X0,X2)
| ~ member(sK7,X2)
| ~ member(X1,X2)
| ~ equivalence(sK5,X2)
| ~ member(X1,sF9) ),
inference(resolution,[],[f91,f122]) ).
fof(f177,plain,
! [X2,X0,X1] :
( ~ apply(sK5,X0,sK6)
| apply(sK5,X0,X1)
| ~ member(X0,X2)
| ~ member(sK6,X2)
| ~ member(X1,X2)
| ~ equivalence(sK5,X2)
| ~ member(X1,sF8) ),
inference(resolution,[],[f91,f121]) ).
fof(f179,plain,
! [X2,X0,X1] :
( ~ apply(sK5,X0,X1)
| apply(sK5,X0,sK7)
| ~ member(X0,X2)
| ~ member(X1,X2)
| ~ member(sK7,X2)
| ~ equivalence(sK5,X2)
| ~ member(X1,sF9) ),
inference(resolution,[],[f91,f147]) ).
fof(f186,plain,
! [X0] :
( ~ subset(sF8,X0)
| member(sK6,X0) ),
inference(resolution,[],[f59,f137]) ).
fof(f188,plain,
! [X2,X0,X1] :
( ~ equivalence(sK5,X2)
| ~ member(X0,X2)
| ~ member(sK6,X2)
| ~ member(X1,X2)
| apply(sK5,X0,X1)
| ~ member(X1,sF8)
| ~ member(X0,sF8) ),
inference(resolution,[],[f177,f163]) ).
fof(f194,plain,
! [X2,X0,X1] :
( ~ equivalence(sK5,X2)
| ~ member(X0,X2)
| ~ member(sK7,X2)
| ~ member(X1,X2)
| apply(sK5,X0,X1)
| ~ member(X1,sF9)
| ~ member(X0,sF9) ),
inference(resolution,[],[f176,f147]) ).
fof(f200,plain,
! [X0,X1] :
( ~ member(X0,sK4)
| ~ member(sK7,sK4)
| ~ member(X1,sK4)
| apply(sK5,X0,X1)
| ~ member(X1,sF9)
| ~ member(X0,sF9) ),
inference(resolution,[],[f194,f99]) ).
fof(f201,plain,
! [X0,X1] :
( ~ member(X0,sK4)
| ~ member(sK7,sK4)
| apply(sK5,X0,X1)
| ~ member(X1,sF9)
| ~ member(X0,sF9) ),
inference(forward_subsumption_resolution,[],[f200,f124]) ).
fof(f202,plain,
! [X0,X1] :
( ~ member(sK7,sK4)
| apply(sK5,X0,X1)
| ~ member(X1,sF9)
| ~ member(X0,sF9) ),
inference(forward_subsumption_resolution,[],[f201,f124]) ).
fof(f203,plain,
! [X0,X1] :
( apply(sK5,X0,X1)
| ~ member(X1,sF9)
| ~ member(X0,sF9) ),
inference(forward_subsumption_resolution,[],[f202,f97]) ).
fof(f204,plain,
! [X0] :
( ~ member(X0,sF9)
| ~ member(sK6,sF9)
| ~ member(X0,sK4)
| member(X0,sF8) ),
inference(resolution,[],[f203,f127]) ).
fof(f210,plain,
! [X0] :
( ~ member(X0,sF9)
| ~ member(sK6,sF9)
| member(X0,sF8) ),
inference(forward_subsumption_resolution,[],[f204,f124]) ).
fof(f211,plain,
! [X0,X1] :
( ~ member(X0,sK4)
| ~ member(sK6,sK4)
| ~ member(X1,sK4)
| apply(sK5,X0,X1)
| ~ member(X1,sF8)
| ~ member(X0,sF8) ),
inference(resolution,[],[f188,f99]) ).
fof(f212,plain,
! [X0,X1] :
( ~ member(X0,sK4)
| ~ member(sK6,sK4)
| apply(sK5,X0,X1)
| ~ member(X1,sF8)
| ~ member(X0,sF8) ),
inference(forward_subsumption_resolution,[],[f211,f123]) ).
fof(f213,plain,
! [X0,X1] :
( ~ member(sK6,sK4)
| apply(sK5,X0,X1)
| ~ member(X1,sF8)
| ~ member(X0,sF8) ),
inference(forward_subsumption_resolution,[],[f212,f123]) ).
fof(f214,plain,
! [X0,X1] :
( apply(sK5,X0,X1)
| ~ member(X1,sF8)
| ~ member(X0,sF8) ),
inference(forward_subsumption_resolution,[],[f213,f98]) ).
fof(f216,plain,
! [X0] :
( ~ member(X0,sF8)
| ~ member(sK7,sF8)
| ~ member(X0,sK4)
| member(X0,sF9) ),
inference(resolution,[],[f214,f128]) ).
fof(f221,plain,
! [X0] :
( ~ member(X0,sF8)
| ~ member(sK7,sF8)
| member(X0,sF9) ),
inference(forward_subsumption_resolution,[],[f216,f123]) ).
fof(f243,plain,
! [X0,X1] :
( apply(sK5,sK6,sK7)
| ~ member(sK6,X0)
| ~ member(X1,X0)
| ~ member(sK7,X0)
| ~ equivalence(sK5,X0)
| ~ member(X1,sF9)
| ~ member(X1,sF8) ),
inference(resolution,[],[f179,f121]) ).
fof(f254,definition,
( spl10_5
<=> ! [X0,X1] :
( ~ member(sK6,X0)
| ~ member(X1,sF8)
| ~ member(X1,sF9)
| ~ equivalence(sK5,X0)
| ~ member(sK7,X0)
| ~ member(X1,X0) ) ),
introduced(definition,[new_symbols(definition,[spl10_5])],[avatar_definition]) ).
fof(f255,plain,
( ! [X0,X1] :
( ~ equivalence(sK5,X0)
| ~ member(X1,sF8)
| ~ member(X1,sF9)
| ~ member(sK6,X0)
| ~ member(sK7,X0)
| ~ member(X1,X0) )
| ~ spl10_5 ),
inference(avatar_component_clause,[],[f254]) ).
fof(f257,definition,
( spl10_6
<=> apply(sK5,sK6,sK7) ),
introduced(definition,[new_symbols(definition,[spl10_6])],[avatar_definition]) ).
fof(f259,plain,
( apply(sK5,sK6,sK7)
| ~ spl10_6 ),
inference(avatar_component_clause,[],[f257]) ).
fof(f260,plain,
( spl10_5
| spl10_6 ),
inference(avatar_split_clause,[],[f243,f257,f254]) ).
fof(f261,plain,
( ! [X0] :
( ~ member(X0,sF8)
| ~ member(X0,sF9)
| ~ member(sK6,sK4)
| ~ member(sK7,sK4)
| ~ member(X0,sK4) )
| ~ spl10_5 ),
inference(resolution,[],[f255,f99]) ).
fof(f262,plain,
( ! [X0] :
( ~ member(X0,sF8)
| ~ member(X0,sF9)
| ~ member(sK6,sK4)
| ~ member(sK7,sK4) )
| ~ spl10_5 ),
inference(forward_subsumption_resolution,[],[f261,f123]) ).
fof(f263,plain,
( ! [X0] :
( ~ member(X0,sF8)
| ~ member(X0,sF9)
| ~ member(sK7,sK4) )
| ~ spl10_5 ),
inference(forward_subsumption_resolution,[],[f262,f98]) ).
fof(f264,plain,
( ! [X0] :
( ~ member(X0,sF9)
| ~ member(X0,sF8) )
| ~ spl10_5 ),
inference(forward_subsumption_resolution,[],[f263,f97]) ).
fof(f282,plain,
( ! [X0] :
( ~ member(sK3(X0,sF9),sF8)
| disjoint(X0,sF9) )
| ~ spl10_5 ),
inference(resolution,[],[f89,f264]) ).
fof(f284,plain,
( disjoint(sF8,sF9)
| disjoint(sF8,sF9)
| ~ spl10_5 ),
inference(resolution,[],[f90,f282]) ).
fof(f291,plain,
( disjoint(sF8,sF9)
| ~ spl10_5 ),
inference(duplicate_literal_removal,[],[f284]) ).
fof(f292,plain,
( $false
| spl10_2
| ~ spl10_5 ),
inference(forward_subsumption_resolution,[],[f291,f118]) ).
fof(f293,plain,
( spl10_2
| ~ spl10_5 ),
inference(avatar_contradiction_clause,[],[f292]) ).
fof(f305,plain,
( subset(sF8,sF9)
| ~ spl10_1 ),
inference(resolution,[],[f114,f63]) ).
fof(f307,plain,
( member(sK6,sF9)
| ~ spl10_1 ),
inference(resolution,[],[f305,f186]) ).
fof(f310,plain,
( $false
| ~ spl10_1
| spl10_4 ),
inference(forward_subsumption_resolution,[],[f307,f159]) ).
fof(f311,plain,
( ~ spl10_1
| spl10_4 ),
inference(avatar_contradiction_clause,[],[f310]) ).
fof(f313,plain,
( ~ member(sK7,sK4)
| member(sK7,sF8)
| ~ spl10_6 ),
inference(resolution,[],[f259,f127]) ).
fof(f323,plain,
( member(sK7,sF8)
| ~ spl10_6 ),
inference(forward_subsumption_resolution,[],[f313,f97]) ).
fof(f324,plain,
( $false
| spl10_3
| ~ spl10_6 ),
inference(forward_subsumption_resolution,[],[f323,f154]) ).
fof(f325,plain,
( spl10_3
| ~ spl10_6 ),
inference(avatar_contradiction_clause,[],[f324]) ).
fof(f328,plain,
( ! [X0] :
( ~ member(X0,sF9)
| member(X0,sF8) )
| ~ spl10_4 ),
inference(forward_subsumption_resolution,[],[f210,f158]) ).
fof(f332,plain,
( ! [X0] :
( ~ member(X0,sF8)
| member(X0,sF9) )
| ~ spl10_3 ),
inference(forward_subsumption_resolution,[],[f221,f155]) ).
fof(f336,plain,
( ! [X0] :
( member(sK0(sF9,X0),sF8)
| subset(sF9,X0) )
| ~ spl10_4 ),
inference(resolution,[],[f328,f60]) ).
fof(f340,plain,
( ! [X0] :
( member(sK0(sF8,X0),sF9)
| subset(sF8,X0) )
| ~ spl10_3 ),
inference(resolution,[],[f332,f60]) ).
fof(f355,plain,
( subset(sF8,sF9)
| subset(sF8,sF9)
| ~ spl10_3 ),
inference(resolution,[],[f340,f61]) ).
fof(f359,plain,
( subset(sF8,sF9)
| ~ spl10_3 ),
inference(duplicate_literal_removal,[],[f355]) ).
fof(f367,definition,
( spl10_9
<=> subset(sF9,sF8) ),
introduced(definition,[new_symbols(definition,[spl10_9])],[avatar_definition]) ).
fof(f368,plain,
( subset(sF9,sF8)
| ~ spl10_9 ),
inference(avatar_component_clause,[],[f367]) ).
fof(f369,plain,
( ~ subset(sF9,sF8)
| spl10_9 ),
inference(avatar_component_clause,[],[f367]) ).
fof(f371,plain,
( subset(sF9,sF8)
| subset(sF9,sF8)
| ~ spl10_4 ),
inference(resolution,[],[f336,f61]) ).
fof(f375,plain,
( subset(sF9,sF8)
| ~ spl10_4 ),
inference(duplicate_literal_removal,[],[f371]) ).
fof(f376,plain,
( $false
| ~ spl10_4
| spl10_9 ),
inference(forward_subsumption_resolution,[],[f375,f369]) ).
fof(f377,plain,
( ~ spl10_4
| spl10_9 ),
inference(avatar_contradiction_clause,[],[f376]) ).
fof(f381,plain,
( ~ subset(sF8,sF9)
| equal_set(sF8,sF9)
| ~ spl10_9 ),
inference(resolution,[],[f368,f64]) ).
fof(f382,plain,
( equal_set(sF8,sF9)
| ~ spl10_3
| ~ spl10_9 ),
inference(forward_subsumption_resolution,[],[f381,f359]) ).
fof(f383,plain,
( $false
| spl10_1
| ~ spl10_3
| ~ spl10_9 ),
inference(forward_subsumption_resolution,[],[f382,f113]) ).
fof(f384,plain,
( spl10_1
| ~ spl10_3
| ~ spl10_9 ),
inference(avatar_contradiction_clause,[],[f383]) ).
fof(f385,plain,
( ! [X0] :
( ~ member(X0,sF9)
| ~ member(X0,sF8) )
| ~ spl10_2 ),
inference(resolution,[],[f117,f88]) ).
fof(f386,plain,
( ! [X0] : ~ member(X0,sF9)
| ~ spl10_2
| ~ spl10_4 ),
inference(forward_subsumption_resolution,[],[f385,f328]) ).
fof(f390,plain,
( $false
| ~ spl10_2
| ~ spl10_4 ),
inference(resolution,[],[f386,f136]) ).
fof(f394,plain,
( ~ spl10_2
| ~ spl10_4 ),
inference(avatar_contradiction_clause,[],[f390]) ).
cnf(s1,plain,
( spl10_1
| ~ spl10_2 ),
inference(sat_conversion,[],[f119]) ).
cnf(s2,plain,
( ~ spl10_1
| spl10_2 ),
inference(sat_conversion,[],[f120]) ).
cnf(s4,plain,
( ~ spl10_3
| spl10_4 ),
inference(sat_conversion,[],[f169]) ).
cnf(s5,plain,
( spl10_5
| spl10_6 ),
inference(sat_conversion,[],[f260]) ).
cnf(s6,plain,
( spl10_2
| ~ spl10_5 ),
inference(sat_conversion,[],[f293]) ).
cnf(s8,plain,
( ~ spl10_1
| spl10_4 ),
inference(sat_conversion,[],[f311]) ).
cnf(s9,plain,
( spl10_3
| ~ spl10_6 ),
inference(sat_conversion,[],[f325]) ).
cnf(s11,plain,
( ~ spl10_4
| spl10_9 ),
inference(sat_conversion,[],[f377]) ).
cnf(s12,plain,
( spl10_1
| ~ spl10_3
| ~ spl10_9 ),
inference(sat_conversion,[],[f384]) ).
cnf(s13,plain,
( ~ spl10_2
| ~ spl10_4 ),
inference(sat_conversion,[],[f394]) ).
cnf(s15,plain,
( ~ spl10_3
| spl10_1 ),
inference(rat,[],[s11,s4,s12]) ).
cnf(s16,plain,
spl10_1,
inference(rat,[],[s15,s9,s5,s6,s1]) ).
cnf(s17,plain,
spl10_4,
inference(rat,[],[s8,s16]) ).
cnf(s18,plain,
spl10_2,
inference(rat,[],[s2,s16]) ).
cnf(s21,plain,
$false,
inference(rat,[],[s13,s17,s18]) ).
fof(f396,plain,
$false,
inference(avatar_sat_refutation,[],[s21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SET769+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.06/10.54 % Computer : n012.cluster.edu
% 0.06/10.54 % Model : x86_64 x86_64
% 0.06/10.54 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/10.54 % Memory : 8046.5625MB
% 0.06/10.54 % OS : Linux 6.8.0-71-generic
% 0.06/10.54 % CPULimit : 300
% 0.06/10.54 % WCLimit : 300
% 0.06/10.54 % DateTime : Mon Sep 28 02:45:19 UTC 2026
% 0.06/10.54 % CPUTime :
% 0.06/10.54 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.06/10.56 Running first-order theorem proving
% 0.06/10.56 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.60/11.37 % (2962612)Detected formulas, will run a generic FOF schedule.
% 3.60/11.37 % (2962622)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3340715865:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.60/11.37 % (2962619)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=1370926679:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.60/11.37 % (2962617)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=2843682345:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.60/11.37 % (2962618)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=20753657:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.60/11.37 % (2962620)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3324094458:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.60/11.37 % (2962620)Refutation not found, incomplete strategy
% 3.60/11.37 % (2962620)------------------------------
% 3.60/11.37 % (2962620)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.60/11.37 % (2962620)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.60/11.37 % (2962620)CaDiCaL version: 2.1.3
% 3.60/11.37 % (2962620)Termination reason: Refutation not found, incomplete strategy
% 3.60/11.37 % (2962620)Time elapsed: 0.001 s
% 3.60/11.37 % (2962620)Peak memory usage: 88 MB
% 3.60/11.37 % (2962620)Instructions burned: 1 (million)
% 3.60/11.37 % (2962623)dis-21_1_sil=8000:lcm=predicate:random_seed=4219455557: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.60/11.37 % (2962621)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3461463013:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.60/11.37 % (2962622)Instruction limit reached!
% 3.60/11.37 % (2962622)------------------------------
% 3.60/11.37 % (2962622)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.60/11.37 % (2962622)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.60/11.37 % (2962622)CaDiCaL version: 2.1.3
% 3.60/11.37 % (2962622)Termination reason: Instruction limit
% 3.60/11.37 % (2962622)Termination phase: Saturation
% 3.60/11.37 % (2962622)Time elapsed: 0.046 s
% 3.60/11.37 % (2962622)Peak memory usage: 89 MB
% 3.60/11.37 % (2962622)Instructions burned: 141 (million)
% 3.60/11.37 % (2962621)Instruction limit reached!
% 3.60/11.37 % (2962621)------------------------------
% 3.60/11.37 % (2962621)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.60/11.37 % (2962621)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.60/11.37 % (2962621)CaDiCaL version: 2.1.3
% 3.60/11.37 % (2962621)Termination reason: Instruction limit
% 3.60/11.37 % (2962621)Termination phase: Saturation
% 3.60/11.37 % (2962621)Time elapsed: 0.039 s
% 3.60/11.37 % (2962621)Peak memory usage: 88 MB
% 3.60/11.37 % (2962621)Instructions burned: 120 (million)
% 3.60/11.37 % (2962623)Instruction limit reached!
% 3.60/11.37 % (2962623)------------------------------
% 3.60/11.37 % (2962623)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.60/11.37 % (2962623)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.60/11.37 % (2962623)CaDiCaL version: 2.1.3
% 3.60/11.37 % (2962623)Termination reason: Instruction limit
% 3.60/11.37 % (2962623)Termination phase: Saturation
% 3.60/11.37 % (2962623)Time elapsed: 0.045 s
% 3.60/11.37 % (2962623)Peak memory usage: 89 MB
% 3.60/11.37 % (2962623)Instructions burned: 130 (million)
% 3.60/11.37 % (2962632)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3934246393:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/157Mi)
% 3.60/11.37 % (2962631)lrs+10_1_sil=8000:sp=occurrence:random_seed=3805770681:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 3.60/11.37 % (2962633)lrs+1011_1_sil=32000:sp=occurrence:random_seed=3360184235:i=325:sd=1:ss=axioms:sgt=32_2998 on theBenchmark for (2998ds/325Mi)
% 3.60/11.37 % (2962620)------------------------------
% 3.60/11.37 % (2962620)------------------------------
% 3.60/11.37 % (2962632)Instruction limit reached!
% 3.60/11.37 % (2962632)------------------------------
% 3.60/11.37 % (2962632)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.60/11.37 % (2962632)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.60/11.37 % (2962632)CaDiCaL version: 2.1.3
% 3.60/11.37 % (2962632)Termination reason: Instruction limit
% 3.60/11.37 % (2962632)Termination phase: Saturation
% 3.60/11.37 % (2962632)Time elapsed: 0.042 s
% 3.60/11.37 % (2962632)Peak memory usage: 89 MB
% 3.60/11.37 % (2962632)Instructions burned: 158 (million)
% 3.60/11.37 % (2962631)Instruction limit reached!
% 3.60/11.37 % (2962631)------------------------------
% 3.60/11.37 % (2962631)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.60/11.37 % (2962631)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.60/11.37 % (2962631)CaDiCaL version: 2.1.3
% 3.60/11.37 % (2962631)Termination reason: Instruction limit
% 3.60/11.37 % (2962631)Termination phase: Saturation
% 3.60/11.37 % (2962631)Time elapsed: 0.098 s
% 3.60/11.37 % (2962631)Peak memory usage: 92 MB
% 3.60/11.37 % (2962631)Instructions burned: 286 (million)
% 3.60/11.37 % (2962633)Instruction limit reached!
% 3.60/11.37 % (2962633)------------------------------
% 3.60/11.37 % (2962633)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.60/11.37 % (2962633)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.60/11.37 % (2962633)CaDiCaL version: 2.1.3
% 3.60/11.37 % (2962633)Termination reason: Instruction limit
% 3.60/11.37 % (2962633)Termination phase: Saturation
% 3.60/11.37 % (2962633)Time elapsed: 0.103 s
% 3.60/11.37 % (2962633)Peak memory usage: 90 MB
% 3.60/11.37 % (2962633)Instructions burned: 326 (million)
% 3.60/11.37 % (2962637)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=2845211331:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 3.60/11.37 % (2962638)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=2723930075:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2997 on theBenchmark for (2997ds/294Mi)
% 3.60/11.37 % (2962638)Refutation not found, incomplete strategy
% 3.60/11.37 % (2962638)------------------------------
% 3.60/11.37 % (2962638)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.60/11.37 % (2962638)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.60/11.37 % (2962638)CaDiCaL version: 2.1.3
% 3.60/11.37 % (2962638)Termination reason: Refutation not found, incomplete strategy
% 3.60/11.37 % (2962638)Time elapsed: 0.001 s
% 3.60/11.37 % (2962638)Peak memory usage: 88 MB
% 3.60/11.37 % (2962638)Instructions burned: 1 (million)
% 3.60/11.37 % (2962637)Instruction limit reached!
% 3.60/11.37 % (2962637)------------------------------
% 3.60/11.37 % (2962637)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.60/11.37 % (2962637)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.60/11.37 % (2962637)CaDiCaL version: 2.1.3
% 3.60/11.37 % (2962637)Termination reason: Instruction limit
% 3.60/11.37 % (2962637)Termination phase: Saturation
% 3.60/11.37 % (2962637)Time elapsed: 0.077 s
% 3.60/11.37 % (2962637)Peak memory usage: 91 MB
% 3.60/11.37 % (2962637)Instructions burned: 248 (million)
% 3.60/11.37 % (2962641)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=1985981745:cts=off:i=113:fsr=off:ss=included:sgt=4_2996 on theBenchmark for (2996ds/113Mi)
% 3.60/11.37 % (2962639)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=3260108874:i=2350_2996 on theBenchmark for (2996ds/2350Mi)
% 3.60/11.37 % (2962617)First to succeed.
% 3.60/11.37 % (2962617)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2962612"
% 3.60/11.37 % (2962641)Instruction limit reached!
% 3.60/11.37 % (2962641)------------------------------
% 3.60/11.37 % (2962641)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.60/11.37 % (2962641)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.60/11.37 % (2962641)CaDiCaL version: 2.1.3
% 3.60/11.37 % (2962641)Termination reason: Instruction limit
% 3.60/11.37 % (2962641)Termination phase: Saturation
% 3.60/11.37 % (2962641)Time elapsed: 0.043 s
% 3.60/11.37 % (2962641)Peak memory usage: 89 MB
% 3.60/11.37 % (2962641)Instructions burned: 116 (million)
% 3.60/11.37 % (2962643)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=2081640934:i=127:av=off:fsr=off:sup=off_2995 on theBenchmark for (2995ds/127Mi)
% 3.60/11.37 % (2962638)------------------------------
% 3.60/11.37 % (2962638)------------------------------
% 3.60/11.37 % (2962643)Instruction limit reached!
% 3.60/11.37 % (2962643)------------------------------
% 3.60/11.37 % (2962643)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.60/11.37 % (2962643)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.60/11.37 % (2962643)CaDiCaL version: 2.1.3
% 3.60/11.37 % (2962643)Termination reason: Instruction limit
% 3.60/11.37 % (2962643)Termination phase: Saturation
% 3.60/11.37 % (2962643)Time elapsed: 0.037 s
% 3.60/11.37 % (2962643)Peak memory usage: 89 MB
% 3.60/11.37 % (2962643)Instructions burned: 127 (million)
% 3.60/11.37 % (2962646)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=1175326861:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2995 on theBenchmark for (2995ds/114Mi)
% 3.60/11.37 % (2962646)Instruction limit reached!
% 3.60/11.37 % (2962646)------------------------------
% 3.60/11.37 % (2962646)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.60/11.37 % (2962646)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.60/11.37 % (2962646)CaDiCaL version: 2.1.3
% 3.60/11.37 % (2962646)Termination reason: Instruction limit
% 3.60/11.37 % (2962646)Termination phase: Saturation
% 3.60/11.37 % (2962646)Time elapsed: 0.039 s
% 3.60/11.37 % (2962646)Peak memory usage: 89 MB
% 3.60/11.37 % (2962646)Instructions burned: 114 (million)
% 3.60/11.37 % (2962617)Refutation found. Thanks to Tanya!
% 3.60/11.37 % SZS status Theorem for theBenchmark
% 3.60/11.37 % SZS output start Proof for theBenchmark
% See solution above
% 4.54/11.47 % (2962617)------------------------------
% 4.54/11.47 % (2962617)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.54/11.47 % (2962617)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.54/11.47 % (2962617)CaDiCaL version: 2.1.3
% 4.54/11.47 % (2962617)Termination reason: Refutation
% 4.54/11.47 % (2962617)Time elapsed: 0.357 s
% 4.54/11.47 % (2962617)Peak memory usage: 128 MB
% 4.54/11.47 % (2962617)Instructions burned: 963 (million)
% 4.54/11.47 % (2962617)------------------------------
% 4.54/11.47 % (2962617)------------------------------
% 4.54/11.47 % (2962612)Success in time 0.617 s
% 4.54/11.47 % Vampire exiting
%------------------------------------------------------------------------------