%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO300^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 : n011.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:42:43 AM UTC 2026
% Result : Theorem 0.25s 0.37s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SYO300^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.25 % Computer : n011.cluster.edu
% 0.10/0.25 % Model : x86_64 x86_64
% 0.10/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.25 % Memory : 8046.5625MB
% 0.10/0.25 % OS : Linux 6.8.0-71-generic
% 0.10/0.25 % CPULimit : 300
% 0.10/0.25 % WCLimit : 300
% 0.10/0.25 % DateTime : Tue Sep 29 16:44:31 UTC 2026
% 0.10/0.26 % CPUTime :
% 0.10/0.26 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.32 Running higher-order theorem proving
% 0.25/0.33 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.e6z25aLqb6/E---3.1_330083.p
% 0.25/0.37 % Version: 3.5.1-ho
% 0.25/0.37 % Preprocessing class: HSSSSMSSSSMNHHA.
% 0.25/0.37 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.37 % Starting post_as_ho5 with 1500s (5) cores
% 0.25/0.37 % Starting sh2lt with 300s (1) cores
% 0.25/0.37 % Starting ehoh_best8_lambda with 300s (1) cores
% 0.25/0.37 % Starting post_as_ho10 with 300s (1) cores
% 0.25/0.37 % sh2lt with pid 330097 completed with status 0
% 0.25/0.37 % Result found by sh2lt
% 0.25/0.37 % Preprocessing class: HSSSSMSSSSMNHHA.
% 0.25/0.37 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.37 % Starting post_as_ho5 with 1500s (5) cores
% 0.25/0.37 % Starting sh2lt with 300s (1) cores
% 0.25/0.37 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,5,,4,20000,1.0,true))
% 0.25/0.37 % SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.25/0.37 % Search class: HUUSS-FFSF11-SHHFFSNN
% 0.25/0.37 % partial match(3): HGUSF-FFSF11-SHHFFSBN
% 0.25/0.37 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.37 % Starting SubtermCWHack with 28s (1) cores
% 0.25/0.37 % SubtermCWHack with pid 330103 completed with status 10
% 0.25/0.37 % Starting sh2lt with 31s (1) cores
% 0.25/0.37 % sh2lt with pid 330110 completed with status 0
% 0.25/0.37 % Result found by sh2lt
% 0.25/0.37 % Preprocessing class: HSSSSMSSSSMNHHA.
% 0.25/0.37 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.37 % Starting post_as_ho5 with 1500s (5) cores
% 0.25/0.37 % Starting sh2lt with 300s (1) cores
% 0.25/0.37 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,5,,4,20000,1.0,true))
% 0.25/0.37 % SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.25/0.37 % Search class: HUUSS-FFSF11-SHHFFSNN
% 0.25/0.37 % partial match(3): HGUSF-FFSF11-SHHFFSBN
% 0.25/0.37 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.37 % Starting SubtermCWHack with 28s (1) cores
% 0.25/0.37 % SubtermCWHack with pid 330103 completed with status 10
% 0.25/0.37 % Starting sh2lt with 31s (1) cores
% 0.25/0.37 % Preprocessing time : 0.002 s
% 0.25/0.37 % Presaturation interreduction done
% 0.25/0.37
% 0.25/0.37 % Proof found!
% 0.25/0.37 % SZS status Theorem
% 0.25/0.37 % SZS output start CNFRefutation
% 0.25/0.37 thf(decl_23, type, epred1_0: (($i > $i) > $i) > (($i > $i) > $i) > $o).
% 0.25/0.37 thf(decl_24, type, esk1_0: $i > $i).
% 0.25/0.37 thf(decl_25, type, esk2_1: (($i > $i) > $i) > ($i > $i) > $i).
% 0.25/0.37 thf(cUNIFTHM1, conjecture, ![X1:(($i > $i) > $i) > (($i > $i) > $i) > $o]:(?[X2:($i > $i) > $i]:((![X3:($i > $i) > $i]:((X1 @ X3 @ X3))=>(X1 @ (^[X4:$i > $i]:(X4 @ (X2 @ (^[X5:$i]:(X5))))) @ X2)))), file('/export/starexec/sandbox2/tmp/tmp.e6z25aLqb6/E---3.1_330083.p', cUNIFTHM1)).
% 0.25/0.37 thf(c_0_1, negated_conjecture, ~(![X1:(($i > $i) > $i) > (($i > $i) > $i) > $o]:(?[X2:($i > $i) > $i]:((![X3:($i > $i) > $i]:((X1 @ X3 @ X3))=>(X1 @ (^[X4:$i > $i]:(X4 @ (X2 @ (^[X5:$i]:(X5))))) @ X2))))), inference(assume_negation,[status(cth)],[cUNIFTHM1])).
% 0.25/0.37 thf(c_0_2, plain, ![X14:$i > $i, X15:($i > $i) > $i]:(((esk2_1 @ X15 @ X14)=(X14 @ (X15 @ esk1_0)))), inference(variable_rename,[status(thm)],[])).
% 0.25/0.37 thf(c_0_3, plain, ![X16:$i]:(((esk1_0 @ X16)=(X16))), inference(variable_rename,[status(thm)],[])).
% 0.25/0.37 thf(c_0_4, negated_conjecture, ~(![X1:(($i > $i) > $i) > (($i > $i) > $i) > $o]:(?[X2:($i > $i) > $i]:((![X3:($i > $i) > $i]:((X1 @ X3 @ X3))=>(X1 @ (^[Z0:$i > $i]:(Z0 @ (X2 @ (^[Z1:$i]:(Z1))))) @ X2))))), inference(fof_simplification,[status(thm)],[c_0_1])).
% 0.25/0.37 thf(c_0_5, plain, ![X4:$i > $i, X2:($i > $i) > $i]:(((esk2_1 @ X2 @ X4)=(X4 @ (X2 @ esk1_0)))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.25/0.37 thf(c_0_6, plain, ![X5:$i]:(((esk1_0 @ X5)=(X5))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.25/0.37 thf(c_0_7, negated_conjecture, ![X10:($i > $i) > $i, X11:($i > $i) > $i]:(((epred1_0 @ X11 @ X11)&~(epred1_0 @ (^[Z0:$i > $i]:(Z0 @ (X10 @ (^[Z1:$i]:(Z1))))) @ X10))), 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.25/0.37 thf(c_0_8, plain, ![X13:$i > $i, X2:($i > $i) > $i]:(((esk2_1 @ X2 @ X13)=(X13 @ (X2 @ esk1_0)))), introduced(definition)).
% 0.25/0.37 thf(c_0_9, plain, ![X12:$i]:(((esk1_0 @ X12)=(X12))), introduced(definition)).
% 0.25/0.37 thf(c_0_10, plain, ![X4:$i > $i, X2:($i > $i) > $i]:(((esk2_1 @ (esk2_1 @ X2) @ X4)=(X4 @ (X2 @ esk1_0)))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5, c_0_5]), c_0_6])).
% 0.25/0.37 thf(c_0_11, negated_conjecture, ![X2:($i > $i) > $i]:(~((((epred1_0 @ (esk2_1 @ X2) @ X2))=(($true))))), inference(lift_lambdas,[status(thm)],[inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_7]), c_0_8]), c_0_9])).
% 0.25/0.37 thf(c_0_12, plain, ![X2:($i > $i) > $i, X4:$i > $i]:(((esk2_1 @ (esk2_1 @ X2) @ X4)=(esk2_1 @ X2 @ X4))), inference(spm,[status(thm)],[c_0_5, c_0_10])).
% 0.25/0.37 thf(c_0_13, negated_conjecture, ![X2:($i > $i) > $i]:(~((epred1_0 @ (esk2_1 @ X2) @ X2))), inference(cn,[status(thm)],[c_0_11])).
% 0.25/0.37 thf(c_0_14, plain, ![X2:($i > $i) > $i]:(((esk2_1 @ (esk2_1 @ X2))=(esk2_1 @ X2))), inference(pos_ext,[status(thm)],[c_0_12])).
% 0.25/0.37 thf(c_0_15, negated_conjecture, ![X2:($i > $i) > $i]:((epred1_0 @ X2 @ X2)), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.25/0.37 thf(c_0_16, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_14]), c_0_15])]), ['proof']).
% 0.25/0.37 % SZS output end CNFRefutation
% 0.25/0.37 % Parsed axioms : 1
% 0.25/0.37 % Removed by relevancy pruning/SinE : 0
% 0.25/0.37 % Initial clauses : 4
% 0.25/0.37 % Removed in clause preprocessing : 0
% 0.25/0.37 % Initial clauses in saturation : 4
% 0.25/0.37 % Processed clauses : 13
% 0.25/0.37 % ...of these trivial : 0
% 0.25/0.37 % ...subsumed : 1
% 0.25/0.37 % ...remaining for further processing : 12
% 0.25/0.37 % Other redundant clauses eliminated : 0
% 0.25/0.37 % Clauses deleted for lack of memory : 0
% 0.25/0.37 % Backward-subsumed : 0
% 0.25/0.37 % Backward-rewritten : 1
% 0.25/0.37 % Generated clauses : 20
% 0.25/0.37 % ...of the previous two non-redundant : 17
% 0.25/0.37 % ...aggressively subsumed : 0
% 0.25/0.37 % Contextual simplify-reflections : 0
% 0.25/0.37 % Paramodulations : 18
% 0.25/0.37 % Factorizations : 0
% 0.25/0.37 % NegExts : 0
% 0.25/0.37 % Equation resolutions : 0
% 0.25/0.37 % Disequality decompositions : 0
% 0.25/0.37 % Total rewrite steps : 11
% 0.25/0.37 % ...of those cached : 6
% 0.25/0.37 % Propositional unsat checks : 0
% 0.25/0.37 % Propositional check models : 0
% 0.25/0.37 % Propositional check unsatisfiable : 0
% 0.25/0.37 % Propositional clauses : 0
% 0.25/0.37 % Propositional clauses after purity: 0
% 0.25/0.37 % Propositional unsat core size : 0
% 0.25/0.37 % Propositional preprocessing time : 0.000
% 0.25/0.37 % Propositional encoding time : 0.000
% 0.25/0.37 % Propositional solver time : 0.000
% 0.25/0.37 % Success case prop preproc time : 0.000
% 0.25/0.37 % Success case prop encoding time : 0.000
% 0.25/0.37 % Success case prop solver time : 0.000
% 0.25/0.37 % Current number of processed clauses : 7
% 0.25/0.37 % Positive orientable unit clauses : 4
% 0.25/0.37 % Positive unorientable unit clauses: 2
% 0.25/0.37 % Negative unit clauses : 1
% 0.25/0.37 % Non-unit-clauses : 0
% 0.25/0.37 % Current number of unprocessed clauses: 12
% 0.25/0.37 % ...number of literals in the above : 12
% 0.25/0.37 % Current number of archived formulas : 0
% 0.25/0.37 % Current number of archived clauses : 5
% 0.25/0.37 % Clause-clause subsumption calls (NU) : 0
% 0.25/0.37 % Rec. Clause-clause subsumption calls : 0
% 0.25/0.37 % Non-unit clause-clause subsumptions : 0
% 0.25/0.37 % Unit Clause-clause subsumption calls : 0
% 0.25/0.37 % Rewrite failures with RHS unbound : 0
% 0.25/0.37 % BW rewrite match attempts : 33
% 0.25/0.37 % BW rewrite match successes : 3
% 0.25/0.37 % Condensation attempts : 0
% 0.25/0.37 % Condensation successes : 0
% 0.25/0.37 % Termbank termtop insertions : 752
% 0.25/0.37 % Search garbage collected termcells : 64
% 0.25/0.37
% 0.25/0.37 % -------------------------------------------------
% 0.25/0.37 % User time : 0.007 s
% 0.25/0.37 % System time : 0.005 s
% 0.25/0.37 % Total time : 0.012 s
% 0.25/0.37 % Maximum resident set size: 3636 pages
% 0.25/0.37
% 0.25/0.37 % -------------------------------------------------
% 0.25/0.37 % User time : 0.009 s
% 0.25/0.37 % System time : 0.011 s
% 0.25/0.37 % Total time : 0.020 s
% 0.25/0.37 % Maximum resident set size: 4608 pages
% 0.25/0.37 % E exiting
%------------------------------------------------------------------------------