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