%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU519_8 : TPTP v9.3.1. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n013.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:30:03 PM UTC 2026
% Result : Theorem 0.12s 0.41s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU519_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n013.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 21 06:38:21 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.39 Running first-order theorem proving
% 0.12/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.12/0.41 % Version: 3.5.1
% 0.12/0.41 % Preprocessing class: FSSSSLSSSSSNFFN.
% 0.12/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.41 % Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.12/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.41 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.41 % Starting sh5l with 300s (1) cores
% 0.12/0.41 % new_bool_3 with pid 188304 completed with status 0
% 0.12/0.41 % Result found by new_bool_3
% 0.12/0.41 % Preprocessing class: FSSSSLSSSSSNFFN.
% 0.12/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.41 % Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.12/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.41 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.41 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.41 % Search class: FGHNF-FFSS21-SFFFFFNN
% 0.12/0.41 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.41 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.41 % SubtermCWHack with pid 188310 completed with status 0
% 0.12/0.41 % Result found by SubtermCWHack
% 0.12/0.41 % Preprocessing class: FSSSSLSSSSSNFFN.
% 0.12/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.41 % Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.12/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.41 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.41 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.41 % Search class: FGHNF-FFSS21-SFFFFFNN
% 0.12/0.41 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.41 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.41 % Preprocessing time : 0.001 s
% 0.12/0.41
% 0.12/0.41 % Proof found!
% 0.12/0.41 % SZS status Theorem
% 0.12/0.41 % SZS output start CNFRefutation
% 0.12/0.41 tff(decl_23, type, in: ($i * $i) > $o).
% 0.12/0.41 tff(decl_24, type, emptyset: $i).
% 0.12/0.41 tff(decl_25, type, powerset: $i > $i).
% 0.12/0.41 tff(decl_26, type, emptysetE: $o).
% 0.12/0.41 tff(decl_27, type, powersetI: $o).
% 0.12/0.41 tff(decl_28, type, esk1_0: $i).
% 0.12/0.41 tff(decl_29, type, esk2_0: $i).
% 0.12/0.41 tff(decl_30, type, epred1_0: $o).
% 0.12/0.41 tff(decl_31, type, esk3_2: ($i * $i) > $i).
% 0.12/0.41 tff(decl_32, type, esk4_0: $i).
% 0.12/0.41 tff(decl_33, type, esk5_0: $i).
% 0.12/0.41 fof(emptyinPowerset, conjecture, (emptysetE=>(powersetI=>![X3]:(in(emptyset,powerset(X3))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', emptyinPowerset)).
% 0.12/0.41 fof(emptysetE, axiom, (emptysetE<=>![X1]:((in(X1,emptyset)=>![X2:$o]:(X2)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', emptysetE)).
% 0.12/0.41 fof(powersetI, axiom, (powersetI<=>![X3, X4]:((![X1]:((in(X1,X4)=>in(X1,X3)))=>in(X4,powerset(X3))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', powersetI)).
% 0.12/0.41 fof(c_0_3, negated_conjecture, ~((emptysetE=>(powersetI=>![X3]:(in(emptyset,powerset(X3)))))), inference(assume_negation,[status(cth)],[emptyinPowerset])).
% 0.12/0.41 fof(c_0_4, plain, ![X6, X7:$o]:(((~emptysetE|(~in(X6,emptyset)|X7))&((in(esk2_0,emptyset)|emptysetE)&(~epred1_0|emptysetE)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[emptysetE])])])])])])).
% 0.12/0.41 fof(c_0_5, negated_conjecture, (emptysetE&(powersetI&~in(emptyset,powerset(esk1_0)))), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])).
% 0.12/0.41 fof(c_0_6, plain, ![X10, X11, X15]:((((in(esk3_2(X10,X11),X11)|in(X11,powerset(X10))|~powersetI)&(~in(esk3_2(X10,X11),X10)|in(X11,powerset(X10))|~powersetI))&((~in(X15,esk5_0)|in(X15,esk4_0)|powersetI)&(~in(esk5_0,powerset(esk4_0))|powersetI)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[powersetI])])])])])])).
% 0.12/0.41 cnf(c_0_7, plain, (~emptysetE|~in(X1,emptyset)), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_4])])])).
% 0.12/0.41 cnf(c_0_8, negated_conjecture, (emptysetE), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.12/0.41 cnf(c_0_9, plain, (in(esk3_2(X1,X3),X3)|in(X3,powerset(X1))|~powersetI), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.12/0.41 cnf(c_0_10, negated_conjecture, (powersetI), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.12/0.41 cnf(c_0_11, plain, (~in(X1,emptyset)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7, c_0_8])])).
% 0.12/0.41 cnf(c_0_12, plain, (in(esk3_2(X1,X3),X3)|in(X3,powerset(X1))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9, c_0_10])])).
% 0.12/0.41 cnf(c_0_13, negated_conjecture, (~in(emptyset,powerset(esk1_0))), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.12/0.41 cnf(c_0_14, plain, (in(emptyset,powerset(X1))), inference(spm,[status(thm)],[c_0_11, c_0_12])).
% 0.12/0.41 cnf(c_0_15, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13, c_0_14])]), ['proof']).
% 0.12/0.41 % SZS output end CNFRefutation
% 0.12/0.41 % Parsed axioms : 8
% 0.12/0.41 % Removed by relevancy pruning/SinE : 5
% 0.12/0.41 % Initial clauses : 10
% 0.12/0.41 % Removed in clause preprocessing : 0
% 0.12/0.41 % Initial clauses in saturation : 10
% 0.12/0.41 % Processed clauses : 10
% 0.12/0.41 % ...of these trivial : 4
% 0.12/0.41 % ...subsumed : 0
% 0.12/0.41 % ...remaining for further processing : 6
% 0.12/0.41 % Other redundant clauses eliminated : 0
% 0.12/0.41 % Clauses deleted for lack of memory : 0
% 0.12/0.41 % Backward-subsumed : 0
% 0.12/0.41 % Backward-rewritten : 1
% 0.12/0.41 % Generated clauses : 1
% 0.12/0.41 % ...of the previous two non-redundant : 1
% 0.12/0.41 % ...aggressively subsumed : 0
% 0.12/0.41 % Contextual simplify-reflections : 0
% 0.12/0.41 % Paramodulations : 1
% 0.12/0.41 % Factorizations : 0
% 0.12/0.41 % NegExts : 0
% 0.12/0.41 % Equation resolutions : 0
% 0.12/0.41 % Disequality decompositions : 0
% 0.12/0.41 % Total rewrite steps : 7
% 0.12/0.41 % ...of those cached : 4
% 0.12/0.41 % Propositional unsat checks : 0
% 0.12/0.41 % Propositional check models : 0
% 0.12/0.41 % Propositional check unsatisfiable : 0
% 0.12/0.41 % Propositional clauses : 0
% 0.12/0.41 % Propositional clauses after purity: 0
% 0.12/0.41 % Propositional unsat core size : 0
% 0.12/0.41 % Propositional preprocessing time : 0.000
% 0.12/0.41 % Propositional encoding time : 0.000
% 0.12/0.41 % Propositional solver time : 0.000
% 0.12/0.41 % Success case prop preproc time : 0.000
% 0.12/0.41 % Success case prop encoding time : 0.000
% 0.12/0.41 % Success case prop solver time : 0.000
% 0.12/0.41 % Current number of processed clauses : 5
% 0.12/0.41 % Positive orientable unit clauses : 3
% 0.12/0.41 % Positive unorientable unit clauses: 0
% 0.12/0.41 % Negative unit clauses : 1
% 0.12/0.41 % Non-unit-clauses : 1
% 0.12/0.41 % Current number of unprocessed clauses: 1
% 0.12/0.41 % ...number of literals in the above : 3
% 0.12/0.41 % Current number of archived formulas : 0
% 0.12/0.41 % Current number of archived clauses : 1
% 0.12/0.41 % Clause-clause subsumption calls (NU) : 0
% 0.12/0.41 % Rec. Clause-clause subsumption calls : 0
% 0.12/0.41 % Non-unit clause-clause subsumptions : 0
% 0.12/0.41 % Unit Clause-clause subsumption calls : 0
% 0.12/0.41 % Rewrite failures with RHS unbound : 0
% 0.12/0.41 % BW rewrite match attempts : 1
% 0.12/0.41 % BW rewrite match successes : 1
% 0.12/0.41 % Condensation attempts : 0
% 0.12/0.41 % Condensation successes : 0
% 0.12/0.41 % Termbank termtop insertions : 585
% 0.12/0.41 % Search garbage collected termcells : 191
% 0.12/0.41
% 0.12/0.41 % -------------------------------------------------
% 0.12/0.41 % User time : 0.004 s
% 0.12/0.41 % System time : 0.001 s
% 0.12/0.41 % Total time : 0.005 s
% 0.12/0.41 % Maximum resident set size: 3632 pages
% 0.12/0.41
% 0.12/0.41 % -------------------------------------------------
% 0.12/0.41 % User time : 0.006 s
% 0.12/0.41 % System time : 0.004 s
% 0.12/0.41 % Total time : 0.010 s
% 0.12/0.41 % Maximum resident set size: 4864 pages
% 0.12/0.41 % E exiting
%------------------------------------------------------------------------------