%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU238+1 : 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 : n006.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.01s 1.32s
% Output : Refutation 3.92s
% 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/sandbox/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
fof(f4,axiom,
! [X0] :
( ordinal(X0)
=> ( epsilon_transitive(X0)
& epsilon_connected(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cc1_ordinal1) ).
fof(f12,axiom,
! [X0,X1] :
( proper_subset(X0,X1)
<=> ( subset(X0,X1)
& X0 != X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d8_xboole_0) ).
fof(f26,axiom,
! [X0] :
( ordinal(X0)
=> ( ~ empty(succ(X0))
& epsilon_transitive(succ(X0))
& epsilon_connected(succ(X0))
& ordinal(succ(X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc3_ordinal1) ).
fof(f43,axiom,
! [X0,X1] :
( ( ordinal(X0)
& ordinal(X1) )
=> ( ordinal_subset(X0,X1)
<=> subset(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_r1_ordinal1) ).
fof(f46,axiom,
! [X0] : in(X0,succ(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t10_ordinal1) ).
fof(f49,axiom,
! [X0] :
( epsilon_transitive(X0)
=> ! [X1] :
( ordinal(X1)
=> ( proper_subset(X0,X1)
=> in(X0,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t21_ordinal1) ).
fof(f51,axiom,
! [X0] :
( ordinal(X0)
=> ! [X1] :
( ordinal(X1)
=> ( in(X0,X1)
<=> ordinal_subset(succ(X0),X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t33_ordinal1) ).
fof(f53,axiom,
! [X0] :
( ordinal(X0)
=> ( being_limit_ordinal(X0)
<=> ! [X1] :
( ordinal(X1)
=> ( in(X1,X0)
=> in(succ(X1),X0) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t41_ordinal1) ).
fof(f54,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/sandbox/benchmark/theBenchmark.p',t42_ordinal1) ).
fof(f55,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)],[f54]) ).
fof(f64,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,[],[f55]) ).
fof(f65,plain,
! [X0,X1] :
( ( subset(X0,X1)
& X0 != X1 )
=> proper_subset(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f12]) ).
fof(f74,plain,
! [X0,X1] :
( ~ in(X1,X0)
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f77,plain,
! [X0] :
( ( epsilon_transitive(X0)
& epsilon_connected(X0) )
| ~ ordinal(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f86,plain,
! [X0,X1] :
( proper_subset(X0,X1)
| ~ subset(X0,X1)
| X0 = X1 ),
inference(ennf_transformation,[],[f65]) ).
fof(f87,plain,
! [X0,X1] :
( proper_subset(X0,X1)
| ~ subset(X0,X1)
| X0 = X1 ),
inference(flattening,[],[f86]) ).
fof(f91,plain,
! [X0] :
( ( ~ empty(succ(X0))
& epsilon_transitive(succ(X0))
& epsilon_connected(succ(X0))
& ordinal(succ(X0)) )
| ~ ordinal(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f93,plain,
! [X0,X1] :
( ( ordinal_subset(X0,X1)
<=> subset(X0,X1) )
| ~ ordinal(X0)
| ~ ordinal(X1) ),
inference(ennf_transformation,[],[f43]) ).
fof(f94,plain,
! [X0,X1] :
( ( ordinal_subset(X0,X1)
<=> subset(X0,X1) )
| ~ ordinal(X0)
| ~ ordinal(X1) ),
inference(flattening,[],[f93]) ).
fof(f98,plain,
! [X0] :
( ! [X1] :
( in(X0,X1)
| ~ proper_subset(X0,X1)
| ~ ordinal(X1) )
| ~ epsilon_transitive(X0) ),
inference(ennf_transformation,[],[f49]) ).
fof(f99,plain,
! [X0] :
( ! [X1] :
( in(X0,X1)
| ~ proper_subset(X0,X1)
| ~ ordinal(X1) )
| ~ epsilon_transitive(X0) ),
inference(flattening,[],[f98]) ).
fof(f102,plain,
! [X0] :
( ! [X1] :
( ( in(X0,X1)
<=> ordinal_subset(succ(X0),X1) )
| ~ ordinal(X1) )
| ~ ordinal(X0) ),
inference(ennf_transformation,[],[f51]) ).
fof(f103,plain,
! [X0] :
( ( being_limit_ordinal(X0)
<=> ! [X1] :
( in(succ(X1),X0)
| ~ in(X1,X0)
| ~ ordinal(X1) ) )
| ~ ordinal(X0) ),
inference(ennf_transformation,[],[f53]) ).
fof(f104,plain,
! [X0] :
( ( being_limit_ordinal(X0)
<=> ! [X1] :
( in(succ(X1),X0)
| ~ in(X1,X0)
| ~ ordinal(X1) ) )
| ~ ordinal(X0) ),
inference(flattening,[],[f103]) ).
fof(f105,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,[],[f64]) ).
fof(f125,plain,
! [X0,X1] :
( ( ( ordinal_subset(X0,X1)
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ~ ordinal_subset(X0,X1) ) )
| ~ ordinal(X0)
| ~ ordinal(X1) ),
inference(nnf_transformation,[],[f94]) ).
fof(f126,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,[],[f102]) ).
fof(f128,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,[],[f104]) ).
fof(f129,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,[],[f128]) ).
fof(f130,plain,
! [X0] :
( ( ( being_limit_ordinal(X0)
| ( ~ in(succ(sK13(X0)),X0)
& in(sK13(X0),X0)
& ordinal(sK13(X0)) ) )
& ( ! [X2] :
( in(succ(X2),X0)
| ~ in(X2,X0)
| ~ ordinal(X2) )
| ~ being_limit_ordinal(X0) ) )
| ~ ordinal(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK13]),skolemize(X1,sK13(X0))],[f129]) ).
fof(f131,plain,
( ( ( ~ being_limit_ordinal(sK14)
& ! [X1] :
( succ(X1) != sK14
| ~ ordinal(X1) ) )
| ( ordinal(sK15)
& sK14 = succ(sK15)
& being_limit_ordinal(sK14) ) )
& ordinal(sK14) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK14,sK15]),skolemize(X0,sK14),skolemize(X2,sK15)],[f105]) ).
fof(f132,plain,
! [X0,X1] :
( ~ in(X1,X0)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f74]) ).
fof(f136,plain,
! [X0] :
( epsilon_transitive(X0)
| ~ ordinal(X0) ),
inference(cnf_transformation,[],[f77]) ).
fof(f147,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| proper_subset(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f87]) ).
fof(f161,plain,
! [X0] :
( ordinal(succ(X0))
| ~ ordinal(X0) ),
inference(cnf_transformation,[],[f91]) ).
fof(f199,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ ordinal_subset(X0,X1)
| ~ ordinal(X0)
| ~ ordinal(X1) ),
inference(cnf_transformation,[],[f125]) ).
fof(f203,plain,
! [X0] : in(X0,succ(X0)),
inference(cnf_transformation,[],[f46]) ).
fof(f206,plain,
! [X0,X1] :
( ~ proper_subset(X0,X1)
| in(X0,X1)
| ~ ordinal(X1)
| ~ epsilon_transitive(X0) ),
inference(cnf_transformation,[],[f99]) ).
fof(f208,plain,
! [X0,X1] :
( ordinal_subset(succ(X0),X1)
| ~ in(X0,X1)
| ~ ordinal(X1)
| ~ ordinal(X0) ),
inference(cnf_transformation,[],[f126]) ).
fof(f212,plain,
! [X2,X0] :
( ~ being_limit_ordinal(X0)
| ~ in(X2,X0)
| ~ ordinal(X2)
| in(succ(X2),X0)
| ~ ordinal(X0) ),
inference(cnf_transformation,[],[f130]) ).
fof(f213,plain,
! [X0] :
( ordinal(sK13(X0))
| being_limit_ordinal(X0)
| ~ ordinal(X0) ),
inference(cnf_transformation,[],[f130]) ).
fof(f214,plain,
! [X0] :
( in(sK13(X0),X0)
| being_limit_ordinal(X0)
| ~ ordinal(X0) ),
inference(cnf_transformation,[],[f130]) ).
fof(f215,plain,
! [X0] :
( ~ in(succ(sK13(X0)),X0)
| being_limit_ordinal(X0)
| ~ ordinal(X0) ),
inference(cnf_transformation,[],[f130]) ).
fof(f216,plain,
ordinal(sK14),
inference(cnf_transformation,[],[f131]) ).
fof(f217,plain,
! [X1] :
( succ(X1) != sK14
| ~ ordinal(X1)
| being_limit_ordinal(sK14) ),
inference(cnf_transformation,[],[f131]) ).
fof(f221,plain,
( ~ being_limit_ordinal(sK14)
| sK14 = succ(sK15) ),
inference(cnf_transformation,[],[f131]) ).
fof(f222,plain,
( ~ being_limit_ordinal(sK14)
| ordinal(sK15) ),
inference(cnf_transformation,[],[f131]) ).
fof(f229,definition,
( spl16_1
<=> being_limit_ordinal(sK14) ),
introduced(definition,[new_symbols(definition,[spl16_1])],[avatar_definition]) ).
fof(f230,plain,
( ~ being_limit_ordinal(sK14)
| spl16_1 ),
inference(avatar_component_clause,[],[f229]) ).
fof(f231,plain,
( being_limit_ordinal(sK14)
| ~ spl16_1 ),
inference(avatar_component_clause,[],[f229]) ).
fof(f233,definition,
( spl16_2
<=> ! [X1] :
( succ(X1) != sK14
| ~ ordinal(X1) ) ),
introduced(definition,[new_symbols(definition,[spl16_2])],[avatar_definition]) ).
fof(f234,plain,
( ! [X1] :
( succ(X1) != sK14
| ~ ordinal(X1) )
| ~ spl16_2 ),
inference(avatar_component_clause,[],[f233]) ).
fof(f235,plain,
( spl16_1
| spl16_2 ),
inference(avatar_split_clause,[],[f217,f233,f229]) ).
fof(f237,definition,
( spl16_3
<=> sK14 = succ(sK15) ),
introduced(definition,[new_symbols(definition,[spl16_3])],[avatar_definition]) ).
fof(f239,plain,
( sK14 = succ(sK15)
| ~ spl16_3 ),
inference(avatar_component_clause,[],[f237]) ).
fof(f242,definition,
( spl16_4
<=> ordinal(sK15) ),
introduced(definition,[new_symbols(definition,[spl16_4])],[avatar_definition]) ).
fof(f244,plain,
( ordinal(sK15)
| ~ spl16_4 ),
inference(avatar_component_clause,[],[f242]) ).
fof(f246,plain,
( spl16_3
| ~ spl16_1 ),
inference(avatar_split_clause,[],[f221,f229,f237]) ).
fof(f247,plain,
( spl16_4
| ~ spl16_1 ),
inference(avatar_split_clause,[],[f222,f229,f242]) ).
fof(f287,plain,
! [X0,X1] :
( proper_subset(X0,X1)
| ~ ordinal(X0)
| ~ ordinal(X1)
| ~ ordinal_subset(X0,X1)
| X0 = X1 ),
inference(resolution,[],[f199,f147]) ).
fof(f313,plain,
! [X0] : ~ in(X0,X0),
inference(factoring,[],[f132]) ).
fof(f364,plain,
! [X0,X1] :
( ~ ordinal(X0)
| ~ ordinal(X1)
| ~ ordinal_subset(X0,X1)
| X0 = X1
| in(X0,X1)
| ~ ordinal(X1)
| ~ epsilon_transitive(X0) ),
inference(resolution,[],[f287,f206]) ).
fof(f365,plain,
! [X0,X1] :
( ~ ordinal(X0)
| ~ ordinal(X1)
| ~ ordinal_subset(X0,X1)
| X0 = X1
| in(X0,X1)
| ~ epsilon_transitive(X0) ),
inference(duplicate_literal_removal,[],[f364]) ).
fof(f367,plain,
! [X0,X1] :
( ~ ordinal_subset(X0,X1)
| ~ ordinal(X1)
| ~ ordinal(X0)
| X0 = X1
| in(X0,X1) ),
inference(forward_subsumption_resolution,[],[f365,f136]) ).
fof(f457,plain,
( ! [X0] :
( ~ in(X0,sK14)
| ~ ordinal(X0)
| in(succ(X0),sK14)
| ~ ordinal(sK14) )
| ~ spl16_1 ),
inference(resolution,[],[f231,f212]) ).
fof(f458,plain,
( ! [X0] :
( ~ in(X0,sK14)
| ~ ordinal(X0)
| in(succ(X0),sK14) )
| ~ spl16_1 ),
inference(forward_subsumption_resolution,[],[f457,f216]) ).
fof(f463,plain,
( in(sK15,sK14)
| ~ spl16_3 ),
inference(superposition,[],[f203,f239]) ).
fof(f485,plain,
( ~ ordinal(sK15)
| in(succ(sK15),sK14)
| ~ spl16_1
| ~ spl16_3 ),
inference(resolution,[],[f458,f463]) ).
fof(f487,plain,
( in(succ(sK15),sK14)
| ~ spl16_1
| ~ spl16_3
| ~ spl16_4 ),
inference(forward_subsumption_resolution,[],[f485,f244]) ).
fof(f490,plain,
( in(sK14,sK14)
| ~ spl16_1
| ~ spl16_3
| ~ spl16_4 ),
inference(forward_demodulation,[],[f487,f239]) ).
fof(f500,plain,
( $false
| ~ spl16_1
| ~ spl16_3
| ~ spl16_4 ),
inference(forward_subsumption_resolution,[],[f490,f313]) ).
fof(f501,plain,
( ~ spl16_1
| ~ spl16_3
| ~ spl16_4 ),
inference(avatar_contradiction_clause,[],[f500]) ).
fof(f629,plain,
! [X0,X1] :
( ~ ordinal(X0)
| ~ ordinal(succ(X1))
| succ(X1) = X0
| in(succ(X1),X0)
| ~ in(X1,X0)
| ~ ordinal(X0)
| ~ ordinal(X1) ),
inference(resolution,[],[f367,f208]) ).
fof(f630,plain,
! [X0,X1] :
( ~ ordinal(X0)
| ~ ordinal(succ(X1))
| succ(X1) = X0
| in(succ(X1),X0)
| ~ in(X1,X0)
| ~ ordinal(X1) ),
inference(duplicate_literal_removal,[],[f629]) ).
fof(f635,plain,
! [X0,X1] :
( ~ in(X1,X0)
| succ(X1) = X0
| in(succ(X1),X0)
| ~ ordinal(X0)
| ~ ordinal(X1) ),
inference(forward_subsumption_resolution,[],[f630,f161]) ).
fof(f805,definition,
( spl16_45
<=> ordinal(sK13(sK14)) ),
introduced(definition,[new_symbols(definition,[spl16_45])],[avatar_definition]) ).
fof(f806,plain,
( ordinal(sK13(sK14))
| ~ spl16_45 ),
inference(avatar_component_clause,[],[f805]) ).
fof(f807,plain,
( ~ ordinal(sK13(sK14))
| spl16_45 ),
inference(avatar_component_clause,[],[f805]) ).
fof(f838,plain,
( being_limit_ordinal(sK14)
| ~ ordinal(sK14)
| spl16_45 ),
inference(resolution,[],[f807,f213]) ).
fof(f842,plain,
( ~ ordinal(sK14)
| spl16_1
| spl16_45 ),
inference(forward_subsumption_resolution,[],[f838,f230]) ).
fof(f844,plain,
( $false
| spl16_1
| spl16_45 ),
inference(forward_subsumption_resolution,[],[f842,f216]) ).
fof(f845,plain,
( spl16_1
| spl16_45 ),
inference(avatar_contradiction_clause,[],[f844]) ).
fof(f1119,plain,
! [X0] :
( succ(sK13(X0)) = X0
| in(succ(sK13(X0)),X0)
| ~ ordinal(X0)
| ~ ordinal(sK13(X0))
| being_limit_ordinal(X0)
| ~ ordinal(X0) ),
inference(resolution,[],[f635,f214]) ).
fof(f1123,plain,
! [X0] :
( succ(sK13(X0)) = X0
| in(succ(sK13(X0)),X0)
| ~ ordinal(X0)
| ~ ordinal(sK13(X0))
| being_limit_ordinal(X0) ),
inference(duplicate_literal_removal,[],[f1119]) ).
fof(f1127,plain,
! [X0] :
( succ(sK13(X0)) = X0
| ~ ordinal(X0)
| ~ ordinal(sK13(X0))
| being_limit_ordinal(X0) ),
inference(forward_subsumption_resolution,[],[f1123,f215]) ).
fof(f1130,plain,
! [X0] :
( being_limit_ordinal(X0)
| ~ ordinal(X0)
| succ(sK13(X0)) = X0 ),
inference(forward_subsumption_resolution,[],[f1127,f213]) ).
fof(f1392,plain,
( ~ ordinal(sK14)
| sK14 = succ(sK13(sK14))
| spl16_1 ),
inference(resolution,[],[f1130,f230]) ).
fof(f1394,plain,
( sK14 = succ(sK13(sK14))
| spl16_1 ),
inference(forward_subsumption_resolution,[],[f1392,f216]) ).
fof(f1570,plain,
( sK14 != sK14
| ~ ordinal(sK13(sK14))
| spl16_1
| ~ spl16_2 ),
inference(superposition,[],[f234,f1394]) ).
fof(f1587,plain,
( ~ ordinal(sK13(sK14))
| spl16_1
| ~ spl16_2 ),
inference(trivial_inequality_removal,[],[f1570]) ).
fof(f1603,plain,
( $false
| spl16_1
| ~ spl16_2
| ~ spl16_45 ),
inference(forward_subsumption_resolution,[],[f1587,f806]) ).
fof(f1604,plain,
( spl16_1
| ~ spl16_2
| ~ spl16_45 ),
inference(avatar_contradiction_clause,[],[f1603]) ).
cnf(s1,plain,
( spl16_1
| spl16_2 ),
inference(sat_conversion,[],[f235]) ).
cnf(s4,plain,
( ~ spl16_1
| spl16_3 ),
inference(sat_conversion,[],[f246]) ).
cnf(s5,plain,
( ~ spl16_1
| spl16_4 ),
inference(sat_conversion,[],[f247]) ).
cnf(s24,plain,
( ~ spl16_1
| ~ spl16_3
| ~ spl16_4 ),
inference(sat_conversion,[],[f501]) ).
cnf(s57,plain,
( spl16_1
| spl16_45 ),
inference(sat_conversion,[],[f845]) ).
cnf(s99,plain,
( spl16_1
| ~ spl16_2
| ~ spl16_45 ),
inference(sat_conversion,[],[f1604]) ).
cnf(s109,plain,
spl16_1,
inference(rat,[],[s99,s1,s57]) ).
cnf(s110,plain,
spl16_4,
inference(rat,[],[s5,s109]) ).
cnf(s111,plain,
spl16_3,
inference(rat,[],[s4,s109]) ).
cnf(s112,plain,
$false,
inference(rat,[],[s24,s109,s110,s111]) ).
fof(f1621,plain,
$false,
inference(avatar_sat_refutation,[],[s112]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU238+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n006.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 28 04:15:10 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/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
% 3.01/1.32 % (3575143)Detected formulas, will run a generic FOF schedule.
% 3.01/1.32 % (3575151)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1367677935:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.01/1.32 % (3575151)Refutation not found, incomplete strategy
% 3.01/1.32 % (3575151)------------------------------
% 3.01/1.32 % (3575151)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.01/1.32 % (3575151)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.01/1.32 % (3575151)CaDiCaL version: 2.1.3
% 3.01/1.32 % (3575151)Termination reason: Refutation not found, incomplete strategy
% 3.01/1.32 % (3575151)Time elapsed: 0.001 s
% 3.01/1.32 % (3575151)Peak memory usage: 88 MB
% 3.01/1.32 % (3575151)Instructions burned: 1 (million)
% 3.01/1.32 % (3575152)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3211055983:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.01/1.32 % (3575149)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=71051247:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.01/1.32 % (3575148)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=144973526:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.01/1.32 % (3575154)dis-21_1_sil=8000:lcm=predicate:random_seed=3166283476: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.01/1.32 % (3575150)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=2363954601:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.01/1.32 % (3575153)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3909846413:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.01/1.32 % (3575153)First to succeed.
% 3.01/1.32 % (3575153)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3575143"
% 3.01/1.32 % (3575152)Instruction limit reached!
% 3.01/1.32 % (3575152)------------------------------
% 3.01/1.32 % (3575152)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.01/1.32 % (3575152)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.01/1.32 % (3575152)CaDiCaL version: 2.1.3
% 3.01/1.32 % (3575152)Termination reason: Instruction limit
% 3.01/1.32 % (3575152)Termination phase: Saturation
% 3.01/1.32 % (3575152)Time elapsed: 0.052 s
% 3.01/1.32 % (3575152)Peak memory usage: 88 MB
% 3.01/1.32 % (3575152)Instructions burned: 119 (million)
% 3.01/1.32 % (3575154)Instruction limit reached!
% 3.01/1.32 % (3575154)------------------------------
% 3.01/1.32 % (3575154)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.01/1.32 % (3575154)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.01/1.32 % (3575154)CaDiCaL version: 2.1.3
% 3.01/1.32 % (3575154)Termination reason: Instruction limit
% 3.01/1.32 % (3575154)Termination phase: Saturation
% 3.01/1.32 % (3575154)Time elapsed: 0.077 s
% 3.01/1.32 % (3575154)Peak memory usage: 89 MB
% 3.01/1.32 % (3575154)Instructions burned: 129 (million)
% 3.01/1.32 % (3575151)------------------------------
% 3.01/1.32 % (3575151)------------------------------
% 3.01/1.32 % (3575162)lrs+10_1_sil=8000:sp=occurrence:random_seed=669006164:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.01/1.32 % (3575163)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2429609073:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.01/1.32 % (3575164)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2963423616:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 3.01/1.32 % (3575164)Refutation not found, incomplete strategy
% 3.01/1.32 % (3575164)------------------------------
% 3.01/1.32 % (3575164)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.01/1.32 % (3575164)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.01/1.32 % (3575164)CaDiCaL version: 2.1.3
% 3.01/1.32 % (3575164)Termination reason: Refutation not found, incomplete strategy
% 3.01/1.32 % (3575164)Time elapsed: 0.005 s
% 3.01/1.32 % (3575164)Peak memory usage: 89 MB
% 3.01/1.32 % (3575164)Instructions burned: 11 (million)
% 3.01/1.32 % (3575153)Refutation found. Thanks to Tanya!
% 3.01/1.32 % SZS status Theorem for theBenchmark
% 3.01/1.32 % SZS output start Proof for theBenchmark
% See solution above
% 3.92/1.52 % (3575153)------------------------------
% 3.92/1.52 % (3575153)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.92/1.52 % (3575153)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.92/1.52 % (3575153)CaDiCaL version: 2.1.3
% 3.92/1.52 % (3575153)Termination reason: Refutation
% 3.92/1.52 % (3575153)Time elapsed: 0.033 s
% 3.92/1.52 % (3575153)Peak memory usage: 90 MB
% 3.92/1.52 % (3575153)Instructions burned: 40 (million)
% 3.92/1.52 % (3575153)------------------------------
% 3.92/1.52 % (3575153)------------------------------
% 3.92/1.52 % (3575143)Success in time 0.467 s
% 3.92/1.52 % Vampire exiting
%------------------------------------------------------------------------------