%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET144+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n015.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:17 PM UTC 2026
% Result : Theorem 2.51s 1.28s
% Output : Refutation 3.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 15
% Syntax : Number of formulae : 106 ( 8 unt; 10 def)
% Number of atoms : 268 ( 12 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 264 ( 102 ~; 122 |; 22 &)
% ( 15 <=>; 3 =>; 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 : 84 ( 0 sgn 79 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2] :
( member(X2,union(X0,X1))
<=> ( member(X2,X0)
| member(X2,X1) ) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',intersection_defn) ).
fof(f3,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).
fof(f4,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_defn) ).
fof(f9,conjecture,
! [X0,X1,X2] :
( subset(X0,X1)
=> union(X0,intersection(X2,X1)) = intersection(union(X0,X2),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th44) ).
fof(f10,negated_conjecture,
~ ! [X0,X1,X2] :
( subset(X0,X1)
=> union(X0,intersection(X2,X1)) = intersection(union(X0,X2),X1) ),
inference(negated_conjecture,[status(cth)],[f9]) ).
fof(f11,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f12,plain,
? [X0,X1,X2] :
( union(X0,intersection(X2,X1)) != intersection(union(X0,X2),X1)
& subset(X0,X1) ),
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] :
( ( 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(f18,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,[],[f17]) ).
fof(f19,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))],[f18]) ).
fof(f20,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f21,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(flattening,[],[f20]) ).
fof(f25,plain,
( union(sK2,intersection(sK4,sK3)) != intersection(union(sK2,sK4),sK3)
& subset(sK2,sK3) ),
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(f32,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ member(X3,X0)
| member(X3,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f33,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f34,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f37,plain,
! [X0,X1] :
( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f45,plain,
subset(sK2,sK3),
inference(cnf_transformation,[],[f25]) ).
fof(f46,plain,
union(sK2,intersection(sK4,sK3)) != intersection(union(sK2,sK4),sK3),
inference(cnf_transformation,[],[f25]) ).
fof(f51,definition,
! [X0,X1] :
( sQ5_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(definition,[new_symbols(definition,[sQ5_eqProxy])],[equality_proxy_definition]) ).
fof(f52,plain,
! [X0,X1] :
( sQ5_eqProxy(X0,X1)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(equality_proxy_replacement,[],[f37,f51]) ).
fof(f57,plain,
~ sQ5_eqProxy(union(sK2,intersection(sK4,sK3)),intersection(union(sK2,sK4),sK3)),
inference(equality_proxy_replacement,[],[f46,f51]) ).
fof(f59,plain,
! [X0,X1] :
( sQ5_eqProxy(X1,X0)
| ~ sQ5_eqProxy(X0,X1) ),
inference(equality_proxy_axiom,[],[f51]) ).
fof(f60,plain,
~ sQ5_eqProxy(intersection(union(sK2,sK4),sK3),union(sK2,intersection(sK4,sK3))),
inference(resolution,[],[f59,f57]) ).
fof(f62,plain,
! [X0] :
( member(X0,sK3)
| ~ member(X0,sK2) ),
inference(resolution,[],[f32,f45]) ).
fof(f67,plain,
( ~ subset(intersection(union(sK2,sK4),sK3),union(sK2,intersection(sK4,sK3)))
| ~ subset(union(sK2,intersection(sK4,sK3)),intersection(union(sK2,sK4),sK3)) ),
inference(resolution,[],[f52,f60]) ).
fof(f69,definition,
( spl6_1
<=> subset(union(sK2,intersection(sK4,sK3)),intersection(union(sK2,sK4),sK3)) ),
introduced(definition,[new_symbols(definition,[spl6_1])],[avatar_definition]) ).
fof(f70,plain,
( ~ subset(union(sK2,intersection(sK4,sK3)),intersection(union(sK2,sK4),sK3))
| spl6_1 ),
inference(avatar_component_clause,[],[f69]) ).
fof(f72,definition,
( spl6_2
<=> subset(intersection(union(sK2,sK4),sK3),union(sK2,intersection(sK4,sK3))) ),
introduced(definition,[new_symbols(definition,[spl6_2])],[avatar_definition]) ).
fof(f73,plain,
( ~ subset(intersection(union(sK2,sK4),sK3),union(sK2,intersection(sK4,sK3)))
| spl6_2 ),
inference(avatar_component_clause,[],[f72]) ).
fof(f74,plain,
( ~ spl6_1
| ~ spl6_2 ),
inference(avatar_split_clause,[],[f67,f72,f69]) ).
fof(f82,definition,
( spl6_3
<=> member(sK0(union(sK2,intersection(sK4,sK3)),intersection(union(sK2,sK4),sK3)),sK2) ),
introduced(definition,[new_symbols(definition,[spl6_3])],[avatar_definition]) ).
fof(f83,plain,
( member(sK0(union(sK2,intersection(sK4,sK3)),intersection(union(sK2,sK4),sK3)),sK2)
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f82]) ).
fof(f85,definition,
( spl6_4
<=> member(sK0(union(sK2,intersection(sK4,sK3)),intersection(union(sK2,sK4),sK3)),intersection(sK4,sK3)) ),
introduced(definition,[new_symbols(definition,[spl6_4])],[avatar_definition]) ).
fof(f86,plain,
( member(sK0(union(sK2,intersection(sK4,sK3)),intersection(union(sK2,sK4),sK3)),intersection(sK4,sK3))
| ~ spl6_4 ),
inference(avatar_component_clause,[],[f85]) ).
fof(f88,plain,
( ~ member(sK0(intersection(union(sK2,sK4),sK3),union(sK2,intersection(sK4,sK3))),union(sK2,intersection(sK4,sK3)))
| spl6_2 ),
inference(resolution,[],[f73,f34]) ).
fof(f89,plain,
( member(sK0(intersection(union(sK2,sK4),sK3),union(sK2,intersection(sK4,sK3))),intersection(union(sK2,sK4),sK3))
| spl6_2 ),
inference(resolution,[],[f73,f33]) ).
fof(f90,plain,
( ~ member(sK0(intersection(union(sK2,sK4),sK3),union(sK2,intersection(sK4,sK3))),sK2)
| spl6_2 ),
inference(resolution,[],[f88,f28]) ).
fof(f91,plain,
( ~ member(sK0(intersection(union(sK2,sK4),sK3),union(sK2,intersection(sK4,sK3))),intersection(sK4,sK3))
| spl6_2 ),
inference(resolution,[],[f88,f27]) ).
fof(f92,plain,
( member(sK0(intersection(union(sK2,sK4),sK3),union(sK2,intersection(sK4,sK3))),union(sK2,sK4))
| spl6_2 ),
inference(resolution,[],[f89,f30]) ).
fof(f93,plain,
( member(sK0(intersection(union(sK2,sK4),sK3),union(sK2,intersection(sK4,sK3))),sK3)
| spl6_2 ),
inference(resolution,[],[f89,f29]) ).
fof(f94,plain,
( member(sK0(intersection(union(sK2,sK4),sK3),union(sK2,intersection(sK4,sK3))),sK4)
| member(sK0(intersection(union(sK2,sK4),sK3),union(sK2,intersection(sK4,sK3))),sK2)
| spl6_2 ),
inference(resolution,[],[f92,f26]) ).
fof(f96,definition,
( spl6_5
<=> member(sK0(intersection(union(sK2,sK4),sK3),union(sK2,intersection(sK4,sK3))),sK2) ),
introduced(definition,[new_symbols(definition,[spl6_5])],[avatar_definition]) ).
fof(f97,plain,
( member(sK0(intersection(union(sK2,sK4),sK3),union(sK2,intersection(sK4,sK3))),sK2)
| ~ spl6_5 ),
inference(avatar_component_clause,[],[f96]) ).
fof(f99,definition,
( spl6_6
<=> member(sK0(intersection(union(sK2,sK4),sK3),union(sK2,intersection(sK4,sK3))),sK4) ),
introduced(definition,[new_symbols(definition,[spl6_6])],[avatar_definition]) ).
fof(f101,plain,
( spl6_5
| spl6_6
| spl6_2 ),
inference(avatar_split_clause,[],[f94,f72,f99,f96]) ).
fof(f102,plain,
( $false
| spl6_2
| ~ spl6_5 ),
inference(resolution,[],[f97,f90]) ).
fof(f103,plain,
( spl6_2
| ~ spl6_5 ),
inference(avatar_contradiction_clause,[],[f102]) ).
fof(f106,plain,
( ~ member(sK0(intersection(union(sK2,sK4),sK3),union(sK2,intersection(sK4,sK3))),sK4)
| ~ member(sK0(intersection(union(sK2,sK4),sK3),union(sK2,intersection(sK4,sK3))),sK3)
| spl6_2 ),
inference(resolution,[],[f31,f91]) ).
fof(f108,definition,
( spl6_7
<=> member(sK0(intersection(union(sK2,sK4),sK3),union(sK2,intersection(sK4,sK3))),sK3) ),
introduced(definition,[new_symbols(definition,[spl6_7])],[avatar_definition]) ).
fof(f109,plain,
( ~ member(sK0(intersection(union(sK2,sK4),sK3),union(sK2,intersection(sK4,sK3))),sK3)
| spl6_7 ),
inference(avatar_component_clause,[],[f108]) ).
fof(f111,plain,
( ~ spl6_7
| ~ spl6_6
| spl6_2 ),
inference(avatar_split_clause,[],[f106,f72,f99,f108]) ).
fof(f112,plain,
( $false
| spl6_2
| spl6_7 ),
inference(resolution,[],[f109,f93]) ).
fof(f114,plain,
( spl6_2
| spl6_7 ),
inference(avatar_contradiction_clause,[],[f112]) ).
fof(f139,plain,
( ~ member(sK0(union(sK2,intersection(sK4,sK3)),intersection(union(sK2,sK4),sK3)),intersection(union(sK2,sK4),sK3))
| spl6_1 ),
inference(resolution,[],[f70,f34]) ).
fof(f140,plain,
( member(sK0(union(sK2,intersection(sK4,sK3)),intersection(union(sK2,sK4),sK3)),union(sK2,intersection(sK4,sK3)))
| spl6_1 ),
inference(resolution,[],[f70,f33]) ).
fof(f151,plain,
( ~ member(sK0(union(sK2,intersection(sK4,sK3)),intersection(union(sK2,sK4),sK3)),union(sK2,sK4))
| ~ member(sK0(union(sK2,intersection(sK4,sK3)),intersection(union(sK2,sK4),sK3)),sK3)
| spl6_1 ),
inference(resolution,[],[f139,f31]) ).
fof(f153,definition,
( spl6_16
<=> member(sK0(union(sK2,intersection(sK4,sK3)),intersection(union(sK2,sK4),sK3)),sK3) ),
introduced(definition,[new_symbols(definition,[spl6_16])],[avatar_definition]) ).
fof(f154,plain,
( ~ member(sK0(union(sK2,intersection(sK4,sK3)),intersection(union(sK2,sK4),sK3)),sK3)
| spl6_16 ),
inference(avatar_component_clause,[],[f153]) ).
fof(f156,definition,
( spl6_17
<=> member(sK0(union(sK2,intersection(sK4,sK3)),intersection(union(sK2,sK4),sK3)),union(sK2,sK4)) ),
introduced(definition,[new_symbols(definition,[spl6_17])],[avatar_definition]) ).
fof(f157,plain,
( ~ member(sK0(union(sK2,intersection(sK4,sK3)),intersection(union(sK2,sK4),sK3)),union(sK2,sK4))
| spl6_17 ),
inference(avatar_component_clause,[],[f156]) ).
fof(f158,plain,
( ~ spl6_16
| ~ spl6_17
| spl6_1 ),
inference(avatar_split_clause,[],[f151,f69,f156,f153]) ).
fof(f159,plain,
( member(sK0(union(sK2,intersection(sK4,sK3)),intersection(union(sK2,sK4),sK3)),intersection(sK4,sK3))
| member(sK0(union(sK2,intersection(sK4,sK3)),intersection(union(sK2,sK4),sK3)),sK2)
| spl6_1 ),
inference(resolution,[],[f140,f26]) ).
fof(f160,plain,
( ~ member(sK0(union(sK2,intersection(sK4,sK3)),intersection(union(sK2,sK4),sK3)),sK2)
| spl6_16 ),
inference(resolution,[],[f154,f62]) ).
fof(f161,plain,
( $false
| ~ spl6_3
| spl6_16 ),
inference(resolution,[],[f160,f83]) ).
fof(f162,plain,
( ~ spl6_3
| spl6_16 ),
inference(avatar_contradiction_clause,[],[f161]) ).
fof(f163,plain,
( spl6_3
| spl6_4
| spl6_1 ),
inference(avatar_split_clause,[],[f159,f69,f85,f82]) ).
fof(f164,plain,
( member(sK0(union(sK2,intersection(sK4,sK3)),intersection(union(sK2,sK4),sK3)),sK4)
| ~ spl6_4 ),
inference(resolution,[],[f86,f30]) ).
fof(f165,plain,
( member(sK0(union(sK2,intersection(sK4,sK3)),intersection(union(sK2,sK4),sK3)),sK3)
| ~ spl6_4 ),
inference(resolution,[],[f86,f29]) ).
fof(f166,plain,
( $false
| ~ spl6_4
| spl6_16 ),
inference(resolution,[],[f165,f154]) ).
fof(f167,plain,
( ~ spl6_4
| spl6_16 ),
inference(avatar_contradiction_clause,[],[f166]) ).
fof(f192,plain,
( ~ member(sK0(union(sK2,intersection(sK4,sK3)),intersection(union(sK2,sK4),sK3)),sK2)
| spl6_17 ),
inference(resolution,[],[f157,f28]) ).
fof(f193,plain,
( ~ member(sK0(union(sK2,intersection(sK4,sK3)),intersection(union(sK2,sK4),sK3)),sK4)
| spl6_17 ),
inference(resolution,[],[f157,f27]) ).
fof(f202,plain,
( $false
| ~ spl6_3
| spl6_17 ),
inference(resolution,[],[f192,f83]) ).
fof(f204,plain,
( ~ spl6_3
| spl6_17 ),
inference(avatar_contradiction_clause,[],[f202]) ).
fof(f221,plain,
( $false
| ~ spl6_4
| spl6_17 ),
inference(resolution,[],[f193,f164]) ).
fof(f223,plain,
( ~ spl6_4
| spl6_17 ),
inference(avatar_contradiction_clause,[],[f221]) ).
cnf(s1,plain,
( ~ spl6_1
| ~ spl6_2 ),
inference(sat_conversion,[],[f74]) ).
cnf(s4,plain,
( spl6_2
| spl6_5
| spl6_6 ),
inference(sat_conversion,[],[f101]) ).
cnf(s5,plain,
( spl6_2
| ~ spl6_5 ),
inference(sat_conversion,[],[f103]) ).
cnf(s6,plain,
( spl6_2
| ~ spl6_6
| ~ spl6_7 ),
inference(sat_conversion,[],[f111]) ).
cnf(s7,plain,
( spl6_2
| spl6_7 ),
inference(sat_conversion,[],[f114]) ).
cnf(s12,plain,
( spl6_1
| ~ spl6_16
| ~ spl6_17 ),
inference(sat_conversion,[],[f158]) ).
cnf(s13,plain,
( ~ spl6_3
| spl6_16 ),
inference(sat_conversion,[],[f162]) ).
cnf(s14,plain,
( spl6_1
| spl6_3
| spl6_4 ),
inference(sat_conversion,[],[f163]) ).
cnf(s15,plain,
( ~ spl6_4
| spl6_16 ),
inference(sat_conversion,[],[f167]) ).
cnf(s16,plain,
( ~ spl6_3
| spl6_17 ),
inference(sat_conversion,[],[f204]) ).
cnf(s17,plain,
( ~ spl6_4
| spl6_17 ),
inference(sat_conversion,[],[f223]) ).
cnf(s18,plain,
( spl6_2
| ~ spl6_7 ),
inference(rat,[],[s4,s5,s6]) ).
cnf(s19,plain,
spl6_2,
inference(rat,[],[s18,s7]) ).
cnf(s20,plain,
( ~ spl6_4
| spl6_1 ),
inference(rat,[],[s12,s15,s17]) ).
cnf(s21,plain,
( spl6_4
| spl6_1 ),
inference(rat,[],[s12,s13,s16,s14]) ).
cnf(s22,plain,
spl6_1,
inference(rat,[],[s21,s20]) ).
cnf(s23,plain,
$false,
inference(rat,[],[s1,s19,s22]) ).
fof(f224,plain,
$false,
inference(avatar_sat_refutation,[],[s23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET144+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.41 % Computer : n015.cluster.edu
% 0.13/0.41 % Model : x86_64 x86_64
% 0.13/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.41 % Memory : 8046.5625MB
% 0.13/0.41 % OS : Linux 6.8.0-71-generic
% 0.13/0.41 % CPULimit : 300
% 0.13/0.41 % WCLimit : 300
% 0.13/0.41 % DateTime : Mon Sep 28 00:57:16 UTC 2026
% 0.13/0.41 % CPUTime :
% 0.13/0.41 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.44 Running first-order theorem proving
% 0.13/0.44 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
% 2.51/1.28 % (2166389)Detected formulas, will run a generic FOF schedule.
% 2.51/1.28 % (2166395)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=620808150:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.51/1.28 % (2166400)dis-21_1_sil=8000:lcm=predicate:random_seed=912472751: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.51/1.28 % (2166398)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2384246850:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.51/1.28 % (2166394)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=3394096879:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.51/1.28 % (2166397)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2317181821:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.51/1.28 % (2166396)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=3943550947:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.51/1.28 % (2166399)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3566840573:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.51/1.28 % (2166400)First to succeed.
% 2.51/1.28 % (2166397)Refutation not found, incomplete strategy
% 2.51/1.28 % (2166397)------------------------------
% 2.51/1.28 % (2166397)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.51/1.28 % (2166397)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.51/1.28 % (2166397)CaDiCaL version: 2.1.3
% 2.51/1.28 % (2166397)Termination reason: Refutation not found, incomplete strategy
% 2.51/1.28 % (2166397)Time elapsed: 0.002 s
% 2.51/1.28 % (2166397)Peak memory usage: 88 MB
% 2.51/1.28 % (2166397)Instructions burned: 1 (million)
% 2.51/1.28 % (2166400)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2166389"
% 2.51/1.28 % (2166398)Instruction limit reached!
% 2.51/1.28 % (2166398)------------------------------
% 2.51/1.28 % (2166398)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.51/1.28 % (2166398)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.51/1.28 % (2166398)CaDiCaL version: 2.1.3
% 2.51/1.28 % (2166398)Termination reason: Instruction limit
% 2.51/1.28 % (2166398)Termination phase: Saturation
% 2.51/1.28 % (2166398)Time elapsed: 0.075 s
% 2.51/1.28 % (2166398)Peak memory usage: 89 MB
% 2.51/1.28 % (2166398)Instructions burned: 120 (million)
% 2.51/1.28 % (2166399)Instruction limit reached!
% 2.51/1.28 % (2166399)------------------------------
% 2.51/1.28 % (2166399)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.51/1.28 % (2166399)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.51/1.28 % (2166399)CaDiCaL version: 2.1.3
% 2.51/1.28 % (2166399)Termination reason: Instruction limit
% 2.51/1.28 % (2166399)Termination phase: Saturation
% 2.51/1.28 % (2166399)Time elapsed: 0.089 s
% 2.51/1.28 % (2166399)Peak memory usage: 89 MB
% 2.51/1.28 % (2166399)Instructions burned: 139 (million)
% 2.51/1.28 % (2166408)lrs+10_1_sil=8000:sp=occurrence:random_seed=1972389035:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.51/1.28 % (2166409)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3239072201:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.51/1.28 % (2166409)Refutation not found, incomplete strategy
% 2.51/1.28 % (2166409)------------------------------
% 2.51/1.28 % (2166409)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.51/1.28 % (2166409)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.51/1.28 % (2166409)CaDiCaL version: 2.1.3
% 2.51/1.28 % (2166409)Termination reason: Refutation not found, incomplete strategy
% 2.51/1.28 % (2166409)Time elapsed: 0.002 s
% 2.51/1.28 % (2166409)Peak memory usage: 89 MB
% 2.51/1.28 % (2166409)Instructions burned: 2 (million)
% 2.51/1.28 % (2166397)------------------------------
% 2.51/1.28 % (2166397)------------------------------
% 2.51/1.28 % (2166400)Refutation found. Thanks to Tanya!
% 2.51/1.28 % SZS status Theorem for theBenchmark
% 2.51/1.28 % SZS output start Proof for theBenchmark
% See solution above
% 3.44/1.43 % (2166400)------------------------------
% 3.44/1.43 % (2166400)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.44/1.43 % (2166400)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.44/1.43 % (2166400)CaDiCaL version: 2.1.3
% 3.44/1.43 % (2166400)Termination reason: Refutation
% 3.44/1.43 % (2166400)Time elapsed: 0.006 s
% 3.44/1.43 % (2166400)Peak memory usage: 89 MB
% 3.44/1.43 % (2166400)Instructions burned: 7 (million)
% 3.44/1.43 % (2166400)------------------------------
% 3.44/1.43 % (2166400)------------------------------
% 3.44/1.43 % (2166389)Success in time 0.402 s
% 3.44/1.43 % Vampire exiting
%------------------------------------------------------------------------------