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