%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU141+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 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:52:04 PM UTC 2026
% Result : Theorem 2.50s 1.02s
% Output : Refutation 2.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 13
% Syntax : Number of formulae : 112 ( 14 unt; 4 def)
% Number of atoms : 377 ( 61 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 443 ( 178 ~; 186 |; 64 &)
% ( 13 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 4 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-3 aty)
% Number of variables : 177 ( 0 sgn 162 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(f3,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d10_xboole_0) ).
fof(f4,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f5,axiom,
! [X0,X1,X2] :
( X2 = set_intersection2(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
& in(X3,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f6,axiom,
! [X0,X1,X2] :
( X2 = set_difference(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
& ~ in(X3,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_xboole_0) ).
fof(f7,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> set_intersection2(X0,X1) = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(f17,axiom,
! [X0] : set_intersection2(X0,empty_set) = empty_set,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_boole) ).
fof(f20,axiom,
! [X0,X1] :
( ~ ( ~ disjoint(X0,X1)
& ! [X2] : ~ in(X2,set_intersection2(X0,X1)) )
& ~ ( ? [X2] : in(X2,set_intersection2(X0,X1))
& disjoint(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_xboole_0) ).
fof(f23,conjecture,
! [X0,X1] :
( disjoint(X0,X1)
<=> set_difference(X0,X1) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t83_xboole_1) ).
fof(f24,negated_conjecture,
~ ! [X0,X1] :
( disjoint(X0,X1)
<=> set_difference(X0,X1) = X0 ),
inference(negated_conjecture,[status(cth)],[f23]) ).
fof(f28,plain,
! [X0,X1] :
( ~ ( ~ disjoint(X0,X1)
& ! [X2] : ~ in(X2,set_intersection2(X0,X1)) )
& ~ ( ? [X3] : in(X3,set_intersection2(X0,X1))
& disjoint(X0,X1) ) ),
inference(rectify,[],[f20]) ).
fof(f30,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f32,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| ? [X2] : in(X2,set_intersection2(X0,X1)) )
& ( ! [X3] : ~ in(X3,set_intersection2(X0,X1))
| ~ disjoint(X0,X1) ) ),
inference(ennf_transformation,[],[f28]) ).
fof(f35,plain,
? [X0,X1] :
( disjoint(X0,X1)
<~> set_difference(X0,X1) = X0 ),
inference(ennf_transformation,[],[f24]) ).
fof(f37,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f38,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(flattening,[],[f37]) ).
fof(f39,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f30]) ).
fof(f40,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f39]) ).
fof(f41,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK0(X0,X1),X1)
& in(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f40]) ).
fof(f42,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X0)
| ~ in(X3,X1) )
& ( ( in(X3,X0)
& in(X3,X1) )
| ~ in(X3,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f43,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X0)
| ~ in(X3,X1) )
& ( ( in(X3,X0)
& in(X3,X1) )
| ~ in(X3,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(flattening,[],[f42]) ).
fof(f44,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X0)
| ~ in(X4,X1) )
& ( ( in(X4,X0)
& in(X4,X1) )
| ~ in(X4,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(rectify,[],[f43]) ).
fof(f45,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ( ( ~ in(sK1(X0,X1,X2),X0)
| ~ in(sK1(X0,X1,X2),X1)
| ~ in(sK1(X0,X1,X2),X2) )
& ( ( in(sK1(X0,X1,X2),X0)
& in(sK1(X0,X1,X2),X1) )
| in(sK1(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X0)
| ~ in(X4,X1) )
& ( ( in(X4,X0)
& in(X4,X1) )
| ~ in(X4,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X3,sK1(X0,X1,X2))],[f44]) ).
fof(f46,plain,
! [X0,X1,X2] :
( ( X2 = set_difference(X0,X1)
| ? [X3] :
( ( ~ in(X3,X0)
| in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& ~ in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X0)
| in(X3,X1) )
& ( ( in(X3,X0)
& ~ in(X3,X1) )
| ~ in(X3,X2) ) )
| set_difference(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f47,plain,
! [X0,X1,X2] :
( ( X2 = set_difference(X0,X1)
| ? [X3] :
( ( ~ in(X3,X0)
| in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& ~ in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X0)
| in(X3,X1) )
& ( ( in(X3,X0)
& ~ in(X3,X1) )
| ~ in(X3,X2) ) )
| set_difference(X0,X1) != X2 ) ),
inference(flattening,[],[f46]) ).
fof(f48,plain,
! [X0,X1,X2] :
( ( X2 = set_difference(X0,X1)
| ? [X3] :
( ( ~ in(X3,X0)
| in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& ~ in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X0)
| in(X4,X1) )
& ( ( in(X4,X0)
& ~ in(X4,X1) )
| ~ in(X4,X2) ) )
| set_difference(X0,X1) != X2 ) ),
inference(rectify,[],[f47]) ).
fof(f49,plain,
! [X0,X1,X2] :
( ( X2 = set_difference(X0,X1)
| ( ( ~ in(sK2(X0,X1,X2),X0)
| in(sK2(X0,X1,X2),X1)
| ~ in(sK2(X0,X1,X2),X2) )
& ( ( in(sK2(X0,X1,X2),X0)
& ~ in(sK2(X0,X1,X2),X1) )
| in(sK2(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X0)
| in(X4,X1) )
& ( ( in(X4,X0)
& ~ in(X4,X1) )
| ~ in(X4,X2) ) )
| set_difference(X0,X1) != X2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X3,sK2(X0,X1,X2))],[f48]) ).
fof(f50,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| set_intersection2(X0,X1) != empty_set )
& ( set_intersection2(X0,X1) = empty_set
| ~ disjoint(X0,X1) ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f53,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| in(sK5(X0,X1),set_intersection2(X0,X1)) )
& ( ! [X3] : ~ in(X3,set_intersection2(X0,X1))
| ~ disjoint(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(X2,sK5(X0,X1))],[f32]) ).
fof(f54,plain,
? [X0,X1] :
( ( set_difference(X0,X1) != X0
| ~ disjoint(X0,X1) )
& ( set_difference(X0,X1) = X0
| disjoint(X0,X1) ) ),
inference(nnf_transformation,[],[f35]) ).
fof(f55,plain,
( ( sK6 != set_difference(sK6,sK7)
| ~ disjoint(sK6,sK7) )
& ( sK6 = set_difference(sK6,sK7)
| disjoint(sK6,sK7) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7]),skolemize(X0,sK6),skolemize(X1,sK7)],[f54]) ).
fof(f57,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f60,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f38]) ).
fof(f62,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f41]) ).
fof(f63,plain,
! [X0,X1] :
( ~ in(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f41]) ).
fof(f64,plain,
! [X2,X0,X1,X4] :
( in(X4,X1)
| ~ in(X4,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f45]) ).
fof(f65,plain,
! [X2,X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f45]) ).
fof(f66,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X0)
| ~ in(X4,X1)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f45]) ).
fof(f70,plain,
! [X2,X0,X1,X4] :
( ~ in(X4,X1)
| ~ in(X4,X2)
| set_difference(X0,X1) != X2 ),
inference(cnf_transformation,[],[f49]) ).
fof(f71,plain,
! [X2,X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,X2)
| set_difference(X0,X1) != X2 ),
inference(cnf_transformation,[],[f49]) ).
fof(f72,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X0)
| in(X4,X1)
| set_difference(X0,X1) != X2 ),
inference(cnf_transformation,[],[f49]) ).
fof(f76,plain,
! [X0,X1] :
( ~ disjoint(X0,X1)
| set_intersection2(X0,X1) = empty_set ),
inference(cnf_transformation,[],[f50]) ).
fof(f77,plain,
! [X0,X1] :
( set_intersection2(X0,X1) != empty_set
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f50]) ).
fof(f84,plain,
! [X0] : empty_set = set_intersection2(X0,empty_set),
inference(cnf_transformation,[],[f17]) ).
fof(f87,plain,
! [X3,X0,X1] :
( ~ in(X3,set_intersection2(X0,X1))
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[],[f53]) ).
fof(f88,plain,
! [X0,X1] :
( disjoint(X0,X1)
| in(sK5(X0,X1),set_intersection2(X0,X1)) ),
inference(cnf_transformation,[],[f53]) ).
fof(f91,plain,
( sK6 = set_difference(sK6,sK7)
| disjoint(sK6,sK7) ),
inference(cnf_transformation,[],[f55]) ).
fof(f92,plain,
( sK6 != set_difference(sK6,sK7)
| ~ disjoint(sK6,sK7) ),
inference(cnf_transformation,[],[f55]) ).
fof(f96,plain,
! [X0,X1,X4] :
( in(X4,set_intersection2(X0,X1))
| ~ in(X4,X0)
| ~ in(X4,X1) ),
inference(equality_resolution,[],[f66]) ).
fof(f97,plain,
! [X0,X1,X4] :
( ~ in(X4,set_intersection2(X0,X1))
| in(X4,X0) ),
inference(equality_resolution,[],[f65]) ).
fof(f98,plain,
! [X0,X1,X4] :
( ~ in(X4,set_intersection2(X0,X1))
| in(X4,X1) ),
inference(equality_resolution,[],[f64]) ).
fof(f99,plain,
! [X0,X1,X4] :
( in(X4,set_difference(X0,X1))
| ~ in(X4,X0)
| in(X4,X1) ),
inference(equality_resolution,[],[f72]) ).
fof(f100,plain,
! [X0,X1,X4] :
( ~ in(X4,set_difference(X0,X1))
| in(X4,X0) ),
inference(equality_resolution,[],[f71]) ).
fof(f101,plain,
! [X0,X1,X4] :
( ~ in(X4,set_difference(X0,X1))
| ~ in(X4,X1) ),
inference(equality_resolution,[],[f70]) ).
fof(f102,definition,
sF8 = set_difference(sK6,sK7),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
fof(f103,plain,
set_difference(sK6,sK7) = sF8,
inference(reorient_equations,[],[f102]) ).
fof(f104,plain,
( sK6 != sF8
| ~ disjoint(sK6,sK7) ),
inference(definition_folding,[],[f92,f103]) ).
fof(f105,plain,
( sK6 = sF8
| disjoint(sK6,sK7) ),
inference(definition_folding,[],[f91,f103]) ).
fof(f107,definition,
( spl9_1
<=> disjoint(sK6,sK7) ),
introduced(definition,[new_symbols(definition,[spl9_1])],[avatar_definition]) ).
fof(f108,plain,
( ~ disjoint(sK6,sK7)
| spl9_1 ),
inference(avatar_component_clause,[],[f107]) ).
fof(f109,plain,
( disjoint(sK6,sK7)
| ~ spl9_1 ),
inference(avatar_component_clause,[],[f107]) ).
fof(f111,definition,
( spl9_2
<=> sK6 = sF8 ),
introduced(definition,[new_symbols(definition,[spl9_2])],[avatar_definition]) ).
fof(f112,plain,
( sK6 != sF8
| spl9_2 ),
inference(avatar_component_clause,[],[f111]) ).
fof(f113,plain,
( sK6 = sF8
| ~ spl9_2 ),
inference(avatar_component_clause,[],[f111]) ).
fof(f114,plain,
( spl9_1
| spl9_2 ),
inference(avatar_split_clause,[],[f105,f111,f107]) ).
fof(f115,plain,
( ~ spl9_1
| ~ spl9_2 ),
inference(avatar_split_clause,[],[f104,f111,f107]) ).
fof(f122,plain,
! [X0] : empty_set = set_intersection2(empty_set,X0),
inference(superposition,[],[f84,f57]) ).
fof(f134,plain,
! [X0] :
( empty_set != empty_set
| disjoint(empty_set,X0) ),
inference(superposition,[],[f77,f122]) ).
fof(f135,plain,
! [X0] : disjoint(empty_set,X0),
inference(trivial_inequality_removal,[],[f134]) ).
fof(f141,plain,
! [X0,X1] :
( ~ in(X0,empty_set)
| ~ disjoint(empty_set,X1) ),
inference(superposition,[],[f87,f122]) ).
fof(f142,plain,
! [X0] : ~ in(X0,empty_set),
inference(forward_subsumption_resolution,[],[f141,f135]) ).
fof(f160,plain,
! [X0] :
( ~ in(X0,sF8)
| in(X0,sK6) ),
inference(superposition,[],[f100,f103]) ).
fof(f165,plain,
! [X0] :
( ~ in(X0,sF8)
| ~ in(X0,sK7) ),
inference(superposition,[],[f101,f103]) ).
fof(f166,plain,
( ! [X0] :
( ~ in(X0,sK7)
| ~ in(X0,sK6) )
| ~ spl9_2 ),
inference(forward_demodulation,[],[f165,f113]) ).
fof(f168,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| X0 = X1
| in(sK0(X1,X0),X1) ),
inference(resolution,[],[f60,f62]) ).
fof(f180,plain,
( in(sK5(sK6,sK7),set_intersection2(sK6,sK7))
| spl9_1 ),
inference(resolution,[],[f88,f108]) ).
fof(f185,plain,
( in(sK5(sK6,sK7),sK7)
| spl9_1 ),
inference(resolution,[],[f180,f98]) ).
fof(f186,plain,
( in(sK5(sK6,sK7),sK6)
| spl9_1 ),
inference(resolution,[],[f180,f97]) ).
fof(f206,plain,
! [X2,X0,X1] :
( ~ in(sK0(X0,set_difference(X1,X2)),X1)
| in(sK0(X0,set_difference(X1,X2)),X2)
| subset(X0,set_difference(X1,X2)) ),
inference(resolution,[],[f99,f63]) ).
fof(f212,plain,
( ~ in(sK5(sK6,sK7),sK6)
| spl9_1
| ~ spl9_2 ),
inference(resolution,[],[f185,f166]) ).
fof(f215,plain,
( $false
| spl9_1
| ~ spl9_2 ),
inference(forward_subsumption_resolution,[],[f212,f186]) ).
fof(f216,plain,
( spl9_1
| ~ spl9_2 ),
inference(avatar_contradiction_clause,[],[f215]) ).
fof(f217,plain,
( empty_set = set_intersection2(sK6,sK7)
| ~ spl9_1 ),
inference(resolution,[],[f109,f76]) ).
fof(f260,plain,
( ! [X0] :
( in(X0,empty_set)
| ~ in(X0,sK6)
| ~ in(X0,sK7) )
| ~ spl9_1 ),
inference(superposition,[],[f96,f217]) ).
fof(f266,plain,
( ! [X0] :
( ~ in(X0,sK7)
| ~ in(X0,sK6) )
| ~ spl9_1 ),
inference(forward_subsumption_resolution,[],[f260,f142]) ).
fof(f853,plain,
! [X0] :
( ~ in(sK0(X0,sF8),sK6)
| in(sK0(X0,sF8),sK7)
| subset(X0,sF8) ),
inference(superposition,[],[f206,f103]) ).
fof(f854,plain,
( ! [X0] :
( ~ in(sK0(X0,sF8),sK6)
| subset(X0,sF8) )
| ~ spl9_1 ),
inference(forward_subsumption_resolution,[],[f853,f266]) ).
fof(f3328,definition,
( spl9_39
<=> subset(sK6,sF8) ),
introduced(definition,[new_symbols(definition,[spl9_39])],[avatar_definition]) ).
fof(f3329,plain,
( ~ subset(sK6,sF8)
| spl9_39 ),
inference(avatar_component_clause,[],[f3328]) ).
fof(f3330,plain,
( subset(sK6,sF8)
| ~ spl9_39 ),
inference(avatar_component_clause,[],[f3328]) ).
fof(f3340,plain,
( sK6 = sF8
| in(sK0(sF8,sK6),sF8)
| ~ spl9_39 ),
inference(resolution,[],[f3330,f168]) ).
fof(f3342,plain,
( ~ subset(sF8,sK6)
| sK6 = sF8
| ~ spl9_39 ),
inference(resolution,[],[f3330,f60]) ).
fof(f3343,plain,
( ~ subset(sF8,sK6)
| spl9_2
| ~ spl9_39 ),
inference(forward_subsumption_resolution,[],[f3342,f112]) ).
fof(f3344,plain,
( in(sK0(sF8,sK6),sF8)
| spl9_2
| ~ spl9_39 ),
inference(forward_subsumption_resolution,[],[f3340,f112]) ).
fof(f3546,plain,
( in(sK0(sF8,sK6),sK6)
| spl9_2
| ~ spl9_39 ),
inference(resolution,[],[f3344,f160]) ).
fof(f3852,plain,
( subset(sF8,sK6)
| spl9_2
| ~ spl9_39 ),
inference(resolution,[],[f3546,f63]) ).
fof(f3858,plain,
( $false
| spl9_2
| ~ spl9_39 ),
inference(forward_subsumption_resolution,[],[f3852,f3343]) ).
fof(f3859,plain,
( spl9_2
| ~ spl9_39 ),
inference(avatar_contradiction_clause,[],[f3858]) ).
fof(f3889,plain,
( in(sK0(sK6,sF8),sK6)
| spl9_39 ),
inference(resolution,[],[f3329,f62]) ).
fof(f3926,plain,
( subset(sK6,sF8)
| ~ spl9_1
| spl9_39 ),
inference(resolution,[],[f3889,f854]) ).
fof(f3942,plain,
( $false
| ~ spl9_1
| spl9_39 ),
inference(forward_subsumption_resolution,[],[f3926,f3329]) ).
fof(f3943,plain,
( ~ spl9_1
| spl9_39 ),
inference(avatar_contradiction_clause,[],[f3942]) ).
cnf(s1,plain,
( spl9_1
| spl9_2 ),
inference(sat_conversion,[],[f114]) ).
cnf(s2,plain,
( ~ spl9_1
| ~ spl9_2 ),
inference(sat_conversion,[],[f115]) ).
cnf(s3,plain,
( spl9_1
| ~ spl9_2 ),
inference(sat_conversion,[],[f216]) ).
cnf(s47,plain,
( spl9_2
| ~ spl9_39 ),
inference(sat_conversion,[],[f3859]) ).
cnf(s49,plain,
( ~ spl9_1
| spl9_39 ),
inference(sat_conversion,[],[f3943]) ).
cnf(s50,plain,
spl9_1,
inference(rat,[],[s1,s3]) ).
cnf(s51,plain,
spl9_39,
inference(rat,[],[s49,s50]) ).
cnf(s52,plain,
~ spl9_2,
inference(rat,[],[s2,s50]) ).
cnf(s53,plain,
$false,
inference(rat,[],[s47,s51,s52]) ).
fof(f3944,plain,
$false,
inference(avatar_sat_refutation,[],[s53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU141+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37 % Computer : n011.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 28 03:42:46 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.15/0.40 Running first-order model finding
% 0.15/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.50/1.02 % (2996622)Will run a generic schedule for satisfiability detection.
% 2.50/1.02 % (2996629)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1768812789:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.50/1.02 % (2996628)% WARNING: option uhcvi not known.
% 2.50/1.02 % (2996630)dis+10_1_sil=32000:sp=arity:random_seed=1054716859:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.50/1.02 % (2996627)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2002594198_2999 on theBenchmark for (2999ds/0Mi)
% 2.50/1.02 % (2996628)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=519608982:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.50/1.02 % (2996632)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=174931726:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.50/1.02 % (2996633)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1057676107:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.50/1.02 % (2996631)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1504819573:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.50/1.02 % TRYING [1]
% 2.50/1.02 % TRYING [2]
% 2.50/1.02 % TRYING [3]
% 2.50/1.02 % TRYING [4]
% 2.50/1.02 % TRYING [5]
% 2.50/1.02 % (2996630)Instruction limit reached!
% 2.50/1.02 % (2996630)------------------------------
% 2.50/1.02 % (2996630)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.50/1.02 % (2996630)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.50/1.02 % (2996630)CaDiCaL version: 2.1.3
% 2.50/1.02 % (2996630)Termination reason: Instruction limit
% 2.50/1.02 % (2996630)Termination phase: Saturation
% 2.50/1.02 % (2996630)Time elapsed: 0.064 s
% 2.50/1.02 % (2996630)Peak memory usage: 12 MB
% 2.50/1.02 % (2996630)Instructions burned: 104 (million)
% 2.50/1.02 % (2996631)Instruction limit reached!
% 2.50/1.02 % (2996631)------------------------------
% 2.50/1.02 % (2996631)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.50/1.02 % (2996631)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.50/1.02 % (2996631)CaDiCaL version: 2.1.3
% 2.50/1.02 % (2996631)Termination reason: Instruction limit
% 2.50/1.02 % (2996631)Termination phase: Saturation
% 2.50/1.02 % (2996631)Time elapsed: 0.071 s
% 2.50/1.02 % (2996631)Peak memory usage: 12 MB
% 2.50/1.02 % (2996631)Instructions burned: 117 (million)
% 2.50/1.02 % (2996632)Instruction limit reached!
% 2.50/1.02 % (2996632)------------------------------
% 2.50/1.02 % (2996632)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.50/1.02 % (2996632)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.50/1.02 % (2996632)CaDiCaL version: 2.1.3
% 2.50/1.02 % (2996632)Termination reason: Instruction limit
% 2.50/1.02 % (2996632)Termination phase: Saturation
% 2.50/1.02 % (2996632)Time elapsed: 0.081 s
% 2.50/1.02 % (2996632)Peak memory usage: 12 MB
% 2.50/1.02 % (2996632)Instructions burned: 132 (million)
% 2.50/1.02 % (2996641)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1886598793:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 2.50/1.02 % TRYING [1]
% 2.50/1.02 % TRYING [2]
% 2.50/1.02 % (2996633)Instruction limit reached!
% 2.50/1.02 % (2996633)------------------------------
% 2.50/1.02 % (2996633)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.50/1.02 % (2996633)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.50/1.02 % (2996633)CaDiCaL version: 2.1.3
% 2.50/1.02 % (2996633)Termination reason: Instruction limit
% 2.50/1.02 % (2996633)Termination phase: Saturation
% 2.50/1.02 % (2996633)Time elapsed: 0.087 s
% 2.50/1.02 % (2996633)Peak memory usage: 13 MB
% 2.50/1.02 % (2996633)Instructions burned: 160 (million)
% 2.50/1.02 % TRYING [3]
% 2.50/1.02 % (2996642)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=314825922:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 2.50/1.02 % TRYING [4]
% 2.50/1.02 % (2996643)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=3060884804:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.50/1.02 % (2996645)ott-21_1_sil=16000:fs=off:random_seed=4175740749:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.50/1.02 % TRYING [5]
% 2.50/1.02 % TRYING [6]
% 2.50/1.02 % TRYING [6]
% 2.50/1.02 % (2996642)Instruction limit reached!
% 2.50/1.02 % (2996642)------------------------------
% 2.50/1.02 % (2996642)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.50/1.02 % (2996642)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.50/1.02 % (2996642)CaDiCaL version: 2.1.3
% 2.50/1.02 % (2996642)Termination reason: Instruction limit
% 2.50/1.02 % (2996642)Termination phase: Saturation
% 2.50/1.02 % (2996642)Time elapsed: 0.084 s
% 2.50/1.02 % (2996642)Peak memory usage: 13 MB
% 2.50/1.02 % (2996642)Instructions burned: 132 (million)
% 2.50/1.02 % (2996649)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2683465211:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 2.50/1.02 % (2996645)Instruction limit reached!
% 2.50/1.02 % (2996645)------------------------------
% 2.50/1.02 % (2996645)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.50/1.02 % (2996645)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.50/1.02 % (2996645)CaDiCaL version: 2.1.3
% 2.50/1.02 % (2996645)Termination reason: Instruction limit
% 2.50/1.02 % (2996645)Termination phase: Saturation
% 2.50/1.02 % (2996645)Time elapsed: 0.095 s
% 2.50/1.02 % (2996645)Peak memory usage: 13 MB
% 2.50/1.02 % (2996645)Instructions burned: 181 (million)
% 2.50/1.02 % (2996651)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1143727957:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.50/1.02 % TRYING [1]
% 2.50/1.02 % TRYING [2]
% 2.50/1.02 % TRYING [3]
% 2.50/1.02 % TRYING [4]
% 2.50/1.02 % TRYING [5]
% 2.50/1.02 % TRYING [6]
% 2.50/1.02 % TRYING [7]
% 2.50/1.02 % (2996641)Instruction limit reached!
% 2.50/1.02 % (2996641)------------------------------
% 2.50/1.02 % (2996641)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.50/1.02 % (2996641)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.50/1.02 % (2996641)CaDiCaL version: 2.1.3
% 2.50/1.02 % (2996641)Termination reason: Instruction limit
% 2.50/1.02 % (2996641)Termination phase: Finite model building constraint generation
% 2.50/1.02 % (2996641)Time elapsed: 0.333 s
% 2.50/1.02 % (2996641)Peak memory usage: 22 MB
% 2.50/1.02 % (2996641)Instructions burned: 716 (million)
% 2.50/1.02 % TRYING [7]
% 2.50/1.02 % (2996653)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3735800627:i=1179_2995 on theBenchmark for (2995ds/1179Mi)
% 2.50/1.02 % (2996643)Instruction limit reached!
% 2.50/1.02 % (2996643)------------------------------
% 2.50/1.02 % (2996643)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.50/1.02 % (2996643)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.50/1.02 % (2996643)CaDiCaL version: 2.1.3
% 2.50/1.02 % (2996643)Termination reason: Instruction limit
% 2.50/1.02 % (2996643)Termination phase: Saturation
% 2.50/1.02 % (2996643)Time elapsed: 0.380 s
% 2.50/1.02 % (2996643)Peak memory usage: 18 MB
% 2.50/1.02 % (2996643)Instructions burned: 684 (million)
% 2.50/1.02 % (2996655)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=1794597999:i=889:ins=1_2994 on theBenchmark for (2994ds/889Mi)
% 2.50/1.02 % (2996649)Instruction limit reached!
% 2.50/1.02 % (2996649)------------------------------
% 2.50/1.02 % (2996649)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.50/1.02 % (2996649)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.50/1.02 % (2996649)CaDiCaL version: 2.1.3
% 2.50/1.02 % (2996649)Termination reason: Instruction limit
% 2.50/1.02 % (2996649)Termination phase: Saturation
% 2.50/1.02 % (2996649)Time elapsed: 0.312 s
% 2.50/1.02 % (2996649)Peak memory usage: 14 MB
% 2.50/1.02 % (2996649)Instructions burned: 477 (million)
% 2.50/1.02 % TRYING [7]
% 2.50/1.02 % (2996657)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=3929812190:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2994 on theBenchmark for (2994ds/692Mi)
% 2.50/1.02 % (2996653) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2996622-2996653"...
% 2.50/1.02 % TRYING [14]
% 2.50/1.02 % (2996653)...printing done.
% 2.50/1.02 % (2996653)Refutation found. Thanks to Tanya!
% 2.50/1.02 % SZS status Theorem for theBenchmark
% 2.50/1.02 % SZS output start Proof for theBenchmark
% See solution above
% 2.50/1.02 % (2996653)------------------------------
% 2.50/1.02 % (2996653)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.50/1.02 % (2996653)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.50/1.02 % (2996653)CaDiCaL version: 2.1.3
% 2.50/1.02 % (2996653)Termination reason: Refutation
% 2.50/1.02 % (2996653)Time elapsed: 0.123 s
% 2.50/1.02 % (2996653)Peak memory usage: 14 MB
% 2.50/1.02 % (2996653)Instructions burned: 199 (million)
% 2.50/1.02 % (2996622)Success in time 0.605 s
% 2.50/1.02 % Vampire exiting
%------------------------------------------------------------------------------