%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU154+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n012.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 02:24:01 PM UTC 2026
% Result : Theorem 0.04s 0.53s
% Output : CNFRefutation 0.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 10 unt; 0 def)
% Number of atoms : 64 ( 19 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 72 ( 32 ~; 19 |; 16 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 43 ( 0 sgn 28 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l28_zfmisc_1,conjecture,
! [X1,X2] :
( ~ in(X1,X2)
=> disjoint(singleton(X1),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l28_zfmisc_1) ).
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
fof(t69_enumset1,lemma,
! [X1] : unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t69_enumset1) ).
fof(t3_xboole_0,lemma,
! [X1,X2] :
( ~ ( disjoint(X1,X2)
& ? [X3] :
( in(X3,X2)
& in(X3,X1) ) )
& ~ ( ! [X3] :
~ ( in(X3,X2)
& in(X3,X1) )
& ~ disjoint(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_xboole_0) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2] :
( ~ in(X1,X2)
=> disjoint(singleton(X1),X2) ),
inference(assume_negation,[status(cth)],[l28_zfmisc_1]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2] :
( ~ in(X1,X2)
=> disjoint(singleton(X1),X2) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_6,plain,
! [X17,X18,X19,X20,X21,X22] :
( ( X22 = singleton(X21)
| esk1_2(X21,X22) = X21
| in(esk1_2(X21,X22),X22) )
& ( X22 = singleton(X21)
| esk1_2(X21,X22) != X21
| ~ in(esk1_2(X21,X22),X22) )
& ( X18 != singleton(X17)
| in(X20,X18)
| X20 != X17 )
& ( X18 != singleton(X17)
| X19 = X17
| ~ in(X19,X18) ) ),
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)],[d1_tarski])])])])])])]) ).
fof(c_0_7,lemma,
! [X169] : unordered_pair(X169,X169) = singleton(X169),
inference(variable_rename,[status(thm)],[t69_enumset1]) ).
fof(c_0_8,negated_conjecture,
( ~ disjoint(singleton(esk9_0),esk10_0)
& ~ in(esk9_0,esk10_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_9,lemma,
! [X1,X2] :
( ~ ( disjoint(X1,X2)
& ? [X3] :
( in(X3,X2)
& in(X3,X1) ) )
& ~ ( ! [X3] :
~ ( in(X3,X2)
& in(X3,X1) )
& ~ disjoint(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[t3_xboole_0]) ).
cnf(c_0_10,plain,
( X2 != singleton(X3)
| ~ in(X1,X2)
| X1 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,lemma,
unordered_pair(X1,X1) = singleton(X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
~ disjoint(singleton(esk9_0),esk10_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,lemma,
! [X144,X145,X147,X148,X149] :
( ( ~ disjoint(X147,X148)
| ~ in(X149,X148)
| ~ in(X149,X147) )
& ( disjoint(X144,X145)
| in(esk14_2(X144,X145),X145) )
& ( disjoint(X144,X145)
| in(esk14_2(X144,X145),X144) ) ),
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)],[c_0_9])])])])])])]) ).
cnf(c_0_14,plain,
( ~ in(X1,X2)
| X2 != unordered_pair(X3,X3)
| X1 = X3 ),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
~ disjoint(unordered_pair(esk9_0,esk9_0),esk10_0),
inference(rw,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_16,lemma,
( disjoint(X1,X2)
| in(esk14_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,lemma,
( disjoint(X1,X2)
| in(esk14_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( ~ in(X1,unordered_pair(X2,X2))
| X1 = X2 ),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
in(esk14_2(unordered_pair(esk9_0,esk9_0),esk10_0),unordered_pair(esk9_0,esk9_0)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
in(esk14_2(unordered_pair(esk9_0,esk9_0),esk10_0),esk10_0),
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
esk14_2(unordered_pair(esk9_0,esk9_0),esk10_0) = esk9_0,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
~ in(esk9_0,esk10_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SEU154+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.48 % Computer : n012.cluster.edu
% 0.04/0.48 % Model : x86_64 x86_64
% 0.04/0.48 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.48 % Memory : 8046.5625MB
% 0.04/0.48 % OS : Linux 6.8.0-71-generic
% 0.04/0.49 % CPULimit : 300
% 0.04/0.49 % WCLimit : 300
% 0.04/0.49 % DateTime : Mon Sep 21 05:53:22 UTC 2026
% 0.04/0.49 % CPUTime :
% 0.04/0.49 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.51 Running first-order theorem proving
% 0.04/0.51 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.04/0.53 % Version: 3.5.1
% 0.04/0.53 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.04/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.04/0.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.04/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.04/0.53 % Starting new_bool_1 with 300s (1) cores
% 0.04/0.53 % Starting sh5l with 300s (1) cores
% 0.04/0.53 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1688657 completed with status 0
% 0.04/0.53 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.04/0.53 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.04/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.04/0.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.04/0.53 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.04/0.53 % No SInE strategy applied
% 0.04/0.53 % Search class: FGHSM-FFMS32-SFFFFFNN
% 0.04/0.53 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.04/0.53 % Starting SubtermCWHack with 136s (1) cores
% 0.04/0.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.04/0.53 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.04/0.53 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.04/0.53 % Starting new_bool_3 with 136s (1) cores
% 0.04/0.53 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with pid 1688667 completed with status 0
% 0.04/0.53 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I
% 0.04/0.53 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.04/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.04/0.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.04/0.53 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.04/0.53 % No SInE strategy applied
% 0.04/0.53 % Search class: FGHSM-FFMS32-SFFFFFNN
% 0.04/0.53 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.04/0.53 % Starting SubtermCWHack with 136s (1) cores
% 0.04/0.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.04/0.53 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.04/0.53 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.04/0.53 % Preprocessing time : 0.001 s
% 0.04/0.53 % Presaturation interreduction done
% 0.04/0.53
% 0.04/0.53 % Proof found!
% 0.04/0.53 % SZS status Theorem
% 0.04/0.53 % SZS output start CNFRefutation
% See solution above
% 0.04/0.53 % Parsed axioms : 77
% 0.04/0.53 % Removed by relevancy pruning/SinE : 0
% 0.04/0.53 % Initial clauses : 122
% 0.04/0.53 % Removed in clause preprocessing : 9
% 0.04/0.53 % Initial clauses in saturation : 113
% 0.04/0.53 % Processed clauses : 381
% 0.04/0.53 % ...of these trivial : 4
% 0.04/0.53 % ...subsumed : 150
% 0.04/0.53 % ...remaining for further processing : 227
% 0.04/0.53 % Other redundant clauses eliminated : 31
% 0.04/0.53 % Clauses deleted for lack of memory : 0
% 0.04/0.53 % Backward-subsumed : 0
% 0.04/0.53 % Backward-rewritten : 7
% 0.04/0.53 % Generated clauses : 441
% 0.04/0.53 % ...of the previous two non-redundant : 346
% 0.04/0.53 % ...aggressively subsumed : 0
% 0.04/0.53 % Contextual simplify-reflections : 0
% 0.04/0.53 % Paramodulations : 410
% 0.04/0.53 % Factorizations : 0
% 0.04/0.53 % NegExts : 0
% 0.04/0.53 % Equation resolutions : 34
% 0.04/0.53 % Disequality decompositions : 0
% 0.04/0.53 % Total rewrite steps : 180
% 0.04/0.53 % ...of those cached : 130
% 0.04/0.53 % Propositional unsat checks : 0
% 0.04/0.53 % Propositional check models : 0
% 0.04/0.53 % Propositional check unsatisfiable : 0
% 0.04/0.53 % Propositional clauses : 0
% 0.04/0.53 % Propositional clauses after purity: 0
% 0.04/0.53 % Propositional unsat core size : 0
% 0.04/0.53 % Propositional preprocessing time : 0.000
% 0.04/0.53 % Propositional encoding time : 0.000
% 0.04/0.53 % Propositional solver time : 0.000
% 0.04/0.53 % Success case prop preproc time : 0.000
% 0.04/0.53 % Success case prop encoding time : 0.000
% 0.04/0.53 % Success case prop solver time : 0.000
% 0.04/0.53 % Current number of processed clauses : 97
% 0.04/0.53 % Positive orientable unit clauses : 25
% 0.04/0.53 % Positive unorientable unit clauses: 3
% 0.04/0.53 % Negative unit clauses : 28
% 0.04/0.53 % Non-unit-clauses : 41
% 0.04/0.53 % Current number of unprocessed clauses: 177
% 0.04/0.53 % ...number of literals in the above : 337
% 0.04/0.53 % Current number of archived formulas : 0
% 0.04/0.53 % Current number of archived clauses : 110
% 0.04/0.53 % Clause-clause subsumption calls (NU) : 1322
% 0.04/0.53 % Rec. Clause-clause subsumption calls : 1019
% 0.04/0.53 % Non-unit clause-clause subsumptions : 31
% 0.04/0.53 % Unit Clause-clause subsumption calls : 212
% 0.04/0.53 % Rewrite failures with RHS unbound : 0
% 0.04/0.53 % BW rewrite match attempts : 62
% 0.04/0.53 % BW rewrite match successes : 44
% 0.04/0.53 % Condensation attempts : 0
% 0.04/0.53 % Condensation successes : 0
% 0.04/0.53 % Termbank termtop insertions : 10135
% 0.04/0.53 % Search garbage collected termcells : 1689
% 0.04/0.53
% 0.04/0.53 % -------------------------------------------------
% 0.04/0.53 % User time : 0.012 s
% 0.04/0.53 % System time : 0.003 s
% 0.04/0.53 % Total time : 0.015 s
% 0.04/0.53 % Maximum resident set size: 3952 pages
% 0.04/0.53
% 0.04/0.53 % -------------------------------------------------
% 0.04/0.53 % User time : 0.045 s
% 0.04/0.53 % System time : 0.009 s
% 0.04/0.53 % Total time : 0.054 s
% 0.04/0.53 % Maximum resident set size: 4864 pages
% 0.04/0.53 % E exiting
%------------------------------------------------------------------------------