%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU138+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n018.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:47:22 PM UTC 2026
% Result : Theorem 2.68s 1.27s
% Output : Refutation 3.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 12
% Syntax : Number of formulae : 88 ( 12 unt; 7 def)
% Number of atoms : 311 ( 36 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 360 ( 137 ~; 155 |; 53 &)
% ( 14 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 7 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 127 ( 0 sgn 117 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
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(f17,conjecture,
! [X0,X1] : set_difference(X0,set_difference(X0,X1)) = set_intersection2(X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t48_xboole_1) ).
fof(f18,negated_conjecture,
~ ! [X0,X1] : set_difference(X0,set_difference(X0,X1)) = set_intersection2(X0,X1),
inference(negated_conjecture,[status(cth)],[f17]) ).
fof(f26,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f27,plain,
? [X0,X1] : set_intersection2(X0,X1) != set_difference(X0,set_difference(X0,X1)),
inference(ennf_transformation,[],[f18]) ).
fof(f31,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f32,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(flattening,[],[f31]) ).
fof(f33,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,[],[f26]) ).
fof(f34,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,[],[f33]) ).
fof(f35,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))],[f34]) ).
fof(f36,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(f37,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,[],[f36]) ).
fof(f38,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,[],[f37]) ).
fof(f39,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))],[f38]) ).
fof(f40,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(f41,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,[],[f40]) ).
fof(f42,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,[],[f41]) ).
fof(f43,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))],[f42]) ).
fof(f46,plain,
set_intersection2(sK5,sK6) != set_difference(sK5,set_difference(sK5,sK6)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK6]),skolemize(X0,sK5),skolemize(X1,sK6)],[f27]) ).
fof(f51,plain,
! [X0,X1] :
( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(cnf_transformation,[],[f32]) ).
fof(f53,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f35]) ).
fof(f54,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ in(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f35]) ).
fof(f55,plain,
! [X2,X0,X1,X4] :
( in(X4,X1)
| ~ in(X4,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f39]) ).
fof(f56,plain,
! [X2,X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f39]) ).
fof(f57,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X0)
| ~ in(X4,X1)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f39]) ).
fof(f61,plain,
! [X2,X0,X1,X4] :
( ~ in(X4,X1)
| ~ in(X4,X2)
| set_difference(X0,X1) != X2 ),
inference(cnf_transformation,[],[f43]) ).
fof(f62,plain,
! [X2,X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,X2)
| set_difference(X0,X1) != X2 ),
inference(cnf_transformation,[],[f43]) ).
fof(f63,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X0)
| in(X4,X1)
| set_difference(X0,X1) != X2 ),
inference(cnf_transformation,[],[f43]) ).
fof(f74,plain,
set_intersection2(sK5,sK6) != set_difference(sK5,set_difference(sK5,sK6)),
inference(cnf_transformation,[],[f46]) ).
fof(f81,plain,
! [X0,X1,X4] :
( in(X4,set_intersection2(X0,X1))
| ~ in(X4,X0)
| ~ in(X4,X1) ),
inference(equality_resolution,[],[f57]) ).
fof(f82,plain,
! [X0,X1,X4] :
( ~ in(X4,set_intersection2(X0,X1))
| in(X4,X0) ),
inference(equality_resolution,[],[f56]) ).
fof(f83,plain,
! [X0,X1,X4] :
( ~ in(X4,set_intersection2(X0,X1))
| in(X4,X1) ),
inference(equality_resolution,[],[f55]) ).
fof(f84,plain,
! [X0,X1,X4] :
( in(X4,set_difference(X0,X1))
| ~ in(X4,X0)
| in(X4,X1) ),
inference(equality_resolution,[],[f63]) ).
fof(f85,plain,
! [X0,X1,X4] :
( ~ in(X4,set_difference(X0,X1))
| in(X4,X0) ),
inference(equality_resolution,[],[f62]) ).
fof(f86,plain,
! [X0,X1,X4] :
( ~ in(X4,set_difference(X0,X1))
| ~ in(X4,X1) ),
inference(equality_resolution,[],[f61]) ).
fof(f87,definition,
! [X0,X1] :
( sQ7_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(definition,[new_symbols(definition,[sQ7_eqProxy])],[equality_proxy_definition]) ).
fof(f89,plain,
! [X0,X1] :
( sQ7_eqProxy(X0,X1)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(equality_proxy_replacement,[],[f51,f87]) ).
fof(f99,plain,
~ sQ7_eqProxy(set_intersection2(sK5,sK6),set_difference(sK5,set_difference(sK5,sK6))),
inference(equality_proxy_replacement,[],[f74,f87]) ).
fof(f123,plain,
( ~ subset(set_intersection2(sK5,sK6),set_difference(sK5,set_difference(sK5,sK6)))
| ~ subset(set_difference(sK5,set_difference(sK5,sK6)),set_intersection2(sK5,sK6)) ),
inference(resolution,[],[f89,f99]) ).
fof(f126,definition,
( spl8_3
<=> subset(set_intersection2(sK5,sK6),set_difference(sK5,set_difference(sK5,sK6))) ),
introduced(definition,[new_symbols(definition,[spl8_3])],[avatar_definition]) ).
fof(f127,plain,
( ~ subset(set_intersection2(sK5,sK6),set_difference(sK5,set_difference(sK5,sK6)))
| spl8_3 ),
inference(avatar_component_clause,[],[f126]) ).
fof(f129,definition,
( spl8_4
<=> subset(set_difference(sK5,set_difference(sK5,sK6)),set_intersection2(sK5,sK6)) ),
introduced(definition,[new_symbols(definition,[spl8_4])],[avatar_definition]) ).
fof(f130,plain,
( ~ subset(set_difference(sK5,set_difference(sK5,sK6)),set_intersection2(sK5,sK6))
| spl8_4 ),
inference(avatar_component_clause,[],[f129]) ).
fof(f132,plain,
( ~ spl8_4
| ~ spl8_3 ),
inference(avatar_split_clause,[],[f123,f126,f129]) ).
fof(f133,plain,
( ~ in(sK0(set_intersection2(sK5,sK6),set_difference(sK5,set_difference(sK5,sK6))),set_difference(sK5,set_difference(sK5,sK6)))
| spl8_3 ),
inference(resolution,[],[f127,f54]) ).
fof(f134,plain,
( in(sK0(set_intersection2(sK5,sK6),set_difference(sK5,set_difference(sK5,sK6))),set_intersection2(sK5,sK6))
| spl8_3 ),
inference(resolution,[],[f127,f53]) ).
fof(f135,plain,
( in(sK0(set_intersection2(sK5,sK6),set_difference(sK5,set_difference(sK5,sK6))),sK6)
| spl8_3 ),
inference(resolution,[],[f134,f83]) ).
fof(f136,plain,
( in(sK0(set_intersection2(sK5,sK6),set_difference(sK5,set_difference(sK5,sK6))),sK5)
| spl8_3 ),
inference(resolution,[],[f134,f82]) ).
fof(f153,plain,
( ~ in(sK0(set_intersection2(sK5,sK6),set_difference(sK5,set_difference(sK5,sK6))),sK5)
| in(sK0(set_intersection2(sK5,sK6),set_difference(sK5,set_difference(sK5,sK6))),set_difference(sK5,sK6))
| spl8_3 ),
inference(resolution,[],[f84,f133]) ).
fof(f155,definition,
( spl8_5
<=> in(sK0(set_intersection2(sK5,sK6),set_difference(sK5,set_difference(sK5,sK6))),set_difference(sK5,sK6)) ),
introduced(definition,[new_symbols(definition,[spl8_5])],[avatar_definition]) ).
fof(f156,plain,
( in(sK0(set_intersection2(sK5,sK6),set_difference(sK5,set_difference(sK5,sK6))),set_difference(sK5,sK6))
| ~ spl8_5 ),
inference(avatar_component_clause,[],[f155]) ).
fof(f158,definition,
( spl8_6
<=> in(sK0(set_intersection2(sK5,sK6),set_difference(sK5,set_difference(sK5,sK6))),sK5) ),
introduced(definition,[new_symbols(definition,[spl8_6])],[avatar_definition]) ).
fof(f159,plain,
( ~ in(sK0(set_intersection2(sK5,sK6),set_difference(sK5,set_difference(sK5,sK6))),sK5)
| spl8_6 ),
inference(avatar_component_clause,[],[f158]) ).
fof(f160,plain,
( spl8_5
| ~ spl8_6
| spl8_3 ),
inference(avatar_split_clause,[],[f153,f126,f158,f155]) ).
fof(f161,plain,
( $false
| spl8_3
| spl8_6 ),
inference(resolution,[],[f159,f136]) ).
fof(f162,plain,
( spl8_3
| spl8_6 ),
inference(avatar_contradiction_clause,[],[f161]) ).
fof(f163,plain,
( ~ in(sK0(set_intersection2(sK5,sK6),set_difference(sK5,set_difference(sK5,sK6))),sK6)
| ~ spl8_5 ),
inference(resolution,[],[f156,f86]) ).
fof(f167,plain,
( $false
| spl8_3
| ~ spl8_5 ),
inference(resolution,[],[f163,f135]) ).
fof(f168,plain,
( spl8_3
| ~ spl8_5 ),
inference(avatar_contradiction_clause,[],[f167]) ).
fof(f169,plain,
( ~ in(sK0(set_difference(sK5,set_difference(sK5,sK6)),set_intersection2(sK5,sK6)),set_intersection2(sK5,sK6))
| spl8_4 ),
inference(resolution,[],[f130,f54]) ).
fof(f170,plain,
( in(sK0(set_difference(sK5,set_difference(sK5,sK6)),set_intersection2(sK5,sK6)),set_difference(sK5,set_difference(sK5,sK6)))
| spl8_4 ),
inference(resolution,[],[f130,f53]) ).
fof(f171,plain,
( ~ in(sK0(set_difference(sK5,set_difference(sK5,sK6)),set_intersection2(sK5,sK6)),sK5)
| ~ in(sK0(set_difference(sK5,set_difference(sK5,sK6)),set_intersection2(sK5,sK6)),sK6)
| spl8_4 ),
inference(resolution,[],[f169,f81]) ).
fof(f173,definition,
( spl8_7
<=> in(sK0(set_difference(sK5,set_difference(sK5,sK6)),set_intersection2(sK5,sK6)),sK6) ),
introduced(definition,[new_symbols(definition,[spl8_7])],[avatar_definition]) ).
fof(f176,definition,
( spl8_8
<=> in(sK0(set_difference(sK5,set_difference(sK5,sK6)),set_intersection2(sK5,sK6)),sK5) ),
introduced(definition,[new_symbols(definition,[spl8_8])],[avatar_definition]) ).
fof(f177,plain,
( ~ in(sK0(set_difference(sK5,set_difference(sK5,sK6)),set_intersection2(sK5,sK6)),sK5)
| spl8_8 ),
inference(avatar_component_clause,[],[f176]) ).
fof(f178,plain,
( ~ spl8_7
| ~ spl8_8
| spl8_4 ),
inference(avatar_split_clause,[],[f171,f129,f176,f173]) ).
fof(f179,plain,
( ~ in(sK0(set_difference(sK5,set_difference(sK5,sK6)),set_intersection2(sK5,sK6)),set_difference(sK5,sK6))
| spl8_4 ),
inference(resolution,[],[f170,f86]) ).
fof(f180,plain,
( in(sK0(set_difference(sK5,set_difference(sK5,sK6)),set_intersection2(sK5,sK6)),sK5)
| spl8_4 ),
inference(resolution,[],[f170,f85]) ).
fof(f190,plain,
( ~ in(sK0(set_difference(sK5,set_difference(sK5,sK6)),set_intersection2(sK5,sK6)),sK5)
| in(sK0(set_difference(sK5,set_difference(sK5,sK6)),set_intersection2(sK5,sK6)),sK6)
| spl8_4 ),
inference(resolution,[],[f179,f84]) ).
fof(f192,plain,
( spl8_7
| ~ spl8_8
| spl8_4 ),
inference(avatar_split_clause,[],[f190,f129,f176,f173]) ).
fof(f193,plain,
( $false
| spl8_4
| spl8_8 ),
inference(resolution,[],[f177,f180]) ).
fof(f194,plain,
( spl8_4
| spl8_8 ),
inference(avatar_contradiction_clause,[],[f193]) ).
cnf(s4,plain,
( ~ spl8_3
| ~ spl8_4 ),
inference(sat_conversion,[],[f132]) ).
cnf(s5,plain,
( spl8_3
| spl8_5
| ~ spl8_6 ),
inference(sat_conversion,[],[f160]) ).
cnf(s6,plain,
( spl8_3
| spl8_6 ),
inference(sat_conversion,[],[f162]) ).
cnf(s7,plain,
( spl8_3
| ~ spl8_5 ),
inference(sat_conversion,[],[f168]) ).
cnf(s8,plain,
( spl8_4
| ~ spl8_7
| ~ spl8_8 ),
inference(sat_conversion,[],[f178]) ).
cnf(s9,plain,
( spl8_4
| spl8_7
| ~ spl8_8 ),
inference(sat_conversion,[],[f192]) ).
cnf(s10,plain,
( spl8_4
| spl8_8 ),
inference(sat_conversion,[],[f194]) ).
cnf(s11,plain,
spl8_3,
inference(rat,[],[s5,s6,s7]) ).
cnf(s12,plain,
~ spl8_4,
inference(rat,[],[s4,s11]) ).
cnf(s13,plain,
spl8_8,
inference(rat,[],[s10,s12]) ).
cnf(s14,plain,
spl8_7,
inference(rat,[],[s9,s13,s12]) ).
cnf(s15,plain,
$false,
inference(rat,[],[s8,s13,s14,s12]) ).
fof(f195,plain,
$false,
inference(avatar_sat_refutation,[],[s15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU138+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n018.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 28 03:43:57 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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
% 2.68/1.27 % (2973465)Detected formulas, will run a generic FOF schedule.
% 2.68/1.27 % (2973472)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=2980698676:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.68/1.27 % (2973475)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2992217033:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.68/1.27 % (2973471)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=69376643:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.68/1.27 % (2973470)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=489080425:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.68/1.27 % (2973473)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1378032903:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.68/1.27 % (2973473)Refutation not found, incomplete strategy
% 2.68/1.27 % (2973473)------------------------------
% 2.68/1.27 % (2973473)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.68/1.27 % (2973473)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.68/1.27 % (2973473)CaDiCaL version: 2.1.3
% 2.68/1.27 % (2973473)Termination reason: Refutation not found, incomplete strategy
% 2.68/1.27 % (2973473)Time elapsed: 0.002 s
% 2.68/1.27 % (2973473)Peak memory usage: 88 MB
% 2.68/1.27 % (2973473)Instructions burned: 1 (million)
% 2.68/1.27 % (2973476)dis-21_1_sil=8000:lcm=predicate:random_seed=2176648789: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.68/1.27 % (2973474)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2811270295:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.68/1.27 % (2973476)First to succeed.
% 2.68/1.27 % (2973476)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2973465"
% 2.68/1.27 % (2973474)Instruction limit reached!
% 2.68/1.27 % (2973474)------------------------------
% 2.68/1.27 % (2973474)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.68/1.27 % (2973474)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.68/1.27 % (2973474)CaDiCaL version: 2.1.3
% 2.68/1.27 % (2973474)Termination reason: Instruction limit
% 2.68/1.27 % (2973474)Termination phase: Saturation
% 2.68/1.27 % (2973474)Time elapsed: 0.071 s
% 2.68/1.27 % (2973474)Peak memory usage: 88 MB
% 2.68/1.27 % (2973474)Instructions burned: 120 (million)
% 2.68/1.27 % (2973475)Instruction limit reached!
% 2.68/1.27 % (2973475)------------------------------
% 2.68/1.27 % (2973475)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.68/1.27 % (2973475)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.68/1.27 % (2973475)CaDiCaL version: 2.1.3
% 2.68/1.27 % (2973475)Termination reason: Instruction limit
% 2.68/1.27 % (2973475)Termination phase: Saturation
% 2.68/1.27 % (2973475)Time elapsed: 0.096 s
% 2.68/1.27 % (2973475)Peak memory usage: 89 MB
% 2.68/1.27 % (2973475)Instructions burned: 140 (million)
% 2.68/1.27 % (2973484)lrs+10_1_sil=8000:sp=occurrence:random_seed=2755824528:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.68/1.27 % (2973485)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2911408537:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.68/1.27 % (2973473)------------------------------
% 2.68/1.27 % (2973473)------------------------------
% 2.68/1.27 % (2973485)Refutation not found, incomplete strategy
% 2.68/1.27 % (2973485)------------------------------
% 2.68/1.27 % (2973485)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.68/1.27 % (2973485)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.68/1.27 % (2973485)CaDiCaL version: 2.1.3
% 2.68/1.27 % (2973485)Termination reason: Refutation not found, incomplete strategy
% 2.68/1.27 % (2973485)Time elapsed: 0.003 s
% 2.68/1.27 % (2973485)Peak memory usage: 89 MB
% 2.68/1.27 % (2973485)Instructions burned: 3 (million)
% 2.68/1.27 % (2973476)Refutation found. Thanks to Tanya!
% 2.68/1.27 % SZS status Theorem for theBenchmark
% 2.68/1.27 % SZS output start Proof for theBenchmark
% See solution above
% 3.43/1.36 % (2973476)------------------------------
% 3.43/1.36 % (2973476)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.43/1.36 % (2973476)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.43/1.36 % (2973476)CaDiCaL version: 2.1.3
% 3.43/1.36 % (2973476)Termination reason: Refutation
% 3.43/1.36 % (2973476)Time elapsed: 0.005 s
% 3.43/1.36 % (2973476)Peak memory usage: 89 MB
% 3.43/1.36 % (2973476)Instructions burned: 5 (million)
% 3.43/1.36 % (2973476)------------------------------
% 3.43/1.36 % (2973476)------------------------------
% 3.43/1.36 % (2973465)Success in time 0.413 s
% 3.43/1.36 % Vampire exiting
%------------------------------------------------------------------------------