%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU154+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n010.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:27 PM UTC 2026
% Result : Theorem 4.49s 1.59s
% Output : Refutation 5.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 14
% Syntax : Number of formulae : 88 ( 17 unt; 7 def)
% Number of atoms : 283 ( 52 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 322 ( 127 ~; 139 |; 39 &)
% ( 14 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 8 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 94 ( 0 sgn 85 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
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(f4,axiom,
! [X0,X1] :
( X1 = singleton(X0)
<=> ! [X2] :
( in(X2,X1)
<=> X2 = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).
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(f13,conjecture,
! [X0,X1] :
( ~ in(X0,X1)
=> disjoint(singleton(X0),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l28_zfmisc_1) ).
fof(f14,negated_conjecture,
~ ! [X0,X1] :
( ~ in(X0,X1)
=> disjoint(singleton(X0),X1) ),
inference(negated_conjecture,[status(cth)],[f13]) ).
fof(f19,axiom,
! [X0] : subset(empty_set,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_xboole_1) ).
fof(f23,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f24,plain,
? [X0,X1] :
( ~ disjoint(singleton(X0),X1)
& ~ in(X0,X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f28,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,[],[f4]) ).
fof(f29,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,[],[f28]) ).
fof(f30,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))],[f29]) ).
fof(f31,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,[],[f23]) ).
fof(f32,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,[],[f31]) ).
fof(f33,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))],[f32]) ).
fof(f34,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(f35,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,[],[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) ) ) )
& ( ! [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,[],[f35]) ).
fof(f37,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))],[f36]) ).
fof(f38,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(f39,plain,
( ~ disjoint(singleton(sK3),sK4)
& ~ in(sK3,sK4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4]),skolemize(X0,sK3),skolemize(X1,sK4)],[f24]) ).
fof(f43,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f47,plain,
! [X3,X0,X1] :
( X0 = X3
| ~ in(X3,X1)
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f30]) ).
fof(f51,plain,
! [X3,X0,X1] :
( in(X3,X1)
| ~ in(X3,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f33]) ).
fof(f57,plain,
! [X2,X0,X1] :
( set_intersection2(X0,X1) = X2
| in(sK2(X0,X1,X2),X1)
| in(sK2(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f37]) ).
fof(f58,plain,
! [X2,X0,X1] :
( set_intersection2(X0,X1) = X2
| in(sK2(X0,X1,X2),X0)
| in(sK2(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f37]) ).
fof(f59,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,[],[f37]) ).
fof(f61,plain,
! [X0,X1] :
( disjoint(X0,X1)
| set_intersection2(X0,X1) != empty_set ),
inference(cnf_transformation,[],[f38]) ).
fof(f64,plain,
~ in(sK3,sK4),
inference(cnf_transformation,[],[f39]) ).
fof(f65,plain,
~ disjoint(singleton(sK3),sK4),
inference(cnf_transformation,[],[f39]) ).
fof(f70,plain,
! [X0] : subset(empty_set,X0),
inference(cnf_transformation,[],[f19]) ).
fof(f75,plain,
! [X3,X0] :
( X0 = X3
| ~ in(X3,singleton(X0)) ),
inference(equality_resolution,[],[f47]) ).
fof(f80,definition,
( spl7_1
<=> disjoint(singleton(sK3),sK4) ),
introduced(definition,[new_symbols(definition,[spl7_1])],[avatar_definition]) ).
fof(f82,plain,
( ~ disjoint(singleton(sK3),sK4)
| spl7_1 ),
inference(avatar_component_clause,[],[f80]) ).
fof(f83,plain,
~ spl7_1,
inference(avatar_split_clause,[],[f65,f80]) ).
fof(f85,plain,
( empty_set != set_intersection2(singleton(sK3),sK4)
| spl7_1 ),
inference(resolution,[],[f82,f61]) ).
fof(f88,plain,
( empty_set != set_intersection2(sK4,singleton(sK3))
| spl7_1 ),
inference(forward_demodulation,[],[f85,f43]) ).
fof(f90,definition,
( spl7_2
<=> in(sK3,sK4) ),
introduced(definition,[new_symbols(definition,[spl7_2])],[avatar_definition]) ).
fof(f92,plain,
( ~ in(sK3,sK4)
| spl7_2 ),
inference(avatar_component_clause,[],[f90]) ).
fof(f93,plain,
~ spl7_2,
inference(avatar_split_clause,[],[f64,f90]) ).
fof(f96,plain,
( ! [X0] :
( ~ in(sK3,X0)
| ~ subset(X0,sK4) )
| spl7_2 ),
inference(resolution,[],[f92,f51]) ).
fof(f98,definition,
( spl7_3
<=> empty_set = set_intersection2(sK4,singleton(sK3)) ),
introduced(definition,[new_symbols(definition,[spl7_3])],[avatar_definition]) ).
fof(f100,plain,
( empty_set != set_intersection2(sK4,singleton(sK3))
| spl7_3 ),
inference(avatar_component_clause,[],[f98]) ).
fof(f101,plain,
( ~ spl7_3
| spl7_1 ),
inference(avatar_split_clause,[],[f88,f80,f98]) ).
fof(f138,definition,
( spl7_7
<=> ! [X0] :
( ~ in(sK3,X0)
| ~ subset(X0,sK4) ) ),
introduced(definition,[new_symbols(definition,[spl7_7])],[avatar_definition]) ).
fof(f139,plain,
( ! [X0] :
( ~ subset(X0,sK4)
| ~ in(sK3,X0) )
| ~ spl7_7 ),
inference(avatar_component_clause,[],[f138]) ).
fof(f140,plain,
( spl7_7
| spl7_2 ),
inference(avatar_split_clause,[],[f96,f90,f138]) ).
fof(f144,plain,
( ~ in(sK3,empty_set)
| ~ spl7_7 ),
inference(resolution,[],[f139,f70]) ).
fof(f164,definition,
( spl7_10
<=> in(sK2(sK4,singleton(sK3),empty_set),empty_set) ),
introduced(definition,[new_symbols(definition,[spl7_10])],[avatar_definition]) ).
fof(f165,plain,
( in(sK2(sK4,singleton(sK3),empty_set),empty_set)
| ~ spl7_10 ),
inference(avatar_component_clause,[],[f164]) ).
fof(f166,plain,
( ~ in(sK2(sK4,singleton(sK3),empty_set),empty_set)
| spl7_10 ),
inference(avatar_component_clause,[],[f164]) ).
fof(f168,definition,
( spl7_11
<=> in(sK2(sK4,singleton(sK3),empty_set),singleton(sK3)) ),
introduced(definition,[new_symbols(definition,[spl7_11])],[avatar_definition]) ).
fof(f169,plain,
( in(sK2(sK4,singleton(sK3),empty_set),singleton(sK3))
| ~ spl7_11 ),
inference(avatar_component_clause,[],[f168]) ).
fof(f176,plain,
( empty_set = set_intersection2(sK4,singleton(sK3))
| in(sK2(sK4,singleton(sK3),empty_set),singleton(sK3))
| spl7_10 ),
inference(resolution,[],[f166,f57]) ).
fof(f184,plain,
( in(sK2(sK4,singleton(sK3),empty_set),singleton(sK3))
| spl7_3
| spl7_10 ),
inference(forward_subsumption_resolution,[],[f176,f100]) ).
fof(f194,plain,
( spl7_11
| spl7_3
| spl7_10 ),
inference(avatar_split_clause,[],[f184,f164,f98,f168]) ).
fof(f197,plain,
( ! [X0] :
( in(sK2(sK4,singleton(sK3),empty_set),X0)
| ~ subset(empty_set,X0) )
| ~ spl7_10 ),
inference(resolution,[],[f165,f51]) ).
fof(f200,plain,
( empty_set = set_intersection2(sK4,singleton(sK3))
| ~ in(sK2(sK4,singleton(sK3),empty_set),sK4)
| ~ in(sK2(sK4,singleton(sK3),empty_set),singleton(sK3))
| ~ spl7_10 ),
inference(resolution,[],[f165,f59]) ).
fof(f203,plain,
( ! [X0] : in(sK2(sK4,singleton(sK3),empty_set),X0)
| ~ spl7_10 ),
inference(forward_subsumption_resolution,[],[f197,f70]) ).
fof(f212,plain,
( ~ in(sK2(sK4,singleton(sK3),empty_set),sK4)
| ~ in(sK2(sK4,singleton(sK3),empty_set),singleton(sK3))
| spl7_3
| ~ spl7_10 ),
inference(forward_subsumption_resolution,[],[f200,f100]) ).
fof(f213,plain,
( ~ in(sK2(sK4,singleton(sK3),empty_set),sK4)
| spl7_3
| ~ spl7_10 ),
inference(forward_subsumption_resolution,[],[f212,f203]) ).
fof(f214,plain,
( $false
| spl7_3
| ~ spl7_10 ),
inference(forward_subsumption_resolution,[],[f213,f203]) ).
fof(f215,plain,
( spl7_3
| ~ spl7_10 ),
inference(avatar_contradiction_clause,[],[f214]) ).
fof(f224,plain,
( sK3 = sK2(sK4,singleton(sK3),empty_set)
| ~ spl7_11 ),
inference(resolution,[],[f169,f75]) ).
fof(f234,definition,
( spl7_13
<=> sK3 = sK2(sK4,singleton(sK3),empty_set) ),
introduced(definition,[new_symbols(definition,[spl7_13])],[avatar_definition]) ).
fof(f236,plain,
( sK3 = sK2(sK4,singleton(sK3),empty_set)
| ~ spl7_13 ),
inference(avatar_component_clause,[],[f234]) ).
fof(f237,plain,
( spl7_13
| ~ spl7_11 ),
inference(avatar_split_clause,[],[f224,f168,f234]) ).
fof(f244,plain,
( in(sK3,sK4)
| empty_set = set_intersection2(sK4,singleton(sK3))
| in(sK3,empty_set)
| ~ spl7_13 ),
inference(superposition,[],[f58,f236]) ).
fof(f250,plain,
( empty_set = set_intersection2(sK4,singleton(sK3))
| in(sK3,empty_set)
| spl7_2
| ~ spl7_13 ),
inference(forward_subsumption_resolution,[],[f244,f92]) ).
fof(f254,plain,
( in(sK3,empty_set)
| spl7_2
| spl7_3
| ~ spl7_13 ),
inference(forward_subsumption_resolution,[],[f250,f100]) ).
fof(f257,plain,
( $false
| spl7_2
| spl7_3
| ~ spl7_7
| ~ spl7_13 ),
inference(forward_subsumption_resolution,[],[f254,f144]) ).
fof(f258,plain,
( spl7_2
| spl7_3
| ~ spl7_7
| ~ spl7_13 ),
inference(avatar_contradiction_clause,[],[f257]) ).
cnf(s1,plain,
~ spl7_1,
inference(sat_conversion,[],[f83]) ).
cnf(s2,plain,
~ spl7_2,
inference(sat_conversion,[],[f93]) ).
cnf(s3,plain,
( spl7_1
| ~ spl7_3 ),
inference(sat_conversion,[],[f101]) ).
cnf(s7,plain,
( spl7_2
| spl7_7 ),
inference(sat_conversion,[],[f140]) ).
cnf(s12,plain,
( spl7_3
| spl7_10
| spl7_11 ),
inference(sat_conversion,[],[f194]) ).
cnf(s15,plain,
( spl7_3
| ~ spl7_10 ),
inference(sat_conversion,[],[f215]) ).
cnf(s17,plain,
( ~ spl7_11
| spl7_13 ),
inference(sat_conversion,[],[f237]) ).
cnf(s20,plain,
( spl7_2
| spl7_3
| ~ spl7_7
| ~ spl7_13 ),
inference(sat_conversion,[],[f258]) ).
cnf(s21,plain,
spl7_7,
inference(rat,[],[s7,s2]) ).
cnf(s26,plain,
~ spl7_3,
inference(rat,[],[s3,s1]) ).
cnf(s27,plain,
~ spl7_13,
inference(rat,[],[s20,s21,s2,s26]) ).
cnf(s28,plain,
~ spl7_10,
inference(rat,[],[s15,s26]) ).
cnf(s30,plain,
~ spl7_11,
inference(rat,[],[s17,s27]) ).
cnf(s31,plain,
$false,
inference(rat,[],[s12,s26,s30,s28]) ).
fof(f259,plain,
$false,
inference(avatar_sat_refutation,[],[s31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU154+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 % Computer : n010.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 28 03:46:47 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/0.41 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.49/1.59 % (1538610)Detected formulas, will run a generic FOF schedule.
% 4.49/1.59 % (1538617)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=322573942:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 4.49/1.59 % (1538616)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=438149798:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 4.49/1.59 % (1538619)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1418262798:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 4.49/1.59 % (1538620)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=725570222:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 4.49/1.59 % (1538618)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3858422831:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 4.49/1.59 % (1538615)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=569056394:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 4.49/1.59 % (1538621)dis-21_1_sil=8000:lcm=predicate:random_seed=3732042018: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)
% 4.49/1.59 % (1538618)Refutation not found, incomplete strategy
% 4.49/1.59 % (1538618)------------------------------
% 4.49/1.59 % (1538618)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.49/1.59 % (1538618)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.49/1.59 % (1538618)CaDiCaL version: 2.1.3
% 4.49/1.59 % (1538618)Termination reason: Refutation not found, incomplete strategy
% 4.49/1.59 % (1538618)Time elapsed: 0.001 s
% 4.49/1.59 % (1538618)Peak memory usage: 88 MB
% 4.49/1.59 % (1538619)Instruction limit reached!
% 4.49/1.59 % (1538619)------------------------------
% 4.49/1.59 % (1538619)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.49/1.59 % (1538619)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.49/1.59 % (1538619)CaDiCaL version: 2.1.3
% 4.49/1.59 % (1538619)Termination reason: Instruction limit
% 4.49/1.59 % (1538619)Termination phase: Saturation
% 4.49/1.59 % (1538619)Time elapsed: 0.070 s
% 4.49/1.59 % (1538619)Peak memory usage: 88 MB
% 4.49/1.59 % (1538619)Instructions burned: 120 (million)
% 4.49/1.59 % (1538621)Instruction limit reached!
% 4.49/1.59 % (1538621)------------------------------
% 4.49/1.59 % (1538621)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.49/1.59 % (1538621)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.49/1.59 % (1538621)CaDiCaL version: 2.1.3
% 4.49/1.59 % (1538621)Termination reason: Instruction limit
% 4.49/1.59 % (1538621)Termination phase: Saturation
% 4.49/1.59 % (1538621)Time elapsed: 0.071 s
% 4.49/1.59 % (1538621)Peak memory usage: 89 MB
% 4.49/1.59 % (1538621)Instructions burned: 130 (million)
% 4.49/1.59 % (1538620)Instruction limit reached!
% 4.49/1.59 % (1538620)------------------------------
% 4.49/1.59 % (1538620)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.49/1.59 % (1538620)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.49/1.59 % (1538620)CaDiCaL version: 2.1.3
% 4.49/1.59 % (1538620)Termination reason: Instruction limit
% 4.49/1.59 % (1538620)Termination phase: Saturation
% 4.49/1.59 % (1538620)Time elapsed: 0.085 s
% 4.49/1.59 % (1538620)Peak memory usage: 89 MB
% 4.49/1.59 % (1538620)Instructions burned: 141 (million)
% 4.49/1.59 % (1538629)lrs+10_1_sil=8000:sp=occurrence:random_seed=3674862093:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 4.49/1.59 % (1538630)lrs+10_1_sil=32000:urr=on:br=off:random_seed=937377111:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 4.49/1.59 % (1538631)lrs+1011_1_sil=32000:sp=occurrence:random_seed=3282078234:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 4.49/1.59 % (1538618)------------------------------
% 4.49/1.59 % (1538618)------------------------------
% 4.49/1.59 % (1538630)Instruction limit reached!
% 4.49/1.59 % (1538630)------------------------------
% 4.49/1.59 % (1538630)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.49/1.59 % (1538630)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.49/1.59 % (1538630)CaDiCaL version: 2.1.3
% 4.49/1.59 % (1538630)Termination reason: Instruction limit
% 4.49/1.59 % (1538630)Termination phase: Saturation
% 4.49/1.59 % (1538630)Time elapsed: 0.080 s
% 4.49/1.59 % (1538630)Peak memory usage: 88 MB
% 4.49/1.59 % (1538630)Instructions burned: 158 (million)
% 4.49/1.59 % (1538617)First to succeed.
% 4.49/1.59 % (1538617)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1538610"
% 4.49/1.59 % (1538629)Instruction limit reached!
% 4.49/1.59 % (1538629)------------------------------
% 4.49/1.59 % (1538629)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.49/1.59 % (1538629)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.49/1.59 % (1538629)CaDiCaL version: 2.1.3
% 4.49/1.59 % (1538629)Termination reason: Instruction limit
% 4.49/1.59 % (1538629)Termination phase: Saturation
% 4.49/1.59 % (1538629)Time elapsed: 0.163 s
% 4.49/1.59 % (1538629)Peak memory usage: 90 MB
% 4.49/1.59 % (1538629)Instructions burned: 285 (million)
% 4.49/1.59 % (1538635)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=1971055090:s2a=on:i=248:s2at=1.23:gtg=position_2995 on theBenchmark for (2995ds/248Mi)
% 4.49/1.59 % (1538631)Instruction limit reached!
% 4.49/1.59 % (1538631)------------------------------
% 4.49/1.59 % (1538631)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.49/1.59 % (1538631)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.49/1.59 % (1538631)CaDiCaL version: 2.1.3
% 4.49/1.59 % (1538631)Termination reason: Instruction limit
% 4.49/1.59 % (1538631)Termination phase: Saturation
% 4.49/1.59 % (1538631)Time elapsed: 0.194 s
% 4.49/1.59 % (1538631)Peak memory usage: 90 MB
% 4.49/1.59 % (1538631)Instructions burned: 325 (million)
% 4.49/1.59 % (1538636)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=722195396:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 4.49/1.59 % (1538636)Refutation not found, incomplete strategy
% 4.49/1.59 % (1538636)------------------------------
% 4.49/1.59 % (1538636)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.49/1.59 % (1538636)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.49/1.59 % (1538636)CaDiCaL version: 2.1.3
% 4.49/1.59 % (1538636)Termination reason: Refutation not found, incomplete strategy
% 4.49/1.59 % (1538636)Time elapsed: 0.002 s
% 4.49/1.59 % (1538636)Peak memory usage: 88 MB
% 4.49/1.59 % (1538636)Instructions burned: 1 (million)
% 4.49/1.59 % (1538635)Instruction limit reached!
% 4.49/1.59 % (1538635)------------------------------
% 4.49/1.59 % (1538635)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.49/1.59 % (1538635)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.49/1.59 % (1538635)CaDiCaL version: 2.1.3
% 4.49/1.59 % (1538635)Termination reason: Instruction limit
% 4.49/1.59 % (1538635)Termination phase: Saturation
% 4.49/1.59 % (1538635)Time elapsed: 0.149 s
% 4.49/1.59 % (1538635)Peak memory usage: 90 MB
% 4.49/1.59 % (1538635)Instructions burned: 249 (million)
% 4.49/1.59 % (1538617)Refutation found. Thanks to Tanya!
% 4.49/1.59 % SZS status Theorem for theBenchmark
% 4.49/1.59 % SZS output start Proof for theBenchmark
% See solution above
% 5.61/1.69 % (1538617)------------------------------
% 5.61/1.69 % (1538617)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.61/1.69 % (1538617)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.61/1.69 % (1538617)CaDiCaL version: 2.1.3
% 5.61/1.69 % (1538617)Termination reason: Refutation
% 5.61/1.69 % (1538617)Time elapsed: 0.390 s
% 5.61/1.69 % (1538617)Peak memory usage: 129 MB
% 5.61/1.69 % (1538617)Instructions burned: 928 (million)
% 5.61/1.69 % (1538617)------------------------------
% 5.61/1.69 % (1538617)------------------------------
% 5.61/1.69 % (1538610)Success in time 0.729 s
% 5.61/1.69 % Vampire exiting
%------------------------------------------------------------------------------