%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET169+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n001.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:40:22 PM UTC 2026
% Result : Theorem 2.71s 1.27s
% Output : Refutation 3.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of formulae : 101 ( 13 unt; 9 def)
% Number of atoms : 257 ( 15 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 270 ( 114 ~; 125 |; 18 &)
% ( 13 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 12 ( 10 usr; 9 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 69 ( 0 sgn 64 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2] :
( member(X2,union(X0,X1))
<=> ( member(X2,X0)
| member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union_defn) ).
fof(f2,axiom,
! [X0,X1,X2] :
( member(X2,intersection(X0,X1))
<=> ( member(X2,X0)
& member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_defn) ).
fof(f8,axiom,
! [X0,X1] :
( X0 = X1
<=> ! [X2] :
( member(X2,X0)
<=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_member_defn) ).
fof(f9,conjecture,
! [X0,X1,X2] : intersection(X0,union(X1,X2)) = union(intersection(X0,X1),intersection(X0,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_intersection_distributes_over_union) ).
fof(f10,negated_conjecture,
~ ! [X0,X1,X2] : intersection(X0,union(X1,X2)) = union(intersection(X0,X1),intersection(X0,X2)),
inference(negated_conjecture,[status(cth)],[f9]) ).
fof(f12,plain,
? [X0,X1,X2] : intersection(X0,union(X1,X2)) != union(intersection(X0,X1),intersection(X0,X2)),
inference(ennf_transformation,[],[f10]) ).
fof(f13,plain,
! [X0,X1,X2] :
( ( member(X2,union(X0,X1))
| ( ~ member(X2,X0)
& ~ member(X2,X1) ) )
& ( member(X2,X0)
| member(X2,X1)
| ~ member(X2,union(X0,X1)) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f14,plain,
! [X0,X1,X2] :
( ( member(X2,union(X0,X1))
| ( ~ member(X2,X0)
& ~ member(X2,X1) ) )
& ( member(X2,X0)
| member(X2,X1)
| ~ member(X2,union(X0,X1)) ) ),
inference(flattening,[],[f13]) ).
fof(f15,plain,
! [X0,X1,X2] :
( ( member(X2,intersection(X0,X1))
| ~ member(X2,X0)
| ~ member(X2,X1) )
& ( ( member(X2,X0)
& member(X2,X1) )
| ~ member(X2,intersection(X0,X1)) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f16,plain,
! [X0,X1,X2] :
( ( member(X2,intersection(X0,X1))
| ~ member(X2,X0)
| ~ member(X2,X1) )
& ( ( member(X2,X0)
& member(X2,X1) )
| ~ member(X2,intersection(X0,X1)) ) ),
inference(flattening,[],[f15]) ).
fof(f22,plain,
! [X0,X1] :
( ( X0 = X1
| ? [X2] :
( ( ~ member(X2,X1)
| ~ member(X2,X0) )
& ( member(X2,X1)
| member(X2,X0) ) ) )
& ( ! [X2] :
( ( member(X2,X0)
| ~ member(X2,X1) )
& ( member(X2,X1)
| ~ member(X2,X0) ) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f23,plain,
! [X0,X1] :
( ( X0 = X1
| ? [X2] :
( ( ~ member(X2,X1)
| ~ member(X2,X0) )
& ( member(X2,X1)
| member(X2,X0) ) ) )
& ( ! [X3] :
( ( member(X3,X0)
| ~ member(X3,X1) )
& ( member(X3,X1)
| ~ member(X3,X0) ) )
| X0 != X1 ) ),
inference(rectify,[],[f22]) ).
fof(f24,plain,
! [X0,X1] :
( ( X0 = X1
| ( ( ~ member(sK1(X0,X1),X1)
| ~ member(sK1(X0,X1),X0) )
& ( member(sK1(X0,X1),X1)
| member(sK1(X0,X1),X0) ) ) )
& ( ! [X3] :
( ( member(X3,X0)
| ~ member(X3,X1) )
& ( member(X3,X1)
| ~ member(X3,X0) ) )
| X0 != X1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X2,sK1(X0,X1))],[f23]) ).
fof(f25,plain,
intersection(sK2,union(sK3,sK4)) != union(intersection(sK2,sK3),intersection(sK2,sK4)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4]),skolemize(X0,sK2),skolemize(X1,sK3),skolemize(X2,sK4)],[f12]) ).
fof(f26,plain,
! [X2,X0,X1] :
( ~ member(X2,union(X0,X1))
| member(X2,X1)
| member(X2,X0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f27,plain,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f28,plain,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f29,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X0,X1))
| member(X2,X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f30,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X0,X1))
| member(X2,X0) ),
inference(cnf_transformation,[],[f16]) ).
fof(f31,plain,
! [X2,X0,X1] :
( member(X2,intersection(X0,X1))
| ~ member(X2,X0)
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f43,plain,
! [X0,X1] :
( X0 = X1
| member(sK1(X0,X1),X1)
| member(sK1(X0,X1),X0) ),
inference(cnf_transformation,[],[f24]) ).
fof(f44,plain,
! [X0,X1] :
( X0 = X1
| ~ member(sK1(X0,X1),X1)
| ~ member(sK1(X0,X1),X0) ),
inference(cnf_transformation,[],[f24]) ).
fof(f45,plain,
intersection(sK2,union(sK3,sK4)) != union(intersection(sK2,sK3),intersection(sK2,sK4)),
inference(cnf_transformation,[],[f25]) ).
fof(f50,definition,
! [X0,X1] :
( sQ5_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(definition,[new_symbols(definition,[sQ5_eqProxy])],[equality_proxy_definition]) ).
fof(f54,plain,
! [X0,X1] :
( sQ5_eqProxy(X0,X1)
| ~ member(sK1(X0,X1),X1)
| ~ member(sK1(X0,X1),X0) ),
inference(equality_proxy_replacement,[],[f44,f50]) ).
fof(f55,plain,
! [X0,X1] :
( sQ5_eqProxy(X0,X1)
| member(sK1(X0,X1),X1)
| member(sK1(X0,X1),X0) ),
inference(equality_proxy_replacement,[],[f43,f50]) ).
fof(f56,plain,
~ sQ5_eqProxy(intersection(sK2,union(sK3,sK4)),union(intersection(sK2,sK3),intersection(sK2,sK4))),
inference(equality_proxy_replacement,[],[f45,f50]) ).
fof(f118,plain,
( ~ member(sK1(intersection(sK2,union(sK3,sK4)),union(intersection(sK2,sK3),intersection(sK2,sK4))),union(intersection(sK2,sK3),intersection(sK2,sK4)))
| ~ member(sK1(intersection(sK2,union(sK3,sK4)),union(intersection(sK2,sK3),intersection(sK2,sK4))),intersection(sK2,union(sK3,sK4))) ),
inference(resolution,[],[f54,f56]) ).
fof(f128,definition,
( spl6_11
<=> member(sK1(intersection(sK2,union(sK3,sK4)),union(intersection(sK2,sK3),intersection(sK2,sK4))),intersection(sK2,union(sK3,sK4))) ),
introduced(definition,[new_symbols(definition,[spl6_11])],[avatar_definition]) ).
fof(f129,plain,
( ~ member(sK1(intersection(sK2,union(sK3,sK4)),union(intersection(sK2,sK3),intersection(sK2,sK4))),intersection(sK2,union(sK3,sK4)))
| spl6_11 ),
inference(avatar_component_clause,[],[f128]) ).
fof(f131,definition,
( spl6_12
<=> member(sK1(intersection(sK2,union(sK3,sK4)),union(intersection(sK2,sK3),intersection(sK2,sK4))),union(intersection(sK2,sK3),intersection(sK2,sK4))) ),
introduced(definition,[new_symbols(definition,[spl6_12])],[avatar_definition]) ).
fof(f132,plain,
( ~ member(sK1(intersection(sK2,union(sK3,sK4)),union(intersection(sK2,sK3),intersection(sK2,sK4))),union(intersection(sK2,sK3),intersection(sK2,sK4)))
| spl6_12 ),
inference(avatar_component_clause,[],[f131]) ).
fof(f133,plain,
( ~ spl6_11
| ~ spl6_12 ),
inference(avatar_split_clause,[],[f118,f131,f128]) ).
fof(f134,plain,
( ~ member(sK1(intersection(sK2,union(sK3,sK4)),union(intersection(sK2,sK3),intersection(sK2,sK4))),intersection(sK2,sK3))
| spl6_12 ),
inference(resolution,[],[f132,f28]) ).
fof(f135,plain,
( ~ member(sK1(intersection(sK2,union(sK3,sK4)),union(intersection(sK2,sK3),intersection(sK2,sK4))),intersection(sK2,sK4))
| spl6_12 ),
inference(resolution,[],[f132,f27]) ).
fof(f138,definition,
( spl6_13
<=> member(sK1(intersection(sK2,union(sK3,sK4)),union(intersection(sK2,sK3),intersection(sK2,sK4))),sK3) ),
introduced(definition,[new_symbols(definition,[spl6_13])],[avatar_definition]) ).
fof(f139,plain,
( ~ member(sK1(intersection(sK2,union(sK3,sK4)),union(intersection(sK2,sK3),intersection(sK2,sK4))),sK3)
| spl6_13 ),
inference(avatar_component_clause,[],[f138]) ).
fof(f141,definition,
( spl6_14
<=> member(sK1(intersection(sK2,union(sK3,sK4)),union(intersection(sK2,sK3),intersection(sK2,sK4))),sK2) ),
introduced(definition,[new_symbols(definition,[spl6_14])],[avatar_definition]) ).
fof(f142,plain,
( ~ member(sK1(intersection(sK2,union(sK3,sK4)),union(intersection(sK2,sK3),intersection(sK2,sK4))),sK2)
| spl6_14 ),
inference(avatar_component_clause,[],[f141]) ).
fof(f144,plain,
( ~ member(sK1(intersection(sK2,union(sK3,sK4)),union(intersection(sK2,sK3),intersection(sK2,sK4))),sK2)
| ~ member(sK1(intersection(sK2,union(sK3,sK4)),union(intersection(sK2,sK3),intersection(sK2,sK4))),sK4)
| spl6_12 ),
inference(resolution,[],[f135,f31]) ).
fof(f146,definition,
( spl6_15
<=> member(sK1(intersection(sK2,union(sK3,sK4)),union(intersection(sK2,sK3),intersection(sK2,sK4))),sK4) ),
introduced(definition,[new_symbols(definition,[spl6_15])],[avatar_definition]) ).
fof(f148,plain,
( ~ spl6_15
| ~ spl6_14
| spl6_12 ),
inference(avatar_split_clause,[],[f144,f131,f141,f146]) ).
fof(f221,plain,
( member(sK1(intersection(sK2,union(sK3,sK4)),union(intersection(sK2,sK3),intersection(sK2,sK4))),union(intersection(sK2,sK3),intersection(sK2,sK4)))
| member(sK1(intersection(sK2,union(sK3,sK4)),union(intersection(sK2,sK3),intersection(sK2,sK4))),intersection(sK2,union(sK3,sK4))) ),
inference(resolution,[],[f55,f56]) ).
fof(f226,plain,
( member(sK1(intersection(sK2,union(sK3,sK4)),union(intersection(sK2,sK3),intersection(sK2,sK4))),intersection(sK2,union(sK3,sK4)))
| ~ spl6_11 ),
inference(avatar_component_clause,[],[f128]) ).
fof(f227,plain,
( member(sK1(intersection(sK2,union(sK3,sK4)),union(intersection(sK2,sK3),intersection(sK2,sK4))),union(intersection(sK2,sK3),intersection(sK2,sK4)))
| ~ spl6_12 ),
inference(avatar_component_clause,[],[f131]) ).
fof(f228,plain,
( spl6_11
| spl6_12 ),
inference(avatar_split_clause,[],[f221,f131,f128]) ).
fof(f234,definition,
( spl6_20
<=> member(sK1(intersection(sK2,union(sK3,sK4)),union(intersection(sK2,sK3),intersection(sK2,sK4))),intersection(sK2,sK3)) ),
introduced(definition,[new_symbols(definition,[spl6_20])],[avatar_definition]) ).
fof(f235,plain,
( member(sK1(intersection(sK2,union(sK3,sK4)),union(intersection(sK2,sK3),intersection(sK2,sK4))),intersection(sK2,sK3))
| ~ spl6_20 ),
inference(avatar_component_clause,[],[f234]) ).
fof(f237,definition,
( spl6_21
<=> member(sK1(intersection(sK2,union(sK3,sK4)),union(intersection(sK2,sK3),intersection(sK2,sK4))),intersection(sK2,sK4)) ),
introduced(definition,[new_symbols(definition,[spl6_21])],[avatar_definition]) ).
fof(f238,plain,
( member(sK1(intersection(sK2,union(sK3,sK4)),union(intersection(sK2,sK3),intersection(sK2,sK4))),intersection(sK2,sK4))
| ~ spl6_21 ),
inference(avatar_component_clause,[],[f237]) ).
fof(f240,plain,
( member(sK1(intersection(sK2,union(sK3,sK4)),union(intersection(sK2,sK3),intersection(sK2,sK4))),sK2)
| ~ spl6_20 ),
inference(resolution,[],[f235,f30]) ).
fof(f241,plain,
( member(sK1(intersection(sK2,union(sK3,sK4)),union(intersection(sK2,sK3),intersection(sK2,sK4))),sK3)
| ~ spl6_20 ),
inference(resolution,[],[f235,f29]) ).
fof(f244,plain,
( $false
| spl6_14
| ~ spl6_20 ),
inference(resolution,[],[f240,f142]) ).
fof(f245,plain,
( spl6_14
| ~ spl6_20 ),
inference(avatar_contradiction_clause,[],[f244]) ).
fof(f247,definition,
( spl6_22
<=> member(sK1(intersection(sK2,union(sK3,sK4)),union(intersection(sK2,sK3),intersection(sK2,sK4))),union(sK3,sK4)) ),
introduced(definition,[new_symbols(definition,[spl6_22])],[avatar_definition]) ).
fof(f248,plain,
( ~ member(sK1(intersection(sK2,union(sK3,sK4)),union(intersection(sK2,sK3),intersection(sK2,sK4))),union(sK3,sK4))
| spl6_22 ),
inference(avatar_component_clause,[],[f247]) ).
fof(f250,plain,
( ~ member(sK1(intersection(sK2,union(sK3,sK4)),union(intersection(sK2,sK3),intersection(sK2,sK4))),sK3)
| spl6_22 ),
inference(resolution,[],[f248,f28]) ).
fof(f251,plain,
( ~ member(sK1(intersection(sK2,union(sK3,sK4)),union(intersection(sK2,sK3),intersection(sK2,sK4))),sK4)
| spl6_22 ),
inference(resolution,[],[f248,f27]) ).
fof(f253,plain,
( ~ spl6_15
| spl6_22 ),
inference(avatar_split_clause,[],[f251,f247,f146]) ).
fof(f263,plain,
( $false
| spl6_13
| ~ spl6_20 ),
inference(resolution,[],[f241,f139]) ).
fof(f264,plain,
( spl6_13
| ~ spl6_20 ),
inference(avatar_contradiction_clause,[],[f263]) ).
fof(f265,plain,
( member(sK1(intersection(sK2,union(sK3,sK4)),union(intersection(sK2,sK3),intersection(sK2,sK4))),sK2)
| ~ spl6_21 ),
inference(resolution,[],[f238,f30]) ).
fof(f266,plain,
( member(sK1(intersection(sK2,union(sK3,sK4)),union(intersection(sK2,sK3),intersection(sK2,sK4))),sK4)
| ~ spl6_21 ),
inference(resolution,[],[f238,f29]) ).
fof(f286,plain,
( ~ spl6_13
| spl6_22 ),
inference(avatar_split_clause,[],[f250,f247,f138]) ).
fof(f293,plain,
( member(sK1(intersection(sK2,union(sK3,sK4)),union(intersection(sK2,sK3),intersection(sK2,sK4))),sK2)
| ~ spl6_11 ),
inference(resolution,[],[f226,f30]) ).
fof(f294,plain,
( member(sK1(intersection(sK2,union(sK3,sK4)),union(intersection(sK2,sK3),intersection(sK2,sK4))),union(sK3,sK4))
| ~ spl6_11 ),
inference(resolution,[],[f226,f29]) ).
fof(f312,plain,
( ~ member(sK1(intersection(sK2,union(sK3,sK4)),union(intersection(sK2,sK3),intersection(sK2,sK4))),sK2)
| ~ member(sK1(intersection(sK2,union(sK3,sK4)),union(intersection(sK2,sK3),intersection(sK2,sK4))),sK3)
| spl6_12 ),
inference(resolution,[],[f134,f31]) ).
fof(f314,plain,
( ~ spl6_13
| ~ spl6_14
| spl6_12 ),
inference(avatar_split_clause,[],[f312,f131,f141,f138]) ).
fof(f322,plain,
( member(sK1(intersection(sK2,union(sK3,sK4)),union(intersection(sK2,sK3),intersection(sK2,sK4))),sK4)
| member(sK1(intersection(sK2,union(sK3,sK4)),union(intersection(sK2,sK3),intersection(sK2,sK4))),sK3)
| ~ spl6_11 ),
inference(resolution,[],[f294,f26]) ).
fof(f326,plain,
( spl6_13
| spl6_15
| ~ spl6_11 ),
inference(avatar_split_clause,[],[f322,f128,f146,f138]) ).
fof(f327,plain,
( spl6_15
| ~ spl6_21 ),
inference(avatar_split_clause,[],[f266,f237,f146]) ).
fof(f330,plain,
( ~ member(sK1(intersection(sK2,union(sK3,sK4)),union(intersection(sK2,sK3),intersection(sK2,sK4))),sK2)
| ~ member(sK1(intersection(sK2,union(sK3,sK4)),union(intersection(sK2,sK3),intersection(sK2,sK4))),union(sK3,sK4))
| spl6_11 ),
inference(resolution,[],[f129,f31]) ).
fof(f332,plain,
( ~ spl6_22
| ~ spl6_14
| spl6_11 ),
inference(avatar_split_clause,[],[f330,f128,f141,f247]) ).
fof(f342,plain,
( member(sK1(intersection(sK2,union(sK3,sK4)),union(intersection(sK2,sK3),intersection(sK2,sK4))),intersection(sK2,sK4))
| member(sK1(intersection(sK2,union(sK3,sK4)),union(intersection(sK2,sK3),intersection(sK2,sK4))),intersection(sK2,sK3))
| ~ spl6_12 ),
inference(resolution,[],[f227,f26]) ).
fof(f343,plain,
( spl6_20
| spl6_21
| ~ spl6_12 ),
inference(avatar_split_clause,[],[f342,f131,f237,f234]) ).
fof(f400,plain,
( $false
| spl6_14
| ~ spl6_21 ),
inference(resolution,[],[f265,f142]) ).
fof(f402,plain,
( spl6_14
| ~ spl6_21 ),
inference(avatar_contradiction_clause,[],[f400]) ).
fof(f429,plain,
( $false
| ~ spl6_11
| spl6_14 ),
inference(resolution,[],[f293,f142]) ).
fof(f430,plain,
( ~ spl6_11
| spl6_14 ),
inference(avatar_contradiction_clause,[],[f429]) ).
cnf(s8,plain,
( ~ spl6_11
| ~ spl6_12 ),
inference(sat_conversion,[],[f133]) ).
cnf(s10,plain,
( spl6_12
| ~ spl6_14
| ~ spl6_15 ),
inference(sat_conversion,[],[f148]) ).
cnf(s18,plain,
( spl6_11
| spl6_12 ),
inference(sat_conversion,[],[f228]) ).
cnf(s20,plain,
( spl6_14
| ~ spl6_20 ),
inference(sat_conversion,[],[f245]) ).
cnf(s22,plain,
( ~ spl6_15
| spl6_22 ),
inference(sat_conversion,[],[f253]) ).
cnf(s24,plain,
( spl6_13
| ~ spl6_20 ),
inference(sat_conversion,[],[f264]) ).
cnf(s27,plain,
( ~ spl6_13
| spl6_22 ),
inference(sat_conversion,[],[f286]) ).
cnf(s29,plain,
( spl6_12
| ~ spl6_13
| ~ spl6_14 ),
inference(sat_conversion,[],[f314]) ).
cnf(s31,plain,
( ~ spl6_11
| spl6_13
| spl6_15 ),
inference(sat_conversion,[],[f326]) ).
cnf(s32,plain,
( spl6_15
| ~ spl6_21 ),
inference(sat_conversion,[],[f327]) ).
cnf(s33,plain,
( spl6_11
| ~ spl6_14
| ~ spl6_22 ),
inference(sat_conversion,[],[f332]) ).
cnf(s35,plain,
( ~ spl6_12
| spl6_20
| spl6_21 ),
inference(sat_conversion,[],[f343]) ).
cnf(s40,plain,
( spl6_14
| ~ spl6_21 ),
inference(sat_conversion,[],[f402]) ).
cnf(s42,plain,
( ~ spl6_11
| spl6_14 ),
inference(sat_conversion,[],[f430]) ).
cnf(s43,plain,
( ~ spl6_21
| spl6_11 ),
inference(rat,[],[s22,s33,s32,s40]) ).
cnf(s44,plain,
spl6_11,
inference(rat,[],[s33,s27,s20,s24,s35,s43,s18]) ).
cnf(s45,plain,
spl6_14,
inference(rat,[],[s42,s44]) ).
cnf(s47,plain,
~ spl6_12,
inference(rat,[],[s8,s44]) ).
cnf(s48,plain,
~ spl6_13,
inference(rat,[],[s29,s45,s47]) ).
cnf(s49,plain,
~ spl6_15,
inference(rat,[],[s10,s45,s47]) ).
cnf(s50,plain,
$false,
inference(rat,[],[s31,s44,s49,s48]) ).
fof(f431,plain,
$false,
inference(avatar_sat_refutation,[],[s50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET169+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n001.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 28 01:05:23 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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.71/1.27 % (4124467)Detected formulas, will run a generic FOF schedule.
% 2.71/1.27 % (4124473)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=1893913889:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.71/1.27 % (4124474)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=3134207539:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.71/1.27 % (4124472)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=2745364303:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.71/1.27 % (4124476)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3284831718:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.71/1.27 % (4124475)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2580021106:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.71/1.27 % (4124475)Refutation not found, incomplete strategy
% 2.71/1.27 % (4124475)------------------------------
% 2.71/1.27 % (4124475)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.71/1.27 % (4124475)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.71/1.27 % (4124475)CaDiCaL version: 2.1.3
% 2.71/1.27 % (4124475)Termination reason: Refutation not found, incomplete strategy
% 2.71/1.27 % (4124475)Time elapsed: 0.001 s
% 2.71/1.27 % (4124475)Peak memory usage: 88 MB
% 2.71/1.27 % (4124478)dis-21_1_sil=8000:lcm=predicate:random_seed=3868972219: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.71/1.27 % (4124477)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1729669944:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.71/1.27 % (4124478)First to succeed.
% 2.71/1.27 % (4124478)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-4124467"
% 2.71/1.27 % (4124476)Instruction limit reached!
% 2.71/1.27 % (4124476)------------------------------
% 2.71/1.27 % (4124476)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.71/1.27 % (4124476)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.71/1.27 % (4124476)CaDiCaL version: 2.1.3
% 2.71/1.27 % (4124476)Termination reason: Instruction limit
% 2.71/1.27 % (4124476)Termination phase: Saturation
% 2.71/1.27 % (4124476)Time elapsed: 0.071 s
% 2.71/1.27 % (4124476)Peak memory usage: 89 MB
% 2.71/1.27 % (4124476)Instructions burned: 120 (million)
% 2.71/1.27 % (4124477)Instruction limit reached!
% 2.71/1.27 % (4124477)------------------------------
% 2.71/1.27 % (4124477)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.71/1.27 % (4124477)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.71/1.27 % (4124477)CaDiCaL version: 2.1.3
% 2.71/1.27 % (4124477)Termination reason: Instruction limit
% 2.71/1.27 % (4124477)Termination phase: Saturation
% 2.71/1.27 % (4124477)Time elapsed: 0.087 s
% 2.71/1.27 % (4124477)Peak memory usage: 89 MB
% 2.71/1.27 % (4124477)Instructions burned: 140 (million)
% 2.71/1.27 % (4124486)lrs+10_1_sil=8000:sp=occurrence:random_seed=3600517098:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.71/1.27 % (4124487)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3712232184:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.71/1.27 % (4124487)Refutation not found, incomplete strategy
% 2.71/1.27 % (4124487)------------------------------
% 2.71/1.27 % (4124487)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.71/1.27 % (4124487)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.71/1.27 % (4124487)CaDiCaL version: 2.1.3
% 2.71/1.27 % (4124487)Termination reason: Refutation not found, incomplete strategy
% 2.71/1.27 % (4124487)Time elapsed: 0.002 s
% 2.71/1.27 % (4124487)Peak memory usage: 89 MB
% 2.71/1.27 % (4124487)Instructions burned: 1 (million)
% 2.71/1.27 % (4124475)------------------------------
% 2.71/1.27 % (4124475)------------------------------
% 2.71/1.27 % (4124478)Refutation found. Thanks to Tanya!
% 2.71/1.27 % SZS status Theorem for theBenchmark
% 2.71/1.27 % SZS output start Proof for theBenchmark
% See solution above
% 3.59/1.46 % (4124478)------------------------------
% 3.59/1.46 % (4124478)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.59/1.46 % (4124478)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.59/1.46 % (4124478)CaDiCaL version: 2.1.3
% 3.59/1.46 % (4124478)Termination reason: Refutation
% 3.59/1.46 % (4124478)Time elapsed: 0.009 s
% 3.59/1.46 % (4124478)Peak memory usage: 89 MB
% 3.59/1.46 % (4124478)Instructions burned: 11 (million)
% 3.59/1.46 % (4124478)------------------------------
% 3.59/1.46 % (4124478)------------------------------
% 3.59/1.46 % (4124467)Success in time 0.426 s
% 3.59/1.46 % Vampire exiting
%------------------------------------------------------------------------------