%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM388+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n019.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 : Thu Sep 24 01:48:58 PM UTC 2026
% Result : Theorem 0.14s 0.42s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 32 ( 8 unt; 0 def)
% Number of atoms : 90 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 91 ( 33 ~; 30 |; 14 &)
% ( 2 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 50 ( 1 sgn 31 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t4_subset,axiom,
! [X1,X2,X3] :
( ( element(X2,powerset(X3))
& in(X1,X2) )
=> element(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_subset) ).
fof(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_subset) ).
fof(d2_ordinal1,axiom,
! [X1] :
( epsilon_transitive(X1)
<=> ! [X2] :
( in(X2,X1)
=> subset(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_ordinal1) ).
fof(t19_ordinal1,conjecture,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ! [X3] :
( epsilon_transitive(X3)
=> ( ( in(X1,X2)
& in(X3,X1) )
=> in(X3,X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t19_ordinal1) ).
fof(cc1_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ( epsilon_connected(X1)
& epsilon_transitive(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cc1_ordinal1) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( empty(X2)
& in(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_boole) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( in(X1,X2)
| empty(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_subset) ).
fof(c_0_7,plain,
! [X38,X39,X40] :
( element(X38,X40)
| ~ element(X39,powerset(X40))
| ~ in(X38,X39) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_subset])])]) ).
fof(c_0_8,plain,
! [X36,X37] :
( ( element(X36,powerset(X37))
| ~ subset(X36,X37) )
& ( subset(X36,X37)
| ~ element(X36,powerset(X37)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])]) ).
cnf(c_0_9,plain,
( ~ element(X2,powerset(X3))
| ~ in(X1,X2)
| element(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( ~ subset(X1,X2)
| element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X11,X12,X13] :
( ( epsilon_transitive(X13)
| ~ subset(esk1_1(X13),X13) )
& ( epsilon_transitive(X13)
| in(esk1_1(X13),X13) )
& ( subset(X12,X11)
| ~ in(X12,X11)
| ~ epsilon_transitive(X11) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_ordinal1])])])])])])]) ).
fof(c_0_12,negated_conjecture,
~ ! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ! [X3] :
( epsilon_transitive(X3)
=> ( ( in(X1,X2)
& in(X3,X1) )
=> in(X3,X2) ) ) ) ),
inference(assume_negation,[status(cth)],[t19_ordinal1]) ).
cnf(c_0_13,plain,
( ~ in(X1,X3)
| ~ subset(X3,X2)
| element(X1,X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( ~ in(X2,X1)
| ~ epsilon_transitive(X1)
| subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,negated_conjecture,
( ~ in(esk16_0,esk15_0)
& in(esk14_0,esk15_0)
& in(esk16_0,esk14_0)
& epsilon_transitive(esk16_0)
& ordinal(esk15_0)
& ordinal(esk14_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).
fof(c_0_16,plain,
! [X7] :
( ( ~ ordinal(X7)
| epsilon_connected(X7) )
& ( ~ ordinal(X7)
| epsilon_transitive(X7) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_ordinal1])])])]) ).
cnf(c_0_17,plain,
( ~ in(X3,X2)
| ~ in(X1,X3)
| ~ epsilon_transitive(X2)
| element(X1,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
in(esk16_0,esk14_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
( ~ ordinal(X1)
| epsilon_transitive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,negated_conjecture,
ordinal(esk15_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_21,plain,
! [X45,X46] :
( ~ empty(X46)
| ~ in(X45,X46) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])])]) ).
fof(c_0_22,plain,
! [X34,X35] :
( in(X34,X35)
| empty(X35)
| ~ element(X34,X35) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])])]) ).
cnf(c_0_23,negated_conjecture,
( ~ in(esk14_0,X1)
| ~ epsilon_transitive(X1)
| element(esk16_0,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,negated_conjecture,
epsilon_transitive(esk15_0),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
in(esk14_0,esk15_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_26,plain,
( ~ empty(X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
( ~ element(X1,X2)
| in(X1,X2)
| empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,negated_conjecture,
element(esk16_0,esk15_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_29,negated_conjecture,
~ empty(esk15_0),
inference(spm,[status(thm)],[c_0_26,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
~ in(esk16_0,esk15_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM388+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n019.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 21 02:27:05 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.42 % Version: 3.5.1
% 0.14/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.42 % Starting sh5l with 300s (1) cores
% 0.14/0.42 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1489073 completed with status 0
% 0.14/0.42 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.42 % No SInE strategy applied
% 0.14/0.42 % Search class: FGHSS-FFMM11-SFFFFFNN
% 0.14/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.42 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.42 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.42 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.42 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 1489081 completed with status 0
% 0.14/0.42 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.14/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.42 % No SInE strategy applied
% 0.14/0.42 % Search class: FGHSS-FFMM11-SFFFFFNN
% 0.14/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.42 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.42 % Preprocessing time : 0.001 s
% 0.14/0.42 % Presaturation interreduction done
% 0.14/0.42
% 0.14/0.42 % Proof found!
% 0.14/0.42 % SZS status Theorem
% 0.14/0.42 % SZS output start CNFRefutation
% See solution above
% 0.14/0.42 % Parsed axioms : 32
% 0.14/0.42 % Removed by relevancy pruning/SinE : 0
% 0.14/0.42 % Initial clauses : 60
% 0.14/0.42 % Removed in clause preprocessing : 2
% 0.14/0.42 % Initial clauses in saturation : 58
% 0.14/0.42 % Processed clauses : 169
% 0.14/0.42 % ...of these trivial : 5
% 0.14/0.42 % ...subsumed : 18
% 0.14/0.42 % ...remaining for further processing : 146
% 0.14/0.42 % Other redundant clauses eliminated : 0
% 0.14/0.42 % Clauses deleted for lack of memory : 0
% 0.14/0.42 % Backward-subsumed : 0
% 0.14/0.42 % Backward-rewritten : 7
% 0.14/0.42 % Generated clauses : 87
% 0.14/0.42 % ...of the previous two non-redundant : 78
% 0.14/0.42 % ...aggressively subsumed : 0
% 0.14/0.42 % Contextual simplify-reflections : 2
% 0.14/0.42 % Paramodulations : 87
% 0.14/0.42 % Factorizations : 0
% 0.14/0.42 % NegExts : 0
% 0.14/0.42 % Equation resolutions : 0
% 0.14/0.42 % Disequality decompositions : 0
% 0.14/0.42 % Total rewrite steps : 22
% 0.14/0.42 % ...of those cached : 13
% 0.14/0.42 % Propositional unsat checks : 0
% 0.14/0.42 % Propositional check models : 0
% 0.14/0.42 % Propositional check unsatisfiable : 0
% 0.14/0.42 % Propositional clauses : 0
% 0.14/0.42 % Propositional clauses after purity: 0
% 0.14/0.42 % Propositional unsat core size : 0
% 0.14/0.42 % Propositional preprocessing time : 0.000
% 0.14/0.42 % Propositional encoding time : 0.000
% 0.14/0.42 % Propositional solver time : 0.000
% 0.14/0.42 % Success case prop preproc time : 0.000
% 0.14/0.42 % Success case prop encoding time : 0.000
% 0.14/0.42 % Success case prop solver time : 0.000
% 0.14/0.42 % Current number of processed clauses : 84
% 0.14/0.42 % Positive orientable unit clauses : 36
% 0.14/0.42 % Positive unorientable unit clauses: 0
% 0.14/0.42 % Negative unit clauses : 7
% 0.14/0.42 % Non-unit-clauses : 41
% 0.14/0.42 % Current number of unprocessed clauses: 21
% 0.14/0.42 % ...number of literals in the above : 60
% 0.14/0.42 % Current number of archived formulas : 0
% 0.14/0.42 % Current number of archived clauses : 62
% 0.14/0.42 % Clause-clause subsumption calls (NU) : 357
% 0.14/0.42 % Rec. Clause-clause subsumption calls : 311
% 0.14/0.42 % Non-unit clause-clause subsumptions : 20
% 0.14/0.42 % Unit Clause-clause subsumption calls : 19
% 0.14/0.42 % Rewrite failures with RHS unbound : 0
% 0.14/0.42 % BW rewrite match attempts : 4
% 0.14/0.42 % BW rewrite match successes : 4
% 0.14/0.42 % Condensation attempts : 0
% 0.14/0.42 % Condensation successes : 0
% 0.14/0.42 % Termbank termtop insertions : 3381
% 0.14/0.42 % Search garbage collected termcells : 430
% 0.14/0.42
% 0.14/0.42 % -------------------------------------------------
% 0.14/0.42 % User time : 0.008 s
% 0.14/0.42 % System time : 0.003 s
% 0.14/0.42 % Total time : 0.011 s
% 0.14/0.42 % Maximum resident set size: 3600 pages
% 0.14/0.42
% 0.14/0.42 % -------------------------------------------------
% 0.14/0.42 % User time : 0.027 s
% 0.14/0.42 % System time : 0.010 s
% 0.14/0.42 % Total time : 0.037 s
% 0.14/0.42 % Maximum resident set size: 4608 pages
% 0.14/0.42 % E exiting
%------------------------------------------------------------------------------