%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU238+3 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 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:52:33 PM UTC 2026
% Result : Theorem 1.25s 0.64s
% Output : Refutation 1.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 16
% Syntax : Number of formulae : 131 ( 14 unt; 5 def)
% Number of atoms : 409 ( 43 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 455 ( 177 ~; 218 |; 27 &)
% ( 14 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 16 ( 14 usr; 6 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 124 ( 0 sgn 119 !; 5 ?)
% 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(f11,axiom,
! [X0] : succ(X0) = set_union2(X0,singleton(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_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(f20,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(f38,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(f41,axiom,
! [X0] : in(X0,succ(X0)),
file('/export/starexec/sandbox/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/sandbox/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/sandbox/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/sandbox/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/sandbox/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(f108,plain,
! [X0,X1] :
( ~ in(X0,X1)
| ~ in(X1,X0) ),
inference(cnf_transformation,[],[f70]) ).
fof(f112,plain,
! [X0] :
( ~ ordinal(X0)
| epsilon_transitive(X0) ),
inference(cnf_transformation,[],[f73]) ).
fof(f120,plain,
! [X0] : succ(X0) = set_union2(X0,singleton(X0)),
inference(cnf_transformation,[],[f11]) ).
fof(f121,plain,
! [X0,X1] :
( X0 = X1
| ~ subset(X0,X1)
| proper_subset(X0,X1) ),
inference(cnf_transformation,[],[f83]) ).
fof(f135,plain,
! [X0] :
( ~ ordinal(X0)
| ordinal(succ(X0)) ),
inference(cnf_transformation,[],[f87]) ).
fof(f176,plain,
! [X0,X1] :
( ~ ordinal(X1)
| ~ ordinal(X0)
| subset(X0,X1)
| ~ ordinal_subset(X0,X1) ),
inference(cnf_transformation,[],[f90]) ).
fof(f179,plain,
! [X0] : in(X0,succ(X0)),
inference(cnf_transformation,[],[f41]) ).
fof(f182,plain,
! [X0,X1] :
( ~ epsilon_transitive(X0)
| ~ ordinal(X1)
| ~ proper_subset(X0,X1)
| in(X0,X1) ),
inference(cnf_transformation,[],[f95]) ).
fof(f185,plain,
! [X0,X1] :
( ~ ordinal(X0)
| ~ ordinal(X1)
| ordinal_subset(succ(X0),X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f98]) ).
fof(f188,plain,
! [X0,X1] :
( ~ ordinal(X0)
| ~ ordinal(X1)
| ~ in(X1,X0)
| in(succ(X1),X0)
| ~ being_limit_ordinal(X0) ),
inference(cnf_transformation,[],[f100]) ).
fof(f189,plain,
! [X0] :
( ~ ordinal(X0)
| ordinal(sK14(X0))
| being_limit_ordinal(X0) ),
inference(cnf_transformation,[],[f100]) ).
fof(f190,plain,
! [X0] :
( ~ ordinal(X0)
| in(sK14(X0),X0)
| being_limit_ordinal(X0) ),
inference(cnf_transformation,[],[f100]) ).
fof(f191,plain,
! [X0] :
( ~ ordinal(X0)
| ~ in(succ(sK14(X0)),X0)
| being_limit_ordinal(X0) ),
inference(cnf_transformation,[],[f100]) ).
fof(f192,plain,
! [X1] :
( being_limit_ordinal(sK15)
| ~ ordinal(X1)
| succ(X1) != sK15 ),
inference(cnf_transformation,[],[f101]) ).
fof(f193,plain,
! [X1] :
( ordinal(sK16)
| ~ ordinal(X1)
| succ(X1) != sK15 ),
inference(cnf_transformation,[],[f101]) ).
fof(f194,plain,
! [X1] :
( sK15 = succ(sK16)
| ~ ordinal(X1)
| succ(X1) != sK15 ),
inference(cnf_transformation,[],[f101]) ).
fof(f195,plain,
( sK15 = succ(sK16)
| ~ being_limit_ordinal(sK15) ),
inference(cnf_transformation,[],[f101]) ).
fof(f196,plain,
( ordinal(sK16)
| ~ being_limit_ordinal(sK15) ),
inference(cnf_transformation,[],[f101]) ).
fof(f197,plain,
ordinal(sK15),
inference(cnf_transformation,[],[f101]) ).
fof(f207,plain,
! [X0] :
( ~ ordinal(X0)
| ordinal(set_union2(X0,singleton(X0))) ),
inference(definition_unfolding,[],[f135,f120]) ).
fof(f208,plain,
! [X0] : in(X0,set_union2(X0,singleton(X0))),
inference(definition_unfolding,[],[f179,f120]) ).
fof(f209,plain,
! [X0,X1] :
( ~ ordinal(X0)
| ~ ordinal(X1)
| ordinal_subset(set_union2(X0,singleton(X0)),X1)
| ~ in(X0,X1) ),
inference(definition_unfolding,[],[f185,f120]) ).
fof(f211,plain,
! [X0] :
( ~ ordinal(X0)
| ~ in(set_union2(sK14(X0),singleton(sK14(X0))),X0)
| being_limit_ordinal(X0) ),
inference(definition_unfolding,[],[f191,f120]) ).
fof(f212,plain,
! [X0,X1] :
( ~ ordinal(X0)
| ~ ordinal(X1)
| ~ in(X1,X0)
| in(set_union2(X1,singleton(X1)),X0)
| ~ being_limit_ordinal(X0) ),
inference(definition_unfolding,[],[f188,f120]) ).
fof(f213,plain,
( sK15 = set_union2(sK16,singleton(sK16))
| ~ being_limit_ordinal(sK15) ),
inference(definition_unfolding,[],[f195,f120]) ).
fof(f214,plain,
! [X1] :
( sK15 = set_union2(sK16,singleton(sK16))
| ~ ordinal(X1)
| sK15 != set_union2(X1,singleton(X1)) ),
inference(definition_unfolding,[],[f194,f120,f120]) ).
fof(f215,plain,
! [X1] :
( ordinal(sK16)
| ~ ordinal(X1)
| sK15 != set_union2(X1,singleton(X1)) ),
inference(definition_unfolding,[],[f193,f120]) ).
fof(f216,plain,
! [X1] :
( being_limit_ordinal(sK15)
| ~ ordinal(X1)
| sK15 != set_union2(X1,singleton(X1)) ),
inference(definition_unfolding,[],[f192,f120]) ).
fof(f217,plain,
! [X0,X1] :
( in(X0,X1)
| in(X1,X0) ),
inference(consistent_polarity_flipping,[],[f108]) ).
fof(f220,plain,
! [X0] :
( epsilon_transitive(X0)
| ordinal(X0) ),
inference(consistent_polarity_flipping,[],[f112]) ).
fof(f227,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| X0 = X1
| ~ proper_subset(X0,X1) ),
inference(consistent_polarity_flipping,[],[f121]) ).
fof(f238,plain,
! [X0] :
( ~ ordinal(set_union2(X0,singleton(X0)))
| ordinal(X0) ),
inference(consistent_polarity_flipping,[],[f207]) ).
fof(f262,plain,
! [X0,X1] :
( subset(X0,X1)
| ordinal(X0)
| ordinal(X1)
| ordinal_subset(X0,X1) ),
inference(consistent_polarity_flipping,[],[f176]) ).
fof(f265,plain,
! [X0] : ~ in(X0,set_union2(X0,singleton(X0))),
inference(consistent_polarity_flipping,[],[f208]) ).
fof(f267,plain,
! [X0,X1] :
( proper_subset(X0,X1)
| ordinal(X1)
| ~ epsilon_transitive(X0)
| ~ in(X0,X1) ),
inference(consistent_polarity_flipping,[],[f182]) ).
fof(f269,plain,
! [X0,X1] :
( ~ ordinal_subset(set_union2(X0,singleton(X0)),X1)
| ordinal(X1)
| ordinal(X0)
| in(X0,X1) ),
inference(consistent_polarity_flipping,[],[f209]) ).
fof(f273,plain,
! [X0] :
( ~ being_limit_ordinal(X0)
| in(set_union2(sK14(X0),singleton(sK14(X0))),X0)
| ordinal(X0) ),
inference(consistent_polarity_flipping,[],[f211]) ).
fof(f274,plain,
! [X0] :
( ~ being_limit_ordinal(X0)
| ~ in(sK14(X0),X0)
| ordinal(X0) ),
inference(consistent_polarity_flipping,[],[f190]) ).
fof(f275,plain,
! [X0] :
( ~ ordinal(sK14(X0))
| ordinal(X0)
| ~ being_limit_ordinal(X0) ),
inference(consistent_polarity_flipping,[],[f189]) ).
fof(f276,plain,
! [X0,X1] :
( ~ in(set_union2(X1,singleton(X1)),X0)
| ordinal(X1)
| in(X1,X0)
| ordinal(X0)
| being_limit_ordinal(X0) ),
inference(consistent_polarity_flipping,[],[f212]) ).
fof(f277,plain,
~ ordinal(sK15),
inference(consistent_polarity_flipping,[],[f197]) ).
fof(f278,plain,
( ~ ordinal(sK16)
| being_limit_ordinal(sK15) ),
inference(consistent_polarity_flipping,[],[f196]) ).
fof(f279,plain,
( sK15 = set_union2(sK16,singleton(sK16))
| being_limit_ordinal(sK15) ),
inference(consistent_polarity_flipping,[],[f213]) ).
fof(f280,plain,
! [X1] :
( sK15 = set_union2(sK16,singleton(sK16))
| ordinal(X1)
| sK15 != set_union2(X1,singleton(X1)) ),
inference(consistent_polarity_flipping,[],[f214]) ).
fof(f281,plain,
! [X1] :
( ~ ordinal(sK16)
| ordinal(X1)
| sK15 != set_union2(X1,singleton(X1)) ),
inference(consistent_polarity_flipping,[],[f215]) ).
fof(f282,plain,
! [X1] :
( ~ being_limit_ordinal(sK15)
| ordinal(X1)
| sK15 != set_union2(X1,singleton(X1)) ),
inference(consistent_polarity_flipping,[],[f216]) ).
fof(f287,definition,
( spl17_1
<=> ! [X1] :
( ordinal(X1)
| sK15 != set_union2(X1,singleton(X1)) ) ),
introduced(definition,[new_symbols(definition,[spl17_1])],[avatar_definition]) ).
fof(f288,plain,
( ! [X1] :
( sK15 != set_union2(X1,singleton(X1))
| ordinal(X1) )
| ~ spl17_1 ),
inference(avatar_component_clause,[],[f287]) ).
fof(f290,definition,
( spl17_2
<=> being_limit_ordinal(sK15) ),
introduced(definition,[new_symbols(definition,[spl17_2])],[avatar_definition]) ).
fof(f291,plain,
( being_limit_ordinal(sK15)
| ~ spl17_2 ),
inference(avatar_component_clause,[],[f290]) ).
fof(f293,plain,
( spl17_1
| ~ spl17_2 ),
inference(avatar_split_clause,[],[f282,f290,f287]) ).
fof(f295,definition,
( spl17_3
<=> ordinal(sK16) ),
introduced(definition,[new_symbols(definition,[spl17_3])],[avatar_definition]) ).
fof(f297,plain,
( ~ ordinal(sK16)
| spl17_3 ),
inference(avatar_component_clause,[],[f295]) ).
fof(f298,plain,
( spl17_1
| ~ spl17_3 ),
inference(avatar_split_clause,[],[f281,f295,f287]) ).
fof(f300,definition,
( spl17_4
<=> sK15 = set_union2(sK16,singleton(sK16)) ),
introduced(definition,[new_symbols(definition,[spl17_4])],[avatar_definition]) ).
fof(f302,plain,
( sK15 = set_union2(sK16,singleton(sK16))
| ~ spl17_4 ),
inference(avatar_component_clause,[],[f300]) ).
fof(f303,plain,
( spl17_1
| spl17_4 ),
inference(avatar_split_clause,[],[f280,f300,f287]) ).
fof(f304,plain,
( spl17_2
| spl17_4 ),
inference(avatar_split_clause,[],[f279,f300,f290]) ).
fof(f305,plain,
( spl17_2
| ~ spl17_3 ),
inference(avatar_split_clause,[],[f278,f295,f290]) ).
fof(f345,plain,
! [X0] : in(X0,X0),
inference(factoring,[],[f217]) ).
fof(f348,plain,
( ~ in(sK16,sK15)
| ~ spl17_4 ),
inference(superposition,[],[f265,f302]) ).
fof(f424,plain,
! [X0,X1] :
( ~ proper_subset(X0,X1)
| ordinal(X1)
| ordinal_subset(X0,X1)
| X0 = X1
| ordinal(X0) ),
inference(resolution,[],[f262,f227]) ).
fof(f445,plain,
( ! [X0] :
( ~ in(sK15,X0)
| ordinal(sK16)
| in(sK16,X0)
| ordinal(X0)
| being_limit_ordinal(X0) )
| ~ spl17_4 ),
inference(superposition,[],[f276,f302]) ).
fof(f448,plain,
( ! [X0] :
( in(sK16,X0)
| ~ in(sK15,X0)
| ordinal(X0)
| being_limit_ordinal(X0) )
| spl17_3
| ~ spl17_4 ),
inference(forward_subsumption_resolution,[],[f445,f297]) ).
fof(f451,plain,
( ~ in(sK15,sK15)
| ordinal(sK15)
| being_limit_ordinal(sK15)
| spl17_3
| ~ spl17_4 ),
inference(resolution,[],[f448,f348]) ).
fof(f457,plain,
( ordinal(sK15)
| being_limit_ordinal(sK15)
| spl17_3
| ~ spl17_4 ),
inference(forward_subsumption_resolution,[],[f451,f345]) ).
fof(f460,plain,
( being_limit_ordinal(sK15)
| spl17_3
| ~ spl17_4 ),
inference(forward_subsumption_resolution,[],[f457,f277]) ).
fof(f468,plain,
( spl17_2
| spl17_3
| ~ spl17_4 ),
inference(avatar_split_clause,[],[f460,f300,f295,f290]) ).
fof(f469,plain,
( in(set_union2(sK14(sK15),singleton(sK14(sK15))),sK15)
| ordinal(sK15)
| ~ spl17_2 ),
inference(resolution,[],[f291,f273]) ).
fof(f470,plain,
( ~ in(sK14(sK15),sK15)
| ordinal(sK15)
| ~ spl17_2 ),
inference(resolution,[],[f291,f274]) ).
fof(f471,plain,
( ~ in(sK14(sK15),sK15)
| ~ spl17_2 ),
inference(forward_subsumption_resolution,[],[f470,f277]) ).
fof(f472,plain,
( in(set_union2(sK14(sK15),singleton(sK14(sK15))),sK15)
| ~ spl17_2 ),
inference(forward_subsumption_resolution,[],[f469,f277]) ).
fof(f516,definition,
( spl17_13
<=> ordinal(sK14(sK15)) ),
introduced(definition,[new_symbols(definition,[spl17_13])],[avatar_definition]) ).
fof(f517,plain,
( ~ ordinal(sK14(sK15))
| spl17_13 ),
inference(avatar_component_clause,[],[f516]) ).
fof(f518,plain,
( ordinal(sK14(sK15))
| ~ spl17_13 ),
inference(avatar_component_clause,[],[f516]) ).
fof(f523,plain,
( ordinal(sK15)
| ~ being_limit_ordinal(sK15)
| ~ spl17_13 ),
inference(resolution,[],[f518,f275]) ).
fof(f535,plain,
( ~ being_limit_ordinal(sK15)
| ~ spl17_13 ),
inference(forward_subsumption_resolution,[],[f523,f277]) ).
fof(f536,plain,
( $false
| ~ spl17_2
| ~ spl17_13 ),
inference(forward_subsumption_resolution,[],[f535,f291]) ).
fof(f537,plain,
( ~ spl17_2
| ~ spl17_13 ),
inference(avatar_contradiction_clause,[],[f536]) ).
fof(f588,plain,
! [X0,X1] :
( ordinal(X0)
| ordinal_subset(X1,X0)
| X0 = X1
| ordinal(X1)
| ordinal(X0)
| ~ epsilon_transitive(X1)
| ~ in(X1,X0) ),
inference(resolution,[],[f424,f267]) ).
fof(f591,plain,
! [X0,X1] :
( ordinal(X0)
| ordinal_subset(X1,X0)
| X0 = X1
| ordinal(X1)
| ~ epsilon_transitive(X1)
| ~ in(X1,X0) ),
inference(duplicate_literal_removal,[],[f588]) ).
fof(f593,plain,
! [X0,X1] :
( ordinal_subset(X1,X0)
| ordinal(X0)
| X0 = X1
| ordinal(X1)
| ~ in(X1,X0) ),
inference(forward_subsumption_resolution,[],[f591,f220]) ).
fof(f1038,plain,
! [X0,X1] :
( ordinal(X0)
| set_union2(X1,singleton(X1)) = X0
| ordinal(set_union2(X1,singleton(X1)))
| ~ in(set_union2(X1,singleton(X1)),X0)
| ordinal(X0)
| ordinal(X1)
| in(X1,X0) ),
inference(resolution,[],[f593,f269]) ).
fof(f1043,plain,
! [X0,X1] :
( ordinal(X0)
| set_union2(X1,singleton(X1)) = X0
| ordinal(set_union2(X1,singleton(X1)))
| ~ in(set_union2(X1,singleton(X1)),X0)
| ordinal(X1)
| in(X1,X0) ),
inference(duplicate_literal_removal,[],[f1038]) ).
fof(f1058,plain,
! [X0,X1] :
( ~ in(set_union2(X1,singleton(X1)),X0)
| set_union2(X1,singleton(X1)) = X0
| ordinal(X0)
| ordinal(X1)
| in(X1,X0) ),
inference(forward_subsumption_resolution,[],[f1043,f238]) ).
fof(f5926,plain,
( sK15 = set_union2(sK14(sK15),singleton(sK14(sK15)))
| ordinal(sK15)
| ordinal(sK14(sK15))
| in(sK14(sK15),sK15)
| ~ spl17_2 ),
inference(resolution,[],[f1058,f472]) ).
fof(f6090,plain,
( ordinal(sK15)
| ordinal(sK14(sK15))
| in(sK14(sK15),sK15)
| ~ spl17_1
| ~ spl17_2 ),
inference(forward_subsumption_resolution,[],[f5926,f288]) ).
fof(f6092,plain,
( ordinal(sK14(sK15))
| in(sK14(sK15),sK15)
| ~ spl17_1
| ~ spl17_2 ),
inference(forward_subsumption_resolution,[],[f6090,f277]) ).
fof(f6093,plain,
( in(sK14(sK15),sK15)
| ~ spl17_1
| ~ spl17_2
| spl17_13 ),
inference(forward_subsumption_resolution,[],[f6092,f517]) ).
fof(f6094,plain,
( $false
| ~ spl17_1
| ~ spl17_2
| spl17_13 ),
inference(forward_subsumption_resolution,[],[f6093,f471]) ).
fof(f6095,plain,
( ~ spl17_1
| ~ spl17_2
| spl17_13 ),
inference(avatar_contradiction_clause,[],[f6094]) ).
cnf(s1,plain,
( spl17_1
| ~ spl17_2 ),
inference(sat_conversion,[],[f293]) ).
cnf(s2,plain,
( spl17_1
| ~ spl17_3 ),
inference(sat_conversion,[],[f298]) ).
cnf(s3,plain,
( spl17_1
| spl17_4 ),
inference(sat_conversion,[],[f303]) ).
cnf(s4,plain,
( spl17_2
| spl17_4 ),
inference(sat_conversion,[],[f304]) ).
cnf(s5,plain,
( spl17_2
| ~ spl17_3 ),
inference(sat_conversion,[],[f305]) ).
cnf(s10,plain,
( spl17_2
| spl17_3
| ~ spl17_4 ),
inference(sat_conversion,[],[f468]) ).
cnf(s16,plain,
( ~ spl17_2
| ~ spl17_13 ),
inference(sat_conversion,[],[f537]) ).
cnf(s254,plain,
( ~ spl17_1
| ~ spl17_2
| spl17_13 ),
inference(sat_conversion,[],[f6095]) ).
cnf(s263,plain,
spl17_1,
inference(rat,[],[s10,s1,s2,s3]) ).
cnf(s264,plain,
spl17_2,
inference(rat,[],[s10,s4,s5]) ).
cnf(s265,plain,
spl17_13,
inference(rat,[],[s254,s263,s264]) ).
cnf(s268,plain,
$false,
inference(rat,[],[s16,s265,s264]) ).
fof(f6096,plain,
$false,
inference(avatar_sat_refutation,[],[s268]) ).
%------------------------------------------------------------------------------
%----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/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.38 % Computer : n015.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:19:01 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41 Running first-order model finding
% 0.10/0.41 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.25/0.64 % (2251853)Will run a generic schedule for satisfiability detection.
% 1.25/0.64 % (2251862)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4260126286:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.25/0.64 % (2251859)% WARNING: option uhcvi not known.
% 1.25/0.64 % (2251858)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1502231675_2999 on theBenchmark for (2999ds/0Mi)
% 1.25/0.64 % (2251860)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=19771734:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.25/0.64 % (2251861)dis+10_1_sil=32000:sp=arity:random_seed=718450798:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.25/0.64 % (2251863)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=348412352:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.25/0.64 % (2251864)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3945829354:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.25/0.64 % (2251859)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3448969288:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.25/0.64 % TRYING [1]
% 1.25/0.64 % TRYING [2]
% 1.25/0.64 % TRYING [3]
% 1.25/0.64 % TRYING [4]
% 1.25/0.64 % TRYING [5]
% 1.25/0.64 % (2251862)Instruction limit reached!
% 1.25/0.64 % (2251862)------------------------------
% 1.25/0.64 % (2251862)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.25/0.64 % (2251862)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.25/0.64 % (2251862)CaDiCaL version: 2.1.3
% 1.25/0.64 % (2251862)Termination reason: Instruction limit
% 1.25/0.64 % (2251862)Termination phase: Saturation
% 1.25/0.64 % (2251862)Time elapsed: 0.040 s
% 1.25/0.64 % (2251862)Peak memory usage: 13 MB
% 1.25/0.64 % (2251862)Instructions burned: 118 (million)
% 1.25/0.64 % (2251876)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1874491186:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.25/0.64 % TRYING [1]
% 1.25/0.64 % TRYING [2]
% 1.25/0.64 % TRYING [3]
% 1.25/0.64 % TRYING [4]
% 1.25/0.64 % TRYING [5]
% 1.25/0.64 % TRYING [6]
% 1.25/0.64 % (2251861)Instruction limit reached!
% 1.25/0.64 % (2251861)------------------------------
% 1.25/0.64 % (2251861)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.25/0.64 % (2251861)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.25/0.64 % (2251861)CaDiCaL version: 2.1.3
% 1.25/0.64 % (2251861)Termination reason: Instruction limit
% 1.25/0.64 % (2251861)Termination phase: Saturation
% 1.25/0.64 % (2251861)Time elapsed: 0.071 s
% 1.25/0.64 % (2251861)Peak memory usage: 12 MB
% 1.25/0.64 % (2251861)Instructions burned: 103 (million)
% 1.25/0.64 % TRYING [6]
% 1.25/0.64 % (2251863)Instruction limit reached!
% 1.25/0.64 % (2251863)------------------------------
% 1.25/0.64 % (2251863)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.25/0.64 % (2251863)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.25/0.64 % (2251863)CaDiCaL version: 2.1.3
% 1.25/0.64 % (2251863)Termination reason: Instruction limit
% 1.25/0.64 % (2251863)Termination phase: Saturation
% 1.25/0.64 % (2251863)Time elapsed: 0.087 s
% 1.25/0.64 % (2251863)Peak memory usage: 13 MB
% 1.25/0.64 % (2251863)Instructions burned: 132 (million)
% 1.25/0.64 % (2251883)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=209852075:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 1.25/0.64 % (2251864)Instruction limit reached!
% 1.25/0.64 % (2251864)------------------------------
% 1.25/0.64 % (2251864)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.25/0.64 % (2251864)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.25/0.64 % (2251864)CaDiCaL version: 2.1.3
% 1.25/0.64 % (2251864)Termination reason: Instruction limit
% 1.25/0.64 % (2251864)Termination phase: Saturation
% 1.25/0.64 % (2251864)Time elapsed: 0.107 s
% 1.25/0.64 % (2251864)Peak memory usage: 14 MB
% 1.25/0.64 % (2251864)Instructions burned: 160 (million)
% 1.25/0.64 % (2251888)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=2190056920:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.25/0.64 % (2251890)ott-21_1_sil=16000:fs=off:random_seed=3703212456:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.25/0.64 % TRYING [7]
% 1.25/0.64 % (2251859) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2251853-2251859"...
% 1.25/0.64 % (2251859)...printing done.
% 1.25/0.64 % (2251859)Refutation found. Thanks to Tanya!
% 1.25/0.64 % SZS status Theorem for theBenchmark
% 1.25/0.64 % SZS output start Proof for theBenchmark
% See solution above
% 1.25/0.64 % (2251859)------------------------------
% 1.25/0.64 % (2251859)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.25/0.64 % (2251859)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.25/0.64 % (2251859)CaDiCaL version: 2.1.3
% 1.25/0.64 % (2251859)Termination reason: Refutation
% 1.25/0.64 % (2251859)Time elapsed: 0.171 s
% 1.25/0.64 % (2251859)Peak memory usage: 15 MB
% 1.25/0.64 % (2251859)Instructions burned: 261 (million)
% 1.25/0.64 % (2251853)Success in time 0.214 s
% 1.25/0.64 % Vampire exiting
%------------------------------------------------------------------------------