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