%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET888+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n014.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:42:15 PM UTC 2026
% Result : Theorem 6.98s 1.94s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 35
% Number of leaves : 17
% Syntax : Number of formulae : 152 ( 35 unt; 12 def)
% Number of atoms : 487 ( 245 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 527 ( 192 ~; 285 |; 34 &)
% ( 13 <=>; 2 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 7 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 8 con; 0-3 aty)
% Number of variables : 167 ( 0 sgn 160 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0,X1] :
( X1 = singleton(X0)
<=> ! [X2] :
( in(X2,X1)
<=> X2 = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
fof(f6,axiom,
! [X0,X1,X2] :
( X2 = unordered_pair(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( X3 = X0
| X3 = X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski) ).
fof(f7,axiom,
! [X0,X1] : symmetric_difference(X0,X1) = set_union2(set_difference(X0,X1),set_difference(X1,X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d6_xboole_0) ).
fof(f13,axiom,
! [X0,X1,X2] :
( in(X0,symmetric_difference(X1,X2))
<=> ~ ( in(X0,X1)
<=> in(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_xboole_0) ).
fof(f14,conjecture,
! [X0,X1] :
( X0 != X1
=> symmetric_difference(singleton(X0),singleton(X1)) = unordered_pair(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t29_zfmisc_1) ).
fof(f15,negated_conjecture,
~ ! [X0,X1] :
( X0 != X1
=> symmetric_difference(singleton(X0),singleton(X1)) = unordered_pair(X0,X1) ),
inference(negated_conjecture,[status(cth)],[f14]) ).
fof(f20,plain,
! [X0,X1,X2] :
( in(X0,symmetric_difference(X1,X2))
<=> ( in(X0,X1)
<~> in(X0,X2) ) ),
inference(ennf_transformation,[],[f13]) ).
fof(f21,plain,
? [X0,X1] :
( unordered_pair(X0,X1) != symmetric_difference(singleton(X0),singleton(X1))
& X0 != X1 ),
inference(ennf_transformation,[],[f15]) ).
fof(f22,plain,
! [X0,X1] :
( ( X1 = singleton(X0)
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X2 = X0
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| X0 != X2 )
& ( X2 = X0
| ~ in(X2,X1) ) )
| singleton(X0) != X1 ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f23,plain,
! [X0,X1] :
( ( X1 = singleton(X0)
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X2 = X0
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(rectify,[],[f22]) ).
fof(f24,plain,
! [X0,X1] :
( ( X1 = singleton(X0)
| ( ( sK0(X0,X1) != X0
| ~ in(sK0(X0,X1),X1) )
& ( sK0(X0,X1) = X0
| in(sK0(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f23]) ).
fof(f25,plain,
! [X0,X1,X2] :
( ( X2 = unordered_pair(X0,X1)
| ? [X3] :
( ( ( X0 != X3
& X1 != X3 )
| ~ in(X3,X2) )
& ( X3 = X0
| X3 = X1
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( X0 != X3
& X1 != X3 ) )
& ( X3 = X0
| X3 = X1
| ~ in(X3,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f26,plain,
! [X0,X1,X2] :
( ( X2 = unordered_pair(X0,X1)
| ? [X3] :
( ( ( X0 != X3
& X1 != X3 )
| ~ in(X3,X2) )
& ( X3 = X0
| X3 = X1
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( X0 != X3
& X1 != X3 ) )
& ( X3 = X0
| X3 = X1
| ~ in(X3,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(flattening,[],[f25]) ).
fof(f27,plain,
! [X0,X1,X2] :
( ( X2 = unordered_pair(X0,X1)
| ? [X3] :
( ( ( X0 != X3
& X1 != X3 )
| ~ in(X3,X2) )
& ( X3 = X0
| X3 = X1
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X0 != X4
& X1 != X4 ) )
& ( X0 = X4
| X1 = X4
| ~ in(X4,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(rectify,[],[f26]) ).
fof(f28,plain,
! [X0,X1,X2] :
( ( X2 = unordered_pair(X0,X1)
| ( ( ( sK1(X0,X1,X2) != X0
& sK1(X0,X1,X2) != X1 )
| ~ in(sK1(X0,X1,X2),X2) )
& ( sK1(X0,X1,X2) = X0
| sK1(X0,X1,X2) = X1
| in(sK1(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X0 != X4
& X1 != X4 ) )
& ( X0 = X4
| X1 = X4
| ~ in(X4,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X3,sK1(X0,X1,X2))],[f27]) ).
fof(f31,plain,
! [X0,X1,X2] :
( ( in(X0,symmetric_difference(X1,X2))
| ( ( in(X0,X1)
| ~ in(X0,X2) )
& ( in(X0,X2)
| ~ in(X0,X1) ) ) )
& ( ( ( ~ in(X0,X2)
| ~ in(X0,X1) )
& ( in(X0,X2)
| in(X0,X1) ) )
| ~ in(X0,symmetric_difference(X1,X2)) ) ),
inference(nnf_transformation,[],[f20]) ).
fof(f32,plain,
( unordered_pair(sK4,sK5) != symmetric_difference(singleton(sK4),singleton(sK5))
& sK4 != sK5 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5]),skolemize(X0,sK4),skolemize(X1,sK5)],[f21]) ).
fof(f37,plain,
! [X3,X0,X1] :
( X0 = X3
| ~ in(X3,X1)
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f24]) ).
fof(f38,plain,
! [X3,X0,X1] :
( in(X3,X1)
| X0 != X3
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f24]) ).
fof(f41,plain,
! [X2,X0,X1,X4] :
( X0 = X4
| X1 = X4
| ~ in(X4,X2)
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f28]) ).
fof(f42,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| X1 != X4
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f28]) ).
fof(f43,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| X0 != X4
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f28]) ).
fof(f44,plain,
! [X2,X0,X1] :
( in(sK1(X0,X1,X2),X2)
| sK1(X0,X1,X2) = X0
| sK1(X0,X1,X2) = X1
| unordered_pair(X0,X1) = X2 ),
inference(cnf_transformation,[],[f28]) ).
fof(f45,plain,
! [X2,X0,X1] :
( sK1(X0,X1,X2) != X1
| unordered_pair(X0,X1) = X2
| ~ in(sK1(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f28]) ).
fof(f46,plain,
! [X2,X0,X1] :
( sK1(X0,X1,X2) != X0
| unordered_pair(X0,X1) = X2
| ~ in(sK1(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f28]) ).
fof(f47,plain,
! [X0,X1] : symmetric_difference(X0,X1) = set_union2(set_difference(X0,X1),set_difference(X1,X0)),
inference(cnf_transformation,[],[f7]) ).
fof(f53,plain,
! [X2,X0,X1] :
( in(X0,X2)
| in(X0,X1)
| ~ in(X0,symmetric_difference(X1,X2)) ),
inference(cnf_transformation,[],[f31]) ).
fof(f55,plain,
! [X2,X0,X1] :
( in(X0,symmetric_difference(X1,X2))
| in(X0,X2)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f56,plain,
! [X2,X0,X1] :
( in(X0,symmetric_difference(X1,X2))
| in(X0,X1)
| ~ in(X0,X2) ),
inference(cnf_transformation,[],[f31]) ).
fof(f57,plain,
sK4 != sK5,
inference(cnf_transformation,[],[f32]) ).
fof(f58,plain,
unordered_pair(sK4,sK5) != symmetric_difference(singleton(sK4),singleton(sK5)),
inference(cnf_transformation,[],[f32]) ).
fof(f60,plain,
! [X2,X0,X1] :
( in(X0,set_union2(set_difference(X1,X2),set_difference(X2,X1)))
| in(X0,X1)
| ~ in(X0,X2) ),
inference(definition_unfolding,[],[f56,f47]) ).
fof(f61,plain,
! [X2,X0,X1] :
( in(X0,set_union2(set_difference(X1,X2),set_difference(X2,X1)))
| in(X0,X2)
| ~ in(X0,X1) ),
inference(definition_unfolding,[],[f55,f47]) ).
fof(f63,plain,
! [X2,X0,X1] :
( ~ in(X0,set_union2(set_difference(X1,X2),set_difference(X2,X1)))
| in(X0,X1)
| in(X0,X2) ),
inference(definition_unfolding,[],[f53,f47]) ).
fof(f64,plain,
unordered_pair(sK4,sK5) != set_union2(set_difference(singleton(sK4),singleton(sK5)),set_difference(singleton(sK5),singleton(sK4))),
inference(definition_unfolding,[],[f58,f47]) ).
fof(f65,plain,
! [X3,X1] :
( in(X3,X1)
| singleton(X3) != X1 ),
inference(equality_resolution,[],[f38]) ).
fof(f66,plain,
! [X3] : in(X3,singleton(X3)),
inference(equality_resolution,[],[f65]) ).
fof(f67,plain,
! [X3,X0] :
( ~ in(X3,singleton(X0))
| X0 = X3 ),
inference(equality_resolution,[],[f37]) ).
fof(f68,plain,
! [X2,X1,X4] :
( in(X4,X2)
| unordered_pair(X4,X1) != X2 ),
inference(equality_resolution,[],[f43]) ).
fof(f69,plain,
! [X1,X4] : in(X4,unordered_pair(X4,X1)),
inference(equality_resolution,[],[f68]) ).
fof(f70,plain,
! [X2,X0,X4] :
( in(X4,X2)
| unordered_pair(X0,X4) != X2 ),
inference(equality_resolution,[],[f42]) ).
fof(f71,plain,
! [X0,X4] : in(X4,unordered_pair(X0,X4)),
inference(equality_resolution,[],[f70]) ).
fof(f72,plain,
! [X0,X1,X4] :
( ~ in(X4,unordered_pair(X0,X1))
| X1 = X4
| X0 = X4 ),
inference(equality_resolution,[],[f41]) ).
fof(f73,definition,
sF6 = unordered_pair(sK4,sK5),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
fof(f74,plain,
unordered_pair(sK4,sK5) = sF6,
inference(reorient_equations,[],[f73]) ).
fof(f75,definition,
sF7 = singleton(sK4),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
fof(f76,plain,
singleton(sK4) = sF7,
inference(reorient_equations,[],[f75]) ).
fof(f77,definition,
sF8 = singleton(sK5),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
fof(f78,plain,
singleton(sK5) = sF8,
inference(reorient_equations,[],[f77]) ).
fof(f79,definition,
sF9 = set_difference(sF7,sF8),
introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).
fof(f80,plain,
set_difference(sF7,sF8) = sF9,
inference(reorient_equations,[],[f79]) ).
fof(f81,definition,
sF10 = set_difference(sF8,sF7),
introduced(definition,[new_symbols(definition,[sF10])],[function_definition]) ).
fof(f82,plain,
set_difference(sF8,sF7) = sF10,
inference(reorient_equations,[],[f81]) ).
fof(f83,definition,
sF11 = set_union2(sF9,sF10),
introduced(definition,[new_symbols(definition,[sF11])],[function_definition]) ).
fof(f84,plain,
set_union2(sF9,sF10) = sF11,
inference(reorient_equations,[],[f83]) ).
fof(f85,plain,
sF6 != sF11,
inference(definition_folding,[],[f64,f84,f82,f76,f78,f80,f78,f76,f74]) ).
fof(f86,plain,
in(sK4,sF6),
inference(superposition,[],[f69,f74]) ).
fof(f87,plain,
in(sK5,sF6),
inference(superposition,[],[f71,f74]) ).
fof(f88,plain,
! [X0] :
( ~ in(X0,sF7)
| sK4 = X0 ),
inference(superposition,[],[f67,f76]) ).
fof(f89,plain,
! [X0] :
( ~ in(X0,sF8)
| sK5 = X0 ),
inference(superposition,[],[f67,f78]) ).
fof(f92,plain,
! [X0] :
( in(X0,set_union2(set_difference(sF7,sF8),sF10))
| in(X0,sF8)
| ~ in(X0,sF7) ),
inference(superposition,[],[f61,f82]) ).
fof(f95,plain,
! [X0] :
( in(X0,set_union2(sF9,sF10))
| in(X0,sF8)
| ~ in(X0,sF7) ),
inference(forward_demodulation,[],[f92,f80]) ).
fof(f98,plain,
! [X0] :
( ~ in(X0,sF7)
| in(X0,sF8)
| in(X0,sF11) ),
inference(forward_demodulation,[],[f95,f84]) ).
fof(f101,plain,
in(sK4,sF7),
inference(superposition,[],[f66,f76]) ).
fof(f102,plain,
in(sK5,sF8),
inference(superposition,[],[f66,f78]) ).
fof(f105,plain,
! [X0] :
( in(X0,set_union2(set_difference(sF7,sF8),sF10))
| in(X0,sF7)
| ~ in(X0,sF8) ),
inference(superposition,[],[f60,f82]) ).
fof(f108,plain,
! [X0] :
( in(X0,set_union2(sF9,sF10))
| in(X0,sF7)
| ~ in(X0,sF8) ),
inference(forward_demodulation,[],[f105,f80]) ).
fof(f111,plain,
! [X0] :
( ~ in(X0,sF8)
| in(X0,sF7)
| in(X0,sF11) ),
inference(forward_demodulation,[],[f108,f84]) ).
fof(f117,plain,
! [X0] :
( ~ in(X0,set_union2(set_difference(sF7,sF8),sF10))
| in(X0,sF7)
| in(X0,sF8) ),
inference(superposition,[],[f63,f82]) ).
fof(f122,plain,
! [X0] :
( ~ in(X0,set_union2(sF9,sF10))
| in(X0,sF7)
| in(X0,sF8) ),
inference(forward_demodulation,[],[f117,f80]) ).
fof(f125,plain,
! [X0] :
( ~ in(X0,sF11)
| in(X0,sF7)
| in(X0,sF8) ),
inference(forward_demodulation,[],[f122,f84]) ).
fof(f129,plain,
! [X0] :
( ~ in(X0,sF6)
| sK5 = X0
| sK4 = X0 ),
inference(superposition,[],[f72,f74]) ).
fof(f132,plain,
( in(sK4,sF8)
| in(sK4,sF11) ),
inference(resolution,[],[f101,f98]) ).
fof(f135,definition,
( spl12_1
<=> in(sK4,sF11) ),
introduced(definition,[new_symbols(definition,[spl12_1])],[avatar_definition]) ).
fof(f137,plain,
( in(sK4,sF11)
| ~ spl12_1 ),
inference(avatar_component_clause,[],[f135]) ).
fof(f139,definition,
( spl12_2
<=> in(sK4,sF8) ),
introduced(definition,[new_symbols(definition,[spl12_2])],[avatar_definition]) ).
fof(f141,plain,
( in(sK4,sF8)
| ~ spl12_2 ),
inference(avatar_component_clause,[],[f139]) ).
fof(f142,plain,
( spl12_1
| spl12_2 ),
inference(avatar_split_clause,[],[f132,f139,f135]) ).
fof(f144,plain,
( sK4 = sK5
| ~ spl12_2 ),
inference(resolution,[],[f141,f89]) ).
fof(f145,plain,
( $false
| ~ spl12_2 ),
inference(forward_subsumption_resolution,[],[f144,f57]) ).
fof(f146,plain,
~ spl12_2,
inference(avatar_contradiction_clause,[],[f145]) ).
fof(f160,plain,
( in(sK5,sF7)
| in(sK5,sF11) ),
inference(resolution,[],[f102,f111]) ).
fof(f163,definition,
( spl12_3
<=> in(sK5,sF11) ),
introduced(definition,[new_symbols(definition,[spl12_3])],[avatar_definition]) ).
fof(f165,plain,
( in(sK5,sF11)
| ~ spl12_3 ),
inference(avatar_component_clause,[],[f163]) ).
fof(f167,definition,
( spl12_4
<=> in(sK5,sF7) ),
introduced(definition,[new_symbols(definition,[spl12_4])],[avatar_definition]) ).
fof(f169,plain,
( in(sK5,sF7)
| ~ spl12_4 ),
inference(avatar_component_clause,[],[f167]) ).
fof(f170,plain,
( spl12_3
| spl12_4 ),
inference(avatar_split_clause,[],[f160,f167,f163]) ).
fof(f172,plain,
( sK4 = sK5
| ~ spl12_4 ),
inference(resolution,[],[f169,f88]) ).
fof(f173,plain,
( $false
| ~ spl12_4 ),
inference(forward_subsumption_resolution,[],[f172,f57]) ).
fof(f174,plain,
~ spl12_4,
inference(avatar_contradiction_clause,[],[f173]) ).
fof(f245,plain,
! [X0,X1] :
( sK5 = sK1(X0,X1,sF6)
| sK1(X0,X1,sF6) = X1
| sK1(X0,X1,sF6) = X0
| unordered_pair(X0,X1) = sF6
| sK4 = sK1(X0,X1,sF6) ),
inference(resolution,[],[f44,f129]) ).
fof(f251,plain,
! [X0,X1] :
( in(sK1(X0,X1,sF11),sF8)
| sK1(X0,X1,sF11) = X1
| unordered_pair(X0,X1) = sF11
| in(sK1(X0,X1,sF11),sF7)
| sK1(X0,X1,sF11) = X0 ),
inference(resolution,[],[f44,f125]) ).
fof(f305,plain,
! [X0,X1] :
( X0 != X0
| unordered_pair(X0,X1) = sF6
| ~ in(X0,sF6)
| sK5 = sK1(X0,X1,sF6)
| sK1(X0,X1,sF6) = X1
| unordered_pair(X0,X1) = sF6
| sK4 = sK1(X0,X1,sF6) ),
inference(superposition,[],[f46,f245]) ).
fof(f325,plain,
! [X0,X1] :
( X0 != X0
| unordered_pair(X0,X1) = sF6
| ~ in(X0,sF6)
| sK5 = sK1(X0,X1,sF6)
| sK1(X0,X1,sF6) = X1
| sK4 = sK1(X0,X1,sF6) ),
inference(duplicate_literal_removal,[],[f305]) ).
fof(f326,plain,
! [X0,X1] :
( ~ in(X0,sF6)
| unordered_pair(X0,X1) = sF6
| sK5 = sK1(X0,X1,sF6)
| sK1(X0,X1,sF6) = X1
| sK4 = sK1(X0,X1,sF6) ),
inference(trivial_inequality_removal,[],[f325]) ).
fof(f343,definition,
( spl12_7
<=> sK4 = sK1(sK5,sK4,sF6) ),
introduced(definition,[new_symbols(definition,[spl12_7])],[avatar_definition]) ).
fof(f344,plain,
( sK4 != sK1(sK5,sK4,sF6)
| spl12_7 ),
inference(avatar_component_clause,[],[f343]) ).
fof(f345,plain,
( sK4 = sK1(sK5,sK4,sF6)
| ~ spl12_7 ),
inference(avatar_component_clause,[],[f343]) ).
fof(f351,definition,
( spl12_9
<=> sF6 = unordered_pair(sK5,sK4) ),
introduced(definition,[new_symbols(definition,[spl12_9])],[avatar_definition]) ).
fof(f352,plain,
( sF6 != unordered_pair(sK5,sK4)
| spl12_9 ),
inference(avatar_component_clause,[],[f351]) ).
fof(f353,plain,
( sF6 = unordered_pair(sK5,sK4)
| ~ spl12_9 ),
inference(avatar_component_clause,[],[f351]) ).
fof(f380,plain,
( sK4 != sK4
| sF6 = unordered_pair(sK5,sK4)
| ~ in(sK4,sF6)
| ~ spl12_7 ),
inference(superposition,[],[f45,f345]) ).
fof(f381,plain,
( sF6 = unordered_pair(sK5,sK4)
| ~ in(sK4,sF6)
| ~ spl12_7 ),
inference(trivial_inequality_removal,[],[f380]) ).
fof(f382,plain,
( sF6 = unordered_pair(sK5,sK4)
| ~ spl12_7 ),
inference(forward_subsumption_resolution,[],[f381,f86]) ).
fof(f383,plain,
( spl12_9
| ~ spl12_7 ),
inference(avatar_split_clause,[],[f382,f343,f351]) ).
fof(f415,plain,
! [X0] :
( sK5 = sK1(sK5,X0,sF6)
| sK1(sK5,X0,sF6) = X0
| sF6 = unordered_pair(sK5,X0)
| sK4 = sK1(sK5,X0,sF6) ),
inference(resolution,[],[f326,f87]) ).
fof(f417,plain,
! [X0] :
( sK5 != sK5
| sF6 = unordered_pair(sK5,X0)
| ~ in(sK5,sF6)
| sK1(sK5,X0,sF6) = X0
| sF6 = unordered_pair(sK5,X0)
| sK4 = sK1(sK5,X0,sF6) ),
inference(superposition,[],[f46,f415]) ).
fof(f429,plain,
! [X0] :
( sK5 != sK5
| sF6 = unordered_pair(sK5,X0)
| ~ in(sK5,sF6)
| sK1(sK5,X0,sF6) = X0
| sK4 = sK1(sK5,X0,sF6) ),
inference(duplicate_literal_removal,[],[f417]) ).
fof(f430,plain,
! [X0] :
( sF6 = unordered_pair(sK5,X0)
| ~ in(sK5,sF6)
| sK1(sK5,X0,sF6) = X0
| sK4 = sK1(sK5,X0,sF6) ),
inference(trivial_inequality_removal,[],[f429]) ).
fof(f432,plain,
! [X0] :
( sK4 = sK1(sK5,X0,sF6)
| sK1(sK5,X0,sF6) = X0
| sF6 = unordered_pair(sK5,X0) ),
inference(forward_subsumption_resolution,[],[f430,f87]) ).
fof(f440,plain,
! [X0] :
( X0 != X0
| sF6 = unordered_pair(sK5,X0)
| ~ in(X0,sF6)
| sK4 = sK1(sK5,X0,sF6)
| sF6 = unordered_pair(sK5,X0) ),
inference(superposition,[],[f45,f432]) ).
fof(f443,plain,
! [X0] :
( X0 != X0
| sF6 = unordered_pair(sK5,X0)
| ~ in(X0,sF6)
| sK4 = sK1(sK5,X0,sF6) ),
inference(duplicate_literal_removal,[],[f440]) ).
fof(f444,plain,
! [X0] :
( ~ in(X0,sF6)
| sF6 = unordered_pair(sK5,X0)
| sK4 = sK1(sK5,X0,sF6) ),
inference(trivial_inequality_removal,[],[f443]) ).
fof(f453,plain,
( sF6 = unordered_pair(sK5,sK4)
| sK4 = sK1(sK5,sK4,sF6) ),
inference(resolution,[],[f444,f86]) ).
fof(f484,plain,
! [X0,X1] :
( in(sK1(X0,X1,sF11),sF7)
| unordered_pair(X0,X1) = sF11
| sK1(X0,X1,sF11) = X1
| sK1(X0,X1,sF11) = X0
| sK5 = sK1(X0,X1,sF11) ),
inference(resolution,[],[f251,f89]) ).
fof(f487,plain,
! [X0,X1] :
( sK5 = sK1(X0,X1,sF11)
| sK1(X0,X1,sF11) = X1
| sK1(X0,X1,sF11) = X0
| unordered_pair(X0,X1) = sF11
| sK4 = sK1(X0,X1,sF11) ),
inference(resolution,[],[f484,f88]) ).
fof(f494,plain,
! [X0,X1] :
( X0 != X0
| unordered_pair(X0,X1) = sF11
| ~ in(X0,sF11)
| sK5 = sK1(X0,X1,sF11)
| sK1(X0,X1,sF11) = X1
| unordered_pair(X0,X1) = sF11
| sK4 = sK1(X0,X1,sF11) ),
inference(superposition,[],[f46,f487]) ).
fof(f506,plain,
! [X0,X1] :
( X0 != X0
| unordered_pair(X0,X1) = sF11
| ~ in(X0,sF11)
| sK5 = sK1(X0,X1,sF11)
| sK1(X0,X1,sF11) = X1
| sK4 = sK1(X0,X1,sF11) ),
inference(duplicate_literal_removal,[],[f494]) ).
fof(f507,plain,
! [X0,X1] :
( ~ in(X0,sF11)
| unordered_pair(X0,X1) = sF11
| sK5 = sK1(X0,X1,sF11)
| sK1(X0,X1,sF11) = X1
| sK4 = sK1(X0,X1,sF11) ),
inference(trivial_inequality_removal,[],[f506]) ).
fof(f517,plain,
( ! [X0] :
( sK5 = sK1(sK5,X0,sF11)
| sK1(sK5,X0,sF11) = X0
| sF11 = unordered_pair(sK5,X0)
| sK4 = sK1(sK5,X0,sF11) )
| ~ spl12_3 ),
inference(resolution,[],[f507,f165]) ).
fof(f535,plain,
( ! [X0] :
( sK5 != sK5
| sF11 = unordered_pair(sK5,X0)
| ~ in(sK5,sF11)
| sK1(sK5,X0,sF11) = X0
| sF11 = unordered_pair(sK5,X0)
| sK4 = sK1(sK5,X0,sF11) )
| ~ spl12_3 ),
inference(superposition,[],[f46,f517]) ).
fof(f547,plain,
( ! [X0] :
( sK5 != sK5
| sF11 = unordered_pair(sK5,X0)
| ~ in(sK5,sF11)
| sK1(sK5,X0,sF11) = X0
| sK4 = sK1(sK5,X0,sF11) )
| ~ spl12_3 ),
inference(duplicate_literal_removal,[],[f535]) ).
fof(f548,plain,
( ! [X0] :
( sF11 = unordered_pair(sK5,X0)
| ~ in(sK5,sF11)
| sK1(sK5,X0,sF11) = X0
| sK4 = sK1(sK5,X0,sF11) )
| ~ spl12_3 ),
inference(trivial_inequality_removal,[],[f547]) ).
fof(f549,plain,
( ! [X0] :
( sK4 = sK1(sK5,X0,sF11)
| sK1(sK5,X0,sF11) = X0
| sF11 = unordered_pair(sK5,X0) )
| ~ spl12_3 ),
inference(forward_subsumption_resolution,[],[f548,f165]) ).
fof(f558,plain,
( ! [X0] :
( X0 != X0
| sF11 = unordered_pair(sK5,X0)
| ~ in(X0,sF11)
| sK4 = sK1(sK5,X0,sF11)
| sF11 = unordered_pair(sK5,X0) )
| ~ spl12_3 ),
inference(superposition,[],[f45,f549]) ).
fof(f561,plain,
( ! [X0] :
( X0 != X0
| sF11 = unordered_pair(sK5,X0)
| ~ in(X0,sF11)
| sK4 = sK1(sK5,X0,sF11) )
| ~ spl12_3 ),
inference(duplicate_literal_removal,[],[f558]) ).
fof(f562,plain,
( ! [X0] :
( ~ in(X0,sF11)
| sF11 = unordered_pair(sK5,X0)
| sK4 = sK1(sK5,X0,sF11) )
| ~ spl12_3 ),
inference(trivial_inequality_removal,[],[f561]) ).
fof(f572,plain,
( sF11 = unordered_pair(sK5,sK4)
| sK4 = sK1(sK5,sK4,sF11)
| ~ spl12_1
| ~ spl12_3 ),
inference(resolution,[],[f562,f137]) ).
fof(f583,plain,
( sF6 = sF11
| sK4 = sK1(sK5,sK4,sF11)
| ~ spl12_1
| ~ spl12_3
| ~ spl12_9 ),
inference(forward_demodulation,[],[f572,f353]) ).
fof(f584,plain,
( sK4 = sK1(sK5,sK4,sF11)
| ~ spl12_1
| ~ spl12_3
| ~ spl12_9 ),
inference(forward_subsumption_resolution,[],[f583,f85]) ).
fof(f587,plain,
( sK4 != sK4
| sF11 = unordered_pair(sK5,sK4)
| ~ in(sK4,sF11)
| ~ spl12_1
| ~ spl12_3
| ~ spl12_9 ),
inference(superposition,[],[f45,f584]) ).
fof(f588,plain,
( sF11 = unordered_pair(sK5,sK4)
| ~ in(sK4,sF11)
| ~ spl12_1
| ~ spl12_3
| ~ spl12_9 ),
inference(trivial_inequality_removal,[],[f587]) ).
fof(f590,plain,
( sF11 = unordered_pair(sK5,sK4)
| ~ spl12_1
| ~ spl12_3
| ~ spl12_9 ),
inference(forward_subsumption_resolution,[],[f588,f137]) ).
fof(f591,plain,
( sF6 = sF11
| ~ spl12_1
| ~ spl12_3
| ~ spl12_9 ),
inference(forward_demodulation,[],[f590,f353]) ).
fof(f592,plain,
( $false
| ~ spl12_1
| ~ spl12_3
| ~ spl12_9 ),
inference(forward_subsumption_resolution,[],[f591,f85]) ).
fof(f593,plain,
( ~ spl12_1
| ~ spl12_3
| ~ spl12_9 ),
inference(avatar_contradiction_clause,[],[f592]) ).
fof(f594,plain,
( sK4 = sK1(sK5,sK4,sF6)
| spl12_9 ),
inference(forward_subsumption_resolution,[],[f453,f352]) ).
fof(f604,plain,
( $false
| spl12_7
| spl12_9 ),
inference(forward_subsumption_resolution,[],[f594,f344]) ).
fof(f605,plain,
( spl12_7
| spl12_9 ),
inference(avatar_contradiction_clause,[],[f604]) ).
cnf(s1,plain,
( spl12_1
| spl12_2 ),
inference(sat_conversion,[],[f142]) ).
cnf(s2,plain,
~ spl12_2,
inference(sat_conversion,[],[f146]) ).
cnf(s3,plain,
( spl12_3
| spl12_4 ),
inference(sat_conversion,[],[f170]) ).
cnf(s4,plain,
~ spl12_4,
inference(sat_conversion,[],[f174]) ).
cnf(s10,plain,
( ~ spl12_7
| spl12_9 ),
inference(sat_conversion,[],[f383]) ).
cnf(s13,plain,
( ~ spl12_1
| ~ spl12_3
| ~ spl12_9 ),
inference(sat_conversion,[],[f593]) ).
cnf(s15,plain,
( spl12_7
| spl12_9 ),
inference(sat_conversion,[],[f605]) ).
cnf(s17,plain,
spl12_3,
inference(rat,[],[s3,s4]) ).
cnf(s18,plain,
spl12_1,
inference(rat,[],[s1,s2]) ).
cnf(s19,plain,
~ spl12_9,
inference(rat,[],[s13,s17,s18]) ).
cnf(s20,plain,
spl12_7,
inference(rat,[],[s15,s19]) ).
cnf(s21,plain,
$false,
inference(rat,[],[s10,s19,s20]) ).
fof(f606,plain,
$false,
inference(avatar_sat_refutation,[],[s21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET888+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n014.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:06:31 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
% 6.98/1.94 % (1399315)Detected formulas, will run a generic FOF schedule.
% 6.98/1.94 % (1399323)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=28729066:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 6.98/1.94 % (1399323)Refutation not found, incomplete strategy
% 6.98/1.94 % (1399323)------------------------------
% 6.98/1.94 % (1399323)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.98/1.94 % (1399323)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.98/1.94 % (1399323)CaDiCaL version: 2.1.3
% 6.98/1.94 % (1399323)Termination reason: Refutation not found, incomplete strategy
% 6.98/1.94 % (1399323)Time elapsed: 0.001 s
% 6.98/1.94 % (1399323)Peak memory usage: 88 MB
% 6.98/1.94 % (1399323)Instructions burned: 1 (million)
% 6.98/1.94 % (1399322)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=556377509:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 6.98/1.94 % (1399326)dis-21_1_sil=8000:lcm=predicate:random_seed=715023585: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)
% 6.98/1.94 % (1399320)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=2256890232:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 6.98/1.94 % (1399321)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=398176115:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 6.98/1.94 % (1399324)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3396110763:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 6.98/1.94 % (1399325)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3045027785:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 6.98/1.94 % (1399324)Instruction limit reached!
% 6.98/1.94 % (1399324)------------------------------
% 6.98/1.94 % (1399324)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.98/1.94 % (1399324)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.98/1.94 % (1399324)CaDiCaL version: 2.1.3
% 6.98/1.94 % (1399324)Termination reason: Instruction limit
% 6.98/1.94 % (1399324)Termination phase: Saturation
% 6.98/1.94 % (1399324)Time elapsed: 0.071 s
% 6.98/1.94 % (1399324)Peak memory usage: 88 MB
% 6.98/1.94 % (1399324)Instructions burned: 120 (million)
% 6.98/1.94 % (1399326)Instruction limit reached!
% 6.98/1.94 % (1399326)------------------------------
% 6.98/1.94 % (1399326)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.98/1.94 % (1399326)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.98/1.94 % (1399326)CaDiCaL version: 2.1.3
% 6.98/1.94 % (1399326)Termination reason: Instruction limit
% 6.98/1.94 % (1399326)Termination phase: Saturation
% 6.98/1.94 % (1399326)Time elapsed: 0.076 s
% 6.98/1.94 % (1399326)Peak memory usage: 89 MB
% 6.98/1.94 % (1399326)Instructions burned: 131 (million)
% 6.98/1.94 % (1399323)------------------------------
% 6.98/1.94 % (1399323)------------------------------
% 6.98/1.94 % (1399325)Instruction limit reached!
% 6.98/1.94 % (1399325)------------------------------
% 6.98/1.94 % (1399325)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.98/1.94 % (1399325)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.98/1.94 % (1399325)CaDiCaL version: 2.1.3
% 6.98/1.94 % (1399325)Termination reason: Instruction limit
% 6.98/1.94 % (1399325)Termination phase: Saturation
% 6.98/1.94 % (1399325)Time elapsed: 0.088 s
% 6.98/1.94 % (1399325)Peak memory usage: 89 MB
% 6.98/1.94 % (1399325)Instructions burned: 139 (million)
% 6.98/1.94 % (1399336)lrs+1011_1_sil=32000:sp=occurrence:random_seed=3537015776:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 6.98/1.94 % (1399334)lrs+10_1_sil=8000:sp=occurrence:random_seed=54123334:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 6.98/1.94 % (1399335)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3598029871:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 6.98/1.94 % (1399337)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=740164773:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 6.98/1.94 % (1399335)Instruction limit reached!
% 6.98/1.94 % (1399335)------------------------------
% 6.98/1.94 % (1399335)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.98/1.94 % (1399335)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.98/1.94 % (1399335)CaDiCaL version: 2.1.3
% 6.98/1.94 % (1399335)Termination reason: Instruction limit
% 6.98/1.94 % (1399335)Termination phase: Saturation
% 6.98/1.94 % (1399335)Time elapsed: 0.083 s
% 6.98/1.94 % (1399335)Peak memory usage: 90 MB
% 6.98/1.94 % (1399335)Instructions burned: 157 (million)
% 6.98/1.94 % (1399336)Instruction limit reached!
% 6.98/1.94 % (1399336)------------------------------
% 6.98/1.94 % (1399336)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.98/1.94 % (1399336)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.98/1.94 % (1399336)CaDiCaL version: 2.1.3
% 6.98/1.94 % (1399336)Termination reason: Instruction limit
% 6.98/1.94 % (1399336)Termination phase: Saturation
% 6.98/1.94 % (1399336)Time elapsed: 0.105 s
% 6.98/1.94 % (1399336)Peak memory usage: 90 MB
% 6.98/1.94 % (1399336)Instructions burned: 329 (million)
% 6.98/1.94 % (1399334)Instruction limit reached!
% 6.98/1.94 % (1399334)------------------------------
% 6.98/1.94 % (1399334)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.98/1.94 % (1399334)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.98/1.94 % (1399334)CaDiCaL version: 2.1.3
% 6.98/1.94 % (1399334)Termination reason: Instruction limit
% 6.98/1.94 % (1399334)Termination phase: Saturation
% 6.98/1.94 % (1399334)Time elapsed: 0.144 s
% 6.98/1.94 % (1399334)Peak memory usage: 90 MB
% 6.98/1.94 % (1399334)Instructions burned: 285 (million)
% 6.98/1.94 % (1399337)Instruction limit reached!
% 6.98/1.94 % (1399337)------------------------------
% 6.98/1.94 % (1399337)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.98/1.94 % (1399337)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.98/1.94 % (1399337)CaDiCaL version: 2.1.3
% 6.98/1.94 % (1399337)Termination reason: Instruction limit
% 6.98/1.94 % (1399337)Termination phase: Saturation
% 6.98/1.94 % (1399337)Time elapsed: 0.134 s
% 6.98/1.94 % (1399337)Peak memory usage: 91 MB
% 6.98/1.94 % (1399337)Instructions burned: 248 (million)
% 6.98/1.94 % (1399343)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=2851330685:i=2350_2995 on theBenchmark for (2995ds/2350Mi)
% 6.98/1.94 % (1399342)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=2425808148:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 6.98/1.94 % (1399342)Refutation not found, incomplete strategy
% 6.98/1.94 % (1399342)------------------------------
% 6.98/1.94 % (1399342)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.98/1.94 % (1399342)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.98/1.94 % (1399342)CaDiCaL version: 2.1.3
% 6.98/1.94 % (1399342)Termination reason: Refutation not found, incomplete strategy
% 6.98/1.94 % (1399342)Time elapsed: 0.002 s
% 6.98/1.94 % (1399342)Peak memory usage: 88 MB
% 6.98/1.94 % (1399342)Instructions burned: 1 (million)
% 6.98/1.94 % (1399344)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=186242758:cts=off:i=113:fsr=off:ss=included:sgt=4_2994 on theBenchmark for (2994ds/113Mi)
% 6.98/1.94 % (1399345)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=310756180:i=127:av=off:fsr=off:sup=off_2994 on theBenchmark for (2994ds/127Mi)
% 6.98/1.94 % (1399345)Refutation not found, incomplete strategy
% 6.98/1.94 % (1399345)------------------------------
% 6.98/1.94 % (1399345)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.98/1.94 % (1399345)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.98/1.94 % (1399345)CaDiCaL version: 2.1.3
% 6.98/1.94 % (1399345)Termination reason: Refutation not found, incomplete strategy
% 6.98/1.94 % (1399345)Time elapsed: 0.002 s
% 6.98/1.94 % (1399345)Peak memory usage: 88 MB
% 6.98/1.94 % (1399345)Instructions burned: 1 (million)
% 6.98/1.94 % (1399344)Instruction limit reached!
% 6.98/1.94 % (1399344)------------------------------
% 6.98/1.94 % (1399344)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.98/1.94 % (1399344)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.98/1.94 % (1399344)CaDiCaL version: 2.1.3
% 6.98/1.94 % (1399344)Termination reason: Instruction limit
% 6.98/1.94 % (1399344)Termination phase: Saturation
% 6.98/1.94 % (1399344)Time elapsed: 0.071 s
% 6.98/1.94 % (1399344)Peak memory usage: 89 MB
% 6.98/1.94 % (1399344)Instructions burned: 114 (million)
% 6.98/1.94 % (1399320)First to succeed.
% 6.98/1.94 % (1399320)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1399315"
% 6.98/1.94 % (1399342)------------------------------
% 6.98/1.94 % (1399342)------------------------------
% 6.98/1.94 % (1399350)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=3657001428:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2992 on theBenchmark for (2992ds/114Mi)
% 6.98/1.94 % (1399345)------------------------------
% 6.98/1.94 % (1399345)------------------------------
% 6.98/1.94 % (1399350)Instruction limit reached!
% 6.98/1.94 % (1399350)------------------------------
% 6.98/1.94 % (1399350)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.98/1.94 % (1399350)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.98/1.94 % (1399350)CaDiCaL version: 2.1.3
% 6.98/1.94 % (1399350)Termination reason: Instruction limit
% 6.98/1.94 % (1399350)Termination phase: Saturation
% 6.98/1.94 % (1399350)Time elapsed: 0.064 s
% 6.98/1.94 % (1399350)Peak memory usage: 88 MB
% 6.98/1.94 % (1399350)Instructions burned: 115 (million)
% 6.98/1.94 % (1399351)lrs+10_1_sil=8000:sp=occurrence:random_seed=2151965190:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2991 on theBenchmark for (2991ds/907Mi)
% 6.98/1.94 % (1399343)Also succeeded, but the first one will report.
% 6.98/1.94 % (1399320)Refutation found. Thanks to Tanya!
% 6.98/1.94 % SZS status Theorem for theBenchmark
% 6.98/1.94 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/2.14 % (1399320)------------------------------
% 0.17/2.14 % (1399320)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.17/2.14 % (1399320)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/2.14 % (1399320)CaDiCaL version: 2.1.3
% 0.17/2.14 % (1399320)Termination reason: Refutation
% 0.17/2.14 % (1399320)Time elapsed: 0.670 s
% 0.17/2.14 % (1399320)Peak memory usage: 127 MB
% 0.17/2.14 % (1399320)Instructions burned: 991 (million)
% 0.17/2.14 % (1399320)------------------------------
% 0.17/2.14 % (1399320)------------------------------
% 0.17/2.14 % (1399315)Success in time 1.091 s
% 0.17/2.14 % Vampire exiting
%------------------------------------------------------------------------------