%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU153+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 : n017.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:28:17 PM UTC 2026
% Result : Theorem 0.11s 0.44s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 9 unt; 0 def)
% Number of atoms : 39 ( 13 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 35 ( 17 ~; 9 |; 6 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 26 ( 1 sgn 19 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l25_zfmisc_1,conjecture,
! [X1,X2] :
~ ( in(X1,X2)
& disjoint(singleton(X1),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l25_zfmisc_1) ).
fof(t83_xboole_1,lemma,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_difference(X1,X2) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t83_xboole_1) ).
fof(l1_zfmisc_1,lemma,
! [X1] : singleton(X1) != empty_set,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l1_zfmisc_1) ).
fof(l32_xboole_1,lemma,
! [X1,X2] :
( set_difference(X1,X2) = empty_set
<=> subset(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l32_xboole_1) ).
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(c_0_5,negated_conjecture,
~ ! [X1,X2] :
~ ( in(X1,X2)
& disjoint(singleton(X1),X2) ),
inference(assume_negation,[status(cth)],[l25_zfmisc_1]) ).
fof(c_0_6,lemma,
! [X73,X74] :
( ( disjoint(X73,X74)
| set_difference(X73,X74) != X73 )
& ( set_difference(X73,X74) = X73
| ~ disjoint(X73,X74) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t83_xboole_1])])]) ).
fof(c_0_7,negated_conjecture,
( in(esk1_0,esk2_0)
& disjoint(singleton(esk1_0),esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_8,lemma,
! [X1] : singleton(X1) != empty_set,
inference(fof_simplification,[status(thm)],[l1_zfmisc_1]) ).
fof(c_0_9,lemma,
! [X80,X81] :
( ( set_difference(X80,X81) = empty_set
| ~ subset(X80,X81) )
& ( subset(X80,X81)
| set_difference(X80,X81) != empty_set ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l32_xboole_1])])]) ).
cnf(c_0_10,lemma,
( ~ disjoint(X1,X2)
| set_difference(X1,X2) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
disjoint(singleton(esk1_0),esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_12,lemma,
! [X75] : singleton(X75) != empty_set,
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_8])]) ).
cnf(c_0_13,lemma,
( ~ subset(X1,X2)
| set_difference(X1,X2) = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
set_difference(singleton(esk1_0),esk2_0) = singleton(esk1_0),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,lemma,
singleton(X1) != empty_set,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,lemma,
! [X46,X47] :
( ( subset(singleton(X46),X47)
| ~ in(X46,X47) )
& ( in(X46,X47)
| ~ subset(singleton(X46),X47) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l2_zfmisc_1])])]) ).
cnf(c_0_17,lemma,
~ subset(singleton(esk1_0),esk2_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_18,lemma,
( ~ in(X1,X2)
| subset(singleton(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,negated_conjecture,
in(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_20,lemma,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU153+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n017.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 05:48:41 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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.11/0.44 % Version: 3.5.1
% 0.11/0.44 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.44 % Starting sh5l with 300s (1) cores
% 0.11/0.44 % new_bool_1 with pid 1571190 completed with status 0
% 0.11/0.44 % Result found by new_bool_1
% 0.11/0.44 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.44 % Search class: FGHSM-FFMF32-SFFFFFNN
% 0.11/0.44 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.44 % Starting SubtermCWHack with 28s (1) cores
% 0.11/0.44 % SubtermCWHack with pid 1571193 completed with status 0
% 0.11/0.44 % Result found by SubtermCWHack
% 0.11/0.44 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.44 % Search class: FGHSM-FFMF32-SFFFFFNN
% 0.11/0.44 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.44 % Starting SubtermCWHack with 28s (1) cores
% 0.11/0.44 % Preprocessing time : 0.002 s
% 0.11/0.44
% 0.11/0.44 % Proof found!
% 0.11/0.44 % SZS status Theorem
% 0.11/0.44 % SZS output start CNFRefutation
% See solution above
% 0.11/0.44 % Parsed axioms : 76
% 0.11/0.44 % Removed by relevancy pruning/SinE : 27
% 0.11/0.44 % Initial clauses : 84
% 0.11/0.44 % Removed in clause preprocessing : 0
% 0.11/0.44 % Initial clauses in saturation : 84
% 0.11/0.44 % Processed clauses : 84
% 0.11/0.44 % ...of these trivial : 6
% 0.11/0.44 % ...subsumed : 20
% 0.11/0.44 % ...remaining for further processing : 58
% 0.11/0.44 % Other redundant clauses eliminated : 9
% 0.11/0.44 % Clauses deleted for lack of memory : 0
% 0.11/0.44 % Backward-subsumed : 0
% 0.11/0.44 % Backward-rewritten : 0
% 0.11/0.44 % Generated clauses : 116
% 0.11/0.44 % ...of the previous two non-redundant : 56
% 0.11/0.44 % ...aggressively subsumed : 0
% 0.11/0.44 % Contextual simplify-reflections : 0
% 0.11/0.44 % Paramodulations : 108
% 0.11/0.44 % Factorizations : 0
% 0.11/0.44 % NegExts : 0
% 0.11/0.44 % Equation resolutions : 9
% 0.11/0.44 % Disequality decompositions : 0
% 0.11/0.44 % Total rewrite steps : 61
% 0.11/0.44 % ...of those cached : 34
% 0.11/0.44 % Propositional unsat checks : 0
% 0.11/0.44 % Propositional check models : 0
% 0.11/0.44 % Propositional check unsatisfiable : 0
% 0.11/0.44 % Propositional clauses : 0
% 0.11/0.44 % Propositional clauses after purity: 0
% 0.11/0.44 % Propositional unsat core size : 0
% 0.11/0.44 % Propositional preprocessing time : 0.000
% 0.11/0.44 % Propositional encoding time : 0.000
% 0.11/0.44 % Propositional solver time : 0.000
% 0.11/0.44 % Success case prop preproc time : 0.000
% 0.11/0.44 % Success case prop encoding time : 0.000
% 0.11/0.44 % Success case prop solver time : 0.000
% 0.11/0.44 % Current number of processed clauses : 51
% 0.11/0.44 % Positive orientable unit clauses : 25
% 0.11/0.44 % Positive unorientable unit clauses: 2
% 0.11/0.44 % Negative unit clauses : 7
% 0.11/0.44 % Non-unit-clauses : 17
% 0.11/0.44 % Current number of unprocessed clauses: 56
% 0.11/0.44 % ...number of literals in the above : 146
% 0.11/0.44 % Current number of archived formulas : 0
% 0.11/0.44 % Current number of archived clauses : 0
% 0.11/0.44 % Clause-clause subsumption calls (NU) : 30
% 0.11/0.44 % Rec. Clause-clause subsumption calls : 30
% 0.11/0.44 % Non-unit clause-clause subsumptions : 7
% 0.11/0.44 % Unit Clause-clause subsumption calls : 14
% 0.11/0.44 % Rewrite failures with RHS unbound : 0
% 0.11/0.44 % BW rewrite match attempts : 19
% 0.11/0.44 % BW rewrite match successes : 14
% 0.11/0.44 % Condensation attempts : 0
% 0.11/0.44 % Condensation successes : 0
% 0.11/0.44 % Termbank termtop insertions : 5636
% 0.11/0.44 % Search garbage collected termcells : 1324
% 0.11/0.44
% 0.11/0.44 % -------------------------------------------------
% 0.11/0.44 % User time : 0.013 s
% 0.11/0.44 % System time : 0.001 s
% 0.11/0.44 % Total time : 0.013 s
% 0.11/0.44 % Maximum resident set size: 3948 pages
% 0.11/0.44
% 0.11/0.44 % -------------------------------------------------
% 0.11/0.44 % User time : 0.014 s
% 0.11/0.44 % System time : 0.004 s
% 0.11/0.44 % Total time : 0.018 s
% 0.11/0.44 % Maximum resident set size: 4864 pages
% 0.11/0.44 % E exiting
%------------------------------------------------------------------------------