%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO304^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 : 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 : Wed Sep 30 08:42:44 AM UTC 2026
% Result : Theorem 0.07s 0.25s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO304^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.07/0.17 % Computer : n010.cluster.edu
% 0.07/0.17 % Model : x86_64 x86_64
% 0.07/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.17 % Memory : 8046.5625MB
% 0.07/0.17 % OS : Linux 6.8.0-71-generic
% 0.07/0.17 % CPULimit : 300
% 0.07/0.17 % WCLimit : 300
% 0.07/0.17 % DateTime : Tue Sep 29 16:44:48 UTC 2026
% 0.07/0.17 % CPUTime :
% 0.07/0.17 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.22 Running higher-order theorem proving
% 0.07/0.23 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.NtVZpSOpTT/E---3.1_3119409.p
% 0.07/0.25 % Version: 3.5.1-ho
% 0.07/0.25 % Preprocessing class: HSSSSMSSSSMNHHA.
% 0.07/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.25 % Starting post_as_ho5 with 1500s (5) cores
% 0.07/0.25 % Starting sh2lt with 300s (1) cores
% 0.07/0.25 % Starting ehoh_best8_lambda with 300s (1) cores
% 0.07/0.25 % Starting post_as_ho10 with 300s (1) cores
% 0.07/0.25 % sh2lt with pid 3119423 completed with status 0
% 0.07/0.25 % Result found by sh2lt
% 0.07/0.25 % Preprocessing class: HSSSSMSSSSMNHHA.
% 0.07/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.25 % Starting post_as_ho5 with 1500s (5) cores
% 0.07/0.25 % Starting sh2lt with 300s (1) cores
% 0.07/0.25 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,5,,4,20000,1.0,true))
% 0.07/0.25 % SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.07/0.25 % Search class: HGUNF-FFSF00-SHHFFSBN
% 0.07/0.25 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.25 % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.25 % SubtermCWHack with pid 3119426 completed with status 10
% 0.07/0.25 % Starting sh2lt with 31s (1) cores
% 0.07/0.25 % sh2lt with pid 3119434 completed with status 0
% 0.07/0.25 % Result found by sh2lt
% 0.07/0.25 % Preprocessing class: HSSSSMSSSSMNHHA.
% 0.07/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.25 % Starting post_as_ho5 with 1500s (5) cores
% 0.07/0.25 % Starting sh2lt with 300s (1) cores
% 0.07/0.25 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,5,,4,20000,1.0,true))
% 0.07/0.25 % SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.07/0.25 % Search class: HGUNF-FFSF00-SHHFFSBN
% 0.07/0.25 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.25 % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.25 % SubtermCWHack with pid 3119426 completed with status 10
% 0.07/0.25 % Starting sh2lt with 31s (1) cores
% 0.07/0.25 % Preprocessing time : 0.001 s
% 0.07/0.25 % Presaturation interreduction done
% 0.07/0.25
% 0.07/0.25 % Proof found!
% 0.07/0.25 % SZS status Theorem
% 0.07/0.25 % SZS output start CNFRefutation
% 0.07/0.25 thf(decl_sort1, type, a: $tType).
% 0.07/0.25 thf(decl_23, type, epred1_0: (a > a > $o) > $o).
% 0.07/0.25 thf(decl_24, type, epred2_0: a > a > $o).
% 0.07/0.25 thf(decl_25, type, epred3_2: a > a > a > $o).
% 0.07/0.25 thf(decl_26, type, esk4_0: a).
% 0.07/0.25 thf(decl_28, type, esk6_0: a).
% 0.07/0.25 thf(cE2_eq__pme, conjecture, ![X1:(a > a > $o) > $o]:(((X1 @ (^[X2:a, X3:a]:(![X4:a > $o]:((((X4 @ X2))=>((X4 @ X3)))))))=>(X1 @ (^[X2:a, X3:a]:(((X2)=(X3))))))), file('/export/starexec/sandbox2/tmp/tmp.NtVZpSOpTT/E---3.1_3119409.p', cE2_eq__pme)).
% 0.07/0.25 thf(c_0_1, negated_conjecture, ~(![X1:(a > a > $o) > $o]:(((X1 @ (^[X2:a, X3:a]:(![X4:a > $o]:((((X4 @ X2))=>((X4 @ X3)))))))=>(X1 @ (^[X2:a, X3:a]:(((X2)=(X3)))))))), inference(assume_negation,[status(cth)],[cE2_eq__pme])).
% 0.07/0.25 thf(c_0_2, negated_conjecture, ~(![X1:(a > a > $o) > $o]:(((X1 @ (^[Z0:a, Z1:a]:(![X4:a > $o]:(((X4 @ Z0)=>(X4 @ Z1))))))=>(X1 @ (^[Z0:a, Z1:a]:(((Z0)=(Z1)))))))), inference(fof_simplification,[status(thm)],[c_0_1])).
% 0.07/0.25 thf(c_0_3, negated_conjecture, ((epred1_0 @ (^[Z0:a, Z1:a]:(![X4:a > $o]:(((X4 @ Z0)=>(X4 @ Z1))))))&~(epred1_0 @ $eq)), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])).
% 0.07/0.25 thf(c_0_4, plain, ![X9:a, X8:a]:(((epred2_0 @ X8 @ X9)<=>![X7:a > $o]:(((X7 @ X8)=>(X7 @ X9))))), introduced(definition)).
% 0.07/0.25 thf(c_0_5, negated_conjecture, (((epred1_0 @ epred2_0))=(($true))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_3]), c_0_4])).
% 0.07/0.25 thf(c_0_6, negated_conjecture, ~((epred1_0 @ $eq)), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.07/0.25 thf(c_0_7, negated_conjecture, (epred1_0 @ epred2_0), inference(cn,[status(thm)],[c_0_5])).
% 0.07/0.25 thf(c_0_8, plain, ((epred2_0)!=($eq)), inference(ext_sup,[status(thm)],[c_0_6, c_0_7])).
% 0.07/0.25 thf(c_0_9, plain, ![X10:a, X11:a, X12:a > $o, X13:a, X14:a]:(((~(epred2_0 @ X11 @ X10)|(~(X12 @ X11)|(X12 @ X10)))&(((epred3_2 @ X13 @ X14 @ X14)|(epred2_0 @ X14 @ X13))&(~(epred3_2 @ X13 @ X14 @ X13)|(epred2_0 @ X14 @ X13))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])])])])])).
% 0.07/0.25 thf(c_0_10, plain, ((epred2_0 @ esk4_0)!=($eq @ esk4_0)), inference(neg_ext,[status(thm)],[c_0_8])).
% 0.07/0.25 thf(c_0_11, plain, ![X4:a > $o, X3:a, X2:a]:(((X4 @ X3)|~((epred2_0 @ X2 @ X3))|~((X4 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.07/0.25 thf(c_0_12, plain, ((epred2_0 @ esk4_0 @ esk6_0)<~>((esk4_0)=(esk6_0))), inference(neg_ext,[status(thm)],[c_0_10])).
% 0.07/0.25 thf(c_0_13, plain, ![X2:a, X3:a]:((((X2)=(X3))|~((epred2_0 @ X2 @ X3)))), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_11])).
% 0.07/0.25 thf(c_0_14, plain, (((esk4_0)=(esk6_0))|(epred2_0 @ esk4_0 @ esk6_0)), inference(dynamic_cnf,[status(thm)],[c_0_12])).
% 0.07/0.25 thf(c_0_15, plain, (((esk4_0)!=(esk6_0))|~((epred2_0 @ esk4_0 @ esk6_0))), inference(dynamic_cnf,[status(thm)],[c_0_12])).
% 0.07/0.25 thf(c_0_16, plain, ((esk4_0)=(esk6_0)), inference(spm,[status(thm)],[c_0_13, c_0_14])).
% 0.07/0.25 thf(c_0_17, plain, ![X3:a, X2:a]:(((epred2_0 @ X3 @ X2)|~((epred3_2 @ X2 @ X3 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.07/0.25 thf(c_0_18, plain, ![X3:a, X2:a]:(((epred3_2 @ X2 @ X3 @ X3)|(epred2_0 @ X3 @ X2))), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.07/0.25 thf(c_0_19, plain, ~((epred2_0 @ esk6_0 @ esk6_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15, c_0_16]), c_0_16])])).
% 0.07/0.25 thf(c_0_20, plain, ![X2:a]:((epred2_0 @ X2 @ X2)), inference(spm,[status(thm)],[c_0_17, c_0_18])).
% 0.07/0.25 thf(c_0_21, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19, c_0_20])]), ['proof']).
% 0.07/0.25 % SZS output end CNFRefutation
% 0.07/0.25 % Parsed axioms : 2
% 0.07/0.25 % Removed by relevancy pruning/SinE : 1
% 0.07/0.25 % Initial clauses : 5
% 0.07/0.25 % Removed in clause preprocessing : 0
% 0.07/0.25 % Initial clauses in saturation : 5
% 0.07/0.25 % Processed clauses : 29
% 0.07/0.25 % ...of these trivial : 0
% 0.07/0.25 % ...subsumed : 2
% 0.07/0.25 % ...remaining for further processing : 27
% 0.07/0.25 % Other redundant clauses eliminated : 0
% 0.07/0.25 % Clauses deleted for lack of memory : 0
% 0.07/0.25 % Backward-subsumed : 0
% 0.07/0.25 % Backward-rewritten : 7
% 0.07/0.25 % Generated clauses : 23
% 0.07/0.25 % ...of the previous two non-redundant : 23
% 0.07/0.25 % ...aggressively subsumed : 0
% 0.07/0.25 % Contextual simplify-reflections : 2
% 0.07/0.25 % Paramodulations : 8
% 0.07/0.25 % Factorizations : 0
% 0.07/0.25 % NegExts : 4
% 0.07/0.25 % Equation resolutions : 0
% 0.07/0.25 % Disequality decompositions : 0
% 0.07/0.25 % Total rewrite steps : 12
% 0.07/0.25 % ...of those cached : 9
% 0.07/0.25 % Propositional unsat checks : 0
% 0.07/0.25 % Propositional check models : 0
% 0.07/0.25 % Propositional check unsatisfiable : 0
% 0.07/0.25 % Propositional clauses : 0
% 0.07/0.25 % Propositional clauses after purity: 0
% 0.07/0.25 % Propositional unsat core size : 0
% 0.07/0.25 % Propositional preprocessing time : 0.000
% 0.07/0.25 % Propositional encoding time : 0.000
% 0.07/0.25 % Propositional solver time : 0.000
% 0.07/0.25 % Success case prop preproc time : 0.000
% 0.07/0.25 % Success case prop encoding time : 0.000
% 0.07/0.25 % Success case prop solver time : 0.000
% 0.07/0.25 % Current number of processed clauses : 12
% 0.07/0.25 % Positive orientable unit clauses : 4
% 0.07/0.25 % Positive unorientable unit clauses: 0
% 0.07/0.25 % Negative unit clauses : 4
% 0.07/0.25 % Non-unit-clauses : 4
% 0.07/0.25 % Current number of unprocessed clauses: 3
% 0.07/0.25 % ...number of literals in the above : 8
% 0.07/0.25 % Current number of archived formulas : 0
% 0.07/0.25 % Current number of archived clauses : 15
% 0.07/0.25 % Clause-clause subsumption calls (NU) : 17
% 0.07/0.25 % Rec. Clause-clause subsumption calls : 13
% 0.07/0.25 % Non-unit clause-clause subsumptions : 3
% 0.07/0.25 % Unit Clause-clause subsumption calls : 15
% 0.07/0.25 % Rewrite failures with RHS unbound : 0
% 0.07/0.25 % BW rewrite match attempts : 8
% 0.07/0.25 % BW rewrite match successes : 3
% 0.07/0.25 % Condensation attempts : 0
% 0.07/0.25 % Condensation successes : 0
% 0.07/0.25 % Termbank termtop insertions : 914
% 0.07/0.25 % Search garbage collected termcells : 161
% 0.07/0.25
% 0.07/0.25 % -------------------------------------------------
% 0.07/0.25 % User time : 0.004 s
% 0.07/0.25 % System time : 0.004 s
% 0.07/0.25 % Total time : 0.008 s
% 0.07/0.25 % Maximum resident set size: 3632 pages
% 0.07/0.25
% 0.07/0.25 % -------------------------------------------------
% 0.07/0.25 % User time : 0.004 s
% 0.07/0.25 % System time : 0.010 s
% 0.07/0.25 % Total time : 0.014 s
% 0.07/0.25 % Maximum resident set size: 4608 pages
% 0.07/0.25 % E exiting
%------------------------------------------------------------------------------