%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU147+3 : TPTP v9.3.1. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n013.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.12s 0.42s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 11 unt; 0 def)
% Number of atoms : 67 ( 36 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 67 ( 25 ~; 31 |; 6 &)
% ( 4 <=>; 1 =>; 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 : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 40 ( 1 sgn 23 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).
fof(t3_xboole_1,axiom,
! [X1] :
( subset(X1,empty_set)
=> X1 = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_xboole_1) ).
fof(d1_zfmisc_1,axiom,
! [X1,X2] :
( X2 = powerset(X1)
<=> ! [X3] :
( in(X3,X2)
<=> subset(X3,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_zfmisc_1) ).
fof(t1_zfmisc_1,conjecture,
powerset(empty_set) = singleton(empty_set),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_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_5,plain,
! [X4,X5,X6,X7,X8,X9] :
( ( X9 = singleton(X8)
| esk1_2(X8,X9) = X8
| in(esk1_2(X8,X9),X9) )
& ( X9 = singleton(X8)
| esk1_2(X8,X9) != X8
| ~ in(esk1_2(X8,X9),X9) )
& ( X5 != singleton(X4)
| in(X7,X5)
| X7 != X4 )
& ( X5 != singleton(X4)
| X6 = X4
| ~ in(X6,X5) ) ),
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_6,plain,
! [X11] :
( X11 = empty_set
| ~ subset(X11,empty_set) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_xboole_1])])]) ).
fof(c_0_7,plain,
! [X12,X13,X14,X15,X16,X17] :
( ( X17 = powerset(X16)
| subset(esk2_2(X16,X17),X16)
| in(esk2_2(X16,X17),X17) )
& ( X17 = powerset(X16)
| ~ subset(esk2_2(X16,X17),X16)
| ~ in(esk2_2(X16,X17),X17) )
& ( X13 != powerset(X12)
| in(X15,X13)
| ~ subset(X15,X12) )
& ( X13 != powerset(X12)
| subset(X14,X12)
| ~ in(X14,X13) ) ),
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_zfmisc_1])])])])])])]) ).
fof(c_0_8,negated_conjecture,
powerset(empty_set) != singleton(empty_set),
inference(assume_negation,[status(cth)],[t1_zfmisc_1]) ).
cnf(c_0_9,plain,
( X2 != singleton(X3)
| ~ in(X1,X2)
| X1 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( ~ subset(X1,empty_set)
| X1 = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( X2 = powerset(X1)
| subset(esk2_2(X1,X2),X1)
| in(esk2_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_12,negated_conjecture,
powerset(empty_set) != singleton(empty_set),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( ~ in(X1,singleton(X2))
| X1 = X2 ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( in(esk2_2(empty_set,X1),X1)
| X1 = powerset(empty_set)
| esk2_2(empty_set,X1) = empty_set ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
fof(c_0_15,negated_conjecture,
powerset(empty_set) != singleton(empty_set),
inference(fof_nnf,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
( singleton(X1) = powerset(empty_set)
| esk2_2(empty_set,singleton(X1)) = X1
| esk2_2(empty_set,singleton(X1)) = empty_set ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
powerset(empty_set) != singleton(empty_set),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_18,plain,
! [X26] : subset(X26,X26),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
cnf(c_0_19,plain,
( X3 != singleton(X2)
| X1 != X2
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_20,plain,
( ~ subset(esk2_2(X1,X2),X1)
| ~ in(esk2_2(X1,X2),X2)
| X2 = powerset(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_21,plain,
esk2_2(empty_set,singleton(empty_set)) = empty_set,
inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_16])]),c_0_17]) ).
cnf(c_0_22,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
in(X1,singleton(X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_19])]) ).
cnf(c_0_24,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU147+3 : TPTP v9.3.1. Bugfixed v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.36 % Computer : n013.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8046.5625MB
% 0.12/0.36 % OS : Linux 6.8.0-71-generic
% 0.12/0.36 % CPULimit : 300
% 0.12/0.36 % WCLimit : 300
% 0.12/0.36 % DateTime : Mon Sep 21 05:52:06 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.40 Running first-order theorem proving
% 0.12/0.40 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.12/0.42 % Version: 3.5.1
% 0.12/0.42 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.42 % Starting sh5l with 300s (1) cores
% 0.12/0.42 % new_bool_3 with pid 68488 completed with status 0
% 0.12/0.42 % Result found by new_bool_3
% 0.12/0.42 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.42 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.12/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.42 % SubtermCWHack with pid 68491 completed with status 0
% 0.12/0.42 % Result found by SubtermCWHack
% 0.12/0.42 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.42 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.12/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.42 % Preprocessing time : 0.001 s
% 0.12/0.42
% 0.12/0.42 % Proof found!
% 0.12/0.42 % SZS status Theorem
% 0.12/0.42 % SZS output start CNFRefutation
% See solution above
% 0.12/0.42 % Parsed axioms : 10
% 0.12/0.42 % Removed by relevancy pruning/SinE : 0
% 0.12/0.42 % Initial clauses : 17
% 0.12/0.42 % Removed in clause preprocessing : 0
% 0.12/0.42 % Initial clauses in saturation : 17
% 0.12/0.42 % Processed clauses : 56
% 0.12/0.42 % ...of these trivial : 0
% 0.12/0.42 % ...subsumed : 2
% 0.12/0.42 % ...remaining for further processing : 54
% 0.12/0.42 % Other redundant clauses eliminated : 11
% 0.12/0.42 % Clauses deleted for lack of memory : 0
% 0.12/0.42 % Backward-subsumed : 0
% 0.12/0.42 % Backward-rewritten : 0
% 0.12/0.42 % Generated clauses : 96
% 0.12/0.42 % ...of the previous two non-redundant : 66
% 0.12/0.42 % ...aggressively subsumed : 0
% 0.12/0.42 % Contextual simplify-reflections : 0
% 0.12/0.42 % Paramodulations : 78
% 0.12/0.42 % Factorizations : 8
% 0.12/0.42 % NegExts : 0
% 0.12/0.42 % Equation resolutions : 11
% 0.12/0.42 % Disequality decompositions : 0
% 0.12/0.42 % Total rewrite steps : 16
% 0.12/0.42 % ...of those cached : 12
% 0.12/0.42 % Propositional unsat checks : 0
% 0.12/0.42 % Propositional check models : 0
% 0.12/0.42 % Propositional check unsatisfiable : 0
% 0.12/0.42 % Propositional clauses : 0
% 0.12/0.42 % Propositional clauses after purity: 0
% 0.12/0.42 % Propositional unsat core size : 0
% 0.12/0.42 % Propositional preprocessing time : 0.000
% 0.12/0.42 % Propositional encoding time : 0.000
% 0.12/0.42 % Propositional solver time : 0.000
% 0.12/0.42 % Success case prop preproc time : 0.000
% 0.12/0.42 % Success case prop encoding time : 0.000
% 0.12/0.42 % Success case prop solver time : 0.000
% 0.12/0.42 % Current number of processed clauses : 50
% 0.12/0.42 % Positive orientable unit clauses : 5
% 0.12/0.42 % Positive unorientable unit clauses: 0
% 0.12/0.42 % Negative unit clauses : 5
% 0.12/0.42 % Non-unit-clauses : 40
% 0.12/0.42 % Current number of unprocessed clauses: 27
% 0.12/0.42 % ...number of literals in the above : 82
% 0.12/0.42 % Current number of archived formulas : 0
% 0.12/0.42 % Current number of archived clauses : 0
% 0.12/0.42 % Clause-clause subsumption calls (NU) : 121
% 0.12/0.42 % Rec. Clause-clause subsumption calls : 49
% 0.12/0.42 % Non-unit clause-clause subsumptions : 0
% 0.12/0.42 % Unit Clause-clause subsumption calls : 9
% 0.12/0.42 % Rewrite failures with RHS unbound : 0
% 0.12/0.42 % BW rewrite match attempts : 0
% 0.12/0.42 % BW rewrite match successes : 0
% 0.12/0.42 % Condensation attempts : 0
% 0.12/0.42 % Condensation successes : 0
% 0.12/0.42 % Termbank termtop insertions : 2429
% 0.12/0.42 % Search garbage collected termcells : 310
% 0.12/0.42
% 0.12/0.42 % -------------------------------------------------
% 0.12/0.42 % User time : 0.008 s
% 0.12/0.42 % System time : 0.000 s
% 0.12/0.42 % Total time : 0.008 s
% 0.12/0.42 % Maximum resident set size: 3632 pages
% 0.12/0.42
% 0.12/0.42 % -------------------------------------------------
% 0.12/0.42 % User time : 0.011 s
% 0.12/0.42 % System time : 0.003 s
% 0.12/0.42 % Total time : 0.014 s
% 0.12/0.42 % Maximum resident set size: 4864 pages
% 0.12/0.42 % E exiting
%------------------------------------------------------------------------------