%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU146+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n005.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:23:58 PM UTC 2026
% Result : Theorem 0.66s 0.68s
% Output : CNFRefutation 0.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of formulae : 48 ( 12 unt; 0 def)
% Number of atoms : 141 ( 69 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 142 ( 49 ~; 69 |; 14 &)
% ( 9 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 73 ( 4 sgn 46 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l4_zfmisc_1,conjecture,
! [X1,X2] :
( subset(X1,singleton(X2))
<=> ( X1 = singleton(X2)
| X1 = empty_set ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l4_zfmisc_1) ).
fof(t69_enumset1,lemma,
! [X1] : unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t69_enumset1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(d1_xboole_0,axiom,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(d2_tarski,axiom,
! [X1,X2,X3] :
( X3 = unordered_pair(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( X4 = X2
| X4 = X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_tarski) ).
fof(l2_zfmisc_1,lemma,
! [X1,X2] :
( subset(singleton(X1),X2)
<=> in(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l2_zfmisc_1) ).
fof(d10_xboole_0,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X2,X1)
& subset(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d10_xboole_0) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(t2_xboole_1,lemma,
! [X1] : subset(empty_set,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_xboole_1) ).
fof(c_0_9,negated_conjecture,
~ ! [X1,X2] :
( subset(X1,singleton(X2))
<=> ( X1 = singleton(X2)
| X1 = empty_set ) ),
inference(assume_negation,[status(cth)],[l4_zfmisc_1]) ).
fof(c_0_10,negated_conjecture,
( ( esk8_0 = singleton(esk9_0)
| esk8_0 = empty_set
| subset(esk8_0,singleton(esk9_0)) )
& ( ~ subset(esk8_0,singleton(esk9_0))
| esk8_0 != singleton(esk9_0) )
& ( ~ subset(esk8_0,singleton(esk9_0))
| esk8_0 != empty_set ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])]) ).
fof(c_0_11,lemma,
! [X152] : unordered_pair(X152,X152) = singleton(X152),
inference(variable_rename,[status(thm)],[t69_enumset1]) ).
fof(c_0_12,plain,
! [X46,X47,X48,X49,X50] :
( ( subset(X49,X50)
| ~ in(esk5_2(X49,X50),X50) )
& ( subset(X49,X50)
| in(esk5_2(X49,X50),X49) )
& ( in(X48,X47)
| ~ in(X48,X46)
| ~ subset(X46,X47) ) ),
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)],[d3_tarski])])])])])])]) ).
cnf(c_0_13,negated_conjecture,
( esk8_0 = singleton(esk9_0)
| esk8_0 = empty_set
| subset(esk8_0,singleton(esk9_0)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,lemma,
unordered_pair(X1,X1) = singleton(X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,plain,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[d1_xboole_0]) ).
fof(c_0_16,plain,
! [X28,X29,X30,X31,X32,X33,X34,X35] :
( ( X35 = unordered_pair(X33,X34)
| esk3_3(X33,X34,X35) = X34
| esk3_3(X33,X34,X35) = X33
| in(esk3_3(X33,X34,X35),X35) )
& ( X35 = unordered_pair(X33,X34)
| ~ in(esk3_3(X33,X34,X35),X35)
| esk3_3(X33,X34,X35) != X34 )
& ( X35 = unordered_pair(X33,X34)
| ~ in(esk3_3(X33,X34,X35),X35)
| esk3_3(X33,X34,X35) != X33 )
& ( X30 != unordered_pair(X28,X29)
| in(X32,X30)
| X32 != X29 )
& ( X30 != unordered_pair(X28,X29)
| in(X32,X30)
| X32 != X28 )
& ( X30 != unordered_pair(X28,X29)
| X31 = X29
| X31 = X28
| ~ in(X31,X30) ) ),
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_tarski])])])])])])]) ).
cnf(c_0_17,plain,
( ~ in(X3,X1)
| ~ subset(X1,X2)
| in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
( subset(esk8_0,unordered_pair(esk9_0,esk9_0))
| esk8_0 = unordered_pair(esk9_0,esk9_0)
| esk8_0 = empty_set ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_14]) ).
fof(c_0_19,plain,
! [X24,X25,X26] :
( ( X26 = empty_set
| in(esk2_1(X26),X26) )
& ( ~ in(X25,X24)
| X24 != empty_set ) ),
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_15])])])])])]) ).
cnf(c_0_20,plain,
( X2 != unordered_pair(X3,X4)
| ~ in(X1,X2)
| X1 = X4
| X1 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,negated_conjecture,
( ~ in(X1,esk8_0)
| in(X1,unordered_pair(esk9_0,esk9_0))
| esk8_0 = empty_set
| unordered_pair(esk9_0,esk9_0) = esk8_0 ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
( X1 = empty_set
| in(esk2_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,plain,
( ~ in(X1,unordered_pair(X3,X2))
| X1 = X3
| X1 = X2 ),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_24,negated_conjecture,
( in(esk2_1(esk8_0),unordered_pair(esk9_0,esk9_0))
| esk8_0 = empty_set
| unordered_pair(esk9_0,esk9_0) = esk8_0 ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
fof(c_0_25,lemma,
! [X82,X83] :
( ( subset(singleton(X82),X83)
| ~ in(X82,X83) )
& ( in(X82,X83)
| ~ subset(singleton(X82),X83) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l2_zfmisc_1])])]) ).
cnf(c_0_26,plain,
( X3 != unordered_pair(X2,X4)
| X1 != X2
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_27,negated_conjecture,
( esk8_0 = empty_set
| esk2_1(esk8_0) = esk9_0
| unordered_pair(esk9_0,esk9_0) = esk8_0 ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
fof(c_0_28,plain,
! [X15,X16] :
( ( X15 = X16
| ~ subset(X16,X15)
| ~ subset(X15,X16) )
& ( X15 != X16
| subset(X16,X15) )
& ( X15 != X16
| subset(X15,X16) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d10_xboole_0])])])]) ).
cnf(c_0_29,lemma,
( ~ in(X1,X2)
| subset(singleton(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,plain,
in(X1,unordered_pair(X1,X2)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_26])]) ).
cnf(c_0_31,negated_conjecture,
( in(esk9_0,esk8_0)
| esk8_0 = empty_set
| unordered_pair(esk9_0,esk9_0) = esk8_0 ),
inference(spm,[status(thm)],[c_0_22,c_0_27]) ).
cnf(c_0_32,plain,
( ~ subset(X2,X1)
| ~ subset(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_33,lemma,
( ~ in(X1,X2)
| subset(unordered_pair(X1,X1),X2) ),
inference(rw,[status(thm)],[c_0_29,c_0_14]) ).
cnf(c_0_34,negated_conjecture,
( in(esk9_0,esk8_0)
| esk8_0 = empty_set ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
( ~ subset(esk8_0,singleton(esk9_0))
| esk8_0 != singleton(esk9_0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_36,negated_conjecture,
( ~ subset(unordered_pair(esk9_0,esk9_0),esk8_0)
| esk8_0 = empty_set
| unordered_pair(esk9_0,esk9_0) = esk8_0 ),
inference(spm,[status(thm)],[c_0_32,c_0_18]) ).
cnf(c_0_37,lemma,
( subset(unordered_pair(esk9_0,esk9_0),esk8_0)
| esk8_0 = empty_set ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
fof(c_0_38,plain,
! [X93] : subset(X93,X93),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
cnf(c_0_39,negated_conjecture,
( ~ subset(esk8_0,singleton(esk9_0))
| esk8_0 != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_40,negated_conjecture,
( ~ subset(esk8_0,unordered_pair(esk9_0,esk9_0))
| esk8_0 != unordered_pair(esk9_0,esk9_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_14]),c_0_14]) ).
cnf(c_0_41,negated_conjecture,
( esk8_0 = empty_set
| unordered_pair(esk9_0,esk9_0) = esk8_0 ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
fof(c_0_43,lemma,
! [X116] : subset(empty_set,X116),
inference(variable_rename,[status(thm)],[t2_xboole_1]) ).
cnf(c_0_44,negated_conjecture,
( ~ subset(esk8_0,unordered_pair(esk9_0,esk9_0))
| esk8_0 != empty_set ),
inference(rw,[status(thm)],[c_0_39,c_0_14]) ).
cnf(c_0_45,negated_conjecture,
esk8_0 = empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]) ).
cnf(c_0_46,lemma,
subset(empty_set,X1),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45]),c_0_45]),c_0_46])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU146+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.45 % Computer : n005.cluster.edu
% 0.18/0.45 % Model : x86_64 x86_64
% 0.18/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45 % Memory : 8046.5625MB
% 0.18/0.45 % OS : Linux 6.8.0-71-generic
% 0.18/0.45 % CPULimit : 300
% 0.18/0.45 % WCLimit : 300
% 0.18/0.45 % DateTime : Mon Sep 21 05:52:48 UTC 2026
% 0.18/0.45 % CPUTime :
% 0.18/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.52 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.66/0.68 % Version: 3.5.1
% 0.66/0.68 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.66/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.66/0.68 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.66/0.68 % Starting new_bool_3 with 300s (1) cores
% 0.66/0.68 % Starting new_bool_1 with 300s (1) cores
% 0.66/0.68 % Starting sh5l with 300s (1) cores
% 0.66/0.68 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2695094 completed with status 0
% 0.66/0.68 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.66/0.68 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.66/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.66/0.68 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.66/0.68 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.66/0.68 % No SInE strategy applied
% 0.66/0.68 % Search class: FGHSM-FFMS32-SFFFFFNN
% 0.66/0.68 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.66/0.68 % Starting SubtermCWHack with 136s (1) cores
% 0.66/0.68 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.66/0.68 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.66/0.68 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.66/0.68 % Starting new_bool_3 with 136s (1) cores
% 0.66/0.68 % new_bool_3 with pid 2695105 completed with status 0
% 0.66/0.68 % Result found by new_bool_3
% 0.66/0.68 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.66/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.66/0.68 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.66/0.68 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.66/0.68 % No SInE strategy applied
% 0.66/0.68 % Search class: FGHSM-FFMS32-SFFFFFNN
% 0.66/0.68 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.66/0.68 % Starting SubtermCWHack with 136s (1) cores
% 0.66/0.68 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.66/0.68 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.66/0.68 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.66/0.68 % Starting new_bool_3 with 136s (1) cores
% 0.66/0.68 % Preprocessing time : 0.004 s
% 0.66/0.68 % Presaturation interreduction done
% 0.66/0.68
% 0.66/0.68 % Proof found!
% 0.66/0.68 % SZS status Theorem
% 0.66/0.68 % SZS output start CNFRefutation
% See solution above
% 0.66/0.68 % Parsed axioms : 67
% 0.66/0.68 % Removed by relevancy pruning/SinE : 0
% 0.66/0.68 % Initial clauses : 108
% 0.66/0.68 % Removed in clause preprocessing : 8
% 0.66/0.68 % Initial clauses in saturation : 100
% 0.66/0.68 % Processed clauses : 664
% 0.66/0.68 % ...of these trivial : 14
% 0.66/0.68 % ...subsumed : 374
% 0.66/0.68 % ...remaining for further processing : 276
% 0.66/0.68 % Other redundant clauses eliminated : 60
% 0.66/0.68 % Clauses deleted for lack of memory : 0
% 0.66/0.68 % Backward-subsumed : 25
% 0.66/0.68 % Backward-rewritten : 9
% 0.66/0.68 % Generated clauses : 1870
% 0.66/0.68 % ...of the previous two non-redundant : 1595
% 0.66/0.68 % ...aggressively subsumed : 0
% 0.66/0.68 % Contextual simplify-reflections : 0
% 0.66/0.68 % Paramodulations : 1805
% 0.66/0.68 % Factorizations : 8
% 0.66/0.68 % NegExts : 0
% 0.66/0.68 % Equation resolutions : 60
% 0.66/0.68 % Disequality decompositions : 0
% 0.66/0.68 % Total rewrite steps : 511
% 0.66/0.68 % ...of those cached : 426
% 0.66/0.68 % Propositional unsat checks : 0
% 0.66/0.68 % Propositional check models : 0
% 0.66/0.68 % Propositional check unsatisfiable : 0
% 0.66/0.68 % Propositional clauses : 0
% 0.66/0.68 % Propositional clauses after purity: 0
% 0.66/0.68 % Propositional unsat core size : 0
% 0.66/0.68 % Propositional preprocessing time : 0.000
% 0.66/0.68 % Propositional encoding time : 0.000
% 0.66/0.68 % Propositional solver time : 0.000
% 0.66/0.68 % Success case prop preproc time : 0.000
% 0.66/0.68 % Success case prop encoding time : 0.000
% 0.66/0.68 % Success case prop solver time : 0.000
% 0.66/0.68 % Current number of processed clauses : 134
% 0.66/0.68 % Positive orientable unit clauses : 27
% 0.66/0.68 % Positive unorientable unit clauses: 3
% 0.66/0.68 % Negative unit clauses : 9
% 0.66/0.68 % Non-unit-clauses : 95
% 0.66/0.68 % Current number of unprocessed clauses: 1111
% 0.66/0.68 % ...number of literals in the above : 3720
% 0.66/0.68 % Current number of archived formulas : 0
% 0.66/0.68 % Current number of archived clauses : 126
% 0.66/0.68 % Clause-clause subsumption calls (NU) : 4664
% 0.66/0.68 % Rec. Clause-clause subsumption calls : 3541
% 0.66/0.68 % Non-unit clause-clause subsumptions : 275
% 0.66/0.68 % Unit Clause-clause subsumption calls : 180
% 0.66/0.68 % Rewrite failures with RHS unbound : 0
% 0.66/0.68 % BW rewrite match attempts : 60
% 0.66/0.68 % BW rewrite match successes : 39
% 0.66/0.68 % Condensation attempts : 0
% 0.66/0.68 % Condensation successes : 0
% 0.66/0.68 % Termbank termtop insertions : 23907
% 0.66/0.68 % Search garbage collected termcells : 1501
% 0.66/0.68
% 0.66/0.68 % -------------------------------------------------
% 0.66/0.68 % User time : 0.076 s
% 0.66/0.68 % System time : 0.009 s
% 0.66/0.68 % Total time : 0.085 s
% 0.66/0.68 % Maximum resident set size: 3940 pages
% 0.66/0.68
% 0.66/0.68 % -------------------------------------------------
% 0.66/0.68 % User time : 0.357 s
% 0.66/0.68 % System time : 0.036 s
% 0.66/0.68 % Total time : 0.393 s
% 0.66/0.68 % Maximum resident set size: 4864 pages
% 0.66/0.68 % E exiting
%------------------------------------------------------------------------------