%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET690+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 : n011.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:40 PM UTC 2026
% Result : Theorem 2.76s 1.26s
% Output : Refutation 3.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 15
% Syntax : Number of formulae : 117 ( 6 unt; 10 def)
% Number of atoms : 304 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 302 ( 115 ~; 146 |; 22 &)
% ( 17 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 14 ( 13 usr; 11 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 85 ( 0 sgn 77 !; 8 ?)
% 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(intersection(X0,X1),X2),intersection(X0,union(X1,X2)))
<=> subset(X2,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI12) ).
fof(f13,negated_conjecture,
~ ! [X0,X1,X2] :
( equal_set(union(intersection(X0,X1),X2),intersection(X0,union(X1,X2)))
<=> subset(X2,X0) ),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f14,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f16,plain,
? [X0,X1,X2] :
( equal_set(union(intersection(X0,X1),X2),intersection(X0,union(X1,X2)))
<~> subset(X2,X0) ),
inference(ennf_transformation,[],[f13]) ).
fof(f17,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,[],[f14]) ).
fof(f18,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,[],[f17]) ).
fof(f19,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))],[f18]) ).
fof(f20,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(f21,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,[],[f20]) ).
fof(f23,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(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(flattening,[],[f23]) ).
fof(f25,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(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(flattening,[],[f25]) ).
fof(f38,plain,
? [X0,X1,X2] :
( ( ~ subset(X2,X0)
| ~ equal_set(union(intersection(X0,X1),X2),intersection(X0,union(X1,X2))) )
& ( subset(X2,X0)
| equal_set(union(intersection(X0,X1),X2),intersection(X0,union(X1,X2))) ) ),
inference(nnf_transformation,[],[f16]) ).
fof(f39,plain,
( ( ~ subset(sK5,sK3)
| ~ equal_set(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))) )
& ( subset(sK5,sK3)
| equal_set(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK5]),skolemize(X0,sK3),skolemize(X1,sK4),skolemize(X2,sK5)],[f38]) ).
fof(f40,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ member(X3,X0)
| member(X3,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f41,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f42,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f44,plain,
! [X0,X1] :
( ~ equal_set(X0,X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f45,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f48,plain,
! [X2,X0,X1] :
( ~ member(X0,intersection(X1,X2))
| member(X0,X2) ),
inference(cnf_transformation,[],[f24]) ).
fof(f49,plain,
! [X2,X0,X1] :
( ~ member(X0,intersection(X1,X2))
| member(X0,X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f50,plain,
! [X2,X0,X1] :
( member(X0,intersection(X1,X2))
| ~ member(X0,X1)
| ~ member(X0,X2) ),
inference(cnf_transformation,[],[f24]) ).
fof(f51,plain,
! [X2,X0,X1] :
( ~ member(X0,union(X1,X2))
| member(X0,X2)
| member(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f52,plain,
! [X2,X0,X1] :
( member(X0,union(X1,X2))
| ~ member(X0,X2) ),
inference(cnf_transformation,[],[f26]) ).
fof(f53,plain,
! [X2,X0,X1] :
( member(X0,union(X1,X2))
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f69,plain,
( subset(sK5,sK3)
| equal_set(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))) ),
inference(cnf_transformation,[],[f39]) ).
fof(f70,plain,
( ~ subset(sK5,sK3)
| ~ equal_set(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))) ),
inference(cnf_transformation,[],[f39]) ).
fof(f75,definition,
( spl6_1
<=> equal_set(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))) ),
introduced(definition,[new_symbols(definition,[spl6_1])],[avatar_definition]) ).
fof(f76,plain,
( ~ equal_set(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5)))
| spl6_1 ),
inference(avatar_component_clause,[],[f75]) ).
fof(f77,plain,
( equal_set(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5)))
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f75]) ).
fof(f79,definition,
( spl6_2
<=> subset(sK5,sK3) ),
introduced(definition,[new_symbols(definition,[spl6_2])],[avatar_definition]) ).
fof(f80,plain,
( ~ subset(sK5,sK3)
| spl6_2 ),
inference(avatar_component_clause,[],[f79]) ).
fof(f81,plain,
( subset(sK5,sK3)
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f79]) ).
fof(f82,plain,
( spl6_1
| spl6_2 ),
inference(avatar_split_clause,[],[f69,f79,f75]) ).
fof(f83,plain,
( ~ spl6_1
| ~ spl6_2 ),
inference(avatar_split_clause,[],[f70,f79,f75]) ).
fof(f86,plain,
( ! [X0] :
( member(X0,sK3)
| ~ member(X0,sK5) )
| ~ spl6_2 ),
inference(resolution,[],[f40,f81]) ).
fof(f89,plain,
( ~ subset(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5)))
| ~ subset(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5))
| spl6_1 ),
inference(resolution,[],[f45,f76]) ).
fof(f93,definition,
( spl6_3
<=> subset(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)) ),
introduced(definition,[new_symbols(definition,[spl6_3])],[avatar_definition]) ).
fof(f95,plain,
( ~ subset(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5))
| spl6_3 ),
inference(avatar_component_clause,[],[f93]) ).
fof(f97,definition,
( spl6_4
<=> subset(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))) ),
introduced(definition,[new_symbols(definition,[spl6_4])],[avatar_definition]) ).
fof(f98,plain,
( subset(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5)))
| ~ spl6_4 ),
inference(avatar_component_clause,[],[f97]) ).
fof(f99,plain,
( ~ subset(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5)))
| spl6_4 ),
inference(avatar_component_clause,[],[f97]) ).
fof(f100,plain,
( ~ spl6_3
| ~ spl6_4
| spl6_1 ),
inference(avatar_split_clause,[],[f89,f75,f97,f93]) ).
fof(f101,plain,
( ~ member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)),union(intersection(sK3,sK4),sK5))
| spl6_3 ),
inference(resolution,[],[f95,f42]) ).
fof(f102,plain,
( member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)),intersection(sK3,union(sK4,sK5)))
| spl6_3 ),
inference(resolution,[],[f95,f41]) ).
fof(f105,plain,
( ~ member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)),intersection(sK3,sK4))
| spl6_3 ),
inference(resolution,[],[f101,f53]) ).
fof(f106,plain,
( ~ member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)),sK5)
| spl6_3 ),
inference(resolution,[],[f101,f52]) ).
fof(f109,plain,
( ~ member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)),sK3)
| ~ member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)),sK4)
| spl6_3 ),
inference(resolution,[],[f105,f50]) ).
fof(f111,definition,
( spl6_5
<=> member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)),sK4) ),
introduced(definition,[new_symbols(definition,[spl6_5])],[avatar_definition]) ).
fof(f113,plain,
( ~ member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)),sK4)
| spl6_5 ),
inference(avatar_component_clause,[],[f111]) ).
fof(f115,definition,
( spl6_6
<=> member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)),sK3) ),
introduced(definition,[new_symbols(definition,[spl6_6])],[avatar_definition]) ).
fof(f118,plain,
( ~ spl6_5
| ~ spl6_6
| spl6_3 ),
inference(avatar_split_clause,[],[f109,f93,f115,f111]) ).
fof(f119,plain,
( member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)),sK3)
| spl6_3 ),
inference(resolution,[],[f102,f49]) ).
fof(f120,plain,
( member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)),union(sK4,sK5))
| spl6_3 ),
inference(resolution,[],[f102,f48]) ).
fof(f121,plain,
( spl6_6
| spl6_3 ),
inference(avatar_split_clause,[],[f119,f93,f115]) ).
fof(f122,plain,
( member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)),sK5)
| member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)),sK4)
| spl6_3 ),
inference(resolution,[],[f120,f51]) ).
fof(f123,plain,
( member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)),sK4)
| spl6_3 ),
inference(forward_subsumption_resolution,[],[f122,f106]) ).
fof(f124,plain,
( $false
| spl6_3
| spl6_5 ),
inference(forward_subsumption_resolution,[],[f123,f113]) ).
fof(f125,plain,
( spl6_3
| spl6_5 ),
inference(avatar_contradiction_clause,[],[f124]) ).
fof(f127,plain,
( ~ member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),intersection(sK3,union(sK4,sK5)))
| spl6_4 ),
inference(resolution,[],[f99,f42]) ).
fof(f128,plain,
( member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),union(intersection(sK3,sK4),sK5))
| spl6_4 ),
inference(resolution,[],[f99,f41]) ).
fof(f133,plain,
( ~ member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),sK3)
| ~ member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),union(sK4,sK5))
| spl6_4 ),
inference(resolution,[],[f127,f50]) ).
fof(f135,definition,
( spl6_7
<=> member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),union(sK4,sK5)) ),
introduced(definition,[new_symbols(definition,[spl6_7])],[avatar_definition]) ).
fof(f137,plain,
( ~ member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),union(sK4,sK5))
| spl6_7 ),
inference(avatar_component_clause,[],[f135]) ).
fof(f139,definition,
( spl6_8
<=> member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),sK3) ),
introduced(definition,[new_symbols(definition,[spl6_8])],[avatar_definition]) ).
fof(f141,plain,
( ~ member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),sK3)
| spl6_8 ),
inference(avatar_component_clause,[],[f139]) ).
fof(f142,plain,
( ~ spl6_7
| ~ spl6_8
| spl6_4 ),
inference(avatar_split_clause,[],[f133,f97,f139,f135]) ).
fof(f145,plain,
( ~ member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),sK4)
| spl6_7 ),
inference(resolution,[],[f137,f53]) ).
fof(f146,plain,
( ~ member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),sK5)
| spl6_7 ),
inference(resolution,[],[f137,f52]) ).
fof(f177,plain,
( member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),sK5)
| member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),intersection(sK3,sK4))
| spl6_4 ),
inference(resolution,[],[f128,f51]) ).
fof(f178,plain,
( member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),intersection(sK3,sK4))
| spl6_4
| spl6_7 ),
inference(forward_subsumption_resolution,[],[f177,f146]) ).
fof(f180,plain,
( member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),sK4)
| spl6_4
| spl6_7 ),
inference(resolution,[],[f178,f48]) ).
fof(f181,plain,
( $false
| spl6_4
| spl6_7 ),
inference(forward_subsumption_resolution,[],[f180,f145]) ).
fof(f182,plain,
( spl6_4
| spl6_7 ),
inference(avatar_contradiction_clause,[],[f181]) ).
fof(f185,definition,
( spl6_9
<=> member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),intersection(sK3,sK4)) ),
introduced(definition,[new_symbols(definition,[spl6_9])],[avatar_definition]) ).
fof(f187,plain,
( member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),intersection(sK3,sK4))
| ~ spl6_9 ),
inference(avatar_component_clause,[],[f185]) ).
fof(f189,definition,
( spl6_10
<=> member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),sK5) ),
introduced(definition,[new_symbols(definition,[spl6_10])],[avatar_definition]) ).
fof(f192,plain,
( spl6_9
| spl6_10
| spl6_4 ),
inference(avatar_split_clause,[],[f177,f97,f189,f185]) ).
fof(f204,plain,
( ~ member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),sK5)
| ~ spl6_2
| spl6_8 ),
inference(resolution,[],[f141,f86]) ).
fof(f205,plain,
( ~ spl6_10
| ~ spl6_2
| spl6_8 ),
inference(avatar_split_clause,[],[f204,f139,f79,f189]) ).
fof(f208,plain,
( subset(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5)))
| ~ spl6_1 ),
inference(resolution,[],[f77,f44]) ).
fof(f235,plain,
( member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),sK3)
| ~ spl6_9 ),
inference(resolution,[],[f187,f49]) ).
fof(f237,plain,
( $false
| spl6_8
| ~ spl6_9 ),
inference(forward_subsumption_resolution,[],[f235,f141]) ).
fof(f238,plain,
( spl6_8
| ~ spl6_9 ),
inference(avatar_contradiction_clause,[],[f237]) ).
fof(f239,plain,
( spl6_4
| ~ spl6_1 ),
inference(avatar_split_clause,[],[f208,f75,f97]) ).
fof(f245,plain,
( ~ member(sK0(sK5,sK3),sK3)
| spl6_2 ),
inference(resolution,[],[f80,f42]) ).
fof(f246,plain,
( member(sK0(sK5,sK3),sK5)
| spl6_2 ),
inference(resolution,[],[f80,f41]) ).
fof(f249,plain,
( ! [X0] :
( member(X0,intersection(sK3,union(sK4,sK5)))
| ~ member(X0,union(intersection(sK3,sK4),sK5)) )
| ~ spl6_4 ),
inference(resolution,[],[f98,f40]) ).
fof(f250,plain,
( ! [X0] :
( member(X0,sK3)
| ~ member(X0,union(intersection(sK3,sK4),sK5)) )
| ~ spl6_4 ),
inference(resolution,[],[f249,f49]) ).
fof(f256,plain,
( ~ member(sK0(sK5,sK3),union(intersection(sK3,sK4),sK5))
| spl6_2
| ~ spl6_4 ),
inference(resolution,[],[f250,f245]) ).
fof(f261,plain,
( ~ member(sK0(sK5,sK3),sK5)
| spl6_2
| ~ spl6_4 ),
inference(resolution,[],[f256,f52]) ).
fof(f262,plain,
( $false
| spl6_2
| ~ spl6_4 ),
inference(forward_subsumption_resolution,[],[f261,f246]) ).
fof(f263,plain,
( spl6_2
| ~ spl6_4 ),
inference(avatar_contradiction_clause,[],[f262]) ).
cnf(s1,plain,
( spl6_1
| spl6_2 ),
inference(sat_conversion,[],[f82]) ).
cnf(s2,plain,
( ~ spl6_1
| ~ spl6_2 ),
inference(sat_conversion,[],[f83]) ).
cnf(s3,plain,
( spl6_1
| ~ spl6_3
| ~ spl6_4 ),
inference(sat_conversion,[],[f100]) ).
cnf(s4,plain,
( spl6_3
| ~ spl6_5
| ~ spl6_6 ),
inference(sat_conversion,[],[f118]) ).
cnf(s5,plain,
( spl6_3
| spl6_6 ),
inference(sat_conversion,[],[f121]) ).
cnf(s6,plain,
( spl6_3
| spl6_5 ),
inference(sat_conversion,[],[f125]) ).
cnf(s7,plain,
( spl6_4
| ~ spl6_7
| ~ spl6_8 ),
inference(sat_conversion,[],[f142]) ).
cnf(s8,plain,
( spl6_4
| spl6_7 ),
inference(sat_conversion,[],[f182]) ).
cnf(s10,plain,
( spl6_4
| spl6_9
| spl6_10 ),
inference(sat_conversion,[],[f192]) ).
cnf(s11,plain,
( ~ spl6_2
| spl6_8
| ~ spl6_10 ),
inference(sat_conversion,[],[f205]) ).
cnf(s15,plain,
( spl6_8
| ~ spl6_9 ),
inference(sat_conversion,[],[f238]) ).
cnf(s16,plain,
( ~ spl6_1
| spl6_4 ),
inference(sat_conversion,[],[f239]) ).
cnf(s19,plain,
( spl6_2
| ~ spl6_4 ),
inference(sat_conversion,[],[f263]) ).
cnf(s20,plain,
spl6_3,
inference(rat,[],[s4,s5,s6]) ).
cnf(s21,plain,
spl6_1,
inference(rat,[],[s10,s11,s15,s7,s8,s3,s1,s20]) ).
cnf(s22,plain,
spl6_4,
inference(rat,[],[s16,s21]) ).
cnf(s23,plain,
~ spl6_2,
inference(rat,[],[s2,s21]) ).
cnf(s24,plain,
$false,
inference(rat,[],[s19,s22,s23]) ).
fof(f264,plain,
$false,
inference(avatar_sat_refutation,[],[s24]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET690+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 : n011.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 02:34:00 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.40 Running first-order theorem proving
% 0.10/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.76/1.26 % (2965531)Detected formulas, will run a generic FOF schedule.
% 2.76/1.26 % (2965539)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1438327032:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.76/1.26 % (2965539)Refutation not found, incomplete strategy
% 2.76/1.26 % (2965539)------------------------------
% 2.76/1.26 % (2965539)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.76/1.26 % (2965539)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.76/1.26 % (2965539)CaDiCaL version: 2.1.3
% 2.76/1.26 % (2965539)Termination reason: Refutation not found, incomplete strategy
% 2.76/1.26 % (2965539)Time elapsed: 0.001 s
% 2.76/1.26 % (2965539)Peak memory usage: 88 MB
% 2.76/1.26 % (2965539)Instructions burned: 1 (million)
% 2.76/1.26 % (2965536)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=142914332:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.76/1.26 % (2965537)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=3476606670:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.76/1.26 % (2965542)dis-21_1_sil=8000:lcm=predicate:random_seed=293172725: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.76/1.26 % (2965538)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=3524354165:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.76/1.26 % (2965540)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2589063355:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.76/1.26 % (2965541)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4071568059:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.76/1.26 % (2965541)First to succeed.
% 2.76/1.26 % (2965541)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2965531"
% 2.76/1.26 % (2965542)Also succeeded, but the first one will report.
% 2.76/1.26 % (2965540)Instruction limit reached!
% 2.76/1.26 % (2965540)------------------------------
% 2.76/1.26 % (2965540)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.76/1.26 % (2965540)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.76/1.26 % (2965540)CaDiCaL version: 2.1.3
% 2.76/1.26 % (2965540)Termination reason: Instruction limit
% 2.76/1.26 % (2965540)Termination phase: Saturation
% 2.76/1.26 % (2965540)Time elapsed: 0.070 s
% 2.76/1.26 % (2965540)Peak memory usage: 89 MB
% 2.76/1.26 % (2965540)Instructions burned: 120 (million)
% 2.76/1.26 % (2965539)------------------------------
% 2.76/1.26 % (2965539)------------------------------
% 2.76/1.26 % (2965550)lrs+10_1_sil=8000:sp=occurrence:random_seed=456878463:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.76/1.26 % (2965551)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1705678688:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.76/1.26 % (2965541)Refutation found. Thanks to Tanya!
% 2.76/1.26 % SZS status Theorem for theBenchmark
% 2.76/1.26 % SZS output start Proof for theBenchmark
% See solution above
% 3.57/1.45 % (2965541)------------------------------
% 3.57/1.45 % (2965541)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.57/1.45 % (2965541)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.57/1.45 % (2965541)CaDiCaL version: 2.1.3
% 3.57/1.45 % (2965541)Termination reason: Refutation
% 3.57/1.45 % (2965541)Time elapsed: 0.010 s
% 3.57/1.45 % (2965541)Peak memory usage: 90 MB
% 3.57/1.45 % (2965541)Instructions burned: 13 (million)
% 3.57/1.45 % (2965541)------------------------------
% 3.57/1.45 % (2965541)------------------------------
% 3.57/1.45 % (2965531)Success in time 0.419 s
% 3.57/1.45 % Vampire exiting
%------------------------------------------------------------------------------