%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU391+2 : 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 : n018.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:48:41 PM UTC 2026
% Result : Theorem 5.72s 1.83s
% Output : Refutation 7.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 6
% Syntax : Number of formulae : 81 ( 10 unt; 3 def)
% Number of atoms : 342 ( 22 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 424 ( 163 ~; 190 |; 54 &)
% ( 8 <=>; 7 =>; 0 <=; 2 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 4 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 73 ( 0 sgn 56 !; 17 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f178,axiom,
! [X0] :
( ( ~ empty_carrier(X0)
& one_sorted_str(X0) )
=> ! [X1] :
( ( ~ empty_carrier(X1)
& net_str(X1,X0) )
=> filter_of_net_str(X0,X1) = a_2_1_yellow19(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_yellow19) ).
fof(f469,axiom,
! [X0,X1,X2] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1)
& ~ empty_carrier(X2)
& net_str(X2,X1) )
=> ( in(X0,a_2_1_yellow19(X1,X2))
<=> ? [X3] :
( element(X3,powerset(the_carrier(X1)))
& X0 = X3
& is_eventually_in(X1,X2,X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fraenkel_a_2_1_yellow19) ).
fof(f676,conjecture,
! [X0] :
( ( ~ empty_carrier(X0)
& one_sorted_str(X0) )
=> ! [X1] :
( ( ~ empty_carrier(X1)
& net_str(X1,X0) )
=> ! [X2] :
( in(X2,filter_of_net_str(X0,X1))
<=> ( is_eventually_in(X0,X1,X2)
& element(X2,powerset(the_carrier(X0))) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t11_yellow19) ).
fof(f677,negated_conjecture,
~ ! [X0] :
( ( ~ empty_carrier(X0)
& one_sorted_str(X0) )
=> ! [X1] :
( ( ~ empty_carrier(X1)
& net_str(X1,X0) )
=> ! [X2] :
( in(X2,filter_of_net_str(X0,X1))
<=> ( is_eventually_in(X0,X1,X2)
& element(X2,powerset(the_carrier(X0))) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f676]) ).
fof(f908,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( in(X2,filter_of_net_str(X0,X1))
<~> ( is_eventually_in(X0,X1,X2)
& element(X2,powerset(the_carrier(X0))) ) )
& ~ empty_carrier(X1)
& net_str(X1,X0) )
& ~ empty_carrier(X0)
& one_sorted_str(X0) ),
inference(ennf_transformation,[],[f677]) ).
fof(f909,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( in(X2,filter_of_net_str(X0,X1))
<~> ( is_eventually_in(X0,X1,X2)
& element(X2,powerset(the_carrier(X0))) ) )
& ~ empty_carrier(X1)
& net_str(X1,X0) )
& ~ empty_carrier(X0)
& one_sorted_str(X0) ),
inference(flattening,[],[f908]) ).
fof(f929,plain,
! [X0] :
( ! [X1] :
( filter_of_net_str(X0,X1) = a_2_1_yellow19(X0,X1)
| empty_carrier(X1)
| ~ net_str(X1,X0) )
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(ennf_transformation,[],[f178]) ).
fof(f930,plain,
! [X0] :
( ! [X1] :
( filter_of_net_str(X0,X1) = a_2_1_yellow19(X0,X1)
| empty_carrier(X1)
| ~ net_str(X1,X0) )
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(flattening,[],[f929]) ).
fof(f931,plain,
! [X0,X1,X2] :
( ( in(X0,a_2_1_yellow19(X1,X2))
<=> ? [X3] :
( element(X3,powerset(the_carrier(X1)))
& X0 = X3
& is_eventually_in(X1,X2,X3) ) )
| empty_carrier(X1)
| ~ one_sorted_str(X1)
| empty_carrier(X2)
| ~ net_str(X2,X1) ),
inference(ennf_transformation,[],[f469]) ).
fof(f932,plain,
! [X0,X1,X2] :
( ( in(X0,a_2_1_yellow19(X1,X2))
<=> ? [X3] :
( element(X3,powerset(the_carrier(X1)))
& X0 = X3
& is_eventually_in(X1,X2,X3) ) )
| empty_carrier(X1)
| ~ one_sorted_str(X1)
| empty_carrier(X2)
| ~ net_str(X2,X1) ),
inference(flattening,[],[f931]) ).
fof(f935,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ( ~ is_eventually_in(X0,X1,X2)
| ~ element(X2,powerset(the_carrier(X0)))
| ~ in(X2,filter_of_net_str(X0,X1)) )
& ( ( is_eventually_in(X0,X1,X2)
& element(X2,powerset(the_carrier(X0))) )
| in(X2,filter_of_net_str(X0,X1)) ) )
& ~ empty_carrier(X1)
& net_str(X1,X0) )
& ~ empty_carrier(X0)
& one_sorted_str(X0) ),
inference(nnf_transformation,[],[f909]) ).
fof(f936,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ( ~ is_eventually_in(X0,X1,X2)
| ~ element(X2,powerset(the_carrier(X0)))
| ~ in(X2,filter_of_net_str(X0,X1)) )
& ( ( is_eventually_in(X0,X1,X2)
& element(X2,powerset(the_carrier(X0))) )
| in(X2,filter_of_net_str(X0,X1)) ) )
& ~ empty_carrier(X1)
& net_str(X1,X0) )
& ~ empty_carrier(X0)
& one_sorted_str(X0) ),
inference(flattening,[],[f935]) ).
fof(f937,plain,
( ( ~ is_eventually_in(sK0,sK1,sK2)
| ~ element(sK2,powerset(the_carrier(sK0)))
| ~ in(sK2,filter_of_net_str(sK0,sK1)) )
& ( ( is_eventually_in(sK0,sK1,sK2)
& element(sK2,powerset(the_carrier(sK0))) )
| in(sK2,filter_of_net_str(sK0,sK1)) )
& ~ empty_carrier(sK1)
& net_str(sK1,sK0)
& ~ empty_carrier(sK0)
& one_sorted_str(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f936]) ).
fof(f948,plain,
! [X0,X1,X2] :
( ( ( in(X0,a_2_1_yellow19(X1,X2))
| ! [X3] :
( ~ element(X3,powerset(the_carrier(X1)))
| X0 != X3
| ~ is_eventually_in(X1,X2,X3) ) )
& ( ? [X3] :
( element(X3,powerset(the_carrier(X1)))
& X0 = X3
& is_eventually_in(X1,X2,X3) )
| ~ in(X0,a_2_1_yellow19(X1,X2)) ) )
| empty_carrier(X1)
| ~ one_sorted_str(X1)
| empty_carrier(X2)
| ~ net_str(X2,X1) ),
inference(nnf_transformation,[],[f932]) ).
fof(f949,plain,
! [X0,X1,X2] :
( ( ( in(X0,a_2_1_yellow19(X1,X2))
| ! [X3] :
( ~ element(X3,powerset(the_carrier(X1)))
| X0 != X3
| ~ is_eventually_in(X1,X2,X3) ) )
& ( ? [X4] :
( element(X4,powerset(the_carrier(X1)))
& X0 = X4
& is_eventually_in(X1,X2,X4) )
| ~ in(X0,a_2_1_yellow19(X1,X2)) ) )
| empty_carrier(X1)
| ~ one_sorted_str(X1)
| empty_carrier(X2)
| ~ net_str(X2,X1) ),
inference(rectify,[],[f948]) ).
fof(f950,plain,
! [X0,X1,X2] :
( ( ( in(X0,a_2_1_yellow19(X1,X2))
| ! [X3] :
( ~ element(X3,powerset(the_carrier(X1)))
| X0 != X3
| ~ is_eventually_in(X1,X2,X3) ) )
& ( ( element(sK11(X0,X1,X2),powerset(the_carrier(X1)))
& sK11(X0,X1,X2) = X0
& is_eventually_in(X1,X2,sK11(X0,X1,X2)) )
| ~ in(X0,a_2_1_yellow19(X1,X2)) ) )
| empty_carrier(X1)
| ~ one_sorted_str(X1)
| empty_carrier(X2)
| ~ net_str(X2,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK11]),skolemize(X4,sK11(X0,X1,X2))],[f949]) ).
fof(f954,plain,
one_sorted_str(sK0),
inference(cnf_transformation,[],[f937]) ).
fof(f955,plain,
~ empty_carrier(sK0),
inference(cnf_transformation,[],[f937]) ).
fof(f956,plain,
net_str(sK1,sK0),
inference(cnf_transformation,[],[f937]) ).
fof(f957,plain,
~ empty_carrier(sK1),
inference(cnf_transformation,[],[f937]) ).
fof(f958,plain,
( element(sK2,powerset(the_carrier(sK0)))
| in(sK2,filter_of_net_str(sK0,sK1)) ),
inference(cnf_transformation,[],[f937]) ).
fof(f959,plain,
( is_eventually_in(sK0,sK1,sK2)
| in(sK2,filter_of_net_str(sK0,sK1)) ),
inference(cnf_transformation,[],[f937]) ).
fof(f960,plain,
( ~ is_eventually_in(sK0,sK1,sK2)
| ~ element(sK2,powerset(the_carrier(sK0)))
| ~ in(sK2,filter_of_net_str(sK0,sK1)) ),
inference(cnf_transformation,[],[f937]) ).
fof(f985,plain,
! [X0,X1] :
( ~ net_str(X1,X0)
| empty_carrier(X1)
| filter_of_net_str(X0,X1) = a_2_1_yellow19(X0,X1)
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(cnf_transformation,[],[f930]) ).
fof(f986,plain,
! [X2,X0,X1] :
( is_eventually_in(X1,X2,sK11(X0,X1,X2))
| ~ in(X0,a_2_1_yellow19(X1,X2))
| empty_carrier(X1)
| ~ one_sorted_str(X1)
| empty_carrier(X2)
| ~ net_str(X2,X1) ),
inference(cnf_transformation,[],[f950]) ).
fof(f987,plain,
! [X2,X0,X1] :
( ~ in(X0,a_2_1_yellow19(X1,X2))
| sK11(X0,X1,X2) = X0
| empty_carrier(X1)
| ~ one_sorted_str(X1)
| empty_carrier(X2)
| ~ net_str(X2,X1) ),
inference(cnf_transformation,[],[f950]) ).
fof(f988,plain,
! [X2,X0,X1] :
( element(sK11(X0,X1,X2),powerset(the_carrier(X1)))
| ~ in(X0,a_2_1_yellow19(X1,X2))
| empty_carrier(X1)
| ~ one_sorted_str(X1)
| empty_carrier(X2)
| ~ net_str(X2,X1) ),
inference(cnf_transformation,[],[f950]) ).
fof(f989,plain,
! [X2,X3,X0,X1] :
( in(X0,a_2_1_yellow19(X1,X2))
| ~ element(X3,powerset(the_carrier(X1)))
| X0 != X3
| ~ is_eventually_in(X1,X2,X3)
| empty_carrier(X1)
| ~ one_sorted_str(X1)
| empty_carrier(X2)
| ~ net_str(X2,X1) ),
inference(cnf_transformation,[],[f950]) ).
fof(f995,plain,
! [X2,X3,X1] :
( ~ element(X3,powerset(the_carrier(X1)))
| in(X3,a_2_1_yellow19(X1,X2))
| ~ is_eventually_in(X1,X2,X3)
| empty_carrier(X1)
| ~ one_sorted_str(X1)
| empty_carrier(X2)
| ~ net_str(X2,X1) ),
inference(equality_resolution,[],[f989]) ).
fof(f997,definition,
( spl14_1
<=> in(sK2,filter_of_net_str(sK0,sK1)) ),
introduced(definition,[new_symbols(definition,[spl14_1])],[avatar_definition]) ).
fof(f998,plain,
( ~ in(sK2,filter_of_net_str(sK0,sK1))
| spl14_1 ),
inference(avatar_component_clause,[],[f997]) ).
fof(f999,plain,
( in(sK2,filter_of_net_str(sK0,sK1))
| ~ spl14_1 ),
inference(avatar_component_clause,[],[f997]) ).
fof(f1001,definition,
( spl14_2
<=> element(sK2,powerset(the_carrier(sK0))) ),
introduced(definition,[new_symbols(definition,[spl14_2])],[avatar_definition]) ).
fof(f1002,plain,
( ~ element(sK2,powerset(the_carrier(sK0)))
| spl14_2 ),
inference(avatar_component_clause,[],[f1001]) ).
fof(f1003,plain,
( element(sK2,powerset(the_carrier(sK0)))
| ~ spl14_2 ),
inference(avatar_component_clause,[],[f1001]) ).
fof(f1004,plain,
( spl14_1
| spl14_2 ),
inference(avatar_split_clause,[],[f958,f1001,f997]) ).
fof(f1006,definition,
( spl14_3
<=> is_eventually_in(sK0,sK1,sK2) ),
introduced(definition,[new_symbols(definition,[spl14_3])],[avatar_definition]) ).
fof(f1007,plain,
( ~ is_eventually_in(sK0,sK1,sK2)
| spl14_3 ),
inference(avatar_component_clause,[],[f1006]) ).
fof(f1008,plain,
( is_eventually_in(sK0,sK1,sK2)
| ~ spl14_3 ),
inference(avatar_component_clause,[],[f1006]) ).
fof(f1009,plain,
( spl14_1
| spl14_3 ),
inference(avatar_split_clause,[],[f959,f1006,f997]) ).
fof(f1010,plain,
( ~ spl14_1
| ~ spl14_2
| ~ spl14_3 ),
inference(avatar_split_clause,[],[f960,f1006,f1001,f997]) ).
fof(f1037,plain,
filter_of_net_str(sK0,sK1) = a_2_1_yellow19(sK0,sK1),
inference(unit_resulting_resolution,[],[f985,f954,f955,f956,f957]) ).
fof(f1046,plain,
( in(sK2,a_2_1_yellow19(sK0,sK1))
| ~ spl14_2
| ~ spl14_3 ),
inference(unit_resulting_resolution,[],[f995,f955,f957,f954,f956,f1008,f1003]) ).
fof(f1047,plain,
( in(sK2,filter_of_net_str(sK0,sK1))
| ~ spl14_2
| ~ spl14_3 ),
inference(forward_demodulation,[],[f1046,f1037]) ).
fof(f1048,plain,
( $false
| spl14_1
| ~ spl14_2
| ~ spl14_3 ),
inference(forward_subsumption_resolution,[],[f1047,f998]) ).
fof(f1049,plain,
( spl14_1
| ~ spl14_2
| ~ spl14_3 ),
inference(avatar_contradiction_clause,[],[f1048]) ).
fof(f1075,plain,
! [X0] :
( ~ in(X0,filter_of_net_str(sK0,sK1))
| sK11(X0,sK0,sK1) = X0
| empty_carrier(sK0)
| ~ one_sorted_str(sK0)
| empty_carrier(sK1)
| ~ net_str(sK1,sK0) ),
inference(superposition,[],[f987,f1037]) ).
fof(f1076,plain,
! [X0] :
( ~ in(X0,filter_of_net_str(sK0,sK1))
| sK11(X0,sK0,sK1) = X0
| ~ one_sorted_str(sK0)
| empty_carrier(sK1)
| ~ net_str(sK1,sK0) ),
inference(forward_subsumption_resolution,[],[f1075,f955]) ).
fof(f1077,plain,
! [X0] :
( ~ in(X0,filter_of_net_str(sK0,sK1))
| sK11(X0,sK0,sK1) = X0
| empty_carrier(sK1)
| ~ net_str(sK1,sK0) ),
inference(forward_subsumption_resolution,[],[f1076,f954]) ).
fof(f1078,plain,
! [X0] :
( ~ in(X0,filter_of_net_str(sK0,sK1))
| sK11(X0,sK0,sK1) = X0
| ~ net_str(sK1,sK0) ),
inference(forward_subsumption_resolution,[],[f1077,f957]) ).
fof(f1079,plain,
! [X0] :
( ~ in(X0,filter_of_net_str(sK0,sK1))
| sK11(X0,sK0,sK1) = X0 ),
inference(forward_subsumption_resolution,[],[f1078,f956]) ).
fof(f1245,plain,
( sK2 = sK11(sK2,sK0,sK1)
| ~ spl14_1 ),
inference(unit_resulting_resolution,[],[f1079,f999]) ).
fof(f1247,plain,
( element(sK2,powerset(the_carrier(sK0)))
| ~ in(sK2,a_2_1_yellow19(sK0,sK1))
| empty_carrier(sK0)
| ~ one_sorted_str(sK0)
| empty_carrier(sK1)
| ~ net_str(sK1,sK0)
| ~ spl14_1 ),
inference(superposition,[],[f988,f1245]) ).
fof(f1248,plain,
( is_eventually_in(sK0,sK1,sK2)
| ~ in(sK2,a_2_1_yellow19(sK0,sK1))
| empty_carrier(sK0)
| ~ one_sorted_str(sK0)
| empty_carrier(sK1)
| ~ net_str(sK1,sK0)
| ~ spl14_1 ),
inference(superposition,[],[f986,f1245]) ).
fof(f1249,plain,
( ~ in(sK2,a_2_1_yellow19(sK0,sK1))
| empty_carrier(sK0)
| ~ one_sorted_str(sK0)
| empty_carrier(sK1)
| ~ net_str(sK1,sK0)
| ~ spl14_1
| spl14_2 ),
inference(forward_subsumption_resolution,[],[f1247,f1002]) ).
fof(f1250,plain,
( ~ in(sK2,a_2_1_yellow19(sK0,sK1))
| ~ one_sorted_str(sK0)
| empty_carrier(sK1)
| ~ net_str(sK1,sK0)
| ~ spl14_1
| spl14_2 ),
inference(forward_subsumption_resolution,[],[f1249,f955]) ).
fof(f1251,plain,
( ~ in(sK2,a_2_1_yellow19(sK0,sK1))
| empty_carrier(sK1)
| ~ net_str(sK1,sK0)
| ~ spl14_1
| spl14_2 ),
inference(forward_subsumption_resolution,[],[f1250,f954]) ).
fof(f1252,plain,
( ~ in(sK2,a_2_1_yellow19(sK0,sK1))
| ~ net_str(sK1,sK0)
| ~ spl14_1
| spl14_2 ),
inference(forward_subsumption_resolution,[],[f1251,f957]) ).
fof(f1253,plain,
( ~ in(sK2,a_2_1_yellow19(sK0,sK1))
| ~ spl14_1
| spl14_2 ),
inference(forward_subsumption_resolution,[],[f1252,f956]) ).
fof(f1254,plain,
( ~ in(sK2,filter_of_net_str(sK0,sK1))
| ~ spl14_1
| spl14_2 ),
inference(forward_demodulation,[],[f1253,f1037]) ).
fof(f1255,plain,
( $false
| ~ spl14_1
| spl14_2 ),
inference(forward_subsumption_resolution,[],[f1254,f999]) ).
fof(f1256,plain,
( ~ spl14_1
| spl14_2 ),
inference(avatar_contradiction_clause,[],[f1255]) ).
fof(f1257,plain,
( ~ in(sK2,a_2_1_yellow19(sK0,sK1))
| empty_carrier(sK0)
| ~ one_sorted_str(sK0)
| empty_carrier(sK1)
| ~ net_str(sK1,sK0)
| ~ spl14_1
| spl14_3 ),
inference(forward_subsumption_resolution,[],[f1248,f1007]) ).
fof(f1258,plain,
( ~ in(sK2,a_2_1_yellow19(sK0,sK1))
| ~ one_sorted_str(sK0)
| empty_carrier(sK1)
| ~ net_str(sK1,sK0)
| ~ spl14_1
| spl14_3 ),
inference(forward_subsumption_resolution,[],[f1257,f955]) ).
fof(f1259,plain,
( ~ in(sK2,a_2_1_yellow19(sK0,sK1))
| empty_carrier(sK1)
| ~ net_str(sK1,sK0)
| ~ spl14_1
| spl14_3 ),
inference(forward_subsumption_resolution,[],[f1258,f954]) ).
fof(f1260,plain,
( ~ in(sK2,a_2_1_yellow19(sK0,sK1))
| ~ net_str(sK1,sK0)
| ~ spl14_1
| spl14_3 ),
inference(forward_subsumption_resolution,[],[f1259,f957]) ).
fof(f1261,plain,
( ~ in(sK2,a_2_1_yellow19(sK0,sK1))
| ~ spl14_1
| spl14_3 ),
inference(forward_subsumption_resolution,[],[f1260,f956]) ).
fof(f1262,plain,
( ~ in(sK2,filter_of_net_str(sK0,sK1))
| ~ spl14_1
| spl14_3 ),
inference(forward_demodulation,[],[f1261,f1037]) ).
fof(f1263,plain,
( $false
| ~ spl14_1
| spl14_3 ),
inference(forward_subsumption_resolution,[],[f1262,f999]) ).
fof(f1264,plain,
( ~ spl14_1
| spl14_3 ),
inference(avatar_contradiction_clause,[],[f1263]) ).
cnf(s1,plain,
( spl14_1
| spl14_2 ),
inference(sat_conversion,[],[f1004]) ).
cnf(s2,plain,
( spl14_1
| spl14_3 ),
inference(sat_conversion,[],[f1009]) ).
cnf(s3,plain,
( ~ spl14_1
| ~ spl14_2
| ~ spl14_3 ),
inference(sat_conversion,[],[f1010]) ).
cnf(s4,plain,
( spl14_1
| ~ spl14_2
| ~ spl14_3 ),
inference(sat_conversion,[],[f1049]) ).
cnf(s5,plain,
( ~ spl14_1
| spl14_2 ),
inference(sat_conversion,[],[f1256]) ).
cnf(s6,plain,
( ~ spl14_1
| spl14_3 ),
inference(sat_conversion,[],[f1264]) ).
cnf(s7,plain,
spl14_1,
inference(rat,[],[s4,s1,s2]) ).
cnf(s8,plain,
spl14_3,
inference(rat,[],[s6,s7]) ).
cnf(s9,plain,
spl14_2,
inference(rat,[],[s5,s7]) ).
cnf(s10,plain,
$false,
inference(rat,[],[s3,s8,s9,s7]) ).
fof(f1265,plain,
$false,
inference(avatar_sat_refutation,[],[s10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU391+2 : 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.37 % Computer : n018.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 28 05:07:24 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 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
% 5.72/1.83 % (3004080)Detected formulas, will run a generic FOF schedule.
% 5.72/1.83 % (3004190)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1365761033:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 5.72/1.83 % (3004186)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=108261025:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 5.72/1.83 % (3004188)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=2866377820:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 5.72/1.83 % (3004187)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=4117914418:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 5.72/1.83 % (3004189)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2499394982:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 5.72/1.83 % (3004192)dis-21_1_sil=8000:lcm=predicate:random_seed=3703692880: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)
% 5.72/1.83 % (3004190)Instruction limit reached!
% 5.72/1.83 % (3004190)------------------------------
% 5.72/1.83 % (3004190)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.72/1.83 % (3004190)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.72/1.83 % (3004190)CaDiCaL version: 2.1.3
% 5.72/1.83 % (3004190)Termination reason: Instruction limit
% 5.72/1.83 % (3004190)Termination phase: Saturation
% 5.72/1.83 % (3004190)Time elapsed: 0.042 s
% 5.72/1.83 % (3004190)Peak memory usage: 91 MB
% 5.72/1.83 % (3004190)Instructions burned: 120 (million)
% 5.72/1.83 % (3004191)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4244878355:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 5.72/1.83 % (3004189)Instruction limit reached!
% 5.72/1.83 % (3004189)------------------------------
% 5.72/1.83 % (3004189)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.72/1.83 % (3004189)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.72/1.83 % (3004189)CaDiCaL version: 2.1.3
% 5.72/1.83 % (3004189)Termination reason: Instruction limit
% 5.72/1.83 % (3004189)Termination phase: Blocked clause elimination
% 5.72/1.83 % (3004189)Time elapsed: 0.077 s
% 5.72/1.83 % (3004189)Peak memory usage: 90 MB
% 5.72/1.83 % (3004189)Instructions burned: 109 (million)
% 5.72/1.83 % (3004192)Instruction limit reached!
% 5.72/1.83 % (3004192)------------------------------
% 5.72/1.83 % (3004192)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.72/1.83 % (3004192)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.72/1.83 % (3004192)CaDiCaL version: 2.1.3
% 5.72/1.83 % (3004192)Termination reason: Instruction limit
% 5.72/1.83 % (3004192)Termination phase: Saturation
% 5.72/1.83 % (3004192)Time elapsed: 0.093 s
% 5.72/1.83 % (3004192)Peak memory usage: 92 MB
% 5.72/1.83 % (3004192)Instructions burned: 130 (million)
% 5.72/1.83 % (3004191)Instruction limit reached!
% 5.72/1.83 % (3004191)------------------------------
% 5.72/1.83 % (3004191)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.72/1.83 % (3004191)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.72/1.83 % (3004191)CaDiCaL version: 2.1.3
% 5.72/1.83 % (3004191)Termination reason: Instruction limit
% 5.72/1.83 % (3004191)Termination phase: Saturation
% 5.72/1.83 % (3004191)Time elapsed: 0.129 s
% 5.72/1.83 % (3004191)Peak memory usage: 92 MB
% 5.72/1.83 % (3004191)Instructions burned: 139 (million)
% 5.72/1.83 % (3004212)lrs+10_1_sil=8000:sp=occurrence:random_seed=1157271700:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 5.72/1.83 % (3004228)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1470059585:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 5.72/1.83 % (3004229)lrs+1011_1_sil=32000:sp=occurrence:random_seed=4249884829:i=325:sd=1:ss=axioms:sgt=32_2996 on theBenchmark for (2996ds/325Mi)
% 5.72/1.83 % (3004228)First to succeed.
% 5.72/1.83 % (3004228)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3004080"
% 5.72/1.83 % (3004212)Instruction limit reached!
% 5.72/1.83 % (3004212)------------------------------
% 5.72/1.83 % (3004212)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.72/1.83 % (3004212)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.72/1.83 % (3004212)CaDiCaL version: 2.1.3
% 5.72/1.83 % (3004212)Termination reason: Instruction limit
% 5.72/1.83 % (3004212)Termination phase: Saturation
% 5.72/1.83 % (3004212)Time elapsed: 0.152 s
% 5.72/1.83 % (3004212)Peak memory usage: 95 MB
% 5.72/1.83 % (3004212)Instructions burned: 286 (million)
% 5.72/1.83 % (3004234)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=1964646444:s2a=on:i=248:s2at=1.23:gtg=position_2996 on theBenchmark for (2996ds/248Mi)
% 5.72/1.83 % (3004244)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=535455094:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2994 on theBenchmark for (2994ds/294Mi)
% 5.72/1.83 % (3004234)Instruction limit reached!
% 5.72/1.83 % (3004234)------------------------------
% 5.72/1.83 % (3004234)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.72/1.83 % (3004234)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.72/1.83 % (3004234)CaDiCaL version: 2.1.3
% 5.72/1.83 % (3004234)Termination reason: Instruction limit
% 5.72/1.83 % (3004234)Termination phase: Saturation
% 5.72/1.83 % (3004234)Time elapsed: 0.265 s
% 5.72/1.83 % (3004234)Peak memory usage: 94 MB
% 5.72/1.83 % (3004234)Instructions burned: 248 (million)
% 5.72/1.83 % (3004229)Instruction limit reached!
% 5.72/1.83 % (3004229)------------------------------
% 5.72/1.83 % (3004229)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.72/1.83 % (3004229)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.72/1.83 % (3004229)CaDiCaL version: 2.1.3
% 5.72/1.83 % (3004229)Termination reason: Instruction limit
% 5.72/1.83 % (3004229)Termination phase: Saturation
% 5.72/1.83 % (3004229)Time elapsed: 0.342 s
% 5.72/1.83 % (3004229)Peak memory usage: 96 MB
% 5.72/1.83 % (3004229)Instructions burned: 325 (million)
% 5.72/1.83 % (3004244)Instruction limit reached!
% 5.72/1.83 % (3004244)------------------------------
% 5.72/1.83 % (3004244)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.72/1.83 % (3004244)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.72/1.83 % (3004244)CaDiCaL version: 2.1.3
% 5.72/1.83 % (3004244)Termination reason: Instruction limit
% 5.72/1.83 % (3004244)Termination phase: Saturation
% 5.72/1.83 % (3004244)Time elapsed: 0.166 s
% 5.72/1.83 % (3004244)Peak memory usage: 94 MB
% 5.72/1.83 % (3004244)Instructions burned: 295 (million)
% 5.72/1.83 % (3004228)Refutation found. Thanks to Tanya!
% 5.72/1.83 % SZS status Theorem for theBenchmark
% 5.72/1.83 % SZS output start Proof for theBenchmark
% See solution above
% 7.25/2.10 % (3004228)------------------------------
% 7.25/2.10 % (3004228)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.25/2.10 % (3004228)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.25/2.10 % (3004228)CaDiCaL version: 2.1.3
% 7.25/2.10 % (3004228)Termination reason: Refutation
% 7.25/2.10 % (3004228)Time elapsed: 0.022 s
% 7.25/2.10 % (3004228)Peak memory usage: 91 MB
% 7.25/2.10 % (3004228)Instructions burned: 30 (million)
% 7.25/2.10 % (3004228)------------------------------
% 7.25/2.10 % (3004228)------------------------------
% 7.25/2.10 % (3004080)Success in time 0.972 s
% 7.25/2.10 % Vampire exiting
%------------------------------------------------------------------------------