%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU236+3 : TPTP v9.3.1. Released v3.2.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:18 PM UTC 2026
% Result : Theorem 16.41s 8.53s
% Output : CNFRefutation 16.41s
% 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(f21,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(f38,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(f41,axiom,
! [X0] : in(X0,succ(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t10_ordinal1) ).
fof(f45,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(f46,negated_conjecture,
~ ! [X0] :
( ordinal(X0)
=> ! [X1] :
( ordinal(X1)
=> ( in(X0,X1)
<=> ordinal_subset(succ(X0),X1) ) ) ),
inference(negated_conjecture,[status(cth)],[f45]) ).
fof(f53,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(f67,plain,
! [X0] :
( ~ ordinal(X0)
| ( epsilon_connected(X0)
& epsilon_transitive(X0) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f76,plain,
! [X0] :
( epsilon_transitive(X0)
<=> ! [X1] :
( ~ in(X1,X0)
| subset(X1,X0) ) ),
inference(ennf_transformation,[],[f12]) ).
fof(f77,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) ) ),
inference(ennf_transformation,[],[f13]) ).
fof(f81,plain,
! [X0] :
( ~ ordinal(X0)
| ( ordinal(succ(X0))
& epsilon_connected(succ(X0))
& epsilon_transitive(succ(X0))
& ~ empty(succ(X0)) ) ),
inference(ennf_transformation,[],[f21]) ).
fof(f83,plain,
! [X0,X1] :
( ~ ordinal(X1)
| ~ ordinal(X0)
| ( ordinal_subset(X0,X1)
<=> subset(X0,X1) ) ),
inference(ennf_transformation,[],[f38]) ).
fof(f84,plain,
! [X0,X1] :
( ~ ordinal(X1)
| ~ ordinal(X0)
| ( ordinal_subset(X0,X1)
<=> subset(X0,X1) ) ),
inference(flattening,[],[f83]) ).
fof(f90,plain,
? [X0] :
( ordinal(X0)
& ? [X1] :
( ordinal(X1)
& ( in(X0,X1)
<~> ordinal_subset(succ(X0),X1) ) ) ),
inference(ennf_transformation,[],[f46]) ).
fof(f97,plain,
! [X0,X1,X2] :
( ~ subset(X2,X1)
| ~ subset(X0,X1)
| subset(set_union2(X0,X2),X1) ),
inference(ennf_transformation,[],[f53]) ).
fof(f98,plain,
! [X0,X1,X2] :
( ~ subset(X2,X1)
| ~ subset(X0,X1)
| subset(set_union2(X0,X2),X1) ),
inference(flattening,[],[f97]) ).
fof(f99,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(f100,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,[],[f99]) ).
fof(f101,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))],[f100]) ).
fof(f102,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,[],[f76]) ).
fof(f103,plain,
! [X0] :
( ( ~ epsilon_transitive(X0)
| ! [X2] :
( ~ in(X2,X0)
| subset(X2,X0) ) )
& ( ? [X1] :
( in(X1,X0)
& ~ subset(X1,X0) )
| epsilon_transitive(X0) ) ),
inference(rectify,[],[f102]) ).
fof(f104,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))],[f103]) ).
fof(f105,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,[],[f77]) ).
fof(f106,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,[],[f105]) ).
fof(f107,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))],[f106]) ).
fof(f122,plain,
! [X0,X1] :
( ~ ordinal(X1)
| ~ ordinal(X0)
| ( ( ~ ordinal_subset(X0,X1)
| subset(X0,X1) )
& ( ~ subset(X0,X1)
| ordinal_subset(X0,X1) ) ) ),
inference(nnf_transformation,[],[f84]) ).
fof(f123,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,[],[f90]) ).
fof(f124,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,[],[f123]) ).
fof(f125,plain,
( ordinal(sK17)
& ordinal(sK18)
& ( in(sK17,sK18)
| ordinal_subset(succ(sK17),sK18) )
& ( ~ in(sK17,sK18)
| ~ ordinal_subset(succ(sK17),sK18) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK17,sK18]),skolemize(X0,sK17),skolemize(X1,sK18)],[f124]) ).
fof(f130,plain,
! [X0] :
( ~ ordinal(X0)
| epsilon_transitive(X0) ),
inference(cnf_transformation,[],[f67]) ).
fof(f140,plain,
! [X0] : succ(X0) = set_union2(X0,singleton(X0)),
inference(cnf_transformation,[],[f10]) ).
fof(f141,plain,
! [X3,X0,X1] :
( singleton(X0) != X1
| ~ in(X3,X1)
| X0 = X3 ),
inference(cnf_transformation,[],[f101]) ).
fof(f145,plain,
! [X2,X0] :
( ~ epsilon_transitive(X0)
| ~ in(X2,X0)
| subset(X2,X0) ),
inference(cnf_transformation,[],[f104]) ).
fof(f148,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ in(X3,X0)
| in(X3,X1) ),
inference(cnf_transformation,[],[f107]) ).
fof(f149,plain,
! [X0,X1] :
( in(sK2(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f107]) ).
fof(f150,plain,
! [X0,X1] :
( ~ in(sK2(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f107]) ).
fof(f164,plain,
! [X0] :
( ~ ordinal(X0)
| ordinal(succ(X0)) ),
inference(cnf_transformation,[],[f81]) ).
fof(f203,plain,
! [X0,X1] :
( ~ ordinal(X1)
| ~ ordinal(X0)
| ~ ordinal_subset(X0,X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f122]) ).
fof(f204,plain,
! [X0,X1] :
( ~ ordinal(X1)
| ~ ordinal(X0)
| ~ subset(X0,X1)
| ordinal_subset(X0,X1) ),
inference(cnf_transformation,[],[f122]) ).
fof(f207,plain,
! [X0] : in(X0,succ(X0)),
inference(cnf_transformation,[],[f41]) ).
fof(f211,plain,
ordinal(sK17),
inference(cnf_transformation,[],[f125]) ).
fof(f212,plain,
ordinal(sK18),
inference(cnf_transformation,[],[f125]) ).
fof(f213,plain,
( in(sK17,sK18)
| ordinal_subset(succ(sK17),sK18) ),
inference(cnf_transformation,[],[f125]) ).
fof(f214,plain,
( ~ in(sK17,sK18)
| ~ ordinal_subset(succ(sK17),sK18) ),
inference(cnf_transformation,[],[f125]) ).
fof(f222,plain,
! [X2,X0,X1] :
( ~ subset(X2,X1)
| ~ subset(X0,X1)
| subset(set_union2(X0,X2),X1) ),
inference(cnf_transformation,[],[f98]) ).
fof(f227,plain,
! [X0] :
( ~ ordinal(X0)
| ordinal(set_union2(X0,singleton(X0))) ),
inference(definition_unfolding,[],[f164,f140]) ).
fof(f228,plain,
! [X0] : in(X0,set_union2(X0,singleton(X0))),
inference(definition_unfolding,[],[f207,f140]) ).
fof(f229,plain,
( ~ in(sK17,sK18)
| ~ ordinal_subset(set_union2(sK17,singleton(sK17)),sK18) ),
inference(definition_unfolding,[],[f214,f140]) ).
fof(f230,plain,
( in(sK17,sK18)
| ordinal_subset(set_union2(sK17,singleton(sK17)),sK18) ),
inference(definition_unfolding,[],[f213,f140]) ).
fof(f233,plain,
! [X3,X0] :
( ~ in(X3,singleton(X0))
| X0 = X3 ),
inference(equality_resolution,[],[f141]) ).
tcf(c_51,plain,
! [X0: $i] :
( epsilon_transitive(X0)
| ~ ordinal(X0) ),
inference(cnf_transformation,[],[f130]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ in(X0,singleton(X1)) ),
inference(cnf_transformation,[],[f233]) ).
tcf(c_66,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ~ epsilon_transitive(X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f145]) ).
tcf(c_67,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ~ in(sK2(X0,X1),X1) ),
inference(cnf_transformation,[],[f150]) ).
tcf(c_68,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| in(sK2(X0,X1),X0) ),
inference(cnf_transformation,[],[f149]) ).
tcf(c_69,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,X2)
| ~ subset(X1,X2)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f148]) ).
tcf(c_86,plain,
! [X0: $i] :
( ordinal(set_union2(X0,singleton(X0)))
| ~ ordinal(X0) ),
inference(cnf_transformation,[],[f227]) ).
tcf(c_122,plain,
! [X0: $i,X1: $i] :
( ordinal_subset(X0,X1)
| ~ ordinal(X1)
| ~ ordinal(X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f204]) ).
tcf(c_123,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ~ ordinal(X1)
| ~ ordinal(X0)
| ~ ordinal_subset(X0,X1) ),
inference(cnf_transformation,[],[f203]) ).
tcf(c_126,plain,
! [X0: $i] : in(X0,set_union2(X0,singleton(X0))),
inference(cnf_transformation,[],[f228]) ).
tcf(c_130,negated_conjecture,
( ~ in(sK17,sK18)
| ~ ordinal_subset(set_union2(sK17,singleton(sK17)),sK18) ),
inference(cnf_transformation,[],[f229]) ).
tcf(c_131,negated_conjecture,
( in(sK17,sK18)
| ordinal_subset(set_union2(sK17,singleton(sK17)),sK18) ),
inference(cnf_transformation,[],[f230]) ).
tcf(c_132,negated_conjecture,
ordinal(sK18),
inference(cnf_transformation,[],[f212]) ).
tcf(c_133,negated_conjecture,
ordinal(sK17),
inference(cnf_transformation,[],[f211]) ).
tcf(c_141,plain,
! [X0: $i,X1: $i,X2: $i] :
( subset(set_union2(X0,X2),X1)
| ~ subset(X2,X1)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f222]) ).
tcf(c_1414,plain,
! [X0: $i] : X0 = X0,
theory(equality) ).
tcf(c_1417,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( in(X0,X2)
| ~ in(X1,X3)
| ( X2 != X3 )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_2344,plain,
! [X0: $i] :
( in(sK17,sK18)
| ~ subset(X0,sK18)
| ~ in(sK17,X0) ),
inference(instantiation,[status(thm)],[c_69]) ).
tcf(c_2346,plain,
! [X0: $i] :
( subset(X0,sK18)
| ~ ordinal(sK18)
| ~ ordinal(X0)
| ~ ordinal_subset(X0,sK18) ),
inference(instantiation,[status(thm)],[c_123]) ).
tcf(c_2348,plain,
! [X0: $i] :
( subset(X0,sK18)
| ~ in(sK2(X0,sK18),sK18) ),
inference(instantiation,[status(thm)],[c_67]) ).
tcf(c_2349,plain,
! [X0: $i] :
( subset(X0,sK18)
| in(sK2(X0,sK18),X0) ),
inference(instantiation,[status(thm)],[c_68]) ).
tcf(c_2357,plain,
! [X0: $i,X1: $i] :
( in(sK17,sK18)
| ~ subset(set_union2(X0,X1),sK18)
| ~ in(sK17,set_union2(X0,X1)) ),
inference(instantiation,[status(thm)],[c_2344]) ).
tcf(c_2377,plain,
! [X0: $i,X1: $i] :
( subset(set_union2(X0,X1),sK18)
| ~ subset(X1,sK18)
| ~ subset(X0,sK18) ),
inference(instantiation,[status(thm)],[c_141]) ).
tcf(c_2409,plain,
( epsilon_transitive(sK18)
| ~ ordinal(sK18) ),
inference(instantiation,[status(thm)],[c_51]) ).
tcf(c_2417,plain,
( in(sK17,sK18)
| ~ subset(set_union2(sK17,singleton(sK17)),sK18)
| ~ in(sK17,set_union2(sK17,singleton(sK17))) ),
inference(instantiation,[status(thm)],[c_2357]) ).
tcf(c_2427,plain,
in(sK17,set_union2(sK17,singleton(sK17))),
inference(instantiation,[status(thm)],[c_126]) ).
tcf(c_2556,plain,
( subset(set_union2(sK17,singleton(sK17)),sK18)
| ~ ordinal(sK18)
| ~ ordinal(set_union2(sK17,singleton(sK17)))
| ~ ordinal_subset(set_union2(sK17,singleton(sK17)),sK18) ),
inference(instantiation,[status(thm)],[c_2346]) ).
tcf(c_2559,plain,
( subset(set_union2(sK17,singleton(sK17)),sK18)
| ~ subset(sK17,sK18)
| ~ subset(singleton(sK17),sK18) ),
inference(instantiation,[status(thm)],[c_2377]) ).
tcf(c_2580,plain,
( subset(singleton(sK17),sK18)
| in(sK2(singleton(sK17),sK18),singleton(sK17)) ),
inference(instantiation,[status(thm)],[c_2349]) ).
tcf(c_2591,plain,
sK18 = sK18,
inference(instantiation,[status(thm)],[c_1414]) ).
tcf(c_2864,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_122]) ).
tcf(c_2941,plain,
! [X0: $i,X1: $i] :
( in(X0,X1)
| ~ in(sK17,sK18)
| ( X1 != sK18 )
| ( X0 != sK17 ) ),
inference(instantiation,[status(thm)],[c_1417]) ).
tcf(c_2997,plain,
( ordinal(set_union2(sK17,singleton(sK17)))
| ~ ordinal(sK17) ),
inference(instantiation,[status(thm)],[c_86]) ).
tcf(c_3119,negated_conjecture,
in(sK17,sK18),
inference(global_subsumption_just,[status(thm)],[c_131,c_133,c_132,c_131,c_2417,c_2427,c_2556,c_2997]) ).
tcf(c_3663,plain,
( subset(sK17,sK18)
| ~ epsilon_transitive(sK18) ),
inference(superposition,[status(thm)],[c_3119,c_66]) ).
tcf(c_4400,plain,
! [X0: $i,X1: $i] :
( ( sK2(singleton(X0),sK18) = X1 )
| ~ in(sK2(singleton(X0),sK18),singleton(X1)) ),
inference(instantiation,[status(thm)],[c_63]) ).
tcf(c_4453,plain,
! [X0: $i] :
( ordinal_subset(set_union2(X0,singleton(X0)),sK18)
| ~ ordinal(sK18)
| ~ ordinal(set_union2(X0,singleton(X0)))
| ~ subset(set_union2(X0,singleton(X0)),sK18) ),
inference(instantiation,[status(thm)],[c_2864]) ).
tcf(c_7230,plain,
( ( sK2(singleton(sK17),sK18) = sK17 )
| ~ in(sK2(singleton(sK17),sK18),singleton(sK17)) ),
inference(instantiation,[status(thm)],[c_4400]) ).
tcf(c_8594,plain,
( ordinal_subset(set_union2(sK17,singleton(sK17)),sK18)
| ~ ordinal(sK18)
| ~ ordinal(set_union2(sK17,singleton(sK17)))
| ~ subset(set_union2(sK17,singleton(sK17)),sK18) ),
inference(instantiation,[status(thm)],[c_4453]) ).
tcf(c_10604,plain,
! [X0: $i] :
( in(sK2(singleton(sK17),sK18),X0)
| ~ in(sK17,sK18)
| ( X0 != sK18 )
| ( sK2(singleton(sK17),sK18) != sK17 ) ),
inference(instantiation,[status(thm)],[c_2941]) ).
tcf(c_18406,plain,
( in(sK2(singleton(sK17),sK18),sK18)
| ~ in(sK17,sK18)
| ( sK18 != sK18 )
| ( sK2(singleton(sK17),sK18) != sK17 ) ),
inference(instantiation,[status(thm)],[c_10604]) ).
tcf(c_25208,plain,
( subset(singleton(sK17),sK18)
| ~ in(sK2(singleton(sK17),sK18),sK18) ),
inference(instantiation,[status(thm)],[c_2348]) ).
tcf(c_25209,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_25208,c_18406,c_8594,c_7230,c_3663,c_3119,c_2997,c_2591,c_2580,c_2559,c_2409,c_130,c_132,c_133]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU236+3 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.18/5.45 % Computer : n011.cluster.edu
% 0.18/5.45 % Model : x86_64 x86_64
% 0.18/5.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/5.45 % Memory : 8046.5625MB
% 0.18/5.45 % OS : Linux 6.8.0-71-generic
% 0.18/5.45 % CPULimit : 300
% 0.18/5.45 % WCLimit : 300
% 0.18/5.45 % DateTime : Thu Sep 24 13:21:03 UTC 2026
% 0.18/5.46 % CPUTime :
% 0.18/5.46 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.23/5.50 Running first-order theorem proving
% 0.23/5.50 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.23/5.52
% 0.23/5.52 % ======== iProver multi-core TPTP/SMT =========
% 0.23/5.52
% 0.23/5.52 % Detected problem language: tptp
% 0.23/5.54 % Proving...
% 16.41/8.53 % SZS status Started for theBenchmark.p
% 16.41/8.53 % SZS status Theorem for theBenchmark.p
% 16.41/8.53
% 16.41/8.53 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 16.41/8.53
% 16.41/8.53 % ------ iProver source info
% 16.41/8.53
% 16.41/8.53 % git: date: 2026-07-19 20:42:38 +0200
% 16.41/8.53 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 16.41/8.53 % git: non_committed_changes: false
% 16.41/8.53
% 16.41/8.53 % ------ Parsing...
% 16.41/8.53 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 16.41/8.53
% 16.41/8.53 % ------ Preprocessing... sup_sim: 0 sf_s rm: 23 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e %
% 16.41/8.53
% 16.41/8.53 % ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e %
% 16.41/8.53
% 16.41/8.53 % ------ Preprocessing... sf_s rm: 3 0s sf_e sf_s rm: 0 0s sf_e
% 16.41/8.53 % ------ Proving...
% 16.41/8.53 % ------ Problem Properties
% 16.41/8.53
% 16.41/8.53 %
% 16.41/8.53 % clauses 61
% 16.41/8.53 % conjectures 4
% 16.41/8.53 % EPR 38
% 16.41/8.53 % Horn 54
% 16.41/8.53 % unary 26
% 16.41/8.53 % binary 22
% 16.41/8.53 % lits 112
% 16.41/8.53 % lits eq 10
% 16.41/8.53 % fd_pure 0
% 16.41/8.53 % fd_pseudo 0
% 16.41/8.53 % fd_cond 1
% 16.41/8.53 % fd_pseudo_cond 3
% 16.41/8.53 % AC symbols 0
% 16.41/8.53
% 16.41/8.53 % ------ Input Options Time Limit: Unbounded
% 16.41/8.53
% 16.41/8.53
% 16.41/8.53 % ------
% 16.41/8.53 % Current options:
% 16.41/8.53 % ------
% 16.41/8.53
% 16.41/8.53
% 16.41/8.53 %
% 16.41/8.53
% 16.41/8.53 % ------ Proving...
% 16.41/8.53 %
% 16.41/8.53
% 16.41/8.53 % SZS status Theorem for theBenchmark.p
% 16.41/8.53
% 16.41/8.53 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 16.41/8.53
% 16.41/8.53
%------------------------------------------------------------------------------