%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET169+4 : 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 : n026.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.56s 1.28s
% Output : Refutation 3.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 14
% Syntax : Number of formulae : 99 ( 9 unt; 9 def)
% Number of atoms : 248 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 244 ( 95 ~; 116 |; 17 &)
% ( 14 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 13 ( 12 usr; 10 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 76 ( 0 sgn 71 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset) ).
fof(f2,axiom,
! [X0,X1] :
( equal_set(X0,X1)
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_set) ).
fof(f4,axiom,
! [X0,X1,X2] :
( member(X0,intersection(X1,X2))
<=> ( member(X0,X1)
& member(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection) ).
fof(f5,axiom,
! [X0,X1,X2] :
( member(X0,union(X1,X2))
<=> ( member(X0,X1)
| member(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union) ).
fof(f12,conjecture,
! [X0,X1,X2] : equal_set(intersection(X0,union(X1,X2)),union(intersection(X0,X1),intersection(X0,X2))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI10) ).
fof(f13,negated_conjecture,
~ ! [X0,X1,X2] : equal_set(intersection(X0,union(X1,X2)),union(intersection(X0,X1),intersection(X0,X2))),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f14,plain,
! [X0,X1] :
( ( subset(X0,X1)
& subset(X1,X0) )
=> equal_set(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f15,plain,
? [X0,X1,X2] : ~ equal_set(intersection(X0,union(X1,X2)),union(intersection(X0,X1),intersection(X0,X2))),
inference(ennf_transformation,[],[f13]) ).
fof(f16,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(ennf_transformation,[],[f14]) ).
fof(f17,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(flattening,[],[f16]) ).
fof(f18,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f19,plain,
~ equal_set(intersection(sK0,union(sK1,sK2)),union(intersection(sK0,sK1),intersection(sK0,sK2))),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f15]) ).
fof(f20,plain,
! [X0,X1,X2] :
( ( member(X0,intersection(X1,X2))
| ~ member(X0,X1)
| ~ member(X0,X2) )
& ( ( member(X0,X1)
& member(X0,X2) )
| ~ member(X0,intersection(X1,X2)) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f21,plain,
! [X0,X1,X2] :
( ( member(X0,intersection(X1,X2))
| ~ member(X0,X1)
| ~ member(X0,X2) )
& ( ( member(X0,X1)
& member(X0,X2) )
| ~ member(X0,intersection(X1,X2)) ) ),
inference(flattening,[],[f20]) ).
fof(f22,plain,
! [X0,X1,X2] :
( ( member(X0,union(X1,X2))
| ( ~ member(X0,X1)
& ~ member(X0,X2) ) )
& ( member(X0,X1)
| member(X0,X2)
| ~ member(X0,union(X1,X2)) ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f23,plain,
! [X0,X1,X2] :
( ( member(X0,union(X1,X2))
| ( ~ member(X0,X1)
& ~ member(X0,X2) ) )
& ( member(X0,X1)
| member(X0,X2)
| ~ member(X0,union(X1,X2)) ) ),
inference(flattening,[],[f22]) ).
fof(f24,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,[],[f18]) ).
fof(f25,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,[],[f24]) ).
fof(f26,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK3(X0,X1),X1)
& member(sK3(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X2,sK3(X0,X1))],[f25]) ).
fof(f28,plain,
~ equal_set(intersection(sK0,union(sK1,sK2)),union(intersection(sK0,sK1),intersection(sK0,sK2))),
inference(cnf_transformation,[],[f19]) ).
fof(f29,plain,
! [X2,X0,X1] :
( ~ member(X0,intersection(X1,X2))
| member(X0,X2) ),
inference(cnf_transformation,[],[f21]) ).
fof(f30,plain,
! [X2,X0,X1] :
( ~ member(X0,intersection(X1,X2))
| member(X0,X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f31,plain,
! [X2,X0,X1] :
( member(X0,intersection(X1,X2))
| ~ member(X0,X1)
| ~ member(X0,X2) ),
inference(cnf_transformation,[],[f21]) ).
fof(f32,plain,
! [X2,X0,X1] :
( ~ member(X0,union(X1,X2))
| member(X0,X2)
| member(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f33,plain,
! [X2,X0,X1] :
( member(X0,union(X1,X2))
| ~ member(X0,X2) ),
inference(cnf_transformation,[],[f23]) ).
fof(f34,plain,
! [X2,X0,X1] :
( member(X0,union(X1,X2))
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f35,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(cnf_transformation,[],[f17]) ).
fof(f37,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK3(X0,X1),X0) ),
inference(cnf_transformation,[],[f26]) ).
fof(f38,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK3(X0,X1),X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f44,plain,
( ~ subset(intersection(sK0,union(sK1,sK2)),union(intersection(sK0,sK1),intersection(sK0,sK2)))
| ~ subset(union(intersection(sK0,sK1),intersection(sK0,sK2)),intersection(sK0,union(sK1,sK2))) ),
inference(resolution,[],[f35,f28]) ).
fof(f46,definition,
( spl4_1
<=> subset(union(intersection(sK0,sK1),intersection(sK0,sK2)),intersection(sK0,union(sK1,sK2))) ),
introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition]) ).
fof(f47,plain,
( ~ subset(union(intersection(sK0,sK1),intersection(sK0,sK2)),intersection(sK0,union(sK1,sK2)))
| spl4_1 ),
inference(avatar_component_clause,[],[f46]) ).
fof(f49,definition,
( spl4_2
<=> subset(intersection(sK0,union(sK1,sK2)),union(intersection(sK0,sK1),intersection(sK0,sK2))) ),
introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition]) ).
fof(f50,plain,
( ~ subset(intersection(sK0,union(sK1,sK2)),union(intersection(sK0,sK1),intersection(sK0,sK2)))
| spl4_2 ),
inference(avatar_component_clause,[],[f49]) ).
fof(f51,plain,
( ~ spl4_1
| ~ spl4_2 ),
inference(avatar_split_clause,[],[f44,f49,f46]) ).
fof(f62,definition,
( spl4_3
<=> member(sK3(union(intersection(sK0,sK1),intersection(sK0,sK2)),intersection(sK0,union(sK1,sK2))),union(sK1,sK2)) ),
introduced(definition,[new_symbols(definition,[spl4_3])],[avatar_definition]) ).
fof(f63,plain,
( ~ member(sK3(union(intersection(sK0,sK1),intersection(sK0,sK2)),intersection(sK0,union(sK1,sK2))),union(sK1,sK2))
| spl4_3 ),
inference(avatar_component_clause,[],[f62]) ).
fof(f65,definition,
( spl4_4
<=> member(sK3(union(intersection(sK0,sK1),intersection(sK0,sK2)),intersection(sK0,union(sK1,sK2))),sK0) ),
introduced(definition,[new_symbols(definition,[spl4_4])],[avatar_definition]) ).
fof(f66,plain,
( ~ member(sK3(union(intersection(sK0,sK1),intersection(sK0,sK2)),intersection(sK0,union(sK1,sK2))),sK0)
| spl4_4 ),
inference(avatar_component_clause,[],[f65]) ).
fof(f68,plain,
( ~ member(sK3(union(intersection(sK0,sK1),intersection(sK0,sK2)),intersection(sK0,union(sK1,sK2))),sK1)
| spl4_3 ),
inference(resolution,[],[f63,f34]) ).
fof(f69,plain,
( ~ member(sK3(union(intersection(sK0,sK1),intersection(sK0,sK2)),intersection(sK0,union(sK1,sK2))),sK2)
| spl4_3 ),
inference(resolution,[],[f63,f33]) ).
fof(f77,definition,
( spl4_5
<=> member(sK3(union(intersection(sK0,sK1),intersection(sK0,sK2)),intersection(sK0,union(sK1,sK2))),intersection(sK0,sK1)) ),
introduced(definition,[new_symbols(definition,[spl4_5])],[avatar_definition]) ).
fof(f78,plain,
( member(sK3(union(intersection(sK0,sK1),intersection(sK0,sK2)),intersection(sK0,union(sK1,sK2))),intersection(sK0,sK1))
| ~ spl4_5 ),
inference(avatar_component_clause,[],[f77]) ).
fof(f80,definition,
( spl4_6
<=> member(sK3(union(intersection(sK0,sK1),intersection(sK0,sK2)),intersection(sK0,union(sK1,sK2))),intersection(sK0,sK2)) ),
introduced(definition,[new_symbols(definition,[spl4_6])],[avatar_definition]) ).
fof(f81,plain,
( member(sK3(union(intersection(sK0,sK1),intersection(sK0,sK2)),intersection(sK0,union(sK1,sK2))),intersection(sK0,sK2))
| ~ spl4_6 ),
inference(avatar_component_clause,[],[f80]) ).
fof(f83,plain,
( member(sK3(union(intersection(sK0,sK1),intersection(sK0,sK2)),intersection(sK0,union(sK1,sK2))),sK0)
| ~ spl4_5 ),
inference(resolution,[],[f78,f30]) ).
fof(f84,plain,
( member(sK3(union(intersection(sK0,sK1),intersection(sK0,sK2)),intersection(sK0,union(sK1,sK2))),sK1)
| ~ spl4_5 ),
inference(resolution,[],[f78,f29]) ).
fof(f85,plain,
( $false
| spl4_3
| ~ spl4_5 ),
inference(resolution,[],[f84,f68]) ).
fof(f86,plain,
( spl4_3
| ~ spl4_5 ),
inference(avatar_contradiction_clause,[],[f85]) ).
fof(f87,plain,
( member(sK3(union(intersection(sK0,sK1),intersection(sK0,sK2)),intersection(sK0,union(sK1,sK2))),sK0)
| ~ spl4_6 ),
inference(resolution,[],[f81,f30]) ).
fof(f88,plain,
( member(sK3(union(intersection(sK0,sK1),intersection(sK0,sK2)),intersection(sK0,union(sK1,sK2))),sK2)
| ~ spl4_6 ),
inference(resolution,[],[f81,f29]) ).
fof(f89,plain,
( $false
| spl4_3
| ~ spl4_6 ),
inference(resolution,[],[f88,f69]) ).
fof(f90,plain,
( spl4_3
| ~ spl4_6 ),
inference(avatar_contradiction_clause,[],[f89]) ).
fof(f91,plain,
( ~ member(sK3(intersection(sK0,union(sK1,sK2)),union(intersection(sK0,sK1),intersection(sK0,sK2))),union(intersection(sK0,sK1),intersection(sK0,sK2)))
| spl4_2 ),
inference(resolution,[],[f50,f38]) ).
fof(f92,plain,
( member(sK3(intersection(sK0,union(sK1,sK2)),union(intersection(sK0,sK1),intersection(sK0,sK2))),intersection(sK0,union(sK1,sK2)))
| spl4_2 ),
inference(resolution,[],[f50,f37]) ).
fof(f94,plain,
( member(sK3(intersection(sK0,union(sK1,sK2)),union(intersection(sK0,sK1),intersection(sK0,sK2))),sK0)
| spl4_2 ),
inference(resolution,[],[f92,f30]) ).
fof(f95,plain,
( member(sK3(intersection(sK0,union(sK1,sK2)),union(intersection(sK0,sK1),intersection(sK0,sK2))),union(sK1,sK2))
| spl4_2 ),
inference(resolution,[],[f92,f29]) ).
fof(f96,plain,
( ~ member(sK3(intersection(sK0,union(sK1,sK2)),union(intersection(sK0,sK1),intersection(sK0,sK2))),intersection(sK0,sK1))
| spl4_2 ),
inference(resolution,[],[f91,f34]) ).
fof(f97,plain,
( ~ member(sK3(intersection(sK0,union(sK1,sK2)),union(intersection(sK0,sK1),intersection(sK0,sK2))),intersection(sK0,sK2))
| spl4_2 ),
inference(resolution,[],[f91,f33]) ).
fof(f98,plain,
( member(sK3(intersection(sK0,union(sK1,sK2)),union(intersection(sK0,sK1),intersection(sK0,sK2))),sK2)
| member(sK3(intersection(sK0,union(sK1,sK2)),union(intersection(sK0,sK1),intersection(sK0,sK2))),sK1)
| spl4_2 ),
inference(resolution,[],[f95,f32]) ).
fof(f100,definition,
( spl4_7
<=> member(sK3(intersection(sK0,union(sK1,sK2)),union(intersection(sK0,sK1),intersection(sK0,sK2))),sK1) ),
introduced(definition,[new_symbols(definition,[spl4_7])],[avatar_definition]) ).
fof(f103,definition,
( spl4_8
<=> member(sK3(intersection(sK0,union(sK1,sK2)),union(intersection(sK0,sK1),intersection(sK0,sK2))),sK2) ),
introduced(definition,[new_symbols(definition,[spl4_8])],[avatar_definition]) ).
fof(f105,plain,
( spl4_7
| spl4_8
| spl4_2 ),
inference(avatar_split_clause,[],[f98,f49,f103,f100]) ).
fof(f106,plain,
( ~ member(sK3(intersection(sK0,union(sK1,sK2)),union(intersection(sK0,sK1),intersection(sK0,sK2))),sK0)
| ~ member(sK3(intersection(sK0,union(sK1,sK2)),union(intersection(sK0,sK1),intersection(sK0,sK2))),sK1)
| spl4_2 ),
inference(resolution,[],[f96,f31]) ).
fof(f109,definition,
( spl4_9
<=> member(sK3(intersection(sK0,union(sK1,sK2)),union(intersection(sK0,sK1),intersection(sK0,sK2))),sK0) ),
introduced(definition,[new_symbols(definition,[spl4_9])],[avatar_definition]) ).
fof(f110,plain,
( ~ member(sK3(intersection(sK0,union(sK1,sK2)),union(intersection(sK0,sK1),intersection(sK0,sK2))),sK0)
| spl4_9 ),
inference(avatar_component_clause,[],[f109]) ).
fof(f111,plain,
( ~ spl4_7
| ~ spl4_9
| spl4_2 ),
inference(avatar_split_clause,[],[f106,f49,f109,f100]) ).
fof(f117,plain,
( ~ member(sK3(intersection(sK0,union(sK1,sK2)),union(intersection(sK0,sK1),intersection(sK0,sK2))),sK0)
| ~ member(sK3(intersection(sK0,union(sK1,sK2)),union(intersection(sK0,sK1),intersection(sK0,sK2))),sK2)
| spl4_2 ),
inference(resolution,[],[f97,f31]) ).
fof(f119,plain,
( ~ spl4_8
| ~ spl4_9
| spl4_2 ),
inference(avatar_split_clause,[],[f117,f49,f109,f103]) ).
fof(f120,plain,
( $false
| spl4_2
| spl4_9 ),
inference(resolution,[],[f110,f94]) ).
fof(f121,plain,
( spl4_2
| spl4_9 ),
inference(avatar_contradiction_clause,[],[f120]) ).
fof(f122,plain,
( ~ member(sK3(union(intersection(sK0,sK1),intersection(sK0,sK2)),intersection(sK0,union(sK1,sK2))),intersection(sK0,union(sK1,sK2)))
| spl4_1 ),
inference(resolution,[],[f47,f38]) ).
fof(f123,plain,
( member(sK3(union(intersection(sK0,sK1),intersection(sK0,sK2)),intersection(sK0,union(sK1,sK2))),union(intersection(sK0,sK1),intersection(sK0,sK2)))
| spl4_1 ),
inference(resolution,[],[f47,f37]) ).
fof(f125,plain,
( ~ member(sK3(union(intersection(sK0,sK1),intersection(sK0,sK2)),intersection(sK0,union(sK1,sK2))),sK0)
| ~ member(sK3(union(intersection(sK0,sK1),intersection(sK0,sK2)),intersection(sK0,union(sK1,sK2))),union(sK1,sK2))
| spl4_1 ),
inference(resolution,[],[f122,f31]) ).
fof(f126,plain,
( ~ spl4_3
| ~ spl4_4
| spl4_1 ),
inference(avatar_split_clause,[],[f125,f46,f65,f62]) ).
fof(f127,plain,
( member(sK3(union(intersection(sK0,sK1),intersection(sK0,sK2)),intersection(sK0,union(sK1,sK2))),intersection(sK0,sK2))
| member(sK3(union(intersection(sK0,sK1),intersection(sK0,sK2)),intersection(sK0,union(sK1,sK2))),intersection(sK0,sK1))
| spl4_1 ),
inference(resolution,[],[f123,f32]) ).
fof(f128,plain,
( spl4_5
| spl4_6
| spl4_1 ),
inference(avatar_split_clause,[],[f127,f46,f80,f77]) ).
fof(f129,plain,
( $false
| spl4_4
| ~ spl4_5 ),
inference(resolution,[],[f83,f66]) ).
fof(f130,plain,
( spl4_4
| ~ spl4_5 ),
inference(avatar_contradiction_clause,[],[f129]) ).
fof(f133,plain,
( $false
| spl4_4
| ~ spl4_6 ),
inference(resolution,[],[f87,f66]) ).
fof(f134,plain,
( spl4_4
| ~ spl4_6 ),
inference(avatar_contradiction_clause,[],[f133]) ).
cnf(s1,plain,
( ~ spl4_1
| ~ spl4_2 ),
inference(sat_conversion,[],[f51]) ).
cnf(s4,plain,
( spl4_3
| ~ spl4_5 ),
inference(sat_conversion,[],[f86]) ).
cnf(s5,plain,
( spl4_3
| ~ spl4_6 ),
inference(sat_conversion,[],[f90]) ).
cnf(s6,plain,
( spl4_2
| spl4_7
| spl4_8 ),
inference(sat_conversion,[],[f105]) ).
cnf(s7,plain,
( spl4_2
| ~ spl4_7
| ~ spl4_9 ),
inference(sat_conversion,[],[f111]) ).
cnf(s8,plain,
( spl4_2
| ~ spl4_8
| ~ spl4_9 ),
inference(sat_conversion,[],[f119]) ).
cnf(s9,plain,
( spl4_2
| spl4_9 ),
inference(sat_conversion,[],[f121]) ).
cnf(s10,plain,
( spl4_1
| ~ spl4_3
| ~ spl4_4 ),
inference(sat_conversion,[],[f126]) ).
cnf(s11,plain,
( spl4_1
| spl4_5
| spl4_6 ),
inference(sat_conversion,[],[f128]) ).
cnf(s12,plain,
( spl4_4
| ~ spl4_5 ),
inference(sat_conversion,[],[f130]) ).
cnf(s13,plain,
( spl4_4
| ~ spl4_6 ),
inference(sat_conversion,[],[f134]) ).
cnf(s14,plain,
( spl4_2
| ~ spl4_9 ),
inference(rat,[],[s6,s7,s8]) ).
cnf(s15,plain,
spl4_2,
inference(rat,[],[s14,s9]) ).
cnf(s16,plain,
( spl4_3
| spl4_1 ),
inference(rat,[],[s11,s4,s5]) ).
cnf(s17,plain,
( ~ spl4_3
| spl4_1 ),
inference(rat,[],[s11,s12,s13,s10]) ).
cnf(s18,plain,
spl4_1,
inference(rat,[],[s17,s16]) ).
cnf(s19,plain,
$false,
inference(rat,[],[s1,s15,s18]) ).
fof(f135,plain,
$false,
inference(avatar_sat_refutation,[],[s19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET169+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.39 % Computer : n026.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Mon Sep 28 01:01:57 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.43 Running first-order theorem proving
% 0.12/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
% 2.56/1.28 % (3376694)Detected formulas, will run a generic FOF schedule.
% 2.56/1.28 % (3376703)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3815897670:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.56/1.28 % (3376702)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2743605348:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.56/1.28 % (3376701)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=3164272871:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.56/1.28 % (3376699)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=852822084:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.56/1.28 % (3376700)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=3906994363:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.56/1.28 % (3376702)Refutation not found, incomplete strategy
% 2.56/1.28 % (3376702)------------------------------
% 2.56/1.28 % (3376702)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.56/1.28 % (3376702)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.56/1.28 % (3376702)CaDiCaL version: 2.1.3
% 2.56/1.28 % (3376702)Termination reason: Refutation not found, incomplete strategy
% 2.56/1.28 % (3376702)Time elapsed: 0.001 s
% 2.56/1.28 % (3376702)Peak memory usage: 87 MB
% 2.56/1.28 % (3376705)dis-21_1_sil=8000:lcm=predicate:random_seed=982233098: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.56/1.28 % (3376703)Instruction limit reached!
% 2.56/1.28 % (3376703)------------------------------
% 2.56/1.28 % (3376703)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.56/1.28 % (3376703)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.56/1.28 % (3376703)CaDiCaL version: 2.1.3
% 2.56/1.28 % (3376703)Termination reason: Instruction limit
% 2.56/1.28 % (3376703)Termination phase: Saturation
% 2.56/1.28 % (3376703)Time elapsed: 0.040 s
% 2.56/1.28 % (3376703)Peak memory usage: 90 MB
% 2.56/1.28 % (3376703)Instructions burned: 121 (million)
% 2.56/1.28 % (3376704)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3401575347:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.56/1.28 % (3376705)First to succeed.
% 2.56/1.28 % (3376705)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3376694"
% 2.56/1.28 % (3376704)Also succeeded, but the first one will report.
% 2.56/1.28 % (3376713)lrs+10_1_sil=8000:sp=occurrence:random_seed=3137891680:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 2.56/1.28 % (3376713)Instruction limit reached!
% 2.56/1.28 % (3376713)------------------------------
% 2.56/1.28 % (3376713)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.56/1.28 % (3376713)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.56/1.28 % (3376713)CaDiCaL version: 2.1.3
% 2.56/1.28 % (3376713)Termination reason: Instruction limit
% 2.56/1.28 % (3376713)Termination phase: Saturation
% 2.56/1.28 % (3376713)Time elapsed: 0.090 s
% 2.56/1.28 % (3376713)Peak memory usage: 92 MB
% 2.56/1.28 % (3376713)Instructions burned: 287 (million)
% 2.56/1.28 % (3376702)------------------------------
% 2.56/1.28 % (3376702)------------------------------
% 2.56/1.28 % (3376705)Refutation found. Thanks to Tanya!
% 2.56/1.28 % SZS status Theorem for theBenchmark
% 2.56/1.28 % SZS output start Proof for theBenchmark
% See solution above
% 3.36/1.38 % (3376705)------------------------------
% 3.36/1.38 % (3376705)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.36/1.38 % (3376705)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.36/1.38 % (3376705)CaDiCaL version: 2.1.3
% 3.36/1.38 % (3376705)Termination reason: Refutation
% 3.36/1.38 % (3376705)Time elapsed: 0.004 s
% 3.36/1.38 % (3376705)Peak memory usage: 89 MB
% 3.36/1.38 % (3376705)Instructions burned: 5 (million)
% 3.36/1.38 % (3376705)------------------------------
% 3.36/1.38 % (3376705)------------------------------
% 3.36/1.38 % (3376694)Success in time 0.41 s
% 3.36/1.38 % Vampire exiting
%------------------------------------------------------------------------------