%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET045+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n002.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:13:16 PM UTC 2026
% Result : Theorem 0.11s 11.01s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 12 ( 6 unt; 0 def)
% Number of atoms : 26 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 26 ( 12 ~; 8 |; 4 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 20 ( 2 sgn 10 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel41_1,axiom,
! [X1] :
? [X2] :
! [X3] :
( element(X3,X2)
<=> ( ~ element(X3,X3)
& element(X3,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel41_1) ).
fof(pel41,conjecture,
~ ? [X1] :
! [X3] : element(X3,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel41) ).
fof(c_0_2,plain,
! [X1] :
? [X2] :
! [X3] :
( element(X3,X2)
<=> ( ~ element(X3,X3)
& element(X3,X1) ) ),
inference(fof_simplification,[status(thm)],[pel41_1]) ).
fof(c_0_3,negated_conjecture,
~ ~ ? [X1] :
! [X3] : element(X3,X1),
inference(assume_negation,[status(cth)],[pel41]) ).
fof(c_0_4,plain,
! [X6,X8,X9] :
( ( element(X9,esk2_1(X6))
| element(X9,X9)
| ~ element(X9,X6) )
& ( ~ element(X8,esk2_1(X6))
| ~ element(X8,X8) )
& ( ~ element(X8,esk2_1(X6))
| element(X8,X6) ) ),
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)],[c_0_2])])])])])])]) ).
fof(c_0_5,negated_conjecture,
! [X5] : element(X5,esk1_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_6,plain,
( ~ element(X1,X2)
| element(X1,esk2_1(X2))
| element(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
element(X1,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( element(X1,X1)
| element(X1,esk2_1(esk1_0)) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
( ~ element(X1,esk2_1(X2))
| ~ element(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
element(esk2_1(esk1_0),esk2_1(esk1_0)),
inference(ef,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET045+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/10.94 % Computer : n002.cluster.edu
% 0.11/10.94 % Model : x86_64 x86_64
% 0.11/10.94 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.94 % Memory : 8046.5625MB
% 0.11/10.94 % OS : Linux 6.8.0-71-generic
% 0.11/10.94 % CPULimit : 300
% 0.11/10.94 % WCLimit : 300
% 0.11/10.94 % DateTime : Mon Sep 21 04:50:45 UTC 2026
% 0.11/10.94 % CPUTime :
% 0.11/10.94 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/10.99 Running first-order theorem proving
% 0.11/10.99 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/11.01 % Version: 3.5.1
% 0.11/11.01 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/11.01 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/11.01 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/11.01 % Starting new_bool_3 with 300s (1) cores
% 0.11/11.01 % Starting new_bool_1 with 300s (1) cores
% 0.11/11.01 % Starting sh5l with 300s (1) cores
% 0.11/11.01 % new_bool_3 with pid 2461261 completed with status 0
% 0.11/11.01 % Result found by new_bool_3
% 0.11/11.01 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/11.01 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/11.01 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/11.01 % Starting new_bool_3 with 300s (1) cores
% 0.11/11.01 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/11.01 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/11.01 % Search class: FGHNF-FFSF11-SFFFFFNN
% 0.11/11.01 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/11.01 % Starting SubtermCWHack with 31s (1) cores
% 0.11/11.01 % SubtermCWHack with pid 2461265 completed with status 0
% 0.11/11.01 % Result found by SubtermCWHack
% 0.11/11.01 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/11.01 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/11.01 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/11.01 % Starting new_bool_3 with 300s (1) cores
% 0.11/11.01 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/11.01 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/11.01 % Search class: FGHNF-FFSF11-SFFFFFNN
% 0.11/11.01 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/11.01 % Starting SubtermCWHack with 31s (1) cores
% 0.11/11.01 % Preprocessing time : 0.001 s
% 0.11/11.01
% 0.11/11.01 % Proof found!
% 0.11/11.01 % SZS status Theorem
% 0.11/11.01 % SZS output start CNFRefutation
% See solution above
% 0.11/11.01 % Parsed axioms : 2
% 0.11/11.01 % Removed by relevancy pruning/SinE : 0
% 0.11/11.01 % Initial clauses : 4
% 0.11/11.01 % Removed in clause preprocessing : 0
% 0.11/11.01 % Initial clauses in saturation : 4
% 0.11/11.01 % Processed clauses : 6
% 0.11/11.01 % ...of these trivial : 0
% 0.11/11.01 % ...subsumed : 0
% 0.11/11.01 % ...remaining for further processing : 6
% 0.11/11.01 % Other redundant clauses eliminated : 0
% 0.11/11.01 % Clauses deleted for lack of memory : 0
% 0.11/11.01 % Backward-subsumed : 0
% 0.11/11.01 % Backward-rewritten : 0
% 0.11/11.01 % Generated clauses : 12
% 0.11/11.01 % ...of the previous two non-redundant : 7
% 0.11/11.01 % ...aggressively subsumed : 0
% 0.11/11.01 % Contextual simplify-reflections : 0
% 0.11/11.01 % Paramodulations : 10
% 0.11/11.01 % Factorizations : 2
% 0.11/11.01 % NegExts : 0
% 0.11/11.01 % Equation resolutions : 0
% 0.11/11.01 % Disequality decompositions : 0
% 0.11/11.01 % Total rewrite steps : 4
% 0.11/11.01 % ...of those cached : 1
% 0.11/11.01 % Propositional unsat checks : 0
% 0.11/11.01 % Propositional check models : 0
% 0.11/11.01 % Propositional check unsatisfiable : 0
% 0.11/11.01 % Propositional clauses : 0
% 0.11/11.01 % Propositional clauses after purity: 0
% 0.11/11.01 % Propositional unsat core size : 0
% 0.11/11.01 % Propositional preprocessing time : 0.000
% 0.11/11.01 % Propositional encoding time : 0.000
% 0.11/11.01 % Propositional solver time : 0.000
% 0.11/11.01 % Success case prop preproc time : 0.000
% 0.11/11.01 % Success case prop encoding time : 0.000
% 0.11/11.01 % Success case prop solver time : 0.000
% 0.11/11.01 % Current number of processed clauses : 6
% 0.11/11.01 % Positive orientable unit clauses : 2
% 0.11/11.01 % Positive unorientable unit clauses: 0
% 0.11/11.01 % Negative unit clauses : 0
% 0.11/11.01 % Non-unit-clauses : 4
% 0.11/11.01 % Current number of unprocessed clauses: 5
% 0.11/11.01 % ...number of literals in the above : 10
% 0.11/11.01 % Current number of archived formulas : 0
% 0.11/11.01 % Current number of archived clauses : 0
% 0.11/11.01 % Clause-clause subsumption calls (NU) : 4
% 0.11/11.01 % Rec. Clause-clause subsumption calls : 4
% 0.11/11.01 % Non-unit clause-clause subsumptions : 0
% 0.11/11.01 % Unit Clause-clause subsumption calls : 0
% 0.11/11.01 % Rewrite failures with RHS unbound : 0
% 0.11/11.01 % BW rewrite match attempts : 0
% 0.11/11.01 % BW rewrite match successes : 0
% 0.11/11.01 % Condensation attempts : 0
% 0.11/11.01 % Condensation successes : 0
% 0.11/11.01 % Termbank termtop insertions : 343
% 0.11/11.01 % Search garbage collected termcells : 63
% 0.11/11.01
% 0.11/11.01 % -------------------------------------------------
% 0.11/11.01 % User time : 0.002 s
% 0.11/11.01 % System time : 0.002 s
% 0.11/11.01 % Total time : 0.004 s
% 0.11/11.01 % Maximum resident set size: 3624 pages
% 0.11/11.01
% 0.11/11.01 % -------------------------------------------------
% 0.11/11.01 % User time : 0.004 s
% 0.11/11.01 % System time : 0.006 s
% 0.11/11.01 % Total time : 0.010 s
% 0.11/11.01 % Maximum resident set size: 4608 pages
% 0.11/11.01 % E exiting
%------------------------------------------------------------------------------