%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU238+3 : TPTP v9.3.1. Released v3.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:47:57 PM UTC 2026
% Result : Theorem 3.05s 1.33s
% Output : Refutation 3.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 15
% Syntax : Number of formulae : 104 ( 9 unt; 5 def)
% Number of atoms : 369 ( 35 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 454 ( 189 ~; 190 |; 42 &)
% ( 14 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 16 ( 14 usr; 6 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 106 ( 0 sgn 99 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( in(X0,X1)
=> ~ in(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
fof(f4,axiom,
! [X0] :
( ordinal(X0)
=> ( epsilon_transitive(X0)
& epsilon_connected(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cc1_ordinal1) ).
fof(f12,axiom,
! [X0,X1] :
( proper_subset(X0,X1)
<=> ( subset(X0,X1)
& X0 != X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d8_xboole_0) ).
fof(f20,axiom,
! [X0] :
( ordinal(X0)
=> ( ~ empty(succ(X0))
& epsilon_transitive(succ(X0))
& epsilon_connected(succ(X0))
& ordinal(succ(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc3_ordinal1) ).
fof(f38,axiom,
! [X0,X1] :
( ( ordinal(X0)
& ordinal(X1) )
=> ( ordinal_subset(X0,X1)
<=> subset(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_r1_ordinal1) ).
fof(f41,axiom,
! [X0] : in(X0,succ(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t10_ordinal1) ).
fof(f44,axiom,
! [X0] :
( epsilon_transitive(X0)
=> ! [X1] :
( ordinal(X1)
=> ( proper_subset(X0,X1)
=> in(X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t21_ordinal1) ).
fof(f46,axiom,
! [X0] :
( ordinal(X0)
=> ! [X1] :
( ordinal(X1)
=> ( in(X0,X1)
<=> ordinal_subset(succ(X0),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t33_ordinal1) ).
fof(f48,axiom,
! [X0] :
( ordinal(X0)
=> ( being_limit_ordinal(X0)
<=> ! [X1] :
( ordinal(X1)
=> ( in(X1,X0)
=> in(succ(X1),X0) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t41_ordinal1) ).
fof(f49,conjecture,
! [X0] :
( ordinal(X0)
=> ( ~ ( ~ being_limit_ordinal(X0)
& ! [X1] :
( ordinal(X1)
=> X0 != succ(X1) ) )
& ~ ( ? [X1] :
( ordinal(X1)
& X0 = succ(X1) )
& being_limit_ordinal(X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t42_ordinal1) ).
fof(f50,negated_conjecture,
~ ! [X0] :
( ordinal(X0)
=> ( ~ ( ~ being_limit_ordinal(X0)
& ! [X1] :
( ordinal(X1)
=> X0 != succ(X1) ) )
& ~ ( ? [X1] :
( ordinal(X1)
& X0 = succ(X1) )
& being_limit_ordinal(X0) ) ) ),
inference(negated_conjecture,[status(cth)],[f49]) ).
fof(f59,plain,
~ ! [X0] :
( ordinal(X0)
=> ( ~ ( ~ being_limit_ordinal(X0)
& ! [X1] :
( ordinal(X1)
=> X0 != succ(X1) ) )
& ~ ( ? [X2] :
( ordinal(X2)
& succ(X2) = X0 )
& being_limit_ordinal(X0) ) ) ),
inference(rectify,[],[f50]) ).
fof(f60,plain,
! [X0,X1] :
( ( subset(X0,X1)
& X0 != X1 )
=> proper_subset(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f12]) ).
fof(f70,plain,
! [X0,X1] :
( ~ in(X1,X0)
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f73,plain,
! [X0] :
( ( epsilon_transitive(X0)
& epsilon_connected(X0) )
| ~ ordinal(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f82,plain,
! [X0,X1] :
( proper_subset(X0,X1)
| ~ subset(X0,X1)
| X0 = X1 ),
inference(ennf_transformation,[],[f60]) ).
fof(f83,plain,
! [X0,X1] :
( proper_subset(X0,X1)
| ~ subset(X0,X1)
| X0 = X1 ),
inference(flattening,[],[f82]) ).
fof(f87,plain,
! [X0] :
( ( ~ empty(succ(X0))
& epsilon_transitive(succ(X0))
& epsilon_connected(succ(X0))
& ordinal(succ(X0)) )
| ~ ordinal(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f89,plain,
! [X0,X1] :
( ( ordinal_subset(X0,X1)
<=> subset(X0,X1) )
| ~ ordinal(X0)
| ~ ordinal(X1) ),
inference(ennf_transformation,[],[f38]) ).
fof(f90,plain,
! [X0,X1] :
( ( ordinal_subset(X0,X1)
<=> subset(X0,X1) )
| ~ ordinal(X0)
| ~ ordinal(X1) ),
inference(flattening,[],[f89]) ).
fof(f94,plain,
! [X0] :
( ! [X1] :
( in(X0,X1)
| ~ proper_subset(X0,X1)
| ~ ordinal(X1) )
| ~ epsilon_transitive(X0) ),
inference(ennf_transformation,[],[f44]) ).
fof(f95,plain,
! [X0] :
( ! [X1] :
( in(X0,X1)
| ~ proper_subset(X0,X1)
| ~ ordinal(X1) )
| ~ epsilon_transitive(X0) ),
inference(flattening,[],[f94]) ).
fof(f98,plain,
! [X0] :
( ! [X1] :
( ( in(X0,X1)
<=> ordinal_subset(succ(X0),X1) )
| ~ ordinal(X1) )
| ~ ordinal(X0) ),
inference(ennf_transformation,[],[f46]) ).
fof(f99,plain,
! [X0] :
( ( being_limit_ordinal(X0)
<=> ! [X1] :
( in(succ(X1),X0)
| ~ in(X1,X0)
| ~ ordinal(X1) ) )
| ~ ordinal(X0) ),
inference(ennf_transformation,[],[f48]) ).
fof(f100,plain,
! [X0] :
( ( being_limit_ordinal(X0)
<=> ! [X1] :
( in(succ(X1),X0)
| ~ in(X1,X0)
| ~ ordinal(X1) ) )
| ~ ordinal(X0) ),
inference(flattening,[],[f99]) ).
fof(f101,plain,
? [X0] :
( ( ( ~ being_limit_ordinal(X0)
& ! [X1] :
( X0 != succ(X1)
| ~ ordinal(X1) ) )
| ( ? [X2] :
( ordinal(X2)
& succ(X2) = X0 )
& being_limit_ordinal(X0) ) )
& ordinal(X0) ),
inference(ennf_transformation,[],[f59]) ).
fof(f122,plain,
! [X0,X1] :
( ( ( ordinal_subset(X0,X1)
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ~ ordinal_subset(X0,X1) ) )
| ~ ordinal(X0)
| ~ ordinal(X1) ),
inference(nnf_transformation,[],[f90]) ).
fof(f123,plain,
! [X0] :
( ! [X1] :
( ( ( in(X0,X1)
| ~ ordinal_subset(succ(X0),X1) )
& ( ordinal_subset(succ(X0),X1)
| ~ in(X0,X1) ) )
| ~ ordinal(X1) )
| ~ ordinal(X0) ),
inference(nnf_transformation,[],[f98]) ).
fof(f125,plain,
! [X0] :
( ( ( being_limit_ordinal(X0)
| ? [X1] :
( ~ in(succ(X1),X0)
& in(X1,X0)
& ordinal(X1) ) )
& ( ! [X1] :
( in(succ(X1),X0)
| ~ in(X1,X0)
| ~ ordinal(X1) )
| ~ being_limit_ordinal(X0) ) )
| ~ ordinal(X0) ),
inference(nnf_transformation,[],[f100]) ).
fof(f126,plain,
! [X0] :
( ( ( being_limit_ordinal(X0)
| ? [X1] :
( ~ in(succ(X1),X0)
& in(X1,X0)
& ordinal(X1) ) )
& ( ! [X2] :
( in(succ(X2),X0)
| ~ in(X2,X0)
| ~ ordinal(X2) )
| ~ being_limit_ordinal(X0) ) )
| ~ ordinal(X0) ),
inference(rectify,[],[f125]) ).
fof(f127,plain,
! [X0] :
( ( ( being_limit_ordinal(X0)
| ( ~ in(succ(sK14(X0)),X0)
& in(sK14(X0),X0)
& ordinal(sK14(X0)) ) )
& ( ! [X2] :
( in(succ(X2),X0)
| ~ in(X2,X0)
| ~ ordinal(X2) )
| ~ being_limit_ordinal(X0) ) )
| ~ ordinal(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK14]),skolemize(X1,sK14(X0))],[f126]) ).
fof(f128,plain,
( ( ( ~ being_limit_ordinal(sK15)
& ! [X1] :
( succ(X1) != sK15
| ~ ordinal(X1) ) )
| ( ordinal(sK16)
& sK15 = succ(sK16)
& being_limit_ordinal(sK15) ) )
& ordinal(sK15) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK15,sK16]),skolemize(X0,sK15),skolemize(X2,sK16)],[f101]) ).
fof(f129,plain,
! [X0,X1] :
( ~ in(X1,X0)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f70]) ).
fof(f133,plain,
! [X0] :
( epsilon_transitive(X0)
| ~ ordinal(X0) ),
inference(cnf_transformation,[],[f73]) ).
fof(f144,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| proper_subset(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f83]) ).
fof(f158,plain,
! [X0] :
( ordinal(succ(X0))
| ~ ordinal(X0) ),
inference(cnf_transformation,[],[f87]) ).
fof(f198,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ ordinal_subset(X0,X1)
| ~ ordinal(X0)
| ~ ordinal(X1) ),
inference(cnf_transformation,[],[f122]) ).
fof(f202,plain,
! [X0] : in(X0,succ(X0)),
inference(cnf_transformation,[],[f41]) ).
fof(f205,plain,
! [X0,X1] :
( ~ proper_subset(X0,X1)
| in(X0,X1)
| ~ ordinal(X1)
| ~ epsilon_transitive(X0) ),
inference(cnf_transformation,[],[f95]) ).
fof(f207,plain,
! [X0,X1] :
( ordinal_subset(succ(X0),X1)
| ~ in(X0,X1)
| ~ ordinal(X1)
| ~ ordinal(X0) ),
inference(cnf_transformation,[],[f123]) ).
fof(f211,plain,
! [X2,X0] :
( ~ being_limit_ordinal(X0)
| ~ in(X2,X0)
| ~ ordinal(X2)
| in(succ(X2),X0)
| ~ ordinal(X0) ),
inference(cnf_transformation,[],[f127]) ).
fof(f212,plain,
! [X0] :
( ordinal(sK14(X0))
| being_limit_ordinal(X0)
| ~ ordinal(X0) ),
inference(cnf_transformation,[],[f127]) ).
fof(f213,plain,
! [X0] :
( in(sK14(X0),X0)
| being_limit_ordinal(X0)
| ~ ordinal(X0) ),
inference(cnf_transformation,[],[f127]) ).
fof(f214,plain,
! [X0] :
( ~ in(succ(sK14(X0)),X0)
| being_limit_ordinal(X0)
| ~ ordinal(X0) ),
inference(cnf_transformation,[],[f127]) ).
fof(f215,plain,
ordinal(sK15),
inference(cnf_transformation,[],[f128]) ).
fof(f216,plain,
! [X1] :
( succ(X1) != sK15
| ~ ordinal(X1)
| being_limit_ordinal(sK15) ),
inference(cnf_transformation,[],[f128]) ).
fof(f220,plain,
( ~ being_limit_ordinal(sK15)
| sK15 = succ(sK16) ),
inference(cnf_transformation,[],[f128]) ).
fof(f221,plain,
( ~ being_limit_ordinal(sK15)
| ordinal(sK16) ),
inference(cnf_transformation,[],[f128]) ).
fof(f228,definition,
( spl17_1
<=> being_limit_ordinal(sK15) ),
introduced(definition,[new_symbols(definition,[spl17_1])],[avatar_definition]) ).
fof(f229,plain,
( ~ being_limit_ordinal(sK15)
| spl17_1 ),
inference(avatar_component_clause,[],[f228]) ).
fof(f230,plain,
( being_limit_ordinal(sK15)
| ~ spl17_1 ),
inference(avatar_component_clause,[],[f228]) ).
fof(f232,definition,
( spl17_2
<=> ! [X1] :
( succ(X1) != sK15
| ~ ordinal(X1) ) ),
introduced(definition,[new_symbols(definition,[spl17_2])],[avatar_definition]) ).
fof(f233,plain,
( ! [X1] :
( succ(X1) != sK15
| ~ ordinal(X1) )
| ~ spl17_2 ),
inference(avatar_component_clause,[],[f232]) ).
fof(f234,plain,
( spl17_1
| spl17_2 ),
inference(avatar_split_clause,[],[f216,f232,f228]) ).
fof(f236,definition,
( spl17_3
<=> sK15 = succ(sK16) ),
introduced(definition,[new_symbols(definition,[spl17_3])],[avatar_definition]) ).
fof(f238,plain,
( sK15 = succ(sK16)
| ~ spl17_3 ),
inference(avatar_component_clause,[],[f236]) ).
fof(f241,definition,
( spl17_4
<=> ordinal(sK16) ),
introduced(definition,[new_symbols(definition,[spl17_4])],[avatar_definition]) ).
fof(f243,plain,
( ordinal(sK16)
| ~ spl17_4 ),
inference(avatar_component_clause,[],[f241]) ).
fof(f245,plain,
( spl17_3
| ~ spl17_1 ),
inference(avatar_split_clause,[],[f220,f228,f236]) ).
fof(f246,plain,
( spl17_4
| ~ spl17_1 ),
inference(avatar_split_clause,[],[f221,f228,f241]) ).
fof(f279,plain,
! [X0,X1] :
( proper_subset(X0,X1)
| ~ ordinal(X0)
| ~ ordinal(X1)
| ~ ordinal_subset(X0,X1)
| X0 = X1 ),
inference(resolution,[],[f198,f144]) ).
fof(f312,plain,
! [X0] : ~ in(X0,X0),
inference(factoring,[],[f129]) ).
fof(f363,plain,
! [X0,X1] :
( ~ ordinal(X0)
| ~ ordinal(X1)
| ~ ordinal_subset(X0,X1)
| X0 = X1
| in(X0,X1)
| ~ ordinal(X1)
| ~ epsilon_transitive(X0) ),
inference(resolution,[],[f279,f205]) ).
fof(f364,plain,
! [X0,X1] :
( ~ ordinal(X0)
| ~ ordinal(X1)
| ~ ordinal_subset(X0,X1)
| X0 = X1
| in(X0,X1)
| ~ epsilon_transitive(X0) ),
inference(duplicate_literal_removal,[],[f363]) ).
fof(f366,plain,
! [X0,X1] :
( ~ ordinal_subset(X0,X1)
| ~ ordinal(X1)
| ~ ordinal(X0)
| X0 = X1
| in(X0,X1) ),
inference(forward_subsumption_resolution,[],[f364,f133]) ).
fof(f456,plain,
( ! [X0] :
( ~ in(X0,sK15)
| ~ ordinal(X0)
| in(succ(X0),sK15)
| ~ ordinal(sK15) )
| ~ spl17_1 ),
inference(resolution,[],[f230,f211]) ).
fof(f457,plain,
( ! [X0] :
( ~ in(X0,sK15)
| ~ ordinal(X0)
| in(succ(X0),sK15) )
| ~ spl17_1 ),
inference(forward_subsumption_resolution,[],[f456,f215]) ).
fof(f462,plain,
( in(sK16,sK15)
| ~ spl17_3 ),
inference(superposition,[],[f202,f238]) ).
fof(f484,plain,
( ~ ordinal(sK16)
| in(succ(sK16),sK15)
| ~ spl17_1
| ~ spl17_3 ),
inference(resolution,[],[f457,f462]) ).
fof(f486,plain,
( in(succ(sK16),sK15)
| ~ spl17_1
| ~ spl17_3
| ~ spl17_4 ),
inference(forward_subsumption_resolution,[],[f484,f243]) ).
fof(f489,plain,
( in(sK15,sK15)
| ~ spl17_1
| ~ spl17_3
| ~ spl17_4 ),
inference(forward_demodulation,[],[f486,f238]) ).
fof(f499,plain,
( $false
| ~ spl17_1
| ~ spl17_3
| ~ spl17_4 ),
inference(forward_subsumption_resolution,[],[f489,f312]) ).
fof(f500,plain,
( ~ spl17_1
| ~ spl17_3
| ~ spl17_4 ),
inference(avatar_contradiction_clause,[],[f499]) ).
fof(f628,plain,
! [X0,X1] :
( ~ ordinal(X0)
| ~ ordinal(succ(X1))
| succ(X1) = X0
| in(succ(X1),X0)
| ~ in(X1,X0)
| ~ ordinal(X0)
| ~ ordinal(X1) ),
inference(resolution,[],[f366,f207]) ).
fof(f629,plain,
! [X0,X1] :
( ~ ordinal(X0)
| ~ ordinal(succ(X1))
| succ(X1) = X0
| in(succ(X1),X0)
| ~ in(X1,X0)
| ~ ordinal(X1) ),
inference(duplicate_literal_removal,[],[f628]) ).
fof(f634,plain,
! [X0,X1] :
( ~ in(X1,X0)
| succ(X1) = X0
| in(succ(X1),X0)
| ~ ordinal(X0)
| ~ ordinal(X1) ),
inference(forward_subsumption_resolution,[],[f629,f158]) ).
fof(f804,definition,
( spl17_45
<=> ordinal(sK14(sK15)) ),
introduced(definition,[new_symbols(definition,[spl17_45])],[avatar_definition]) ).
fof(f805,plain,
( ordinal(sK14(sK15))
| ~ spl17_45 ),
inference(avatar_component_clause,[],[f804]) ).
fof(f806,plain,
( ~ ordinal(sK14(sK15))
| spl17_45 ),
inference(avatar_component_clause,[],[f804]) ).
fof(f837,plain,
( being_limit_ordinal(sK15)
| ~ ordinal(sK15)
| spl17_45 ),
inference(resolution,[],[f806,f212]) ).
fof(f841,plain,
( ~ ordinal(sK15)
| spl17_1
| spl17_45 ),
inference(forward_subsumption_resolution,[],[f837,f229]) ).
fof(f843,plain,
( $false
| spl17_1
| spl17_45 ),
inference(forward_subsumption_resolution,[],[f841,f215]) ).
fof(f844,plain,
( spl17_1
| spl17_45 ),
inference(avatar_contradiction_clause,[],[f843]) ).
fof(f1118,plain,
! [X0] :
( succ(sK14(X0)) = X0
| in(succ(sK14(X0)),X0)
| ~ ordinal(X0)
| ~ ordinal(sK14(X0))
| being_limit_ordinal(X0)
| ~ ordinal(X0) ),
inference(resolution,[],[f634,f213]) ).
fof(f1122,plain,
! [X0] :
( succ(sK14(X0)) = X0
| in(succ(sK14(X0)),X0)
| ~ ordinal(X0)
| ~ ordinal(sK14(X0))
| being_limit_ordinal(X0) ),
inference(duplicate_literal_removal,[],[f1118]) ).
fof(f1126,plain,
! [X0] :
( succ(sK14(X0)) = X0
| ~ ordinal(X0)
| ~ ordinal(sK14(X0))
| being_limit_ordinal(X0) ),
inference(forward_subsumption_resolution,[],[f1122,f214]) ).
fof(f1129,plain,
! [X0] :
( being_limit_ordinal(X0)
| ~ ordinal(X0)
| succ(sK14(X0)) = X0 ),
inference(forward_subsumption_resolution,[],[f1126,f212]) ).
fof(f1391,plain,
( ~ ordinal(sK15)
| sK15 = succ(sK14(sK15))
| spl17_1 ),
inference(resolution,[],[f1129,f229]) ).
fof(f1393,plain,
( sK15 = succ(sK14(sK15))
| spl17_1 ),
inference(forward_subsumption_resolution,[],[f1391,f215]) ).
fof(f1569,plain,
( sK15 != sK15
| ~ ordinal(sK14(sK15))
| spl17_1
| ~ spl17_2 ),
inference(superposition,[],[f233,f1393]) ).
fof(f1586,plain,
( ~ ordinal(sK14(sK15))
| spl17_1
| ~ spl17_2 ),
inference(trivial_inequality_removal,[],[f1569]) ).
fof(f1602,plain,
( $false
| spl17_1
| ~ spl17_2
| ~ spl17_45 ),
inference(forward_subsumption_resolution,[],[f1586,f805]) ).
fof(f1603,plain,
( spl17_1
| ~ spl17_2
| ~ spl17_45 ),
inference(avatar_contradiction_clause,[],[f1602]) ).
cnf(s1,plain,
( spl17_1
| spl17_2 ),
inference(sat_conversion,[],[f234]) ).
cnf(s4,plain,
( ~ spl17_1
| spl17_3 ),
inference(sat_conversion,[],[f245]) ).
cnf(s5,plain,
( ~ spl17_1
| spl17_4 ),
inference(sat_conversion,[],[f246]) ).
cnf(s24,plain,
( ~ spl17_1
| ~ spl17_3
| ~ spl17_4 ),
inference(sat_conversion,[],[f500]) ).
cnf(s57,plain,
( spl17_1
| spl17_45 ),
inference(sat_conversion,[],[f844]) ).
cnf(s99,plain,
( spl17_1
| ~ spl17_2
| ~ spl17_45 ),
inference(sat_conversion,[],[f1603]) ).
cnf(s109,plain,
spl17_1,
inference(rat,[],[s99,s1,s57]) ).
cnf(s110,plain,
spl17_4,
inference(rat,[],[s5,s109]) ).
cnf(s111,plain,
spl17_3,
inference(rat,[],[s4,s109]) ).
cnf(s112,plain,
$false,
inference(rat,[],[s24,s109,s110,s111]) ).
fof(f1620,plain,
$false,
inference(avatar_sat_refutation,[],[s112]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU238+3 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.38 % Computer : n001.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 28 04:21:32 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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
% 3.05/1.33 % (12897)Detected formulas, will run a generic FOF schedule.
% 3.05/1.33 % (12906)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1049962753:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.05/1.33 % (12906)Instruction limit reached!
% 3.05/1.33 % (12906)------------------------------
% 3.05/1.33 % (12906)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.05/1.33 % (12906)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.05/1.33 % (12906)CaDiCaL version: 2.1.3
% 3.05/1.33 % (12906)Termination reason: Instruction limit
% 3.05/1.33 % (12906)Termination phase: Saturation
% 3.05/1.33 % (12906)Time elapsed: 0.029 s
% 3.05/1.33 % (12906)Peak memory usage: 88 MB
% 3.05/1.33 % (12906)Instructions burned: 123 (million)
% 3.05/1.33 % (12902)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=3376365538:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.05/1.33 % (12907)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1492173135:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.05/1.33 % (12904)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=2772468672:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.05/1.33 % (12908)dis-21_1_sil=8000:lcm=predicate:random_seed=656510948: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)
% 3.05/1.33 % (12905)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4100176139:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.05/1.33 % (12903)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=612971260:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.05/1.33 % (12905)Refutation not found, incomplete strategy
% 3.05/1.33 % (12905)------------------------------
% 3.05/1.33 % (12905)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.05/1.33 % (12905)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.05/1.33 % (12905)CaDiCaL version: 2.1.3
% 3.05/1.33 % (12905)Termination reason: Refutation not found, incomplete strategy
% 3.05/1.33 % (12905)Time elapsed: 0.002 s
% 3.05/1.33 % (12905)Peak memory usage: 88 MB
% 3.05/1.33 % (12905)Instructions burned: 1 (million)
% 3.05/1.33 % (12907)First to succeed.
% 3.05/1.33 % (12907)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-12897"
% 3.05/1.33 % (12908)Instruction limit reached!
% 3.05/1.33 % (12908)------------------------------
% 3.05/1.33 % (12908)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.05/1.33 % (12908)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.05/1.33 % (12908)CaDiCaL version: 2.1.3
% 3.05/1.33 % (12908)Termination reason: Instruction limit
% 3.05/1.33 % (12908)Termination phase: Saturation
% 3.05/1.33 % (12908)Time elapsed: 0.081 s
% 3.05/1.33 % (12908)Peak memory usage: 90 MB
% 3.05/1.33 % (12908)Instructions burned: 130 (million)
% 3.05/1.33 % (12910)lrs+10_1_sil=8000:sp=occurrence:random_seed=1221449541:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 3.05/1.33 % (12910)Also succeeded, but the first one will report.
% 3.05/1.33 % (12905)------------------------------
% 3.05/1.33 % (12905)------------------------------
% 3.05/1.33 % (12917)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3678130574:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.05/1.33 % (12907)Refutation found. Thanks to Tanya!
% 3.05/1.33 % SZS status Theorem for theBenchmark
% 3.05/1.33 % SZS output start Proof for theBenchmark
% See solution above
% 3.90/1.52 % (12907)------------------------------
% 3.90/1.52 % (12907)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.90/1.52 % (12907)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.90/1.52 % (12907)CaDiCaL version: 2.1.3
% 3.90/1.52 % (12907)Termination reason: Refutation
% 3.90/1.52 % (12907)Time elapsed: 0.032 s
% 3.90/1.52 % (12907)Peak memory usage: 90 MB
% 3.90/1.52 % (12907)Instructions burned: 40 (million)
% 3.90/1.52 % (12907)------------------------------
% 3.90/1.52 % (12907)------------------------------
% 3.90/1.52 % (12897)Success in time 0.461 s
% 3.90/1.52 % Vampire exiting
%------------------------------------------------------------------------------