%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU160+1 : 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 : n003.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:19 PM UTC 2026
% Result : Theorem 0.26s 0.52s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 8 unt; 0 def)
% Number of atoms : 45 ( 24 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 41 ( 15 ~; 19 |; 4 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 18 ( 4 sgn 11 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t39_zfmisc_1,conjecture,
! [X1,X2] :
( subset(X1,singleton(X2))
<=> ( X1 = singleton(X2)
| X1 = empty_set ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t39_zfmisc_1) ).
fof(l4_zfmisc_1,axiom,
! [X1,X2] :
( subset(X1,singleton(X2))
<=> ( X1 = singleton(X2)
| X1 = empty_set ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l4_zfmisc_1) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2] :
( subset(X1,singleton(X2))
<=> ( X1 = singleton(X2)
| X1 = empty_set ) ),
inference(assume_negation,[status(cth)],[t39_zfmisc_1]) ).
fof(c_0_4,plain,
! [X5,X6] :
( ( subset(X5,singleton(X6))
| X5 != singleton(X6) )
& ( subset(X5,singleton(X6))
| X5 != empty_set )
& ( X5 = singleton(X6)
| X5 = empty_set
| ~ subset(X5,singleton(X6)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l4_zfmisc_1])])])]) ).
fof(c_0_5,negated_conjecture,
( ( esk1_0 = singleton(esk2_0)
| esk1_0 = empty_set
| subset(esk1_0,singleton(esk2_0)) )
& ( ~ subset(esk1_0,singleton(esk2_0))
| esk1_0 != singleton(esk2_0) )
& ( ~ subset(esk1_0,singleton(esk2_0))
| esk1_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_3])])])])]) ).
cnf(c_0_6,plain,
( ~ subset(X1,singleton(X2))
| X1 = singleton(X2)
| X1 = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( esk1_0 = singleton(esk2_0)
| esk1_0 = empty_set
| subset(esk1_0,singleton(esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X7] : subset(X7,X7),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
cnf(c_0_9,negated_conjecture,
( ~ subset(esk1_0,singleton(esk2_0))
| esk1_0 != singleton(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
( empty_set = esk1_0
| singleton(esk2_0) = esk1_0 ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( X1 != empty_set
| subset(X1,singleton(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,negated_conjecture,
( ~ subset(esk1_0,singleton(esk2_0))
| esk1_0 != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,negated_conjecture,
empty_set = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).
cnf(c_0_15,plain,
subset(empty_set,singleton(X1)),
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
~ subset(esk1_0,singleton(esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).
cnf(c_0_17,plain,
subset(esk1_0,singleton(X1)),
inference(rw,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU160+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 % Computer : n003.cluster.edu
% 0.15/0.41 % Model : x86_64 x86_64
% 0.15/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.41 % Memory : 8046.5625MB
% 0.15/0.41 % OS : Linux 6.8.0-71-generic
% 0.15/0.42 % CPULimit : 300
% 0.15/0.42 % WCLimit : 300
% 0.15/0.42 % DateTime : Mon Sep 21 05:55:15 UTC 2026
% 0.15/0.42 % CPUTime :
% 0.15/0.42 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.49 Running first-order theorem proving
% 0.15/0.49 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.26/0.52 % Version: 3.5.1
% 0.26/0.52 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.26/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.52 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.26/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.52 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.52 % Starting sh5l with 300s (1) cores
% 0.26/0.52 % new_bool_3 with pid 3552589 completed with status 0
% 0.26/0.52 % Result found by new_bool_3
% 0.26/0.52 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.26/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.52 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.26/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.52 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/0.52 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/0.52 % Search class: FGHSF-FFSS11-SFFFFFNN
% 0.26/0.52 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.52 % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.52 % SubtermCWHack with pid 3552592 completed with status 0
% 0.26/0.52 % Result found by SubtermCWHack
% 0.26/0.52 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.26/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.52 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.26/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.52 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/0.52 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/0.52 % Search class: FGHSF-FFSS11-SFFFFFNN
% 0.26/0.52 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.52 % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.52 % Preprocessing time : 0.002 s
% 0.26/0.52
% 0.26/0.52 % Proof found!
% 0.26/0.52 % SZS status Theorem
% 0.26/0.52 % SZS output start CNFRefutation
% See solution above
% 0.26/0.52 % Parsed axioms : 8
% 0.26/0.52 % Removed by relevancy pruning/SinE : 2
% 0.26/0.52 % Initial clauses : 10
% 0.26/0.52 % Removed in clause preprocessing : 0
% 0.26/0.52 % Initial clauses in saturation : 10
% 0.26/0.52 % Processed clauses : 16
% 0.26/0.52 % ...of these trivial : 0
% 0.26/0.52 % ...subsumed : 0
% 0.26/0.52 % ...remaining for further processing : 16
% 0.26/0.52 % Other redundant clauses eliminated : 2
% 0.26/0.52 % Clauses deleted for lack of memory : 0
% 0.26/0.52 % Backward-subsumed : 2
% 0.26/0.52 % Backward-rewritten : 6
% 0.26/0.52 % Generated clauses : 9
% 0.26/0.52 % ...of the previous two non-redundant : 9
% 0.26/0.52 % ...aggressively subsumed : 0
% 0.26/0.52 % Contextual simplify-reflections : 0
% 0.26/0.52 % Paramodulations : 7
% 0.26/0.52 % Factorizations : 0
% 0.26/0.52 % NegExts : 0
% 0.26/0.52 % Equation resolutions : 2
% 0.26/0.52 % Disequality decompositions : 0
% 0.26/0.52 % Total rewrite steps : 9
% 0.26/0.52 % ...of those cached : 5
% 0.26/0.52 % Propositional unsat checks : 0
% 0.26/0.52 % Propositional check models : 0
% 0.26/0.52 % Propositional check unsatisfiable : 0
% 0.26/0.52 % Propositional clauses : 0
% 0.26/0.52 % Propositional clauses after purity: 0
% 0.26/0.52 % Propositional unsat core size : 0
% 0.26/0.52 % Propositional preprocessing time : 0.000
% 0.26/0.52 % Propositional encoding time : 0.000
% 0.26/0.52 % Propositional solver time : 0.000
% 0.26/0.52 % Success case prop preproc time : 0.000
% 0.26/0.52 % Success case prop encoding time : 0.000
% 0.26/0.52 % Success case prop solver time : 0.000
% 0.26/0.52 % Current number of processed clauses : 6
% 0.26/0.52 % Positive orientable unit clauses : 5
% 0.26/0.52 % Positive unorientable unit clauses: 0
% 0.26/0.52 % Negative unit clauses : 1
% 0.26/0.52 % Non-unit-clauses : 0
% 0.26/0.52 % Current number of unprocessed clauses: 3
% 0.26/0.52 % ...number of literals in the above : 9
% 0.26/0.52 % Current number of archived formulas : 0
% 0.26/0.52 % Current number of archived clauses : 8
% 0.26/0.52 % Clause-clause subsumption calls (NU) : 1
% 0.26/0.52 % Rec. Clause-clause subsumption calls : 1
% 0.26/0.52 % Non-unit clause-clause subsumptions : 1
% 0.26/0.52 % Unit Clause-clause subsumption calls : 1
% 0.26/0.52 % Rewrite failures with RHS unbound : 0
% 0.26/0.52 % BW rewrite match attempts : 2
% 0.26/0.52 % BW rewrite match successes : 2
% 0.26/0.52 % Condensation attempts : 0
% 0.26/0.52 % Condensation successes : 0
% 0.26/0.52 % Termbank termtop insertions : 509
% 0.26/0.52 % Search garbage collected termcells : 101
% 0.26/0.52
% 0.26/0.52 % -------------------------------------------------
% 0.26/0.52 % User time : 0.006 s
% 0.26/0.52 % System time : 0.001 s
% 0.26/0.52 % Total time : 0.007 s
% 0.26/0.52 % Maximum resident set size: 3628 pages
% 0.26/0.52
% 0.26/0.52 % -------------------------------------------------
% 0.26/0.52 % User time : 0.007 s
% 0.26/0.52 % System time : 0.008 s
% 0.26/0.52 % Total time : 0.015 s
% 0.26/0.52 % Maximum resident set size: 4608 pages
% 0.26/0.52 % E exiting
%------------------------------------------------------------------------------