%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU148+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n014.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:59 PM UTC 2026
% Result : Theorem 0.12s 0.45s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 4 unt; 0 def)
% Number of atoms : 38 ( 17 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 39 ( 15 ~; 14 |; 5 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn 17 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t6_zfmisc_1,conjecture,
! [X1,X2] :
( subset(singleton(X1),singleton(X2))
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_zfmisc_1) ).
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
fof(l2_zfmisc_1,lemma,
! [X1,X2] :
( subset(singleton(X1),X2)
<=> in(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l2_zfmisc_1) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2] :
( subset(singleton(X1),singleton(X2))
=> X1 = X2 ),
inference(assume_negation,[status(cth)],[t6_zfmisc_1]) ).
fof(c_0_4,plain,
! [X13,X14,X15,X16,X17,X18] :
( ( X18 = singleton(X17)
| esk3_2(X17,X18) = X17
| in(esk3_2(X17,X18),X18) )
& ( X18 = singleton(X17)
| esk3_2(X17,X18) != X17
| ~ in(esk3_2(X17,X18),X18) )
& ( X14 != singleton(X13)
| in(X16,X14)
| X16 != X13 )
& ( X14 != singleton(X13)
| 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_tarski])])])])])])]) ).
fof(c_0_5,lemma,
! [X21,X22] :
( ( subset(singleton(X21),X22)
| ~ in(X21,X22) )
& ( in(X21,X22)
| ~ subset(singleton(X21),X22) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l2_zfmisc_1])])]) ).
fof(c_0_6,negated_conjecture,
( esk1_0 != esk2_0
& subset(singleton(esk1_0),singleton(esk2_0)) ),
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_7,plain,
( X2 != singleton(X3)
| ~ in(X1,X2)
| X1 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,lemma,
( ~ subset(singleton(X1),X2)
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
subset(singleton(esk1_0),singleton(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( ~ in(X1,singleton(X2))
| X1 = X2 ),
inference(er,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
in(esk1_0,singleton(esk2_0)),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
esk1_0 != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU148+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 % Computer : n014.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 21 05:52:50 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.12/0.45 % Version: 3.5.1
% 0.12/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.45 % Starting sh5l with 300s (1) cores
% 0.12/0.45 % new_bool_3 with pid 3278771 completed with status 0
% 0.12/0.45 % Result found by new_bool_3
% 0.12/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.45 % Search class: FGHSM-FFMF32-SFFFFFNN
% 0.12/0.45 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.45 % Starting SubtermCWHack with 28s (1) cores
% 0.12/0.45 % SubtermCWHack with pid 3278776 completed with status 0
% 0.12/0.45 % Result found by SubtermCWHack
% 0.12/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.45 % Search class: FGHSM-FFMF32-SFFFFFNN
% 0.12/0.45 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.45 % Starting SubtermCWHack with 28s (1) cores
% 0.12/0.45 % Preprocessing time : 0.002 s
% 0.12/0.45
% 0.12/0.45 % Proof found!
% 0.12/0.45 % SZS status Theorem
% 0.12/0.45 % SZS output start CNFRefutation
% See solution above
% 0.12/0.45 % Parsed axioms : 71
% 0.12/0.45 % Removed by relevancy pruning/SinE : 28
% 0.12/0.45 % Initial clauses : 73
% 0.12/0.45 % Removed in clause preprocessing : 0
% 0.12/0.45 % Initial clauses in saturation : 73
% 0.12/0.45 % Processed clauses : 65
% 0.12/0.45 % ...of these trivial : 5
% 0.12/0.45 % ...subsumed : 14
% 0.12/0.45 % ...remaining for further processing : 46
% 0.12/0.45 % Other redundant clauses eliminated : 8
% 0.12/0.45 % Clauses deleted for lack of memory : 0
% 0.12/0.45 % Backward-subsumed : 0
% 0.12/0.45 % Backward-rewritten : 0
% 0.12/0.45 % Generated clauses : 83
% 0.12/0.45 % ...of the previous two non-redundant : 36
% 0.12/0.45 % ...aggressively subsumed : 0
% 0.12/0.45 % Contextual simplify-reflections : 0
% 0.12/0.45 % Paramodulations : 76
% 0.12/0.45 % Factorizations : 0
% 0.12/0.45 % NegExts : 0
% 0.12/0.45 % Equation resolutions : 8
% 0.12/0.45 % Disequality decompositions : 0
% 0.12/0.45 % Total rewrite steps : 46
% 0.12/0.45 % ...of those cached : 27
% 0.12/0.45 % Propositional unsat checks : 0
% 0.12/0.45 % Propositional check models : 0
% 0.12/0.45 % Propositional check unsatisfiable : 0
% 0.12/0.45 % Propositional clauses : 0
% 0.12/0.45 % Propositional clauses after purity: 0
% 0.12/0.45 % Propositional unsat core size : 0
% 0.12/0.45 % Propositional preprocessing time : 0.000
% 0.12/0.45 % Propositional encoding time : 0.000
% 0.12/0.45 % Propositional solver time : 0.000
% 0.12/0.45 % Success case prop preproc time : 0.000
% 0.12/0.45 % Success case prop encoding time : 0.000
% 0.12/0.45 % Success case prop solver time : 0.000
% 0.12/0.45 % Current number of processed clauses : 39
% 0.12/0.45 % Positive orientable unit clauses : 20
% 0.12/0.45 % Positive unorientable unit clauses: 2
% 0.12/0.45 % Negative unit clauses : 7
% 0.12/0.45 % Non-unit-clauses : 10
% 0.12/0.45 % Current number of unprocessed clauses: 43
% 0.12/0.45 % ...number of literals in the above : 118
% 0.12/0.45 % Current number of archived formulas : 0
% 0.12/0.45 % Current number of archived clauses : 0
% 0.12/0.45 % Clause-clause subsumption calls (NU) : 12
% 0.12/0.45 % Rec. Clause-clause subsumption calls : 12
% 0.12/0.45 % Non-unit clause-clause subsumptions : 5
% 0.12/0.45 % Unit Clause-clause subsumption calls : 5
% 0.12/0.45 % Rewrite failures with RHS unbound : 0
% 0.12/0.45 % BW rewrite match attempts : 21
% 0.12/0.45 % BW rewrite match successes : 16
% 0.12/0.45 % Condensation attempts : 0
% 0.12/0.45 % Condensation successes : 0
% 0.12/0.45 % Termbank termtop insertions : 4765
% 0.12/0.45 % Search garbage collected termcells : 1174
% 0.12/0.45
% 0.12/0.45 % -------------------------------------------------
% 0.12/0.45 % User time : 0.011 s
% 0.12/0.45 % System time : 0.000 s
% 0.12/0.45 % Total time : 0.011 s
% 0.12/0.45 % Maximum resident set size: 3688 pages
% 0.12/0.45
% 0.12/0.45 % -------------------------------------------------
% 0.12/0.45 % User time : 0.013 s
% 0.12/0.45 % System time : 0.005 s
% 0.12/0.45 % Total time : 0.018 s
% 0.12/0.45 % Maximum resident set size: 4864 pages
% 0.12/0.45 % E exiting
%------------------------------------------------------------------------------