%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEV236^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 : n026.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:35:15 AM UTC 2026
% Result : Theorem 0.08s 0.25s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV236^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.17 % Computer : n026.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.17 % CPULimit : 300
% 0.08/0.17 % WCLimit : 300
% 0.08/0.17 % DateTime : Tue Sep 29 15:29:31 UTC 2026
% 0.08/0.17 % CPUTime :
% 0.08/0.17 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.21 Running higher-order theorem proving
% 0.08/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.Axdky9kbqB/E---3.1_731145.p
% 0.08/0.25 % Version: 3.5.1-ho
% 0.08/0.25 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.08/0.25 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.25 % Starting post_as_ho12 with 300s (1) cores
% 0.08/0.25 % Starting new_bool_9 with 300s (1) cores
% 0.08/0.25 % Starting post_as_ho1 with 300s (1) cores
% 0.08/0.25 % Starting post_as_ho4 with 300s (1) cores
% 0.08/0.25 % Starting post_as_ho2 with 300s (1) cores
% 0.08/0.25 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.08/0.25 % Starting full_lambda_10 with 300s (1) cores
% 0.08/0.25 % Starting new_ho_8 with 300s (1) cores
% 0.08/0.25 % post_as_ho1 with pid 731160 completed with status 0
% 0.08/0.25 % Result found by post_as_ho1
% 0.08/0.25 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.08/0.25 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.25 % Starting post_as_ho12 with 300s (1) cores
% 0.08/0.25 % Starting new_bool_9 with 300s (1) cores
% 0.08/0.25 % Starting post_as_ho1 with 300s (1) cores
% 0.08/0.25 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.25 % No SInE strategy applied
% 0.08/0.25 % Search class: HGUNF-FFSF22-SSSFFMBN
% 0.08/0.25 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.25 % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.25 % SubtermCWHack with pid 731168 completed with status 0
% 0.08/0.25 % Result found by SubtermCWHack
% 0.08/0.25 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.08/0.25 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.25 % Starting post_as_ho12 with 300s (1) cores
% 0.08/0.25 % Starting new_bool_9 with 300s (1) cores
% 0.08/0.25 % Starting post_as_ho1 with 300s (1) cores
% 0.08/0.25 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.25 % No SInE strategy applied
% 0.08/0.25 % Search class: HGUNF-FFSF22-SSSFFMBN
% 0.08/0.25 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.25 % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.25 % Preprocessing time : 0.001 s
% 0.08/0.25
% 0.08/0.25 % Proof found!
% 0.08/0.25 % SZS status Theorem
% 0.08/0.25 % SZS output start CNFRefutation
% 0.08/0.25 thf(decl_sort1, type, a: $tType).
% 0.08/0.25 thf(decl_23, type, cS: a > $o).
% 0.08/0.25 thf(decl_24, type, cK: (a > $o) > a > $o).
% 0.08/0.25 thf(decl_25, type, esk1_2: (a > $o) > (a > $o) > a).
% 0.08/0.25 thf(decl_26, type, esk2_0: a).
% 0.08/0.25 thf(decl_27, type, epred1_0: a > $o).
% 0.08/0.25 thf(decl_28, type, epred2_1: a > a > $o).
% 0.08/0.25 thf(decl_29, type, esk3_2: a > (a > $o) > a).
% 0.08/0.25 thf(cTHM91_pme, conjecture, (![X1:a > $o, X2:a > $o]:((![X3:a]:(((X1 @ X3)=>(X2 @ X3)))=>![X3:a]:(((cK @ X1 @ X3)=>(cK @ X2 @ X3)))))=>![X3:a]:(((cK @ cS @ X3)=>(cK @ (^[X4:a]:(?[X5:a > $o]:(((![X6:a]:((((X5 @ X6))=>((cS @ X6)))))&((X5 @ X4)))))) @ X3)))), file('/export/starexec/sandbox2/tmp/tmp.Axdky9kbqB/E---3.1_731145.p', cTHM91_pme)).
% 0.08/0.25 thf(c_0_1, negated_conjecture, ~((![X1:a > $o, X2:a > $o]:((![X3:a]:(((X1 @ X3)=>(X2 @ X3)))=>![X3:a]:(((cK @ X1 @ X3)=>(cK @ X2 @ X3)))))=>![X3:a]:(((cK @ cS @ X3)=>(cK @ (^[X4:a]:(?[X5:a > $o]:(((![X6:a]:((((X5 @ X6))=>((cS @ X6)))))&((X5 @ X4)))))) @ X3))))), inference(assume_negation,[status(cth)],[cTHM91_pme])).
% 0.08/0.25 thf(c_0_2, negated_conjecture, ~((![X1:a > $o, X2:a > $o]:((![X3:a]:(((X1 @ X3)=>(X2 @ X3)))=>![X3:a]:(((cK @ X1 @ X3)=>(cK @ X2 @ X3)))))=>![X3:a]:(((cK @ cS @ X3)=>(cK @ (^[Z0:a]:(?[X5:a > $o]:(((![X6:a]:(((X5 @ X6)=>((cS @ X6)))))&(X5 @ Z0))))) @ X3))))), inference(fof_simplification,[status(thm)],[c_0_1])).
% 0.08/0.25 thf(c_0_3, plain, ![X20:a, X22:a, X23:a > $o]:((((~(epred2_1 @ X20 @ X22)|(cS @ X22)|~(epred1_0 @ X20))&((epred2_1 @ X20 @ X20)|~(epred1_0 @ X20)))&(((X23 @ (esk3_2 @ X20 @ X23))|~(X23 @ X20)|(epred1_0 @ X20))&(~(cS @ (esk3_2 @ X20 @ X23))|~(X23 @ X20)|(epred1_0 @ X20))))), 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)],[])])])])])])).
% 0.08/0.25 thf(c_0_4, negated_conjecture, ![X12:a > $o, X13:a > $o, X15:a]:(((((X12 @ (esk1_2 @ X12 @ X13))|(~(cK @ X12 @ X15)|(cK @ X13 @ X15)))&(~(X13 @ (esk1_2 @ X12 @ X13))|(~(cK @ X12 @ X15)|(cK @ X13 @ X15))))&((cK @ cS @ esk2_0)&~(cK @ (^[Z0:a]:(?[X5:a > $o]:(((![X6:a]:(((X5 @ X6)=>((cS @ X6)))))&(X5 @ Z0))))) @ esk2_0)))), 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)],[c_0_2])])])])])])).
% 0.08/0.25 thf(c_0_5, plain, ![X1:a > $o, X3:a]:(((epred1_0 @ X3)|~((cS @ (esk3_2 @ X3 @ X1)))|~((X1 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.08/0.25 thf(c_0_6, plain, ![X1:a > $o, X3:a]:(((X1 @ (esk3_2 @ X3 @ X1))|(epred1_0 @ X3)|~((X1 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.08/0.25 thf(c_0_7, negated_conjecture, ![X1:a > $o, X2:a > $o, X3:a]:(((X1 @ (esk1_2 @ X1 @ X2))|(cK @ X2 @ X3)|~((cK @ X1 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.08/0.25 thf(c_0_8, negated_conjecture, (cK @ cS @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.08/0.25 thf(c_0_9, plain, ![X19:a]:(((epred1_0 @ X19)<=>?[X17:a > $o]:((![X18:a]:(((X17 @ X18)=>(cS @ X18)))&(X17 @ X19))))), introduced(definition)).
% 0.08/0.25 thf(c_0_10, plain, ![X3:a]:(((epred1_0 @ X3)|~((cS @ X3)))), inference(spm,[status(thm)],[c_0_5, c_0_6])).
% 0.08/0.25 thf(c_0_11, negated_conjecture, ![X1:a > $o]:(((cS @ (esk1_2 @ cS @ X1))|(cK @ X1 @ esk2_0))), inference(spm,[status(thm)],[c_0_7, c_0_8])).
% 0.08/0.25 thf(c_0_12, negated_conjecture, ~((((cK @ epred1_0 @ esk2_0))=(($true)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_4]), c_0_9])).
% 0.08/0.25 thf(c_0_13, negated_conjecture, ![X1:a > $o, X2:a > $o, X3:a]:(((cK @ X1 @ X3)|~((X1 @ (esk1_2 @ X2 @ X1)))|~((cK @ X2 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.08/0.25 thf(c_0_14, plain, ![X1:a > $o]:(((epred1_0 @ (esk1_2 @ cS @ X1))|(cK @ X1 @ esk2_0))), inference(spm,[status(thm)],[c_0_10, c_0_11])).
% 0.08/0.25 thf(c_0_15, negated_conjecture, ~((cK @ epred1_0 @ esk2_0)), inference(cn,[status(thm)],[c_0_12])).
% 0.08/0.25 thf(c_0_16, plain, ![X3:a]:(((cK @ epred1_0 @ X3)|~((cK @ cS @ X3)))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_14]), c_0_15])).
% 0.08/0.25 thf(c_0_17, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_8]), c_0_15]), ['proof']).
% 0.08/0.25 % SZS output end CNFRefutation
% 0.08/0.25 % Parsed axioms : 4
% 0.08/0.25 % Removed by relevancy pruning/SinE : 0
% 0.08/0.25 % Initial clauses : 11
% 0.08/0.25 % Removed in clause preprocessing : 3
% 0.08/0.25 % Initial clauses in saturation : 8
% 0.08/0.25 % Processed clauses : 15
% 0.08/0.25 % ...of these trivial : 0
% 0.08/0.25 % ...subsumed : 1
% 0.08/0.25 % ...remaining for further processing : 14
% 0.08/0.25 % Other redundant clauses eliminated : 0
% 0.08/0.25 % Clauses deleted for lack of memory : 0
% 0.08/0.25 % Backward-subsumed : 0
% 0.08/0.25 % Backward-rewritten : 0
% 0.08/0.25 % Generated clauses : 15
% 0.08/0.25 % ...of the previous two non-redundant : 11
% 0.08/0.25 % ...aggressively subsumed : 0
% 0.08/0.25 % Contextual simplify-reflections : 0
% 0.08/0.25 % Paramodulations : 15
% 0.08/0.25 % Factorizations : 0
% 0.08/0.25 % NegExts : 0
% 0.08/0.25 % Equation resolutions : 0
% 0.08/0.25 % Disequality decompositions : 0
% 0.08/0.25 % Total rewrite steps : 1
% 0.08/0.25 % ...of those cached : 0
% 0.08/0.25 % Propositional unsat checks : 0
% 0.08/0.25 % Propositional check models : 0
% 0.08/0.25 % Propositional check unsatisfiable : 0
% 0.08/0.25 % Propositional clauses : 0
% 0.08/0.25 % Propositional clauses after purity: 0
% 0.08/0.25 % Propositional unsat core size : 0
% 0.08/0.25 % Propositional preprocessing time : 0.000
% 0.08/0.25 % Propositional encoding time : 0.000
% 0.08/0.25 % Propositional solver time : 0.000
% 0.08/0.25 % Success case prop preproc time : 0.000
% 0.08/0.25 % Success case prop encoding time : 0.000
% 0.08/0.25 % Success case prop solver time : 0.000
% 0.08/0.25 % Current number of processed clauses : 14
% 0.08/0.25 % Positive orientable unit clauses : 1
% 0.08/0.25 % Positive unorientable unit clauses: 0
% 0.08/0.25 % Negative unit clauses : 1
% 0.08/0.25 % Non-unit-clauses : 12
% 0.08/0.25 % Current number of unprocessed clauses: 3
% 0.08/0.25 % ...number of literals in the above : 11
% 0.08/0.25 % Current number of archived formulas : 0
% 0.08/0.25 % Current number of archived clauses : 0
% 0.08/0.25 % Clause-clause subsumption calls (NU) : 9
% 0.08/0.25 % Rec. Clause-clause subsumption calls : 9
% 0.08/0.25 % Non-unit clause-clause subsumptions : 1
% 0.08/0.25 % Unit Clause-clause subsumption calls : 0
% 0.08/0.25 % Rewrite failures with RHS unbound : 0
% 0.08/0.25 % BW rewrite match attempts : 0
% 0.08/0.25 % BW rewrite match successes : 0
% 0.08/0.25 % Condensation attempts : 0
% 0.08/0.25 % Condensation successes : 0
% 0.08/0.25 % Termbank termtop insertions : 1097
% 0.08/0.25 % Search garbage collected termcells : 299
% 0.08/0.25
% 0.08/0.25 % -------------------------------------------------
% 0.08/0.25 % User time : 0.003 s
% 0.08/0.25 % System time : 0.001 s
% 0.08/0.25 % Total time : 0.004 s
% 0.08/0.25 % Maximum resident set size: 3888 pages
% 0.08/0.25
% 0.08/0.25 % -------------------------------------------------
% 0.08/0.25 % User time : 0.006 s
% 0.08/0.25 % System time : 0.005 s
% 0.08/0.25 % Total time : 0.011 s
% 0.08/0.25 % Maximum resident set size: 4864 pages
% 0.08/0.25 % E exiting
%------------------------------------------------------------------------------