%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU940^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n014.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 : Wed Sep 30 08:28:08 AM UTC 2026
% Result : Theorem 0.20s 0.28s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU940^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n014.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Tue Sep 29 14:49:43 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running higher-order theorem proving
% 0.08/0.24 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.Zio3BSxhCZ/E---3.1_2766720.p
% 0.20/0.28 % Version: 3.5.1-ho
% 0.20/0.28 % Preprocessing class: HSSSSMSSSSMNHHA.
% 0.20/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.28 % Starting post_as_ho5 with 1500s (5) cores
% 0.20/0.28 % Starting sh2lt with 300s (1) cores
% 0.20/0.28 % Starting ehoh_best8_lambda with 300s (1) cores
% 0.20/0.28 % Starting post_as_ho10 with 300s (1) cores
% 0.20/0.28 % post_as_ho5 with pid 2766733 completed with status 9
% 0.20/0.28 % sh2lt with pid 2766734 completed with status 0
% 0.20/0.28 % Result found by sh2lt
% 0.20/0.28 % Preprocessing class: HSSSSMSSSSMNHHA.
% 0.20/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.28 % Starting post_as_ho5 with 1500s (5) cores
% 0.20/0.28 % Starting sh2lt with 300s (1) cores
% 0.20/0.28 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,5,,4,20000,1.0,true))
% 0.20/0.28 % SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.20/0.28 % Search class: HHHSS-FFSF11-SHHFFSBN
% 0.20/0.28 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.28 % Starting SubtermCWHack with 28s (1) cores
% 0.20/0.28 % SubtermCWHack with pid 2766742 completed with status 10
% 0.20/0.28 % Starting sh2lt with 31s (1) cores
% 0.20/0.28 % sh2lt with pid 2766748 completed with status 10
% 0.20/0.28 % Starting new_bool_3 with 28s (1) cores
% 0.20/0.28 % new_bool_3 with pid 2766752 completed with status 0
% 0.20/0.28 % Result found by new_bool_3
% 0.20/0.28 % Preprocessing class: HSSSSMSSSSMNHHA.
% 0.20/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.28 % Starting post_as_ho5 with 1500s (5) cores
% 0.20/0.28 % Starting sh2lt with 300s (1) cores
% 0.20/0.28 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,5,,4,20000,1.0,true))
% 0.20/0.28 % SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.20/0.28 % Search class: HHHSS-FFSF11-SHHFFSBN
% 0.20/0.28 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.28 % Starting SubtermCWHack with 28s (1) cores
% 0.20/0.28 % SubtermCWHack with pid 2766742 completed with status 10
% 0.20/0.28 % Starting sh2lt with 31s (1) cores
% 0.20/0.28 % sh2lt with pid 2766748 completed with status 10
% 0.20/0.28 % Starting new_bool_3 with 28s (1) cores
% 0.20/0.28 % Preprocessing time : 0.001 s
% 0.20/0.28 % Presaturation interreduction done
% 0.20/0.28
% 0.20/0.28 % Proof found!
% 0.20/0.28 % SZS status Theorem
% 0.20/0.28 % SZS output start CNFRefutation
% 0.20/0.28 thf(decl_23, type, epred1_0: $i > $o).
% 0.20/0.28 thf(decl_24, type, esk1_1: (($i > $i) > $o) > $i > $i).
% 0.20/0.28 thf(decl_25, type, esk2_1: (($i > $i) > $o) > $i > $i).
% 0.20/0.28 thf(decl_26, type, esk3_1: (($i > $i) > $o) > $i).
% 0.20/0.28 thf(decl_27, type, esk4_1: (($i > $i) > $o) > $i > $i).
% 0.20/0.28 thf(decl_28, type, esk5_0: $i > $i).
% 0.20/0.28 thf(cTHM112A_pme, conjecture, ![X1:$i > $o]:(?[X2:($i > $i) > $o]:(((X2 @ (^[X3:$i]:(X3)))&![X4:$i > $i, X5:$i > $i]:((((X2 @ X4)&(X2 @ X5))=>((X2 @ (^[X3:$i]:(X4 @ (X5 @ X3))))&![X6:$i]:(((X1 @ X6)=>(X1 @ (X4 @ X6)))))))))), file('/export/starexec/sandbox2/tmp/tmp.Zio3BSxhCZ/E---3.1_2766720.p', cTHM112A_pme)).
% 0.20/0.28 thf(c_0_1, negated_conjecture, ~(![X1:$i > $o]:(?[X2:($i > $i) > $o]:(((X2 @ (^[X3:$i]:(X3)))&![X4:$i > $i, X5:$i > $i]:((((X2 @ X4)&(X2 @ X5))=>((X2 @ (^[X3:$i]:(X4 @ (X5 @ X3))))&![X6:$i]:(((X1 @ X6)=>(X1 @ (X4 @ X6))))))))))), inference(assume_negation,[status(cth)],[cTHM112A_pme])).
% 0.20/0.28 thf(c_0_2, negated_conjecture, ~(![X1:$i > $o]:(?[X2:($i > $i) > $o]:(((X2 @ (^[Z0:$i]:(Z0)))&![X4:$i > $i, X5:$i > $i]:((((X2 @ X4)&(X2 @ X5))=>((X2 @ (^[Z0:$i]:(X4 @ (X5 @ Z0))))&![X6:$i]:(((X1 @ X6)=>(X1 @ (X4 @ X6))))))))))), inference(fof_simplification,[status(thm)],[c_0_1])).
% 0.20/0.28 thf(c_0_3, negated_conjecture, ![X13:($i > $i) > $o]:(((((X13 @ (esk1_1 @ X13))|~(X13 @ (^[Z0:$i]:(Z0))))&((X13 @ (esk2_1 @ X13))|~(X13 @ (^[Z0:$i]:(Z0)))))&(((epred1_0 @ (esk3_1 @ X13))|~(X13 @ (^[Z0:$i]:(esk1_1 @ X13 @ (esk2_1 @ X13 @ Z0))))|~(X13 @ (^[Z0:$i]:(Z0))))&(~(epred1_0 @ (esk1_1 @ X13 @ (esk3_1 @ X13)))|~(X13 @ (^[Z0:$i]:(esk1_1 @ X13 @ (esk2_1 @ X13 @ Z0))))|~(X13 @ (^[Z0:$i]:(Z0))))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])])).
% 0.20/0.28 thf(c_0_4, plain, ![X18:$i]:(((esk5_0 @ X18)=(X18))), introduced(definition)).
% 0.20/0.28 thf(c_0_5, plain, ![X17:$i, X2:($i > $i) > $o]:(((esk4_1 @ X2 @ X17)=(esk1_1 @ X2 @ (esk2_1 @ X2 @ X17)))), introduced(definition)).
% 0.20/0.28 thf(c_0_6, negated_conjecture, ![X2:($i > $i) > $o]:(((X2 @ (esk1_1 @ X2))|~((((X2 @ esk5_0))=(($true)))))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_3]), c_0_4])).
% 0.20/0.28 thf(c_0_7, negated_conjecture, ![X2:($i > $i) > $o]:((~((epred1_0 @ (esk1_1 @ X2 @ (esk3_1 @ X2))))|~((((X2 @ (esk4_1 @ X2)))=(($true))))|~((((X2 @ esk5_0))=(($true)))))), inference(lift_lambdas,[status(thm)],[inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_3]), c_0_4]), c_0_5])).
% 0.20/0.28 thf(c_0_8, negated_conjecture, ![X2:($i > $i) > $o]:(((X2 @ (esk1_1 @ X2))|~((X2 @ esk5_0)))), inference(cn,[status(thm)],[c_0_6])).
% 0.20/0.28 thf(c_0_9, plain, ![X23:$i]:(((esk5_0 @ X23)=(X23))), inference(variable_rename,[status(thm)],[])).
% 0.20/0.28 thf(c_0_10, negated_conjecture, ![X2:($i > $i) > $o]:(((epred1_0 @ (esk3_1 @ X2))|~((((X2 @ (esk4_1 @ X2)))=(($true))))|~((((X2 @ esk5_0))=(($true)))))), inference(lift_lambdas,[status(thm)],[inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_3]), c_0_4]), c_0_5])).
% 0.20/0.28 thf(c_0_11, negated_conjecture, ![X2:($i > $i) > $o]:(((X2 @ (esk2_1 @ X2))|~((((X2 @ esk5_0))=(($true)))))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_3]), c_0_4])).
% 0.20/0.28 thf(c_0_12, negated_conjecture, ![X2:($i > $i) > $o]:((~((epred1_0 @ (esk1_1 @ X2 @ (esk3_1 @ X2))))|~((X2 @ (esk4_1 @ X2)))|~((X2 @ esk5_0)))), inference(cn,[status(thm)],[c_0_7])).
% 0.20/0.28 thf(c_0_13, negated_conjecture, ((esk1_1 @ (^[Z0:$i > $i]:(((Z0)=(esk5_0)))))=(esk5_0)), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_8])).
% 0.20/0.28 thf(c_0_14, plain, ![X3:$i]:(((esk5_0 @ X3)=(X3))), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.20/0.28 thf(c_0_15, negated_conjecture, ![X2:($i > $i) > $o]:(((epred1_0 @ (esk3_1 @ X2))|~((X2 @ (esk4_1 @ X2)))|~((X2 @ esk5_0)))), inference(cn,[status(thm)],[c_0_10])).
% 0.20/0.28 thf(c_0_16, negated_conjecture, ![X2:($i > $i) > $o]:(((X2 @ (esk2_1 @ X2))|~((X2 @ esk5_0)))), inference(cn,[status(thm)],[c_0_11])).
% 0.20/0.28 thf(c_0_17, negated_conjecture, ![X31:($i > $i) > $i > $i, X32:($i > $i) > $i > $i]:((((X31 @ (esk4_1 @ (^[Z0:$i > $i]:(((X31 @ Z0)=(X32 @ Z0))))))!=(X32 @ (esk4_1 @ (^[Z0:$i > $i]:(((X31 @ Z0)=(X32 @ Z0)))))))|((X31 @ esk5_0)!=(X32 @ esk5_0))|~((epred1_0 @ (esk1_1 @ (^[Z0:$i > $i]:(((X31 @ Z0)=(X32 @ Z0)))) @ (esk3_1 @ (^[Z0:$i > $i]:(((X31 @ Z0)=(X32 @ Z0)))))))))), inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]), c_0_12])).
% 0.20/0.28 thf(c_0_18, negated_conjecture, ![X3:$i]:(((esk1_1 @ (^[Z0:$i > $i]:(((Z0)=(esk5_0)))) @ X3)=(X3))), inference(rw,[status(thm)],[inference(arg_cong,[status(thm)],[c_0_13]), c_0_14])).
% 0.20/0.28 thf(c_0_19, negated_conjecture, ![X31:($i > $i) > $i > $i, X32:($i > $i) > $i > $i]:(((epred1_0 @ (esk3_1 @ (^[Z0:$i > $i]:(((X31 @ Z0)=(X32 @ Z0))))))|((X31 @ (esk4_1 @ (^[Z0:$i > $i]:(((X31 @ Z0)=(X32 @ Z0))))))!=(X32 @ (esk4_1 @ (^[Z0:$i > $i]:(((X31 @ Z0)=(X32 @ Z0)))))))|((X31 @ esk5_0)!=(X32 @ esk5_0)))), inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]), c_0_15])).
% 0.20/0.28 thf(c_0_20, plain, ![X24:$i, X25:($i > $i) > $o]:(((esk4_1 @ X25 @ X24)=(esk1_1 @ X25 @ (esk2_1 @ X25 @ X24)))), inference(variable_rename,[status(thm)],[])).
% 0.20/0.28 thf(c_0_21, negated_conjecture, ((esk2_1 @ (^[Z0:$i > $i]:(((Z0)=(esk5_0)))))=(esk5_0)), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_16])).
% 0.20/0.28 thf(c_0_22, plain, ![X31:($i > $i) > $i > $i, X32:($i > $i) > $i > $i]:((((X31 @ (esk4_1 @ (^[Z0:$i > $i]:(((X31 @ Z0)=(X32 @ Z0))))))!=(X32 @ (esk4_1 @ (^[Z0:$i > $i]:(((X31 @ Z0)=(X32 @ Z0)))))))|((^[Z0:$i > $i]:(((X31 @ Z0)=(X32 @ Z0))))!=(^[Z0:$i > $i]:(((Z0)=(esk5_0)))))|((X31 @ esk5_0)!=(X32 @ esk5_0)))), inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_17, c_0_18])]), c_0_19])).
% 0.20/0.28 thf(c_0_23, plain, ![X2:($i > $i) > $o, X3:$i]:(((esk4_1 @ X2 @ X3)=(esk1_1 @ X2 @ (esk2_1 @ X2 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_20])).
% 0.20/0.28 thf(c_0_24, negated_conjecture, ![X3:$i]:(((esk2_1 @ (^[Z0:$i > $i]:(((Z0)=(esk5_0)))) @ X3)=(X3))), inference(rw,[status(thm)],[inference(arg_cong,[status(thm)],[c_0_21]), c_0_14])).
% 0.20/0.28 thf(c_0_25, plain, ((esk4_1 @ (^[Z0:$i > $i]:(((Z0)=(esk5_0)))))!=(esk5_0)), inference(er,[status(thm)],[c_0_22])).
% 0.20/0.28 thf(c_0_26, plain, ![X3:$i]:(((esk4_1 @ (^[Z0:$i > $i]:(((Z0)=(esk5_0)))) @ X3)=(X3))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_24]), c_0_18])).
% 0.20/0.28 thf(c_0_27, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_25]), c_0_26]), c_0_14])]), ['proof']).
% 0.20/0.28 % SZS output end CNFRefutation
% 0.20/0.28 % Parsed axioms : 1
% 0.20/0.28 % Removed by relevancy pruning/SinE : 0
% 0.20/0.28 % Initial clauses : 6
% 0.20/0.28 % Removed in clause preprocessing : 0
% 0.20/0.28 % Initial clauses in saturation : 6
% 0.20/0.28 % Processed clauses : 86
% 0.20/0.28 % ...of these trivial : 1
% 0.20/0.28 % ...subsumed : 7
% 0.20/0.28 % ...remaining for further processing : 78
% 0.20/0.28 % Other redundant clauses eliminated : 8
% 0.20/0.28 % Clauses deleted for lack of memory : 0
% 0.20/0.28 % Backward-subsumed : 1
% 0.20/0.28 % Backward-rewritten : 1
% 0.20/0.28 % Generated clauses : 129
% 0.20/0.28 % ...of the previous two non-redundant : 105
% 0.20/0.28 % ...aggressively subsumed : 0
% 0.20/0.28 % Contextual simplify-reflections : 3
% 0.20/0.28 % Paramodulations : 17
% 0.20/0.28 % Factorizations : 0
% 0.20/0.28 % NegExts : 24
% 0.20/0.28 % Equation resolutions : 14
% 0.20/0.28 % Disequality decompositions : 0
% 0.20/0.28 % Total rewrite steps : 16
% 0.20/0.28 % ...of those cached : 0
% 0.20/0.28 % Propositional unsat checks : 0
% 0.20/0.28 % Propositional check models : 0
% 0.20/0.28 % Propositional check unsatisfiable : 0
% 0.20/0.28 % Propositional clauses : 0
% 0.20/0.28 % Propositional clauses after purity: 0
% 0.20/0.28 % Propositional unsat core size : 0
% 0.20/0.28 % Propositional preprocessing time : 0.000
% 0.20/0.28 % Propositional encoding time : 0.000
% 0.20/0.28 % Propositional solver time : 0.000
% 0.20/0.28 % Success case prop preproc time : 0.000
% 0.20/0.28 % Success case prop encoding time : 0.000
% 0.20/0.28 % Success case prop solver time : 0.000
% 0.20/0.28 % Current number of processed clauses : 57
% 0.20/0.28 % Positive orientable unit clauses : 9
% 0.20/0.28 % Positive unorientable unit clauses: 0
% 0.20/0.28 % Negative unit clauses : 6
% 0.20/0.28 % Non-unit-clauses : 42
% 0.20/0.28 % Current number of unprocessed clauses: 31
% 0.20/0.28 % ...number of literals in the above : 109
% 0.20/0.28 % Current number of archived formulas : 0
% 0.20/0.28 % Current number of archived clauses : 21
% 0.20/0.28 % Clause-clause subsumption calls (NU) : 208
% 0.20/0.28 % Rec. Clause-clause subsumption calls : 126
% 0.20/0.28 % Non-unit clause-clause subsumptions : 9
% 0.20/0.28 % Unit Clause-clause subsumption calls : 24
% 0.20/0.28 % Rewrite failures with RHS unbound : 0
% 0.20/0.28 % BW rewrite match attempts : 8
% 0.20/0.28 % BW rewrite match successes : 2
% 0.20/0.28 % Condensation attempts : 0
% 0.20/0.28 % Condensation successes : 0
% 0.20/0.28 % Termbank termtop insertions : 27749
% 0.20/0.28 % Search garbage collected termcells : 174
% 0.20/0.28
% 0.20/0.28 % -------------------------------------------------
% 0.20/0.28 % User time : 0.019 s
% 0.20/0.28 % System time : 0.008 s
% 0.20/0.28 % Total time : 0.027 s
% 0.20/0.28 % Maximum resident set size: 3892 pages
% 0.20/0.28
% 0.20/0.28 % -------------------------------------------------
% 0.20/0.28 % User time : 0.041 s
% 0.20/0.28 % System time : 0.028 s
% 0.20/0.28 % Total time : 0.070 s
% 0.20/0.28 % Maximum resident set size: 4864 pages
% 0.20/0.28 % E exiting
%------------------------------------------------------------------------------