%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET171+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 : n004.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:23 PM UTC 2026
% Result : Theorem 1.66s 1.13s
% Output : Refutation 2.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 15
% Syntax : Number of formulae : 104 ( 11 unt; 10 def)
% Number of atoms : 262 ( 12 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 257 ( 99 ~; 122 |; 20 &)
% ( 15 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 14 ( 12 usr; 10 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 80 ( 0 sgn 75 !; 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(f3,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_defn) ).
fof(f6,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_defn) ).
fof(f9,conjecture,
! [X0,X1,X2] : union(X0,intersection(X1,X2)) = intersection(union(X0,X1),union(X0,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_union_distributes_over_intersection) ).
fof(f10,negated_conjecture,
~ ! [X0,X1,X2] : union(X0,intersection(X1,X2)) = intersection(union(X0,X1),union(X0,X2)),
inference(negated_conjecture,[status(cth)],[f9]) ).
fof(f11,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f6]) ).
fof(f12,plain,
? [X0,X1,X2] : union(X0,intersection(X1,X2)) != intersection(union(X0,X1),union(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(f17,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f18,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(flattening,[],[f17]) ).
fof(f19,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f20,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f19]) ).
fof(f21,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f20]) ).
fof(f25,plain,
union(sK2,intersection(sK3,sK4)) != intersection(union(sK2,sK3),union(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(f34,plain,
! [X0,X1] :
( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f38,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f39,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f45,plain,
union(sK2,intersection(sK3,sK4)) != intersection(union(sK2,sK3),union(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(f51,plain,
! [X0,X1] :
( sQ5_eqProxy(X0,X1)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(equality_proxy_replacement,[],[f34,f50]) ).
fof(f56,plain,
~ sQ5_eqProxy(union(sK2,intersection(sK3,sK4)),intersection(union(sK2,sK3),union(sK2,sK4))),
inference(equality_proxy_replacement,[],[f45,f50]) ).
fof(f58,plain,
! [X0,X1] :
( sQ5_eqProxy(X1,X0)
| ~ sQ5_eqProxy(X0,X1) ),
inference(equality_proxy_axiom,[],[f50]) ).
fof(f59,plain,
~ sQ5_eqProxy(intersection(union(sK2,sK3),union(sK2,sK4)),union(sK2,intersection(sK3,sK4))),
inference(resolution,[],[f58,f56]) ).
fof(f65,plain,
( ~ subset(intersection(union(sK2,sK3),union(sK2,sK4)),union(sK2,intersection(sK3,sK4)))
| ~ subset(union(sK2,intersection(sK3,sK4)),intersection(union(sK2,sK3),union(sK2,sK4))) ),
inference(resolution,[],[f51,f59]) ).
fof(f67,definition,
( spl6_1
<=> subset(union(sK2,intersection(sK3,sK4)),intersection(union(sK2,sK3),union(sK2,sK4))) ),
introduced(definition,[new_symbols(definition,[spl6_1])],[avatar_definition]) ).
fof(f68,plain,
( ~ subset(union(sK2,intersection(sK3,sK4)),intersection(union(sK2,sK3),union(sK2,sK4)))
| spl6_1 ),
inference(avatar_component_clause,[],[f67]) ).
fof(f70,definition,
( spl6_2
<=> subset(intersection(union(sK2,sK3),union(sK2,sK4)),union(sK2,intersection(sK3,sK4))) ),
introduced(definition,[new_symbols(definition,[spl6_2])],[avatar_definition]) ).
fof(f71,plain,
( ~ subset(intersection(union(sK2,sK3),union(sK2,sK4)),union(sK2,intersection(sK3,sK4)))
| spl6_2 ),
inference(avatar_component_clause,[],[f70]) ).
fof(f72,plain,
( ~ spl6_1
| ~ spl6_2 ),
inference(avatar_split_clause,[],[f65,f70,f67]) ).
fof(f80,definition,
( spl6_3
<=> member(sK0(union(sK2,intersection(sK3,sK4)),intersection(union(sK2,sK3),union(sK2,sK4))),sK2) ),
introduced(definition,[new_symbols(definition,[spl6_3])],[avatar_definition]) ).
fof(f81,plain,
( member(sK0(union(sK2,intersection(sK3,sK4)),intersection(union(sK2,sK3),union(sK2,sK4))),sK2)
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f80]) ).
fof(f83,definition,
( spl6_4
<=> member(sK0(union(sK2,intersection(sK3,sK4)),intersection(union(sK2,sK3),union(sK2,sK4))),intersection(sK3,sK4)) ),
introduced(definition,[new_symbols(definition,[spl6_4])],[avatar_definition]) ).
fof(f84,plain,
( member(sK0(union(sK2,intersection(sK3,sK4)),intersection(union(sK2,sK3),union(sK2,sK4))),intersection(sK3,sK4))
| ~ spl6_4 ),
inference(avatar_component_clause,[],[f83]) ).
fof(f86,plain,
( ~ member(sK0(intersection(union(sK2,sK3),union(sK2,sK4)),union(sK2,intersection(sK3,sK4))),union(sK2,intersection(sK3,sK4)))
| spl6_2 ),
inference(resolution,[],[f71,f39]) ).
fof(f87,plain,
( member(sK0(intersection(union(sK2,sK3),union(sK2,sK4)),union(sK2,intersection(sK3,sK4))),intersection(union(sK2,sK3),union(sK2,sK4)))
| spl6_2 ),
inference(resolution,[],[f71,f38]) ).
fof(f88,plain,
( ~ member(sK0(intersection(union(sK2,sK3),union(sK2,sK4)),union(sK2,intersection(sK3,sK4))),sK2)
| spl6_2 ),
inference(resolution,[],[f86,f28]) ).
fof(f90,plain,
( member(sK0(intersection(union(sK2,sK3),union(sK2,sK4)),union(sK2,intersection(sK3,sK4))),union(sK2,sK3))
| spl6_2 ),
inference(resolution,[],[f87,f30]) ).
fof(f91,plain,
( member(sK0(intersection(union(sK2,sK3),union(sK2,sK4)),union(sK2,intersection(sK3,sK4))),union(sK2,sK4))
| spl6_2 ),
inference(resolution,[],[f87,f29]) ).
fof(f92,plain,
( member(sK0(intersection(union(sK2,sK3),union(sK2,sK4)),union(sK2,intersection(sK3,sK4))),sK3)
| member(sK0(intersection(union(sK2,sK3),union(sK2,sK4)),union(sK2,intersection(sK3,sK4))),sK2)
| spl6_2 ),
inference(resolution,[],[f90,f26]) ).
fof(f94,definition,
( spl6_5
<=> member(sK0(intersection(union(sK2,sK3),union(sK2,sK4)),union(sK2,intersection(sK3,sK4))),sK2) ),
introduced(definition,[new_symbols(definition,[spl6_5])],[avatar_definition]) ).
fof(f95,plain,
( member(sK0(intersection(union(sK2,sK3),union(sK2,sK4)),union(sK2,intersection(sK3,sK4))),sK2)
| ~ spl6_5 ),
inference(avatar_component_clause,[],[f94]) ).
fof(f97,definition,
( spl6_6
<=> member(sK0(intersection(union(sK2,sK3),union(sK2,sK4)),union(sK2,intersection(sK3,sK4))),sK3) ),
introduced(definition,[new_symbols(definition,[spl6_6])],[avatar_definition]) ).
fof(f99,plain,
( spl6_5
| spl6_6
| spl6_2 ),
inference(avatar_split_clause,[],[f92,f70,f97,f94]) ).
fof(f100,plain,
( $false
| spl6_2
| ~ spl6_5 ),
inference(resolution,[],[f95,f88]) ).
fof(f101,plain,
( spl6_2
| ~ spl6_5 ),
inference(avatar_contradiction_clause,[],[f100]) ).
fof(f102,plain,
( member(sK0(intersection(union(sK2,sK3),union(sK2,sK4)),union(sK2,intersection(sK3,sK4))),sK4)
| member(sK0(intersection(union(sK2,sK3),union(sK2,sK4)),union(sK2,intersection(sK3,sK4))),sK2)
| spl6_2 ),
inference(resolution,[],[f91,f26]) ).
fof(f104,definition,
( spl6_7
<=> member(sK0(intersection(union(sK2,sK3),union(sK2,sK4)),union(sK2,intersection(sK3,sK4))),sK4) ),
introduced(definition,[new_symbols(definition,[spl6_7])],[avatar_definition]) ).
fof(f106,plain,
( spl6_5
| spl6_7
| spl6_2 ),
inference(avatar_split_clause,[],[f102,f70,f104,f94]) ).
fof(f115,definition,
( spl6_8
<=> member(sK0(union(sK2,intersection(sK3,sK4)),intersection(union(sK2,sK3),union(sK2,sK4))),union(sK2,sK4)) ),
introduced(definition,[new_symbols(definition,[spl6_8])],[avatar_definition]) ).
fof(f116,plain,
( ~ member(sK0(union(sK2,intersection(sK3,sK4)),intersection(union(sK2,sK3),union(sK2,sK4))),union(sK2,sK4))
| spl6_8 ),
inference(avatar_component_clause,[],[f115]) ).
fof(f118,definition,
( spl6_9
<=> member(sK0(union(sK2,intersection(sK3,sK4)),intersection(union(sK2,sK3),union(sK2,sK4))),union(sK2,sK3)) ),
introduced(definition,[new_symbols(definition,[spl6_9])],[avatar_definition]) ).
fof(f119,plain,
( ~ member(sK0(union(sK2,intersection(sK3,sK4)),intersection(union(sK2,sK3),union(sK2,sK4))),union(sK2,sK3))
| spl6_9 ),
inference(avatar_component_clause,[],[f118]) ).
fof(f157,plain,
( ~ member(sK0(union(sK2,intersection(sK3,sK4)),intersection(union(sK2,sK3),union(sK2,sK4))),sK2)
| spl6_8 ),
inference(resolution,[],[f116,f28]) ).
fof(f158,plain,
( ~ member(sK0(union(sK2,intersection(sK3,sK4)),intersection(union(sK2,sK3),union(sK2,sK4))),sK4)
| spl6_8 ),
inference(resolution,[],[f116,f27]) ).
fof(f159,plain,
( $false
| ~ spl6_3
| spl6_8 ),
inference(resolution,[],[f157,f81]) ).
fof(f160,plain,
( ~ spl6_3
| spl6_8 ),
inference(avatar_contradiction_clause,[],[f159]) ).
fof(f161,plain,
( member(sK0(union(sK2,intersection(sK3,sK4)),intersection(union(sK2,sK3),union(sK2,sK4))),sK3)
| ~ spl6_4 ),
inference(resolution,[],[f84,f30]) ).
fof(f162,plain,
( member(sK0(union(sK2,intersection(sK3,sK4)),intersection(union(sK2,sK3),union(sK2,sK4))),sK4)
| ~ spl6_4 ),
inference(resolution,[],[f84,f29]) ).
fof(f163,plain,
( $false
| ~ spl6_4
| spl6_8 ),
inference(resolution,[],[f162,f158]) ).
fof(f164,plain,
( ~ spl6_4
| spl6_8 ),
inference(avatar_contradiction_clause,[],[f163]) ).
fof(f165,plain,
( ~ member(sK0(union(sK2,intersection(sK3,sK4)),intersection(union(sK2,sK3),union(sK2,sK4))),sK2)
| spl6_9 ),
inference(resolution,[],[f119,f28]) ).
fof(f166,plain,
( ~ member(sK0(union(sK2,intersection(sK3,sK4)),intersection(union(sK2,sK3),union(sK2,sK4))),sK3)
| spl6_9 ),
inference(resolution,[],[f119,f27]) ).
fof(f182,plain,
( $false
| ~ spl6_3
| spl6_9 ),
inference(resolution,[],[f165,f81]) ).
fof(f184,plain,
( ~ spl6_3
| spl6_9 ),
inference(avatar_contradiction_clause,[],[f182]) ).
fof(f185,plain,
( ~ member(sK0(intersection(union(sK2,sK3),union(sK2,sK4)),union(sK2,intersection(sK3,sK4))),union(sK2,intersection(sK3,sK4)))
| spl6_2 ),
inference(resolution,[],[f71,f39]) ).
fof(f188,plain,
( ~ member(sK0(intersection(union(sK2,sK3),union(sK2,sK4)),union(sK2,intersection(sK3,sK4))),intersection(sK3,sK4))
| spl6_2 ),
inference(resolution,[],[f185,f27]) ).
fof(f193,plain,
( ~ member(sK0(intersection(union(sK2,sK3),union(sK2,sK4)),union(sK2,intersection(sK3,sK4))),sK3)
| ~ member(sK0(intersection(union(sK2,sK3),union(sK2,sK4)),union(sK2,intersection(sK3,sK4))),sK4)
| spl6_2 ),
inference(resolution,[],[f188,f31]) ).
fof(f197,plain,
( ~ spl6_7
| ~ spl6_6
| spl6_2 ),
inference(avatar_split_clause,[],[f193,f70,f97,f104]) ).
fof(f198,plain,
( ~ member(sK0(union(sK2,intersection(sK3,sK4)),intersection(union(sK2,sK3),union(sK2,sK4))),intersection(union(sK2,sK3),union(sK2,sK4)))
| spl6_1 ),
inference(resolution,[],[f68,f39]) ).
fof(f199,plain,
( member(sK0(union(sK2,intersection(sK3,sK4)),intersection(union(sK2,sK3),union(sK2,sK4))),union(sK2,intersection(sK3,sK4)))
| spl6_1 ),
inference(resolution,[],[f68,f38]) ).
fof(f200,plain,
( member(sK0(union(sK2,intersection(sK3,sK4)),intersection(union(sK2,sK3),union(sK2,sK4))),intersection(sK3,sK4))
| member(sK0(union(sK2,intersection(sK3,sK4)),intersection(union(sK2,sK3),union(sK2,sK4))),sK2)
| spl6_1 ),
inference(resolution,[],[f199,f26]) ).
fof(f201,plain,
( spl6_3
| spl6_4
| spl6_1 ),
inference(avatar_split_clause,[],[f200,f67,f83,f80]) ).
fof(f202,plain,
( ~ member(sK0(union(sK2,intersection(sK3,sK4)),intersection(union(sK2,sK3),union(sK2,sK4))),union(sK2,sK3))
| ~ member(sK0(union(sK2,intersection(sK3,sK4)),intersection(union(sK2,sK3),union(sK2,sK4))),union(sK2,sK4))
| spl6_1 ),
inference(resolution,[],[f198,f31]) ).
fof(f204,plain,
( ~ spl6_8
| ~ spl6_9
| spl6_1 ),
inference(avatar_split_clause,[],[f202,f67,f118,f115]) ).
fof(f210,plain,
( $false
| ~ spl6_4
| spl6_9 ),
inference(resolution,[],[f166,f161]) ).
fof(f212,plain,
( ~ spl6_4
| spl6_9 ),
inference(avatar_contradiction_clause,[],[f210]) ).
cnf(s1,plain,
( ~ spl6_1
| ~ spl6_2 ),
inference(sat_conversion,[],[f72]) ).
cnf(s4,plain,
( spl6_2
| spl6_5
| spl6_6 ),
inference(sat_conversion,[],[f99]) ).
cnf(s5,plain,
( spl6_2
| ~ spl6_5 ),
inference(sat_conversion,[],[f101]) ).
cnf(s6,plain,
( spl6_2
| spl6_5
| spl6_7 ),
inference(sat_conversion,[],[f106]) ).
cnf(s13,plain,
( ~ spl6_3
| spl6_8 ),
inference(sat_conversion,[],[f160]) ).
cnf(s14,plain,
( ~ spl6_4
| spl6_8 ),
inference(sat_conversion,[],[f164]) ).
cnf(s15,plain,
( ~ spl6_3
| spl6_9 ),
inference(sat_conversion,[],[f184]) ).
cnf(s16,plain,
( spl6_2
| ~ spl6_6
| ~ spl6_7 ),
inference(sat_conversion,[],[f197]) ).
cnf(s17,plain,
( spl6_1
| spl6_3
| spl6_4 ),
inference(sat_conversion,[],[f201]) ).
cnf(s18,plain,
( spl6_1
| ~ spl6_8
| ~ spl6_9 ),
inference(sat_conversion,[],[f204]) ).
cnf(s19,plain,
( ~ spl6_4
| spl6_9 ),
inference(sat_conversion,[],[f212]) ).
cnf(s20,plain,
( spl6_5
| spl6_2 ),
inference(rat,[],[s16,s4,s6]) ).
cnf(s21,plain,
spl6_2,
inference(rat,[],[s20,s5]) ).
cnf(s22,plain,
( ~ spl6_4
| spl6_1 ),
inference(rat,[],[s18,s14,s19]) ).
cnf(s23,plain,
( spl6_4
| spl6_1 ),
inference(rat,[],[s18,s13,s15,s17]) ).
cnf(s24,plain,
spl6_1,
inference(rat,[],[s23,s22]) ).
cnf(s25,plain,
$false,
inference(rat,[],[s1,s21,s24]) ).
fof(f213,plain,
$false,
inference(avatar_sat_refutation,[],[s25]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET171+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.39 % Computer : n004.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Mon Sep 28 01:00:27 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.43 Running first-order theorem proving
% 0.13/0.43 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
% 1.66/1.13 % (4045669)Detected formulas, will run a generic FOF schedule.
% 1.66/1.13 % (4045737)dis-21_1_sil=8000:lcm=predicate:random_seed=4076662356: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)
% 1.66/1.13 % (4045737)First to succeed.
% 1.66/1.13 % (4045737)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-4045669"
% 1.66/1.13 % (4045732)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=1628613728:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 1.66/1.13 % (4045736)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1659030350:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 1.66/1.13 % (4045733)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=3792060192:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 1.66/1.13 % (4045731)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=2599504776:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 1.66/1.13 % (4045734)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4247703704:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 1.66/1.13 % (4045735)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3812747828:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 1.66/1.13 % (4045734)Refutation not found, incomplete strategy
% 1.66/1.13 % (4045734)------------------------------
% 1.66/1.13 % (4045734)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.66/1.13 % (4045734)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.66/1.13 % (4045734)CaDiCaL version: 2.1.3
% 1.66/1.13 % (4045734)Termination reason: Refutation not found, incomplete strategy
% 1.66/1.13 % (4045734)Time elapsed: 0.001 s
% 1.66/1.13 % (4045734)Peak memory usage: 88 MB
% 1.66/1.13 % (4045735)Instruction limit reached!
% 1.66/1.13 % (4045735)------------------------------
% 1.66/1.13 % (4045735)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.66/1.13 % (4045735)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.66/1.13 % (4045735)CaDiCaL version: 2.1.3
% 1.66/1.13 % (4045735)Termination reason: Instruction limit
% 1.66/1.13 % (4045735)Termination phase: Saturation
% 1.66/1.13 % (4045735)Time elapsed: 0.071 s
% 1.66/1.13 % (4045735)Peak memory usage: 89 MB
% 1.66/1.13 % (4045735)Instructions burned: 119 (million)
% 1.66/1.13 % (4045736)Instruction limit reached!
% 1.66/1.13 % (4045736)------------------------------
% 1.66/1.13 % (4045736)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.66/1.13 % (4045736)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.66/1.13 % (4045736)CaDiCaL version: 2.1.3
% 1.66/1.13 % (4045736)Termination reason: Instruction limit
% 1.66/1.13 % (4045736)Termination phase: Saturation
% 1.66/1.13 % (4045736)Time elapsed: 0.086 s
% 1.66/1.13 % (4045736)Peak memory usage: 89 MB
% 1.66/1.13 % (4045736)Instructions burned: 140 (million)
% 1.66/1.13 % (4045737)Refutation found. Thanks to Tanya!
% 1.66/1.13 % SZS status Theorem for theBenchmark
% 1.66/1.13 % SZS output start Proof for theBenchmark
% See solution above
% 2.53/1.31 % (4045737)------------------------------
% 2.53/1.31 % (4045737)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.53/1.31 % (4045737)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.53/1.31 % (4045737)CaDiCaL version: 2.1.3
% 2.53/1.31 % (4045737)Termination reason: Refutation
% 2.53/1.31 % (4045737)Time elapsed: 0.003 s
% 2.53/1.31 % (4045737)Peak memory usage: 89 MB
% 2.53/1.31 % (4045737)Instructions burned: 6 (million)
% 2.53/1.31 % (4045737)------------------------------
% 2.53/1.31 % (4045737)------------------------------
% 2.53/1.31 % (4045669)Success in time 0.261 s
% 2.53/1.31 % Vampire exiting
%------------------------------------------------------------------------------