%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU236+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n011.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 : Fri Sep 25 02:56:17 PM UTC 2026
% Result : Theorem 17.01s 3.97s
% Output : CNFRefutation 17.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 12
% Syntax : Number of formulae : 97 ( 15 unt; 0 def)
% Number of atoms : 309 ( 38 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 355 ( 143 ~; 147 |; 43 &)
% ( 11 <=>; 10 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 145 ( 0 sgn 133 !; 12 ?; 42 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( ordinal(X0)
=> ( epsilon_connected(X0)
& epsilon_transitive(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cc1_ordinal1) ).
fof(f10,axiom,
! [X0] : succ(X0) = set_union2(X0,singleton(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_ordinal1) ).
fof(f11,axiom,
! [X0,X1] :
( X1 = singleton(X0)
<=> ! [X2] :
( in(X2,X1)
<=> X2 = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).
fof(f12,axiom,
! [X0] :
( epsilon_transitive(X0)
<=> ! [X1] :
( in(X1,X0)
=> subset(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_ordinal1) ).
fof(f13,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f27,axiom,
! [X0] :
( ordinal(X0)
=> ( ordinal(succ(X0))
& epsilon_connected(succ(X0))
& epsilon_transitive(succ(X0))
& ~ empty(succ(X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc3_ordinal1) ).
fof(f43,axiom,
! [X0,X1] :
( ( ordinal(X1)
& ordinal(X0) )
=> ( 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(f50,conjecture,
! [X0] :
( ordinal(X0)
=> ! [X1] :
( ordinal(X1)
=> ( in(X0,X1)
<=> ordinal_subset(succ(X0),X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t33_ordinal1) ).
fof(f51,negated_conjecture,
~ ! [X0] :
( ordinal(X0)
=> ! [X1] :
( ordinal(X1)
=> ( in(X0,X1)
<=> ordinal_subset(succ(X0),X1) ) ) ),
inference(negated_conjecture,[status(cth)],[f50]) ).
fof(f58,axiom,
! [X0,X1,X2] :
( ( subset(X2,X1)
& subset(X0,X1) )
=> subset(set_union2(X0,X2),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_xboole_1) ).
fof(f71,plain,
! [X0] :
( ~ ordinal(X0)
| ( epsilon_connected(X0)
& epsilon_transitive(X0) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f80,plain,
! [X0] :
( epsilon_transitive(X0)
<=> ! [X1] :
( ~ in(X1,X0)
| subset(X1,X0) ) ),
inference(ennf_transformation,[],[f12]) ).
fof(f81,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) ) ),
inference(ennf_transformation,[],[f13]) ).
fof(f85,plain,
! [X0] :
( ~ ordinal(X0)
| ( ordinal(succ(X0))
& epsilon_connected(succ(X0))
& epsilon_transitive(succ(X0))
& ~ empty(succ(X0)) ) ),
inference(ennf_transformation,[],[f27]) ).
fof(f87,plain,
! [X0,X1] :
( ~ ordinal(X1)
| ~ ordinal(X0)
| ( ordinal_subset(X0,X1)
<=> subset(X0,X1) ) ),
inference(ennf_transformation,[],[f43]) ).
fof(f88,plain,
! [X0,X1] :
( ~ ordinal(X1)
| ~ ordinal(X0)
| ( ordinal_subset(X0,X1)
<=> subset(X0,X1) ) ),
inference(flattening,[],[f87]) ).
fof(f94,plain,
? [X0] :
( ordinal(X0)
& ? [X1] :
( ordinal(X1)
& ( in(X0,X1)
<~> ordinal_subset(succ(X0),X1) ) ) ),
inference(ennf_transformation,[],[f51]) ).
fof(f101,plain,
! [X0,X1,X2] :
( ~ subset(X2,X1)
| ~ subset(X0,X1)
| subset(set_union2(X0,X2),X1) ),
inference(ennf_transformation,[],[f58]) ).
fof(f102,plain,
! [X0,X1,X2] :
( ~ subset(X2,X1)
| ~ subset(X0,X1)
| subset(set_union2(X0,X2),X1) ),
inference(flattening,[],[f101]) ).
fof(f103,plain,
! [X0,X1] :
( ( singleton(X0) != X1
| ! [X2] :
( ( ~ in(X2,X1)
| X2 = X0 )
& ( X0 != X2
| in(X2,X1) ) ) )
& ( ? [X2] :
( ( in(X2,X1)
| X2 = X0 )
& ( ~ in(X2,X1)
| X0 != X2 ) )
| X1 = singleton(X0) ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f104,plain,
! [X0,X1] :
( ( singleton(X0) != X1
| ! [X3] :
( ( ~ in(X3,X1)
| X0 = X3 )
& ( X0 != X3
| in(X3,X1) ) ) )
& ( ? [X2] :
( ( in(X2,X1)
| X2 = X0 )
& ( ~ in(X2,X1)
| X0 != X2 ) )
| X1 = singleton(X0) ) ),
inference(rectify,[],[f103]) ).
fof(f105,plain,
! [X0,X1] :
( ( singleton(X0) != X1
| ! [X3] :
( ( ~ in(X3,X1)
| X0 = X3 )
& ( X0 != X3
| in(X3,X1) ) ) )
& ( ( ( in(sK0(X0,X1),X1)
| sK0(X0,X1) = X0 )
& ( ~ in(sK0(X0,X1),X1)
| sK0(X0,X1) != X0 ) )
| X1 = singleton(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f104]) ).
fof(f106,plain,
! [X0] :
( ( ~ epsilon_transitive(X0)
| ! [X1] :
( ~ in(X1,X0)
| subset(X1,X0) ) )
& ( ? [X1] :
( in(X1,X0)
& ~ subset(X1,X0) )
| epsilon_transitive(X0) ) ),
inference(nnf_transformation,[],[f80]) ).
fof(f107,plain,
! [X0] :
( ( ~ epsilon_transitive(X0)
| ! [X2] :
( ~ in(X2,X0)
| subset(X2,X0) ) )
& ( ? [X1] :
( in(X1,X0)
& ~ subset(X1,X0) )
| epsilon_transitive(X0) ) ),
inference(rectify,[],[f106]) ).
fof(f108,plain,
! [X0] :
( ( ~ epsilon_transitive(X0)
| ! [X2] :
( ~ in(X2,X0)
| subset(X2,X0) ) )
& ( ( in(sK1(X0),X0)
& ~ subset(sK1(X0),X0) )
| epsilon_transitive(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X1,sK1(X0))],[f107]) ).
fof(f109,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) ) )
& ( ? [X2] :
( in(X2,X0)
& ~ in(X2,X1) )
| subset(X0,X1) ) ),
inference(nnf_transformation,[],[f81]) ).
fof(f110,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X3] :
( ~ in(X3,X0)
| in(X3,X1) ) )
& ( ? [X2] :
( in(X2,X0)
& ~ in(X2,X1) )
| subset(X0,X1) ) ),
inference(rectify,[],[f109]) ).
fof(f111,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X3] :
( ~ in(X3,X0)
| in(X3,X1) ) )
& ( ( in(sK2(X0,X1),X0)
& ~ in(sK2(X0,X1),X1) )
| subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X2,sK2(X0,X1))],[f110]) ).
fof(f125,plain,
! [X0,X1] :
( ~ ordinal(X1)
| ~ ordinal(X0)
| ( ( ~ ordinal_subset(X0,X1)
| subset(X0,X1) )
& ( ~ subset(X0,X1)
| ordinal_subset(X0,X1) ) ) ),
inference(nnf_transformation,[],[f88]) ).
fof(f126,plain,
? [X0] :
( ordinal(X0)
& ? [X1] :
( ordinal(X1)
& ( in(X0,X1)
| ordinal_subset(succ(X0),X1) )
& ( ~ in(X0,X1)
| ~ ordinal_subset(succ(X0),X1) ) ) ),
inference(nnf_transformation,[],[f94]) ).
fof(f127,plain,
? [X0] :
( ordinal(X0)
& ? [X1] :
( ordinal(X1)
& ( in(X0,X1)
| ordinal_subset(succ(X0),X1) )
& ( ~ in(X0,X1)
| ~ ordinal_subset(succ(X0),X1) ) ) ),
inference(flattening,[],[f126]) ).
fof(f128,plain,
( ordinal(sK16)
& ordinal(sK17)
& ( in(sK16,sK17)
| ordinal_subset(succ(sK16),sK17) )
& ( ~ in(sK16,sK17)
| ~ ordinal_subset(succ(sK16),sK17) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK16,sK17]),skolemize(X0,sK16),skolemize(X1,sK17)],[f127]) ).
fof(f133,plain,
! [X0] :
( ~ ordinal(X0)
| epsilon_transitive(X0) ),
inference(cnf_transformation,[],[f71]) ).
fof(f143,plain,
! [X0] : succ(X0) = set_union2(X0,singleton(X0)),
inference(cnf_transformation,[],[f10]) ).
fof(f144,plain,
! [X3,X0,X1] :
( singleton(X0) != X1
| ~ in(X3,X1)
| X0 = X3 ),
inference(cnf_transformation,[],[f105]) ).
fof(f148,plain,
! [X2,X0] :
( ~ epsilon_transitive(X0)
| ~ in(X2,X0)
| subset(X2,X0) ),
inference(cnf_transformation,[],[f108]) ).
fof(f151,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ in(X3,X0)
| in(X3,X1) ),
inference(cnf_transformation,[],[f111]) ).
fof(f152,plain,
! [X0,X1] :
( in(sK2(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f111]) ).
fof(f153,plain,
! [X0,X1] :
( ~ in(sK2(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f111]) ).
fof(f167,plain,
! [X0] :
( ~ ordinal(X0)
| ordinal(succ(X0)) ),
inference(cnf_transformation,[],[f85]) ).
fof(f204,plain,
! [X0,X1] :
( ~ ordinal(X1)
| ~ ordinal(X0)
| ~ ordinal_subset(X0,X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f125]) ).
fof(f205,plain,
! [X0,X1] :
( ~ ordinal(X1)
| ~ ordinal(X0)
| ~ subset(X0,X1)
| ordinal_subset(X0,X1) ),
inference(cnf_transformation,[],[f125]) ).
fof(f208,plain,
! [X0] : in(X0,succ(X0)),
inference(cnf_transformation,[],[f46]) ).
fof(f212,plain,
ordinal(sK16),
inference(cnf_transformation,[],[f128]) ).
fof(f213,plain,
ordinal(sK17),
inference(cnf_transformation,[],[f128]) ).
fof(f214,plain,
( in(sK16,sK17)
| ordinal_subset(succ(sK16),sK17) ),
inference(cnf_transformation,[],[f128]) ).
fof(f215,plain,
( ~ in(sK16,sK17)
| ~ ordinal_subset(succ(sK16),sK17) ),
inference(cnf_transformation,[],[f128]) ).
fof(f223,plain,
! [X2,X0,X1] :
( ~ subset(X2,X1)
| ~ subset(X0,X1)
| subset(set_union2(X0,X2),X1) ),
inference(cnf_transformation,[],[f102]) ).
fof(f228,plain,
! [X0] :
( ~ ordinal(X0)
| ordinal(set_union2(X0,singleton(X0))) ),
inference(definition_unfolding,[],[f167,f143]) ).
fof(f229,plain,
! [X0] : in(X0,set_union2(X0,singleton(X0))),
inference(definition_unfolding,[],[f208,f143]) ).
fof(f230,plain,
( ~ in(sK16,sK17)
| ~ ordinal_subset(set_union2(sK16,singleton(sK16)),sK17) ),
inference(definition_unfolding,[],[f215,f143]) ).
fof(f231,plain,
( in(sK16,sK17)
| ordinal_subset(set_union2(sK16,singleton(sK16)),sK17) ),
inference(definition_unfolding,[],[f214,f143]) ).
fof(f234,plain,
! [X3,X0] :
( ~ in(X3,singleton(X0))
| X0 = X3 ),
inference(equality_resolution,[],[f144]) ).
tcf(c_51,plain,
! [X0: $i] :
( epsilon_transitive(X0)
| ~ ordinal(X0) ),
inference(cnf_transformation,[],[f133]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ in(X0,singleton(X1)) ),
inference(cnf_transformation,[],[f234]) ).
tcf(c_66,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ~ epsilon_transitive(X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f148]) ).
tcf(c_67,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ~ in(sK2(X0,X1),X1) ),
inference(cnf_transformation,[],[f153]) ).
tcf(c_68,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| in(sK2(X0,X1),X0) ),
inference(cnf_transformation,[],[f152]) ).
tcf(c_69,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,X2)
| ~ subset(X1,X2)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f151]) ).
tcf(c_86,plain,
! [X0: $i] :
( ordinal(set_union2(X0,singleton(X0)))
| ~ ordinal(X0) ),
inference(cnf_transformation,[],[f228]) ).
tcf(c_120,plain,
! [X0: $i,X1: $i] :
( ordinal_subset(X0,X1)
| ~ ordinal(X1)
| ~ ordinal(X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f205]) ).
tcf(c_121,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ~ ordinal(X1)
| ~ ordinal(X0)
| ~ ordinal_subset(X0,X1) ),
inference(cnf_transformation,[],[f204]) ).
tcf(c_124,plain,
! [X0: $i] : in(X0,set_union2(X0,singleton(X0))),
inference(cnf_transformation,[],[f229]) ).
tcf(c_128,negated_conjecture,
( ~ in(sK16,sK17)
| ~ ordinal_subset(set_union2(sK16,singleton(sK16)),sK17) ),
inference(cnf_transformation,[],[f230]) ).
tcf(c_129,negated_conjecture,
( in(sK16,sK17)
| ordinal_subset(set_union2(sK16,singleton(sK16)),sK17) ),
inference(cnf_transformation,[],[f231]) ).
tcf(c_130,negated_conjecture,
ordinal(sK17),
inference(cnf_transformation,[],[f213]) ).
tcf(c_131,negated_conjecture,
ordinal(sK16),
inference(cnf_transformation,[],[f212]) ).
tcf(c_139,plain,
! [X0: $i,X1: $i,X2: $i] :
( subset(set_union2(X0,X2),X1)
| ~ subset(X2,X1)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f223]) ).
tcf(c_1406,plain,
! [X0: $i] : X0 = X0,
theory(equality) ).
tcf(c_1409,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( in(X0,X2)
| ~ in(X1,X3)
| ( X2 != X3 )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_2336,plain,
! [X0: $i] :
( in(sK16,sK17)
| ~ subset(X0,sK17)
| ~ in(sK16,X0) ),
inference(instantiation,[status(thm)],[c_69]) ).
tcf(c_2338,plain,
! [X0: $i] :
( subset(X0,sK17)
| ~ ordinal(sK17)
| ~ ordinal(X0)
| ~ ordinal_subset(X0,sK17) ),
inference(instantiation,[status(thm)],[c_121]) ).
tcf(c_2340,plain,
! [X0: $i] :
( subset(X0,sK17)
| ~ in(sK2(X0,sK17),sK17) ),
inference(instantiation,[status(thm)],[c_67]) ).
tcf(c_2341,plain,
! [X0: $i] :
( subset(X0,sK17)
| in(sK2(X0,sK17),X0) ),
inference(instantiation,[status(thm)],[c_68]) ).
tcf(c_2349,plain,
! [X0: $i,X1: $i] :
( in(sK16,sK17)
| ~ subset(set_union2(X0,X1),sK17)
| ~ in(sK16,set_union2(X0,X1)) ),
inference(instantiation,[status(thm)],[c_2336]) ).
tcf(c_2369,plain,
! [X0: $i,X1: $i] :
( subset(set_union2(X0,X1),sK17)
| ~ subset(X1,sK17)
| ~ subset(X0,sK17) ),
inference(instantiation,[status(thm)],[c_139]) ).
tcf(c_2401,plain,
( epsilon_transitive(sK17)
| ~ ordinal(sK17) ),
inference(instantiation,[status(thm)],[c_51]) ).
tcf(c_2409,plain,
( in(sK16,sK17)
| ~ subset(set_union2(sK16,singleton(sK16)),sK17)
| ~ in(sK16,set_union2(sK16,singleton(sK16))) ),
inference(instantiation,[status(thm)],[c_2349]) ).
tcf(c_2419,plain,
in(sK16,set_union2(sK16,singleton(sK16))),
inference(instantiation,[status(thm)],[c_124]) ).
tcf(c_2548,plain,
( subset(set_union2(sK16,singleton(sK16)),sK17)
| ~ ordinal(sK17)
| ~ ordinal(set_union2(sK16,singleton(sK16)))
| ~ ordinal_subset(set_union2(sK16,singleton(sK16)),sK17) ),
inference(instantiation,[status(thm)],[c_2338]) ).
tcf(c_2551,plain,
( subset(set_union2(sK16,singleton(sK16)),sK17)
| ~ subset(sK16,sK17)
| ~ subset(singleton(sK16),sK17) ),
inference(instantiation,[status(thm)],[c_2369]) ).
tcf(c_2572,plain,
( subset(singleton(sK16),sK17)
| in(sK2(singleton(sK16),sK17),singleton(sK16)) ),
inference(instantiation,[status(thm)],[c_2341]) ).
tcf(c_2583,plain,
sK17 = sK17,
inference(instantiation,[status(thm)],[c_1406]) ).
tcf(c_2856,plain,
! [X0: $i,X1: $i] :
( ordinal_subset(set_union2(X0,singleton(X0)),X1)
| ~ ordinal(X1)
| ~ ordinal(set_union2(X0,singleton(X0)))
| ~ subset(set_union2(X0,singleton(X0)),X1) ),
inference(instantiation,[status(thm)],[c_120]) ).
tcf(c_2933,plain,
! [X0: $i,X1: $i] :
( in(X0,X1)
| ~ in(sK16,sK17)
| ( X1 != sK17 )
| ( X0 != sK16 ) ),
inference(instantiation,[status(thm)],[c_1409]) ).
tcf(c_2989,plain,
( ordinal(set_union2(sK16,singleton(sK16)))
| ~ ordinal(sK16) ),
inference(instantiation,[status(thm)],[c_86]) ).
tcf(c_3111,negated_conjecture,
in(sK16,sK17),
inference(global_subsumption_just,[status(thm)],[c_129,c_131,c_130,c_129,c_2409,c_2419,c_2548,c_2989]) ).
tcf(c_3655,plain,
( subset(sK16,sK17)
| ~ epsilon_transitive(sK17) ),
inference(superposition,[status(thm)],[c_3111,c_66]) ).
tcf(c_4392,plain,
! [X0: $i,X1: $i] :
( ( sK2(singleton(X0),sK17) = X1 )
| ~ in(sK2(singleton(X0),sK17),singleton(X1)) ),
inference(instantiation,[status(thm)],[c_63]) ).
tcf(c_4445,plain,
! [X0: $i] :
( ordinal_subset(set_union2(X0,singleton(X0)),sK17)
| ~ ordinal(sK17)
| ~ ordinal(set_union2(X0,singleton(X0)))
| ~ subset(set_union2(X0,singleton(X0)),sK17) ),
inference(instantiation,[status(thm)],[c_2856]) ).
tcf(c_7222,plain,
( ( sK2(singleton(sK16),sK17) = sK16 )
| ~ in(sK2(singleton(sK16),sK17),singleton(sK16)) ),
inference(instantiation,[status(thm)],[c_4392]) ).
tcf(c_8586,plain,
( ordinal_subset(set_union2(sK16,singleton(sK16)),sK17)
| ~ ordinal(sK17)
| ~ ordinal(set_union2(sK16,singleton(sK16)))
| ~ subset(set_union2(sK16,singleton(sK16)),sK17) ),
inference(instantiation,[status(thm)],[c_4445]) ).
tcf(c_10599,plain,
! [X0: $i] :
( in(sK2(singleton(sK16),sK17),X0)
| ~ in(sK16,sK17)
| ( X0 != sK17 )
| ( sK2(singleton(sK16),sK17) != sK16 ) ),
inference(instantiation,[status(thm)],[c_2933]) ).
tcf(c_18401,plain,
( in(sK2(singleton(sK16),sK17),sK17)
| ~ in(sK16,sK17)
| ( sK17 != sK17 )
| ( sK2(singleton(sK16),sK17) != sK16 ) ),
inference(instantiation,[status(thm)],[c_10599]) ).
tcf(c_25203,plain,
( subset(singleton(sK16),sK17)
| ~ in(sK2(singleton(sK16),sK17),sK17) ),
inference(instantiation,[status(thm)],[c_2340]) ).
tcf(c_25204,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_25203,c_18401,c_8586,c_7222,c_3655,c_3111,c_2989,c_2583,c_2572,c_2551,c_2401,c_128,c_130,c_131]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU236+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.15/0.41 % Computer : n011.cluster.edu
% 0.15/0.41 % Model : x86_64 x86_64
% 0.15/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.41 % Memory : 8046.5625MB
% 0.15/0.41 % OS : Linux 6.8.0-71-generic
% 0.15/0.41 % CPULimit : 300
% 0.15/0.41 % WCLimit : 300
% 0.15/0.41 % DateTime : Thu Sep 24 13:20:43 UTC 2026
% 0.15/0.42 % CPUTime :
% 0.15/0.42 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.24/0.48 Running first-order theorem proving
% 0.24/0.48 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.24/0.50
% 0.24/0.50 % ======== iProver multi-core TPTP/SMT =========
% 0.24/0.50
% 0.24/0.50 % Detected problem language: tptp
% 0.24/0.52 % Proving...
% 17.01/3.97 % SZS status Started for theBenchmark.p
% 17.01/3.97 % SZS status Theorem for theBenchmark.p
% 17.01/3.97
% 17.01/3.97 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 17.01/3.97
% 17.01/3.97 % ------ iProver source info
% 17.01/3.97
% 17.01/3.97 % git: date: 2026-07-19 20:42:38 +0200
% 17.01/3.97 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 17.01/3.97 % git: non_committed_changes: false
% 17.01/3.97
% 17.01/3.97 % ------ Parsing...
% 17.01/3.97 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 17.01/3.97
% 17.01/3.97 % ------ Preprocessing... sup_sim: 0 sf_s rm: 21 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e %
% 17.01/3.97
% 17.01/3.97 % ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e %
% 17.01/3.97
% 17.01/3.97 % ------ Preprocessing... sf_s rm: 3 0s sf_e sf_s rm: 0 0s sf_e
% 17.01/3.97 % ------ Proving...
% 17.01/3.97 % ------ Problem Properties
% 17.01/3.97
% 17.01/3.97 %
% 17.01/3.97 % clauses 61
% 17.01/3.97 % conjectures 4
% 17.01/3.97 % EPR 38
% 17.01/3.97 % Horn 54
% 17.01/3.97 % unary 26
% 17.01/3.97 % binary 22
% 17.01/3.97 % lits 112
% 17.01/3.97 % lits eq 10
% 17.01/3.97 % fd_pure 0
% 17.01/3.97 % fd_pseudo 0
% 17.01/3.97 % fd_cond 1
% 17.01/3.97 % fd_pseudo_cond 3
% 17.01/3.97 % AC symbols 0
% 17.01/3.97
% 17.01/3.97 % ------ Input Options Time Limit: Unbounded
% 17.01/3.97
% 17.01/3.97
% 17.01/3.97 % ------
% 17.01/3.97 % Current options:
% 17.01/3.97 % ------
% 17.01/3.97
% 17.01/3.97
% 17.01/3.97 %
% 17.01/3.97
% 17.01/3.97 % ------ Proving...
% 17.01/3.97 %
% 17.01/3.97
% 17.01/3.97 % SZS status Theorem for theBenchmark.p
% 17.01/3.97
% 17.01/3.97 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 17.01/3.97
% 17.01/3.97
%------------------------------------------------------------------------------