%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SEU238+3 : TPTP v9.2.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 05:11:13 PM UTC 2026
% Result : Theorem 23.63s 14.14s
% Output : CNFRefutation 23.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 63 ( 14 unt; 0 def)
% Number of atoms : 217 ( 25 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 265 ( 111 ~; 101 |; 32 &)
% ( 4 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 76 ( 0 sgn 38 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(antisymmetry_r2_hidden,axiom,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
fof(t10_ordinal1,axiom,
! [X1] : in(X1,succ(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t10_ordinal1) ).
fof(d1_ordinal1,axiom,
! [X1] : succ(X1) = set_union2(X1,singleton(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_ordinal1) ).
fof(t41_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ( being_limit_ordinal(X1)
<=> ! [X2] :
( ordinal(X2)
=> ( in(X2,X1)
=> in(succ(X2),X1) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t41_ordinal1) ).
fof(fc3_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ( ~ empty(succ(X1))
& epsilon_transitive(succ(X1))
& epsilon_connected(succ(X1))
& ordinal(succ(X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc3_ordinal1) ).
fof(t42_ordinal1,conjecture,
! [X1] :
( ordinal(X1)
=> ( ~ ( ~ being_limit_ordinal(X1)
& ! [X2] :
( ordinal(X2)
=> X1 != succ(X2) ) )
& ~ ( ? [X2] :
( ordinal(X2)
& X1 = succ(X2) )
& being_limit_ordinal(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t42_ordinal1) ).
fof(t33_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ( in(X1,X2)
<=> ordinal_subset(succ(X1),X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t33_ordinal1) ).
fof(redefinition_r1_ordinal1,axiom,
! [X1,X2] :
( ( ordinal(X1)
& ordinal(X2) )
=> ( ordinal_subset(X1,X2)
<=> subset(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_r1_ordinal1) ).
fof(d8_xboole_0,axiom,
! [X1,X2] :
( proper_subset(X1,X2)
<=> ( subset(X1,X2)
& X1 != X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d8_xboole_0) ).
fof(t21_ordinal1,axiom,
! [X1] :
( epsilon_transitive(X1)
=> ! [X2] :
( ordinal(X2)
=> ( proper_subset(X1,X2)
=> in(X1,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t21_ordinal1) ).
fof(c_0_10,plain,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[antisymmetry_r2_hidden]) ).
fof(c_0_11,plain,
! [X129] : in(X129,succ(X129)),
inference(variable_rename,[status(thm)],[t10_ordinal1]) ).
fof(c_0_12,plain,
! [X96] : succ(X96) = set_union2(X96,singleton(X96)),
inference(variable_rename,[status(thm)],[d1_ordinal1]) ).
fof(c_0_13,plain,
! [X82,X83] :
( ~ in(X82,X83)
| ~ in(X83,X82) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])]) ).
cnf(c_0_14,plain,
in(X1,succ(X1)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
succ(X1) = set_union2(X1,singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X141,X142] :
( ( ~ being_limit_ordinal(X141)
| ~ ordinal(X142)
| ~ in(X142,X141)
| in(succ(X142),X141)
| ~ ordinal(X141) )
& ( ordinal(esk15_1(X141))
| being_limit_ordinal(X141)
| ~ ordinal(X141) )
& ( in(esk15_1(X141),X141)
| being_limit_ordinal(X141)
| ~ ordinal(X141) )
& ( ~ in(succ(esk15_1(X141)),X141)
| being_limit_ordinal(X141)
| ~ ordinal(X141) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t41_ordinal1])])])])]) ).
fof(c_0_17,plain,
! [X1] :
( ordinal(X1)
=> ( ~ empty(succ(X1))
& epsilon_transitive(succ(X1))
& epsilon_connected(succ(X1))
& ordinal(succ(X1)) ) ),
inference(fof_simplification,[status(thm)],[fc3_ordinal1]) ).
cnf(c_0_18,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
in(X1,set_union2(X1,singleton(X1))),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( in(succ(X2),X1)
| ~ being_limit_ordinal(X1)
| ~ ordinal(X2)
| ~ in(X2,X1)
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_21,plain,
! [X106] :
( ( ~ empty(succ(X106))
| ~ ordinal(X106) )
& ( epsilon_transitive(succ(X106))
| ~ ordinal(X106) )
& ( epsilon_connected(succ(X106))
| ~ ordinal(X106) )
& ( ordinal(succ(X106))
| ~ ordinal(X106) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])]) ).
fof(c_0_22,negated_conjecture,
~ ! [X1] :
( ordinal(X1)
=> ( ~ ( ~ being_limit_ordinal(X1)
& ! [X2] :
( ordinal(X2)
=> X1 != succ(X2) ) )
& ~ ( ? [X2] :
( ordinal(X2)
& X1 = succ(X2) )
& being_limit_ordinal(X1) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t42_ordinal1])]) ).
fof(c_0_23,plain,
! [X137,X138] :
( ( ~ in(X137,X138)
| ordinal_subset(succ(X137),X138)
| ~ ordinal(X138)
| ~ ordinal(X137) )
& ( ~ ordinal_subset(succ(X137),X138)
| in(X137,X138)
| ~ ordinal(X138)
| ~ ordinal(X137) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t33_ordinal1])])])]) ).
cnf(c_0_24,plain,
~ in(set_union2(X1,singleton(X1)),X1),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
( in(set_union2(X2,singleton(X2)),X1)
| ~ ordinal(X2)
| ~ ordinal(X1)
| ~ being_limit_ordinal(X1)
| ~ in(X2,X1) ),
inference(rw,[status(thm)],[c_0_20,c_0_15]) ).
cnf(c_0_26,plain,
( ordinal(succ(X1))
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_27,negated_conjecture,
! [X145] :
( ordinal(esk16_0)
& ( ordinal(esk17_0)
| ~ being_limit_ordinal(esk16_0) )
& ( esk16_0 = succ(esk17_0)
| ~ being_limit_ordinal(esk16_0) )
& ( being_limit_ordinal(esk16_0)
| ~ being_limit_ordinal(esk16_0) )
& ( ordinal(esk17_0)
| ~ ordinal(X145)
| esk16_0 != succ(X145) )
& ( esk16_0 = succ(esk17_0)
| ~ ordinal(X145)
| esk16_0 != succ(X145) )
& ( being_limit_ordinal(esk16_0)
| ~ ordinal(X145)
| esk16_0 != succ(X145) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])])])]) ).
fof(c_0_28,plain,
! [X124,X125] :
( ( ~ ordinal_subset(X124,X125)
| subset(X124,X125)
| ~ ordinal(X124)
| ~ ordinal(X125) )
& ( ~ subset(X124,X125)
| ordinal_subset(X124,X125)
| ~ ordinal(X124)
| ~ ordinal(X125) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r1_ordinal1])])]) ).
cnf(c_0_29,plain,
( ordinal_subset(succ(X1),X2)
| ~ in(X1,X2)
| ~ ordinal(X2)
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_30,plain,
( ~ being_limit_ordinal(X1)
| ~ ordinal(X1)
| ~ in(X1,X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
( ordinal(set_union2(X1,singleton(X1)))
| ~ ordinal(X1) ),
inference(rw,[status(thm)],[c_0_26,c_0_15]) ).
cnf(c_0_32,negated_conjecture,
( esk16_0 = succ(esk17_0)
| ~ being_limit_ordinal(esk16_0) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_33,plain,
! [X97,X98] :
( ( subset(X97,X98)
| ~ proper_subset(X97,X98) )
& ( X97 != X98
| ~ proper_subset(X97,X98) )
& ( ~ subset(X97,X98)
| X97 = X98
| proper_subset(X97,X98) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d8_xboole_0])])]) ).
cnf(c_0_34,plain,
( subset(X1,X2)
| ~ ordinal_subset(X1,X2)
| ~ ordinal(X1)
| ~ ordinal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_35,plain,
( ordinal_subset(set_union2(X1,singleton(X1)),X2)
| ~ ordinal(X2)
| ~ ordinal(X1)
| ~ in(X1,X2) ),
inference(rw,[status(thm)],[c_0_29,c_0_15]) ).
cnf(c_0_36,plain,
( in(esk15_1(X1),X1)
| being_limit_ordinal(X1)
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_37,negated_conjecture,
ordinal(esk16_0),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_38,plain,
( ~ being_limit_ordinal(set_union2(X1,singleton(X1)))
| ~ ordinal(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_25]),c_0_19])]),c_0_31]) ).
cnf(c_0_39,negated_conjecture,
( esk16_0 = set_union2(esk17_0,singleton(esk17_0))
| ~ being_limit_ordinal(esk16_0) ),
inference(rw,[status(thm)],[c_0_32,c_0_15]) ).
cnf(c_0_40,negated_conjecture,
( ordinal(esk17_0)
| ~ being_limit_ordinal(esk16_0) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_41,plain,
( ordinal(esk15_1(X1))
| being_limit_ordinal(X1)
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_42,plain,
( X1 = X2
| proper_subset(X1,X2)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_43,plain,
( subset(set_union2(X1,singleton(X1)),X2)
| ~ ordinal(X2)
| ~ ordinal(X1)
| ~ in(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_31]) ).
cnf(c_0_44,negated_conjecture,
( being_limit_ordinal(esk16_0)
| in(esk15_1(esk16_0),esk16_0) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_45,negated_conjecture,
~ being_limit_ordinal(esk16_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_46,negated_conjecture,
( being_limit_ordinal(esk16_0)
| ordinal(esk15_1(esk16_0)) ),
inference(spm,[status(thm)],[c_0_41,c_0_37]) ).
fof(c_0_47,plain,
! [X133,X134] :
( ~ epsilon_transitive(X133)
| ~ ordinal(X134)
| ~ proper_subset(X133,X134)
| in(X133,X134) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t21_ordinal1])])]) ).
cnf(c_0_48,plain,
( set_union2(X1,singleton(X1)) = X2
| proper_subset(set_union2(X1,singleton(X1)),X2)
| ~ ordinal(X2)
| ~ ordinal(X1)
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_49,negated_conjecture,
in(esk15_1(esk16_0),esk16_0),
inference(sr,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_50,negated_conjecture,
ordinal(esk15_1(esk16_0)),
inference(sr,[status(thm)],[c_0_46,c_0_45]) ).
cnf(c_0_51,plain,
( in(X1,X2)
| ~ epsilon_transitive(X1)
| ~ ordinal(X2)
| ~ proper_subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_52,negated_conjecture,
( set_union2(esk15_1(esk16_0),singleton(esk15_1(esk16_0))) = esk16_0
| proper_subset(set_union2(esk15_1(esk16_0),singleton(esk15_1(esk16_0))),esk16_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_37]),c_0_50])]) ).
cnf(c_0_53,plain,
( epsilon_transitive(succ(X1))
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_54,plain,
( being_limit_ordinal(X1)
| ~ in(succ(esk15_1(X1)),X1)
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_55,negated_conjecture,
( set_union2(esk15_1(esk16_0),singleton(esk15_1(esk16_0))) = esk16_0
| in(set_union2(esk15_1(esk16_0),singleton(esk15_1(esk16_0))),esk16_0)
| ~ epsilon_transitive(set_union2(esk15_1(esk16_0),singleton(esk15_1(esk16_0)))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_37])]) ).
cnf(c_0_56,plain,
( epsilon_transitive(set_union2(X1,singleton(X1)))
| ~ ordinal(X1) ),
inference(rw,[status(thm)],[c_0_53,c_0_15]) ).
cnf(c_0_57,negated_conjecture,
( being_limit_ordinal(esk16_0)
| ~ ordinal(X1)
| esk16_0 != succ(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_58,plain,
( being_limit_ordinal(X1)
| ~ ordinal(X1)
| ~ in(set_union2(esk15_1(X1),singleton(esk15_1(X1))),X1) ),
inference(rw,[status(thm)],[c_0_54,c_0_15]) ).
cnf(c_0_59,negated_conjecture,
( set_union2(esk15_1(esk16_0),singleton(esk15_1(esk16_0))) = esk16_0
| in(set_union2(esk15_1(esk16_0),singleton(esk15_1(esk16_0))),esk16_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_50])]) ).
cnf(c_0_60,negated_conjecture,
( being_limit_ordinal(esk16_0)
| esk16_0 != set_union2(X1,singleton(X1))
| ~ ordinal(X1) ),
inference(rw,[status(thm)],[c_0_57,c_0_15]) ).
cnf(c_0_61,negated_conjecture,
set_union2(esk15_1(esk16_0),singleton(esk15_1(esk16_0))) = esk16_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_37])]),c_0_45]) ).
cnf(c_0_62,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_50])]),c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU238+3 : TPTP v9.2.1. Released v3.2.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.14/0.33 % Computer : n017.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Tue May 5 02:49:42 EDT 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 23.63/14.14 % Version : CSE_E---1.7
% 23.63/14.14 % Problem : theBenchmark.p
% 23.63/14.14 % SZS status Theorem for theBenchmark.p
% 23.63/14.14 % SZS output start CNFRefutation
% See solution above
% 23.71/14.23 % Total time : 10.386s
%------------------------------------------------------------------------------