%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU383+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 : 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:38 PM UTC 2026
% Result : Theorem 3.05s 1.33s
% Output : Refutation 4.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 10
% Syntax : Number of formulae : 90 ( 13 unt; 0 def)
% Number of atoms : 398 ( 26 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 499 ( 191 ~; 181 |; 96 &)
% ( 9 <=>; 19 =>; 0 <=; 3 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 143 ( 129 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
! [X0] :
( rel_str(X0)
=> ! [X1] :
( element(X1,powerset(the_carrier(X0)))
=> ( upper_relstr_subset(X1,X0)
<=> ! [X2] :
( element(X2,the_carrier(X0))
=> ! [X3] :
( element(X3,the_carrier(X0))
=> ( ( in(X2,X1)
& related(X0,X2,X3) )
=> in(X3,X1) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d20_waybel_0) ).
fof(f12,axiom,
! [X0] :
( rel_str(X0)
=> element(bottom_of_relstr(X0),the_carrier(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k3_yellow_0) ).
fof(f34,axiom,
! [X0,X1] :
( in(X0,X1)
=> element(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_subset) ).
fof(f35,axiom,
! [X0,X1] :
( element(X0,X1)
=> ( empty(X1)
| in(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_subset) ).
fof(f36,axiom,
! [X0,X1] :
( ! [X2] :
( in(X2,X0)
<=> in(X2,X1) )
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_tarski) ).
fof(f38,axiom,
! [X0] :
( ( ~ empty_carrier(X0)
& antisymmetric_relstr(X0)
& lower_bounded_relstr(X0)
& rel_str(X0) )
=> ! [X1] :
( element(X1,the_carrier(X0))
=> related(X0,bottom_of_relstr(X0),X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t44_yellow_0) ).
fof(f39,axiom,
! [X0,X1,X2] :
( ( in(X0,X1)
& element(X1,powerset(X2)) )
=> element(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_subset) ).
fof(f40,axiom,
! [X0,X1,X2] :
~ ( in(X0,X1)
& element(X1,powerset(X2))
& empty(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_subset) ).
fof(f41,axiom,
! [X0,X1] :
( element(X1,powerset(X0))
=> ( proper_element(X1,powerset(X0))
<=> X1 != X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_tex_2) ).
fof(f45,conjecture,
! [X0] :
( ( ~ empty_carrier(X0)
& reflexive_relstr(X0)
& transitive_relstr(X0)
& antisymmetric_relstr(X0)
& lower_bounded_relstr(X0)
& rel_str(X0) )
=> ! [X1] :
( ( ~ empty(X1)
& filtered_subset(X1,X0)
& upper_relstr_subset(X1,X0)
& element(X1,powerset(the_carrier(X0))) )
=> ( proper_element(X1,powerset(the_carrier(X0)))
<=> ~ in(bottom_of_relstr(X0),X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_waybel_7) ).
fof(f46,negated_conjecture,
~ ! [X0] :
( ( ~ empty_carrier(X0)
& reflexive_relstr(X0)
& transitive_relstr(X0)
& antisymmetric_relstr(X0)
& lower_bounded_relstr(X0)
& rel_str(X0) )
=> ! [X1] :
( ( ~ empty(X1)
& filtered_subset(X1,X0)
& upper_relstr_subset(X1,X0)
& element(X1,powerset(the_carrier(X0))) )
=> ( proper_element(X1,powerset(the_carrier(X0)))
<=> ~ in(bottom_of_relstr(X0),X1) ) ) ),
inference(negated_conjecture,[status(cth)],[f45]) ).
fof(f48,plain,
~ ! [X0] :
( ( ~ empty_carrier(X0)
& reflexive_relstr(X0)
& transitive_relstr(X0)
& antisymmetric_relstr(X0)
& lower_bounded_relstr(X0)
& rel_str(X0) )
=> ! [X1] :
( ( ~ empty(X1)
& upper_relstr_subset(X1,X0)
& element(X1,powerset(the_carrier(X0))) )
=> ( proper_element(X1,powerset(the_carrier(X0)))
<=> ~ in(bottom_of_relstr(X0),X1) ) ) ),
inference(pure_predicate_removal,[],[f46]) ).
fof(f49,plain,
? [X0] :
( ? [X1] :
( ( proper_element(X1,powerset(the_carrier(X0)))
<~> ~ in(bottom_of_relstr(X0),X1) )
& ~ empty(X1)
& upper_relstr_subset(X1,X0)
& element(X1,powerset(the_carrier(X0))) )
& ~ empty_carrier(X0)
& reflexive_relstr(X0)
& transitive_relstr(X0)
& antisymmetric_relstr(X0)
& lower_bounded_relstr(X0)
& rel_str(X0) ),
inference(ennf_transformation,[],[f48]) ).
fof(f50,plain,
? [X0] :
( ? [X1] :
( ( proper_element(X1,powerset(the_carrier(X0)))
<~> ~ in(bottom_of_relstr(X0),X1) )
& ~ empty(X1)
& upper_relstr_subset(X1,X0)
& element(X1,powerset(the_carrier(X0))) )
& ~ empty_carrier(X0)
& reflexive_relstr(X0)
& transitive_relstr(X0)
& antisymmetric_relstr(X0)
& lower_bounded_relstr(X0)
& rel_str(X0) ),
inference(flattening,[],[f49]) ).
fof(f53,plain,
! [X0,X1,X2] :
( ~ in(X0,X1)
| ~ element(X1,powerset(X2))
| ~ empty(X2) ),
inference(ennf_transformation,[],[f40]) ).
fof(f54,plain,
! [X0,X1,X2] :
( element(X0,X2)
| ~ in(X0,X1)
| ~ element(X1,powerset(X2)) ),
inference(ennf_transformation,[],[f39]) ).
fof(f55,plain,
! [X0,X1,X2] :
( element(X0,X2)
| ~ in(X0,X1)
| ~ element(X1,powerset(X2)) ),
inference(flattening,[],[f54]) ).
fof(f56,plain,
! [X0,X1] :
( empty(X1)
| in(X0,X1)
| ~ element(X0,X1) ),
inference(ennf_transformation,[],[f35]) ).
fof(f57,plain,
! [X0,X1] :
( empty(X1)
| in(X0,X1)
| ~ element(X0,X1) ),
inference(flattening,[],[f56]) ).
fof(f58,plain,
! [X0,X1] :
( element(X0,X1)
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f34]) ).
fof(f60,plain,
! [X0] :
( element(bottom_of_relstr(X0),the_carrier(X0))
| ~ rel_str(X0) ),
inference(ennf_transformation,[],[f12]) ).
fof(f65,plain,
! [X0] :
( ! [X1] :
( related(X0,bottom_of_relstr(X0),X1)
| ~ element(X1,the_carrier(X0)) )
| empty_carrier(X0)
| ~ antisymmetric_relstr(X0)
| ~ lower_bounded_relstr(X0)
| ~ rel_str(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f66,plain,
! [X0] :
( ! [X1] :
( related(X0,bottom_of_relstr(X0),X1)
| ~ element(X1,the_carrier(X0)) )
| empty_carrier(X0)
| ~ antisymmetric_relstr(X0)
| ~ lower_bounded_relstr(X0)
| ~ rel_str(X0) ),
inference(flattening,[],[f65]) ).
fof(f67,plain,
! [X0,X1] :
( ( proper_element(X1,powerset(X0))
<=> X1 != X0 )
| ~ element(X1,powerset(X0)) ),
inference(ennf_transformation,[],[f41]) ).
fof(f72,plain,
! [X0] :
( ! [X1] :
( ( upper_relstr_subset(X1,X0)
<=> ! [X2] :
( ! [X3] :
( in(X3,X1)
| ~ in(X2,X1)
| ~ related(X0,X2,X3)
| ~ element(X3,the_carrier(X0)) )
| ~ element(X2,the_carrier(X0)) ) )
| ~ element(X1,powerset(the_carrier(X0))) )
| ~ rel_str(X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f73,plain,
! [X0] :
( ! [X1] :
( ( upper_relstr_subset(X1,X0)
<=> ! [X2] :
( ! [X3] :
( in(X3,X1)
| ~ in(X2,X1)
| ~ related(X0,X2,X3)
| ~ element(X3,the_carrier(X0)) )
| ~ element(X2,the_carrier(X0)) ) )
| ~ element(X1,powerset(the_carrier(X0))) )
| ~ rel_str(X0) ),
inference(flattening,[],[f72]) ).
fof(f75,plain,
! [X0,X1] :
( X0 = X1
| ? [X2] :
( in(X2,X0)
<~> in(X2,X1) ) ),
inference(ennf_transformation,[],[f36]) ).
fof(f76,plain,
? [X0] :
( ? [X1] :
( ( in(bottom_of_relstr(X0),X1)
| ~ proper_element(X1,powerset(the_carrier(X0))) )
& ( ~ in(bottom_of_relstr(X0),X1)
| proper_element(X1,powerset(the_carrier(X0))) )
& ~ empty(X1)
& upper_relstr_subset(X1,X0)
& element(X1,powerset(the_carrier(X0))) )
& ~ empty_carrier(X0)
& reflexive_relstr(X0)
& transitive_relstr(X0)
& antisymmetric_relstr(X0)
& lower_bounded_relstr(X0)
& rel_str(X0) ),
inference(nnf_transformation,[],[f50]) ).
fof(f77,plain,
? [X0] :
( ? [X1] :
( ( in(bottom_of_relstr(X0),X1)
| ~ proper_element(X1,powerset(the_carrier(X0))) )
& ( ~ in(bottom_of_relstr(X0),X1)
| proper_element(X1,powerset(the_carrier(X0))) )
& ~ empty(X1)
& upper_relstr_subset(X1,X0)
& element(X1,powerset(the_carrier(X0))) )
& ~ empty_carrier(X0)
& reflexive_relstr(X0)
& transitive_relstr(X0)
& antisymmetric_relstr(X0)
& lower_bounded_relstr(X0)
& rel_str(X0) ),
inference(flattening,[],[f76]) ).
fof(f78,plain,
( ( in(bottom_of_relstr(sK0),sK1)
| ~ proper_element(sK1,powerset(the_carrier(sK0))) )
& ( ~ in(bottom_of_relstr(sK0),sK1)
| proper_element(sK1,powerset(the_carrier(sK0))) )
& ~ empty(sK1)
& upper_relstr_subset(sK1,sK0)
& element(sK1,powerset(the_carrier(sK0)))
& ~ empty_carrier(sK0)
& reflexive_relstr(sK0)
& transitive_relstr(sK0)
& antisymmetric_relstr(sK0)
& lower_bounded_relstr(sK0)
& rel_str(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f77]) ).
fof(f86,plain,
! [X0,X1] :
( ( ( proper_element(X1,powerset(X0))
| X0 = X1 )
& ( X1 != X0
| ~ proper_element(X1,powerset(X0)) ) )
| ~ element(X1,powerset(X0)) ),
inference(nnf_transformation,[],[f67]) ).
fof(f87,plain,
! [X0] :
( ! [X1] :
( ( ( upper_relstr_subset(X1,X0)
| ? [X2] :
( ? [X3] :
( ~ in(X3,X1)
& in(X2,X1)
& related(X0,X2,X3)
& element(X3,the_carrier(X0)) )
& element(X2,the_carrier(X0)) ) )
& ( ! [X2] :
( ! [X3] :
( in(X3,X1)
| ~ in(X2,X1)
| ~ related(X0,X2,X3)
| ~ element(X3,the_carrier(X0)) )
| ~ element(X2,the_carrier(X0)) )
| ~ upper_relstr_subset(X1,X0) ) )
| ~ element(X1,powerset(the_carrier(X0))) )
| ~ rel_str(X0) ),
inference(nnf_transformation,[],[f73]) ).
fof(f88,plain,
! [X0] :
( ! [X1] :
( ( ( upper_relstr_subset(X1,X0)
| ? [X2] :
( ? [X3] :
( ~ in(X3,X1)
& in(X2,X1)
& related(X0,X2,X3)
& element(X3,the_carrier(X0)) )
& element(X2,the_carrier(X0)) ) )
& ( ! [X4] :
( ! [X5] :
( in(X5,X1)
| ~ in(X4,X1)
| ~ related(X0,X4,X5)
| ~ element(X5,the_carrier(X0)) )
| ~ element(X4,the_carrier(X0)) )
| ~ upper_relstr_subset(X1,X0) ) )
| ~ element(X1,powerset(the_carrier(X0))) )
| ~ rel_str(X0) ),
inference(rectify,[],[f87]) ).
fof(f89,plain,
! [X0] :
( ! [X1] :
( ( ( upper_relstr_subset(X1,X0)
| ( ~ in(sK10(X0,X1),X1)
& in(sK9(X0,X1),X1)
& related(X0,sK9(X0,X1),sK10(X0,X1))
& element(sK10(X0,X1),the_carrier(X0))
& element(sK9(X0,X1),the_carrier(X0)) ) )
& ( ! [X4] :
( ! [X5] :
( in(X5,X1)
| ~ in(X4,X1)
| ~ related(X0,X4,X5)
| ~ element(X5,the_carrier(X0)) )
| ~ element(X4,the_carrier(X0)) )
| ~ upper_relstr_subset(X1,X0) ) )
| ~ element(X1,powerset(the_carrier(X0))) )
| ~ rel_str(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9,sK10]),skolemize(X2,sK9(X0,X1)),skolemize(X3,sK10(X0,X1))],[f88]) ).
fof(f90,plain,
! [X0,X1] :
( X0 = X1
| ? [X2] :
( ( ~ in(X2,X1)
| ~ in(X2,X0) )
& ( in(X2,X1)
| in(X2,X0) ) ) ),
inference(nnf_transformation,[],[f75]) ).
fof(f91,plain,
! [X0,X1] :
( X0 = X1
| ( ( ~ in(sK11(X0,X1),X1)
| ~ in(sK11(X0,X1),X0) )
& ( in(sK11(X0,X1),X1)
| in(sK11(X0,X1),X0) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK11]),skolemize(X2,sK11(X0,X1))],[f90]) ).
fof(f92,plain,
rel_str(sK0),
inference(cnf_transformation,[],[f78]) ).
fof(f93,plain,
lower_bounded_relstr(sK0),
inference(cnf_transformation,[],[f78]) ).
fof(f94,plain,
antisymmetric_relstr(sK0),
inference(cnf_transformation,[],[f78]) ).
fof(f97,plain,
~ empty_carrier(sK0),
inference(cnf_transformation,[],[f78]) ).
fof(f98,plain,
element(sK1,powerset(the_carrier(sK0))),
inference(cnf_transformation,[],[f78]) ).
fof(f99,plain,
upper_relstr_subset(sK1,sK0),
inference(cnf_transformation,[],[f78]) ).
fof(f100,plain,
~ empty(sK1),
inference(cnf_transformation,[],[f78]) ).
fof(f101,plain,
( proper_element(sK1,powerset(the_carrier(sK0)))
| ~ in(bottom_of_relstr(sK0),sK1) ),
inference(cnf_transformation,[],[f78]) ).
fof(f102,plain,
( ~ proper_element(sK1,powerset(the_carrier(sK0)))
| in(bottom_of_relstr(sK0),sK1) ),
inference(cnf_transformation,[],[f78]) ).
fof(f109,plain,
! [X2,X0,X1] :
( ~ element(X1,powerset(X2))
| ~ in(X0,X1)
| ~ empty(X2) ),
inference(cnf_transformation,[],[f53]) ).
fof(f110,plain,
! [X2,X0,X1] :
( ~ element(X1,powerset(X2))
| ~ in(X0,X1)
| element(X0,X2) ),
inference(cnf_transformation,[],[f55]) ).
fof(f111,plain,
! [X0,X1] :
( in(X0,X1)
| empty(X1)
| ~ element(X0,X1) ),
inference(cnf_transformation,[],[f57]) ).
fof(f112,plain,
! [X0,X1] :
( element(X0,X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f58]) ).
fof(f114,plain,
! [X0] :
( element(bottom_of_relstr(X0),the_carrier(X0))
| ~ rel_str(X0) ),
inference(cnf_transformation,[],[f60]) ).
fof(f124,plain,
! [X0,X1] :
( related(X0,bottom_of_relstr(X0),X1)
| ~ element(X1,the_carrier(X0))
| empty_carrier(X0)
| ~ antisymmetric_relstr(X0)
| ~ lower_bounded_relstr(X0)
| ~ rel_str(X0) ),
inference(cnf_transformation,[],[f66]) ).
fof(f125,plain,
! [X0,X1] :
( X0 != X1
| ~ proper_element(X1,powerset(X0))
| ~ element(X1,powerset(X0)) ),
inference(cnf_transformation,[],[f86]) ).
fof(f126,plain,
! [X0,X1] :
( proper_element(X1,powerset(X0))
| X0 = X1
| ~ element(X1,powerset(X0)) ),
inference(cnf_transformation,[],[f86]) ).
fof(f129,plain,
! [X0,X1,X4,X5] :
( in(X5,X1)
| ~ in(X4,X1)
| ~ related(X0,X4,X5)
| ~ element(X5,the_carrier(X0))
| ~ element(X4,the_carrier(X0))
| ~ upper_relstr_subset(X1,X0)
| ~ element(X1,powerset(the_carrier(X0)))
| ~ rel_str(X0) ),
inference(cnf_transformation,[],[f89]) ).
fof(f136,plain,
! [X0,X1] :
( in(sK11(X0,X1),X1)
| X0 = X1
| in(sK11(X0,X1),X0) ),
inference(cnf_transformation,[],[f91]) ).
fof(f137,plain,
! [X0,X1] :
( ~ in(sK11(X0,X1),X1)
| X0 = X1
| ~ in(sK11(X0,X1),X0) ),
inference(cnf_transformation,[],[f91]) ).
fof(f138,plain,
! [X1] :
( ~ proper_element(X1,powerset(X1))
| ~ element(X1,powerset(X1)) ),
inference(equality_resolution,[],[f125]) ).
fof(f150,plain,
! [X0] :
( ~ empty(the_carrier(sK0))
| ~ in(X0,sK1) ),
inference(resolution,[],[f109,f98]) ).
fof(f156,plain,
! [X0] :
( element(X0,the_carrier(sK0))
| ~ in(X0,sK1) ),
inference(resolution,[],[f110,f98]) ).
fof(f165,plain,
( sK1 = the_carrier(sK0)
| ~ element(sK1,powerset(the_carrier(sK0)))
| in(bottom_of_relstr(sK0),sK1) ),
inference(resolution,[],[f126,f102]) ).
fof(f168,plain,
( in(bottom_of_relstr(sK0),sK1)
| sK1 = the_carrier(sK0) ),
inference(forward_subsumption_resolution,[],[f165,f98]) ).
fof(f179,plain,
! [X0,X1] :
( ~ element(sK11(X0,X1),X1)
| ~ in(sK11(X0,X1),X0)
| empty(X1)
| X0 = X1 ),
inference(resolution,[],[f137,f111]) ).
fof(f233,plain,
! [X0,X1,X4,X5] :
( ~ element(X1,powerset(the_carrier(X0)))
| ~ in(X4,X1)
| ~ related(X0,X4,X5)
| ~ element(X5,the_carrier(X0))
| ~ upper_relstr_subset(X1,X0)
| in(X5,X1)
| ~ rel_str(X0) ),
inference(forward_subsumption_resolution,[],[f129,f110]) ).
fof(f241,plain,
! [X0,X1] :
( ~ in(X0,sK1)
| ~ related(sK0,X0,X1)
| ~ element(X1,the_carrier(sK0))
| ~ upper_relstr_subset(sK1,sK0)
| in(X1,sK1)
| ~ rel_str(sK0) ),
inference(resolution,[],[f233,f98]) ).
fof(f248,plain,
! [X0,X1] :
( ~ in(X0,sK1)
| ~ related(sK0,X0,X1)
| ~ element(X1,the_carrier(sK0))
| in(X1,sK1)
| ~ rel_str(sK0) ),
inference(forward_subsumption_resolution,[],[f241,f99]) ).
fof(f249,plain,
! [X0,X1] :
( ~ related(sK0,X0,X1)
| ~ in(X0,sK1)
| ~ element(X1,the_carrier(sK0))
| in(X1,sK1) ),
inference(forward_subsumption_resolution,[],[f248,f92]) ).
fof(f250,plain,
! [X0] :
( ~ in(bottom_of_relstr(sK0),sK1)
| ~ element(X0,the_carrier(sK0))
| in(X0,sK1)
| ~ element(X0,the_carrier(sK0))
| empty_carrier(sK0)
| ~ antisymmetric_relstr(sK0)
| ~ lower_bounded_relstr(sK0)
| ~ rel_str(sK0) ),
inference(resolution,[],[f249,f124]) ).
fof(f252,plain,
! [X0] :
( ~ in(bottom_of_relstr(sK0),sK1)
| ~ element(X0,the_carrier(sK0))
| in(X0,sK1)
| empty_carrier(sK0)
| ~ antisymmetric_relstr(sK0)
| ~ lower_bounded_relstr(sK0)
| ~ rel_str(sK0) ),
inference(duplicate_literal_removal,[],[f250]) ).
fof(f254,plain,
! [X0] :
( ~ in(bottom_of_relstr(sK0),sK1)
| ~ element(X0,the_carrier(sK0))
| in(X0,sK1)
| ~ antisymmetric_relstr(sK0)
| ~ lower_bounded_relstr(sK0)
| ~ rel_str(sK0) ),
inference(forward_subsumption_resolution,[],[f252,f97]) ).
fof(f256,plain,
! [X0] :
( ~ in(bottom_of_relstr(sK0),sK1)
| ~ element(X0,the_carrier(sK0))
| in(X0,sK1)
| ~ lower_bounded_relstr(sK0)
| ~ rel_str(sK0) ),
inference(forward_subsumption_resolution,[],[f254,f94]) ).
fof(f257,plain,
! [X0] :
( ~ in(bottom_of_relstr(sK0),sK1)
| ~ element(X0,the_carrier(sK0))
| in(X0,sK1)
| ~ rel_str(sK0) ),
inference(forward_subsumption_resolution,[],[f256,f93]) ).
fof(f258,plain,
! [X0] :
( ~ element(X0,the_carrier(sK0))
| ~ in(bottom_of_relstr(sK0),sK1)
| in(X0,sK1) ),
inference(forward_subsumption_resolution,[],[f257,f92]) ).
fof(f264,plain,
! [X0] :
( ~ in(bottom_of_relstr(sK0),sK1)
| in(X0,sK1)
| ~ in(X0,the_carrier(sK0)) ),
inference(resolution,[],[f258,f112]) ).
fof(f293,plain,
! [X0] :
( ~ in(X0,the_carrier(sK0))
| in(X0,sK1)
| sK1 = the_carrier(sK0) ),
inference(resolution,[],[f264,f168]) ).
fof(f298,plain,
! [X0] :
( in(sK11(X0,the_carrier(sK0)),sK1)
| sK1 = the_carrier(sK0)
| the_carrier(sK0) = X0
| in(sK11(X0,the_carrier(sK0)),X0) ),
inference(resolution,[],[f293,f136]) ).
fof(f314,plain,
! [X0] :
( ~ in(sK11(X0,the_carrier(sK0)),X0)
| empty(the_carrier(sK0))
| the_carrier(sK0) = X0
| ~ in(sK11(X0,the_carrier(sK0)),sK1) ),
inference(resolution,[],[f179,f156]) ).
fof(f315,plain,
! [X0] :
( ~ in(sK11(X0,the_carrier(sK0)),sK1)
| the_carrier(sK0) = X0
| ~ in(sK11(X0,the_carrier(sK0)),X0) ),
inference(forward_subsumption_resolution,[],[f314,f150]) ).
fof(f344,plain,
( ~ in(sK11(sK1,the_carrier(sK0)),sK1)
| sK1 = the_carrier(sK0) ),
inference(factoring,[],[f315]) ).
fof(f1568,plain,
( sK1 = the_carrier(sK0)
| sK1 = the_carrier(sK0)
| in(sK11(sK1,the_carrier(sK0)),sK1)
| sK1 = the_carrier(sK0) ),
inference(resolution,[],[f298,f344]) ).
fof(f1571,plain,
( sK1 = the_carrier(sK0)
| in(sK11(sK1,the_carrier(sK0)),sK1) ),
inference(duplicate_literal_removal,[],[f1568]) ).
fof(f1573,plain,
sK1 = the_carrier(sK0),
inference(forward_subsumption_resolution,[],[f1571,f344]) ).
fof(f1578,plain,
element(sK1,powerset(sK1)),
inference(superposition,[],[f98,f1573]) ).
fof(f1579,plain,
( proper_element(sK1,powerset(sK1))
| ~ in(bottom_of_relstr(sK0),sK1) ),
inference(superposition,[],[f101,f1573]) ).
fof(f1635,plain,
( element(bottom_of_relstr(sK0),sK1)
| ~ rel_str(sK0) ),
inference(superposition,[],[f114,f1573]) ).
fof(f1714,plain,
element(bottom_of_relstr(sK0),sK1),
inference(forward_subsumption_resolution,[],[f1635,f92]) ).
fof(f1975,plain,
( ~ in(bottom_of_relstr(sK0),sK1)
| ~ element(sK1,powerset(sK1)) ),
inference(resolution,[],[f1579,f138]) ).
fof(f1976,plain,
~ in(bottom_of_relstr(sK0),sK1),
inference(forward_subsumption_resolution,[],[f1975,f1578]) ).
fof(f1984,plain,
( empty(sK1)
| ~ element(bottom_of_relstr(sK0),sK1) ),
inference(resolution,[],[f1976,f111]) ).
fof(f1985,plain,
~ element(bottom_of_relstr(sK0),sK1),
inference(forward_subsumption_resolution,[],[f1984,f100]) ).
fof(f1986,plain,
$false,
inference(forward_subsumption_resolution,[],[f1985,f1714]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU383+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 : n018.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 05:04:24 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.40 Running first-order theorem proving
% 0.11/0.40 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.05/1.33 % (3001136)Detected formulas, will run a generic FOF schedule.
% 3.05/1.33 % (3001144)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=470363317:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.05/1.33 % (3001144)Refutation not found, incomplete strategy
% 3.05/1.33 % (3001144)------------------------------
% 3.05/1.33 % (3001144)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.05/1.33 % (3001144)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.05/1.33 % (3001144)CaDiCaL version: 2.1.3
% 3.05/1.33 % (3001144)Termination reason: Refutation not found, incomplete strategy
% 3.05/1.33 % (3001144)Time elapsed: 0.002 s
% 3.05/1.33 % (3001144)Peak memory usage: 88 MB
% 3.05/1.33 % (3001144)Instructions burned: 3 (million)
% 3.05/1.33 % (3001145)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2633151450:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.05/1.33 % (3001141)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=3720576942:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.05/1.33 % (3001143)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=886404097:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.05/1.33 % (3001142)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=1490637215:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.05/1.33 % (3001147)dis-21_1_sil=8000:lcm=predicate:random_seed=1363337276: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 % (3001146)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2312668133:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.05/1.33 % (3001145)First to succeed.
% 3.05/1.33 % (3001145)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3001136"
% 3.05/1.33 % (3001147)Instruction limit reached!
% 3.05/1.33 % (3001147)------------------------------
% 3.05/1.33 % (3001147)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.05/1.33 % (3001147)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.05/1.33 % (3001147)CaDiCaL version: 2.1.3
% 3.05/1.33 % (3001147)Termination reason: Instruction limit
% 3.05/1.33 % (3001147)Termination phase: Saturation
% 3.05/1.33 % (3001147)Time elapsed: 0.073 s
% 3.05/1.33 % (3001147)Peak memory usage: 90 MB
% 3.05/1.33 % (3001147)Instructions burned: 130 (million)
% 3.05/1.33 % (3001146)Instruction limit reached!
% 3.05/1.33 % (3001146)------------------------------
% 3.05/1.33 % (3001146)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.05/1.33 % (3001146)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.05/1.33 % (3001146)CaDiCaL version: 2.1.3
% 3.05/1.33 % (3001146)Termination reason: Instruction limit
% 3.05/1.33 % (3001146)Termination phase: Saturation
% 3.05/1.33 % (3001146)Time elapsed: 0.100 s
% 3.05/1.33 % (3001146)Peak memory usage: 89 MB
% 3.05/1.33 % (3001146)Instructions burned: 140 (million)
% 3.05/1.33 % (3001144)------------------------------
% 3.05/1.33 % (3001144)------------------------------
% 3.05/1.33 % (3001155)lrs+10_1_sil=8000:sp=occurrence:random_seed=1949169382:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.05/1.33 % (3001157)lrs+1011_1_sil=32000:sp=occurrence:random_seed=3508166513:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 3.05/1.33 % (3001155)Also succeeded, but the first one will report.
% 3.05/1.33 % (3001156)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3294446881:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.05/1.33 % (3001157)Also succeeded, but the first one will report.
% 3.05/1.33 % (3001145)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
% 4.03/1.53 % (3001145)------------------------------
% 4.03/1.53 % (3001145)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.03/1.53 % (3001145)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.03/1.53 % (3001145)CaDiCaL version: 2.1.3
% 4.03/1.53 % (3001145)Termination reason: Refutation
% 4.03/1.53 % (3001145)Time elapsed: 0.057 s
% 4.03/1.53 % (3001145)Peak memory usage: 89 MB
% 4.03/1.53 % (3001145)Instructions burned: 89 (million)
% 4.03/1.53 % (3001145)------------------------------
% 4.03/1.53 % (3001145)------------------------------
% 4.03/1.53 % (3001136)Success in time 0.482 s
% 4.03/1.53 % Vampire exiting
%------------------------------------------------------------------------------