%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU147+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 : n001.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:15 PM UTC 2026
% Result : Theorem 0.14s 0.41s
% Output : CNFRefutation 0.14s
% 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,
! [X6,X7,X8,X9,X10,X11] :
( ( X11 = singleton(X10)
| esk1_2(X10,X11) = X10
| in(esk1_2(X10,X11),X11) )
& ( X11 = singleton(X10)
| esk1_2(X10,X11) != X10
| ~ in(esk1_2(X10,X11),X11) )
& ( X7 != singleton(X6)
| in(X9,X7)
| X9 != X6 )
& ( X7 != singleton(X6)
| X8 = X6
| ~ in(X8,X7) ) ),
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,
! [X26] :
( X26 = empty_set
| ~ subset(X26,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,
! [X13,X14,X15,X16,X17,X18] :
( ( X18 = powerset(X17)
| subset(esk2_2(X17,X18),X17)
| in(esk2_2(X17,X18),X18) )
& ( X18 = powerset(X17)
| ~ subset(esk2_2(X17,X18),X17)
| ~ in(esk2_2(X17,X18),X18) )
& ( X14 != powerset(X13)
| in(X16,X14)
| ~ subset(X16,X13) )
& ( X14 != powerset(X13)
| subset(X15,X13)
| ~ in(X15,X14) ) ),
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,
! [X22] : subset(X22,X22),
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.02 % Problem : SEU147+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.35 % Computer : n001.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 05:58:29 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.39 Running first-order theorem proving
% 0.14/0.39 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.14/0.41 % Version: 3.5.1
% 0.14/0.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 % Starting sh5l with 300s (1) cores
% 0.14/0.41 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2333470 completed with status 0
% 0.14/0.41 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.41 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.41 % No SInE strategy applied
% 0.14/0.41 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.14/0.41 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.41 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.41 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.41 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.41 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.41 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 2333479 completed with status 0
% 0.14/0.41 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.14/0.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.41 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.41 % No SInE strategy applied
% 0.14/0.41 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.14/0.41 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.41 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.41 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.41 % Preprocessing time : 0.001 s
% 0.14/0.41 % Presaturation interreduction done
% 0.14/0.41
% 0.14/0.41 % Proof found!
% 0.14/0.41 % SZS status Theorem
% 0.14/0.41 % SZS output start CNFRefutation
% See solution above
% 0.14/0.41 % Parsed axioms : 13
% 0.14/0.41 % Removed by relevancy pruning/SinE : 0
% 0.14/0.41 % Initial clauses : 20
% 0.14/0.41 % Removed in clause preprocessing : 3
% 0.14/0.41 % Initial clauses in saturation : 17
% 0.14/0.41 % Processed clauses : 58
% 0.14/0.41 % ...of these trivial : 0
% 0.14/0.41 % ...subsumed : 3
% 0.14/0.41 % ...remaining for further processing : 55
% 0.14/0.41 % Other redundant clauses eliminated : 11
% 0.14/0.41 % Clauses deleted for lack of memory : 0
% 0.14/0.41 % Backward-subsumed : 0
% 0.14/0.41 % Backward-rewritten : 0
% 0.14/0.41 % Generated clauses : 62
% 0.14/0.41 % ...of the previous two non-redundant : 37
% 0.14/0.41 % ...aggressively subsumed : 0
% 0.14/0.41 % Contextual simplify-reflections : 0
% 0.14/0.41 % Paramodulations : 46
% 0.14/0.41 % Factorizations : 6
% 0.14/0.41 % NegExts : 0
% 0.14/0.41 % Equation resolutions : 11
% 0.14/0.41 % Disequality decompositions : 0
% 0.14/0.41 % Total rewrite steps : 13
% 0.14/0.41 % ...of those cached : 9
% 0.14/0.41 % Propositional unsat checks : 0
% 0.14/0.41 % Propositional check models : 0
% 0.14/0.41 % Propositional check unsatisfiable : 0
% 0.14/0.41 % Propositional clauses : 0
% 0.14/0.41 % Propositional clauses after purity: 0
% 0.14/0.41 % Propositional unsat core size : 0
% 0.14/0.41 % Propositional preprocessing time : 0.000
% 0.14/0.41 % Propositional encoding time : 0.000
% 0.14/0.41 % Propositional solver time : 0.000
% 0.14/0.41 % Success case prop preproc time : 0.000
% 0.14/0.41 % Success case prop encoding time : 0.000
% 0.14/0.41 % Success case prop solver time : 0.000
% 0.14/0.41 % Current number of processed clauses : 34
% 0.14/0.41 % Positive orientable unit clauses : 5
% 0.14/0.41 % Positive unorientable unit clauses: 0
% 0.14/0.41 % Negative unit clauses : 5
% 0.14/0.41 % Non-unit-clauses : 24
% 0.14/0.41 % Current number of unprocessed clauses: 13
% 0.14/0.41 % ...number of literals in the above : 39
% 0.14/0.41 % Current number of archived formulas : 0
% 0.14/0.41 % Current number of archived clauses : 17
% 0.14/0.41 % Clause-clause subsumption calls (NU) : 38
% 0.14/0.41 % Rec. Clause-clause subsumption calls : 26
% 0.14/0.41 % Non-unit clause-clause subsumptions : 0
% 0.14/0.41 % Unit Clause-clause subsumption calls : 7
% 0.14/0.41 % Rewrite failures with RHS unbound : 0
% 0.14/0.41 % BW rewrite match attempts : 2
% 0.14/0.41 % BW rewrite match successes : 0
% 0.14/0.41 % Condensation attempts : 0
% 0.14/0.41 % Condensation successes : 0
% 0.14/0.41 % Termbank termtop insertions : 1894
% 0.14/0.41 % Search garbage collected termcells : 310
% 0.14/0.41
% 0.14/0.41 % -------------------------------------------------
% 0.14/0.41 % User time : 0.007 s
% 0.14/0.41 % System time : 0.002 s
% 0.14/0.41 % Total time : 0.009 s
% 0.14/0.41 % Maximum resident set size: 3636 pages
% 0.14/0.41
% 0.14/0.41 % -------------------------------------------------
% 0.14/0.41 % User time : 0.015 s
% 0.14/0.41 % System time : 0.014 s
% 0.14/0.41 % Total time : 0.028 s
% 0.14/0.41 % Maximum resident set size: 4608 pages
% 0.14/0.41 % E exiting
%------------------------------------------------------------------------------