%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU123+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n013.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:51:59 PM UTC 2026
% Result : Theorem 0.17s 0.47s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 21
% Syntax : Number of formulae : 106 ( 24 unt; 0 def)
% Number of atoms : 313 ( 55 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 359 ( 152 ~; 129 |; 64 &)
% ( 7 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-3 aty)
% Number of variables : 231 ( 215 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( in(X0,X1)
=> ~ in(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
fof(f2,axiom,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(f3,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d10_xboole_0) ).
fof(f4,axiom,
! [X0] :
( X0 = empty_set
<=> ! [X1] : ~ in(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(f5,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f6,axiom,
! [X0,X1,X2] :
( X2 = set_intersection2(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
& in(X3,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f7,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> set_intersection2(X0,X1) = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(f10,axiom,
empty(empty_set),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_xboole_0) ).
fof(f11,axiom,
! [X0,X1] : set_intersection2(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence_k3_xboole_0) ).
fof(f12,axiom,
? [X0] : empty(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc1_xboole_0) ).
fof(f13,axiom,
? [X0] : ~ empty(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc2_xboole_0) ).
fof(f14,axiom,
! [X0,X1] : subset(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f15,axiom,
! [X0,X1] :
( disjoint(X0,X1)
=> disjoint(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_r1_xboole_0) ).
fof(f16,axiom,
! [X0,X1,X2] :
( ( subset(X0,X1)
& subset(X1,X2) )
=> subset(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_xboole_1) ).
fof(f17,axiom,
! [X0] : subset(empty_set,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_xboole_1) ).
fof(f18,axiom,
! [X0,X1] :
( ~ ( ~ disjoint(X0,X1)
& ! [X2] :
~ ( in(X2,X0)
& in(X2,X1) ) )
& ~ ( ? [X2] :
( in(X2,X0)
& in(X2,X1) )
& disjoint(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_xboole_0) ).
fof(f19,conjecture,
! [X0] :
( subset(X0,empty_set)
=> X0 = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_xboole_1) ).
fof(f20,negated_conjecture,
~ ! [X0] :
( subset(X0,empty_set)
=> X0 = empty_set ),
inference(negated_conjecture,[status(cth)],[f19]) ).
fof(f21,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/sandbox/benchmark/theBenchmark.p',t4_xboole_0) ).
fof(f22,axiom,
! [X0] :
( empty(X0)
=> X0 = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_boole) ).
fof(f23,axiom,
! [X0,X1] :
~ ( in(X0,X1)
& empty(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_boole) ).
fof(f24,axiom,
! [X0,X1] :
~ ( empty(X0)
& X0 != X1
& empty(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_boole) ).
fof(f25,plain,
! [X0] : set_intersection2(X0,X0) = X0,
inference(rectify,[],[f11]) ).
fof(f26,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f14]) ).
fof(f27,plain,
! [X0,X1] :
( ~ ( ~ disjoint(X0,X1)
& ! [X2] :
~ ( in(X2,X0)
& in(X2,X1) ) )
& ~ ( ? [X3] :
( in(X3,X0)
& in(X3,X1) )
& disjoint(X0,X1) ) ),
inference(rectify,[],[f18]) ).
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,[],[f21]) ).
fof(f29,plain,
! [X0,X1] :
( ~ in(X1,X0)
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f30,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f31,plain,
! [X0,X1] :
( disjoint(X1,X0)
| ~ disjoint(X0,X1) ),
inference(ennf_transformation,[],[f15]) ).
fof(f32,plain,
! [X0,X1,X2] :
( subset(X0,X2)
| ~ subset(X0,X1)
| ~ subset(X1,X2) ),
inference(ennf_transformation,[],[f16]) ).
fof(f33,plain,
! [X0,X1,X2] :
( subset(X0,X2)
| ~ subset(X0,X1)
| ~ subset(X1,X2) ),
inference(flattening,[],[f32]) ).
fof(f34,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| ? [X2] :
( in(X2,X0)
& in(X2,X1) ) )
& ( ! [X3] :
( ~ in(X3,X0)
| ~ in(X3,X1) )
| ~ disjoint(X0,X1) ) ),
inference(ennf_transformation,[],[f27]) ).
fof(f35,plain,
? [X0] :
( empty_set != X0
& subset(X0,empty_set) ),
inference(ennf_transformation,[],[f20]) ).
fof(f36,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(f37,plain,
! [X0] :
( X0 = empty_set
| ~ empty(X0) ),
inference(ennf_transformation,[],[f22]) ).
fof(f38,plain,
! [X0,X1] :
( ~ in(X0,X1)
| ~ empty(X1) ),
inference(ennf_transformation,[],[f23]) ).
fof(f39,plain,
! [X0,X1] :
( ~ empty(X0)
| X0 = X1
| ~ empty(X1) ),
inference(ennf_transformation,[],[f24]) ).
fof(f40,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f41,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(flattening,[],[f40]) ).
fof(f42,plain,
! [X0] :
( ( X0 = empty_set
| ? [X1] : in(X1,X0) )
& ( ! [X1] : ~ in(X1,X0)
| empty_set != X0 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f43,plain,
! [X0] :
( ( X0 = empty_set
| ? [X1] : in(X1,X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(rectify,[],[f42]) ).
fof(f44,plain,
! [X0] :
( ( X0 = empty_set
| in(sK0(X0),X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X1,sK0(X0))],[f43]) ).
fof(f45,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(f46,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,[],[f45]) ).
fof(f47,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK1(X0,X1),X1)
& in(sK1(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X2,sK1(X0,X1))],[f46]) ).
fof(f48,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,[],[f6]) ).
fof(f49,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,[],[f48]) ).
fof(f50,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,[],[f49]) ).
fof(f51,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(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_intersection2(X0,X1) != X2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X3,sK2(X0,X1,X2))],[f50]) ).
fof(f52,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,
empty(sK3),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X0,sK3)],[f12]) ).
fof(f54,plain,
~ empty(sK4),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X0,sK4)],[f13]) ).
fof(f55,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| ( in(sK5(X0,X1),X0)
& in(sK5(X0,X1),X1) ) )
& ( ! [X3] :
( ~ in(X3,X0)
| ~ in(X3,X1) )
| ~ disjoint(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(X2,sK5(X0,X1))],[f34]) ).
fof(f56,plain,
( empty_set != sK6
& subset(sK6,empty_set) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(X0,sK6)],[f35]) ).
fof(f57,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| in(sK7(X0,X1),set_intersection2(X0,X1)) )
& ( ! [X3] : ~ in(X3,set_intersection2(X0,X1))
| ~ disjoint(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7]),skolemize(X2,sK7(X0,X1))],[f36]) ).
fof(f58,plain,
! [X0,X1] :
( ~ in(X0,X1)
| ~ in(X1,X0) ),
inference(cnf_transformation,[],[f29]) ).
fof(f59,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f60,plain,
! [X0,X1] :
( subset(X1,X0)
| X0 != X1 ),
inference(cnf_transformation,[],[f41]) ).
fof(f61,plain,
! [X0,X1] :
( subset(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f41]) ).
fof(f62,plain,
! [X0,X1] :
( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(cnf_transformation,[],[f41]) ).
fof(f63,plain,
! [X2,X0] :
( ~ in(X2,X0)
| empty_set != X0 ),
inference(cnf_transformation,[],[f44]) ).
fof(f64,plain,
! [X0] :
( empty_set = X0
| in(sK0(X0),X0) ),
inference(cnf_transformation,[],[f44]) ).
fof(f65,plain,
! [X2,X0,X1] :
( in(X0,X1)
| ~ in(X0,X2)
| ~ subset(X2,X1) ),
inference(cnf_transformation,[],[f47]) ).
fof(f66,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK1(X0,X1),X0) ),
inference(cnf_transformation,[],[f47]) ).
fof(f67,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ in(sK1(X0,X1),X1) ),
inference(cnf_transformation,[],[f47]) ).
fof(f68,plain,
! [X2,X0,X1,X4] :
( in(X4,X1)
| ~ in(X4,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f51]) ).
fof(f69,plain,
! [X2,X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f51]) ).
fof(f70,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X0)
| ~ in(X4,X1)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f51]) ).
fof(f71,plain,
! [X2,X0,X1] :
( set_intersection2(X0,X1) = X2
| in(sK2(X0,X1,X2),X1)
| in(sK2(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f51]) ).
fof(f72,plain,
! [X2,X0,X1] :
( set_intersection2(X0,X1) = X2
| in(sK2(X0,X1,X2),X0)
| in(sK2(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f51]) ).
fof(f73,plain,
! [X2,X0,X1] :
( set_intersection2(X0,X1) = X2
| ~ in(sK2(X0,X1,X2),X0)
| ~ in(sK2(X0,X1,X2),X1)
| ~ in(sK2(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f51]) ).
fof(f74,plain,
! [X0,X1] :
( set_intersection2(X0,X1) = empty_set
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[],[f52]) ).
fof(f75,plain,
! [X0,X1] :
( disjoint(X0,X1)
| set_intersection2(X0,X1) != empty_set ),
inference(cnf_transformation,[],[f52]) ).
fof(f76,plain,
empty(empty_set),
inference(cnf_transformation,[],[f10]) ).
fof(f77,plain,
! [X0] : set_intersection2(X0,X0) = X0,
inference(cnf_transformation,[],[f25]) ).
fof(f78,plain,
empty(sK3),
inference(cnf_transformation,[],[f53]) ).
fof(f79,plain,
~ empty(sK4),
inference(cnf_transformation,[],[f54]) ).
fof(f80,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f26]) ).
fof(f81,plain,
! [X0,X1] :
( disjoint(X1,X0)
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f82,plain,
! [X2,X0,X1] :
( subset(X0,X1)
| ~ subset(X0,X2)
| ~ subset(X2,X1) ),
inference(cnf_transformation,[],[f33]) ).
fof(f83,plain,
! [X0] : subset(empty_set,X0),
inference(cnf_transformation,[],[f17]) ).
fof(f84,plain,
! [X3,X0,X1] :
( ~ in(X3,X0)
| ~ in(X3,X1)
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[],[f55]) ).
fof(f85,plain,
! [X0,X1] :
( disjoint(X0,X1)
| in(sK5(X0,X1),X1) ),
inference(cnf_transformation,[],[f55]) ).
fof(f86,plain,
! [X0,X1] :
( disjoint(X0,X1)
| in(sK5(X0,X1),X0) ),
inference(cnf_transformation,[],[f55]) ).
fof(f87,plain,
subset(sK6,empty_set),
inference(cnf_transformation,[],[f56]) ).
fof(f88,plain,
empty_set != sK6,
inference(cnf_transformation,[],[f56]) ).
fof(f89,plain,
! [X3,X0,X1] :
( ~ in(X3,set_intersection2(X0,X1))
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[],[f57]) ).
fof(f90,plain,
! [X0,X1] :
( disjoint(X0,X1)
| in(sK7(X0,X1),set_intersection2(X0,X1)) ),
inference(cnf_transformation,[],[f57]) ).
fof(f91,plain,
! [X0] :
( empty_set = X0
| ~ empty(X0) ),
inference(cnf_transformation,[],[f37]) ).
fof(f92,plain,
! [X0,X1] :
( ~ in(X0,X1)
| ~ empty(X1) ),
inference(cnf_transformation,[],[f38]) ).
fof(f93,plain,
! [X0,X1] :
( ~ empty(X0)
| X0 = X1
| ~ empty(X1) ),
inference(cnf_transformation,[],[f39]) ).
fof(f94,plain,
! [X0] : subset(X0,X0),
inference(equality_resolution,[],[f61]) ).
fof(f95,plain,
! [X0] : subset(X0,X0),
inference(equality_resolution,[],[f60]) ).
fof(f96,plain,
! [X2] : ~ in(X2,empty_set),
inference(equality_resolution,[],[f63]) ).
fof(f97,plain,
! [X0,X1,X4] :
( in(X4,set_intersection2(X0,X1))
| ~ in(X4,X0)
| ~ in(X4,X1) ),
inference(equality_resolution,[],[f70]) ).
fof(f98,plain,
! [X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,set_intersection2(X0,X1)) ),
inference(equality_resolution,[],[f69]) ).
fof(f99,plain,
! [X0,X1,X4] :
( in(X4,X1)
| ~ in(X4,set_intersection2(X0,X1)) ),
inference(equality_resolution,[],[f68]) ).
fof(f100,plain,
! [X0,X1] :
( ~ disjoint(X0,X1)
| set_intersection2(X0,X1) != empty_set ),
inference(consistent_polarity_flipping,[],[f75]) ).
fof(f101,plain,
! [X0,X1] :
( set_intersection2(X0,X1) = empty_set
| disjoint(X0,X1) ),
inference(consistent_polarity_flipping,[],[f74]) ).
fof(f102,plain,
! [X0,X1] :
( ~ disjoint(X0,X1)
| disjoint(X1,X0) ),
inference(consistent_polarity_flipping,[],[f81]) ).
fof(f103,plain,
! [X0,X1] :
( ~ disjoint(X0,X1)
| in(sK5(X0,X1),X0) ),
inference(consistent_polarity_flipping,[],[f86]) ).
fof(f104,plain,
! [X0,X1] :
( ~ disjoint(X0,X1)
| in(sK5(X0,X1),X1) ),
inference(consistent_polarity_flipping,[],[f85]) ).
fof(f105,plain,
! [X2,X0,X1] :
( ~ in(X0,X1)
| ~ in(X0,X2)
| disjoint(X1,X2) ),
inference(consistent_polarity_flipping,[],[f84]) ).
fof(f106,plain,
! [X0,X1] :
( ~ disjoint(X0,X1)
| in(sK7(X0,X1),set_intersection2(X0,X1)) ),
inference(consistent_polarity_flipping,[],[f90]) ).
fof(f107,plain,
! [X3,X0,X1] :
( ~ in(X3,set_intersection2(X0,X1))
| disjoint(X0,X1) ),
inference(consistent_polarity_flipping,[],[f89]) ).
fof(f147,plain,
$false,
inference(finite_model_not_found_(exhaustively_excluded_all_possible_domain_size_assignments),[],[f58,f59,f62,f94,f95,f64,f96,f67,f66,f65,f73,f72,f71,f97,f98,f99,f100,f101,f76,f77,f78,f79,f80,f102,f82,f83,f103,f104,f105,f88,f87,f106,f107,f91,f92,f93]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU123+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.40 % Computer : n013.cluster.edu
% 0.13/0.40 % Model : x86_64 x86_64
% 0.13/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.40 % Memory : 8046.5625MB
% 0.13/0.40 % OS : Linux 6.8.0-71-generic
% 0.13/0.40 % CPULimit : 300
% 0.13/0.40 % WCLimit : 300
% 0.13/0.40 % DateTime : Mon Sep 28 03:37:51 UTC 2026
% 0.13/0.40 % CPUTime :
% 0.13/0.40 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.43 Running first-order model finding
% 0.13/0.43 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.47 % (778542)Will run a generic schedule for satisfiability detection.
% 0.17/0.47 % (778550)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4262277218_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.47 % TRYING [1]
% 0.17/0.47 % TRYING [2]
% 0.17/0.47 % TRYING [3]
% 0.17/0.47 % TRYING [4]
% 0.17/0.47 % (778551)% WARNING: option uhcvi not known.
% 0.17/0.47 % (778550) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-778542-778550"...
% 0.17/0.47 % (778550)...printing done.
% 0.17/0.47 % (778550)Refutation found. Thanks to Tanya!
% 0.17/0.47 % SZS status Theorem for theBenchmark
% 0.17/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.47 % (778550)------------------------------
% 0.17/0.47 % (778550)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.47 % (778550)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.47 % (778550)CaDiCaL version: 2.1.3
% 0.17/0.47 % (778550)Termination reason: Refutation
% 0.17/0.47 % (778550)Time elapsed: 0.006 s
% 0.17/0.47 % (778550)Peak memory usage: 12 MB
% 0.17/0.47 % (778550)Instructions burned: 25 (million)
% 0.17/0.47 % (778542)Success in time 0.033 s
% 0.17/0.47 % Vampire exiting
%------------------------------------------------------------------------------