%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET705+4 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n008.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:15:02 PM UTC 2026
% Result : Theorem 0.23s 0.57s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 7 unt; 0 def)
% Number of atoms : 29 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 26 ( 11 ~; 9 |; 3 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 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; 1 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thI48,conjecture,
! [X1] : member(X1,power_set(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI48) ).
fof(power_set,axiom,
! [X3,X1] :
( member(X3,power_set(X1))
<=> subset(X3,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',power_set) ).
fof(subset,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',subset) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] : member(X1,power_set(X1)),
inference(assume_negation,[status(cth)],[thI48]) ).
fof(c_0_4,negated_conjecture,
~ member(esk1_0,power_set(esk1_0)),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
fof(c_0_5,plain,
! [X7,X8] :
( ( member(X7,power_set(X8))
| ~ subset(X7,X8) )
& ( subset(X7,X8)
| ~ member(X7,power_set(X8)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[power_set])])]) ).
fof(c_0_6,plain,
! [X9,X10,X11,X12,X13] :
( ( subset(X12,X13)
| ~ member(esk2_2(X12,X13),X13) )
& ( subset(X12,X13)
| member(esk2_2(X12,X13),X12) )
& ( member(X11,X10)
| ~ member(X11,X9)
| ~ subset(X9,X10) ) ),
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)],[subset])])])])])])]) ).
cnf(c_0_7,negated_conjecture,
~ member(esk1_0,power_set(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( ~ subset(X1,X2)
| member(X1,power_set(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( ~ member(esk2_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( subset(X1,X2)
| member(esk2_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
~ subset(esk1_0,esk1_0),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
subset(X1,X1),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SET705+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.48 % Computer : n008.cluster.edu
% 0.18/0.48 % Model : x86_64 x86_64
% 0.18/0.48 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.48 % Memory : 8046.5625MB
% 0.18/0.48 % OS : Linux 6.8.0-71-generic
% 0.18/0.48 % CPULimit : 300
% 0.18/0.48 % WCLimit : 300
% 0.18/0.48 % DateTime : Mon Sep 21 05:34:09 UTC 2026
% 0.18/0.48 % CPUTime :
% 0.18/0.48 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.53 Running first-order theorem proving
% 0.23/0.54 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.23/0.57 % Version: 3.5.1
% 0.23/0.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.57 % Starting sh5l with 300s (1) cores
% 0.23/0.57 % new_bool_3 with pid 243396 completed with status 0
% 0.23/0.57 % Result found by new_bool_3
% 0.23/0.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.57 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.57 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.57 % Search class: FGUNF-FFSF21-SFFFFFNN
% 0.23/0.57 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.57 % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.57 % SubtermCWHack with pid 243404 completed with status 0
% 0.23/0.57 % Result found by SubtermCWHack
% 0.23/0.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.57 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.57 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.57 % Search class: FGUNF-FFSF21-SFFFFFNN
% 0.23/0.57 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.57 % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.57 % Preprocessing time : 0.002 s
% 0.23/0.57
% 0.23/0.57 % Proof found!
% 0.23/0.57 % SZS status Theorem
% 0.23/0.57 % SZS output start CNFRefutation
% See solution above
% 0.23/0.57 % Parsed axioms : 12
% 0.23/0.57 % Removed by relevancy pruning/SinE : 9
% 0.23/0.57 % Initial clauses : 6
% 0.23/0.57 % Removed in clause preprocessing : 0
% 0.23/0.57 % Initial clauses in saturation : 6
% 0.23/0.57 % Processed clauses : 7
% 0.23/0.57 % ...of these trivial : 0
% 0.23/0.57 % ...subsumed : 0
% 0.23/0.57 % ...remaining for further processing : 7
% 0.23/0.57 % Other redundant clauses eliminated : 0
% 0.23/0.57 % Clauses deleted for lack of memory : 0
% 0.23/0.57 % Backward-subsumed : 0
% 0.23/0.57 % Backward-rewritten : 1
% 0.23/0.57 % Generated clauses : 5
% 0.23/0.57 % ...of the previous two non-redundant : 4
% 0.23/0.57 % ...aggressively subsumed : 0
% 0.23/0.57 % Contextual simplify-reflections : 0
% 0.23/0.57 % Paramodulations : 5
% 0.23/0.57 % Factorizations : 0
% 0.23/0.57 % NegExts : 0
% 0.23/0.57 % Equation resolutions : 0
% 0.23/0.57 % Disequality decompositions : 0
% 0.23/0.57 % Total rewrite steps : 1
% 0.23/0.57 % ...of those cached : 0
% 0.23/0.57 % Propositional unsat checks : 0
% 0.23/0.57 % Propositional check models : 0
% 0.23/0.57 % Propositional check unsatisfiable : 0
% 0.23/0.57 % Propositional clauses : 0
% 0.23/0.57 % Propositional clauses after purity: 0
% 0.23/0.57 % Propositional unsat core size : 0
% 0.23/0.57 % Propositional preprocessing time : 0.000
% 0.23/0.57 % Propositional encoding time : 0.000
% 0.23/0.57 % Propositional solver time : 0.000
% 0.23/0.57 % Success case prop preproc time : 0.000
% 0.23/0.57 % Success case prop encoding time : 0.000
% 0.23/0.57 % Success case prop solver time : 0.000
% 0.23/0.57 % Current number of processed clauses : 6
% 0.23/0.57 % Positive orientable unit clauses : 1
% 0.23/0.57 % Positive unorientable unit clauses: 0
% 0.23/0.57 % Negative unit clauses : 1
% 0.23/0.57 % Non-unit-clauses : 4
% 0.23/0.57 % Current number of unprocessed clauses: 3
% 0.23/0.57 % ...number of literals in the above : 7
% 0.23/0.57 % Current number of archived formulas : 0
% 0.23/0.57 % Current number of archived clauses : 1
% 0.23/0.57 % Clause-clause subsumption calls (NU) : 1
% 0.23/0.57 % Rec. Clause-clause subsumption calls : 1
% 0.23/0.57 % Non-unit clause-clause subsumptions : 0
% 0.23/0.57 % Unit Clause-clause subsumption calls : 3
% 0.23/0.57 % Rewrite failures with RHS unbound : 0
% 0.23/0.57 % BW rewrite match attempts : 2
% 0.23/0.57 % BW rewrite match successes : 1
% 0.23/0.57 % Condensation attempts : 0
% 0.23/0.57 % Condensation successes : 0
% 0.23/0.57 % Termbank termtop insertions : 499
% 0.23/0.57 % Search garbage collected termcells : 184
% 0.23/0.57
% 0.23/0.57 % -------------------------------------------------
% 0.23/0.57 % User time : 0.002 s
% 0.23/0.57 % System time : 0.005 s
% 0.23/0.57 % Total time : 0.007 s
% 0.23/0.57 % Maximum resident set size: 3648 pages
% 0.23/0.57
% 0.23/0.57 % -------------------------------------------------
% 0.23/0.57 % User time : 0.004 s
% 0.23/0.57 % System time : 0.011 s
% 0.23/0.57 % Total time : 0.015 s
% 0.23/0.57 % Maximum resident set size: 4864 pages
% 0.23/0.57 % E exiting
%------------------------------------------------------------------------------