%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEV310^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n009.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:22 AM UTC 2026
% Result : Theorem 0.09s 0.26s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEV310^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.17 % Computer : n009.cluster.edu
% 0.09/0.17 % Model : x86_64 x86_64
% 0.09/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17 % Memory : 8046.5625MB
% 0.09/0.17 % OS : Linux 6.8.0-71-generic
% 0.09/0.17 % CPULimit : 300
% 0.09/0.17 % WCLimit : 300
% 0.09/0.17 % DateTime : Tue Sep 29 15:33:45 UTC 2026
% 0.09/0.17 % CPUTime :
% 0.09/0.17 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.21 Running higher-order theorem proving
% 0.09/0.22 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.KvwLwk9pg7/E---3.1_4141613.p
% 0.09/0.26 % Version: 3.5.1-ho
% 0.09/0.26 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.09/0.26 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.26 % Starting post_as_ho12 with 300s (1) cores
% 0.09/0.26 % Starting new_bool_9 with 300s (1) cores
% 0.09/0.26 % Starting post_as_ho1 with 300s (1) cores
% 0.09/0.26 % Starting post_as_ho4 with 300s (1) cores
% 0.09/0.26 % Starting post_as_ho2 with 300s (1) cores
% 0.09/0.26 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.09/0.26 % Starting full_lambda_10 with 300s (1) cores
% 0.09/0.26 % Starting new_ho_8 with 300s (1) cores
% 0.09/0.26 % post_as_ho1 with pid 4141628 completed with status 0
% 0.09/0.26 % Result found by post_as_ho1
% 0.09/0.26 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.09/0.26 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.26 % Starting post_as_ho12 with 300s (1) cores
% 0.09/0.26 % Starting new_bool_9 with 300s (1) cores
% 0.09/0.26 % Starting post_as_ho1 with 300s (1) cores
% 0.09/0.26 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.26 % No SInE strategy applied
% 0.09/0.26 % Search class: HGUNF-FFSF21-SSSFFMBN
% 0.09/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.09/0.26 % SubtermCWHack with pid 4141638 completed with status 0
% 0.09/0.26 % Result found by SubtermCWHack
% 0.09/0.26 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.09/0.26 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.26 % Starting post_as_ho12 with 300s (1) cores
% 0.09/0.26 % Starting new_bool_9 with 300s (1) cores
% 0.09/0.26 % Starting post_as_ho1 with 300s (1) cores
% 0.09/0.26 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.26 % No SInE strategy applied
% 0.09/0.26 % Search class: HGUNF-FFSF21-SSSFFMBN
% 0.09/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.09/0.26 % Preprocessing time : 0.001 s
% 0.09/0.26
% 0.09/0.26 % Proof found!
% 0.09/0.26 % SZS status Theorem
% 0.09/0.26 % SZS output start CNFRefutation
% 0.09/0.26 thf(decl_sort1, type, a: $tType).
% 0.09/0.26 thf(decl_23, type, cK: (a > $o) > a > $o).
% 0.09/0.26 thf(decl_24, type, esk1_2: (a > $o) > (a > $o) > a).
% 0.09/0.26 thf(decl_25, type, esk2_0: a).
% 0.09/0.26 thf(decl_26, type, esk3_1: (a > $o) > a).
% 0.09/0.26 thf(decl_27, type, epred1_0: a > $o).
% 0.09/0.26 thf(decl_28, type, esk4_2: a > (a > $o) > a).
% 0.09/0.26 thf(decl_29, type, epred2_1: a > a > $o).
% 0.09/0.26 thf(cTHM90A_pme, conjecture, (![X1:a > $o, X2:a > $o]:((![X3:a]:(((X1 @ X3)=>(X2 @ X3)))=>![X3:a]:(((cK @ X1 @ X3)=>(cK @ X2 @ X3)))))=>![X3:a]:((![X4:a > $o]:((![X5:a]:(((cK @ X4 @ X5)=>(X4 @ X5)))=>(X4 @ X3)))=>(cK @ (^[X5:a]:(![X4:a > $o]:(((![X6:a]:((((cK @ X4 @ X6))=>((X4 @ X6)))))=>((X4 @ X5)))))) @ X3)))), file('/export/starexec/sandbox/tmp/tmp.KvwLwk9pg7/E---3.1_4141613.p', cTHM90A_pme)).
% 0.09/0.26 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]:((![X4:a > $o]:((![X5:a]:(((cK @ X4 @ X5)=>(X4 @ X5)))=>(X4 @ X3)))=>(cK @ (^[X5:a]:(![X4:a > $o]:(((![X6:a]:((((cK @ X4 @ X6))=>((X4 @ X6)))))=>((X4 @ X5)))))) @ X3))))), inference(assume_negation,[status(cth)],[cTHM90A_pme])).
% 0.09/0.26 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]:((![X4:a > $o]:((![X5:a]:(((cK @ X4 @ X5)=>(X4 @ X5)))=>(X4 @ X3)))=>(cK @ (^[Z0:a]:(![X4:a > $o]:(((![X6:a]:((((cK @ X4 @ X6))=>(X4 @ X6))))=>(X4 @ Z0))))) @ X3))))), inference(fof_simplification,[status(thm)],[c_0_1])).
% 0.09/0.26 thf(c_0_3, plain, ![X24:a, X25:a > $o, X28:a]:(((((cK @ X25 @ (esk4_2 @ X24 @ X25))|(X25 @ X24)|~(epred1_0 @ X24))&(~(X25 @ (esk4_2 @ X24 @ X25))|(X25 @ X24)|~(epred1_0 @ X24)))&((~(cK @ (epred2_1 @ X24) @ X28)|(epred2_1 @ X24 @ X28)|(epred1_0 @ X24))&(~(epred2_1 @ X24 @ X24)|(epred1_0 @ X24))))), 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.09/0.26 thf(c_0_4, negated_conjecture, ![X14:a > $o, X15:a > $o, X17:a, X19:a > $o]:(((((X14 @ (esk1_2 @ X14 @ X15))|(~(cK @ X14 @ X17)|(cK @ X15 @ X17)))&(~(X15 @ (esk1_2 @ X14 @ X15))|(~(cK @ X14 @ X17)|(cK @ X15 @ X17))))&((((cK @ X19 @ (esk3_1 @ X19))|(X19 @ esk2_0))&(~(X19 @ (esk3_1 @ X19))|(X19 @ esk2_0)))&~(cK @ (^[Z0:a]:(![X4:a > $o]:(((![X6:a]:((((cK @ X4 @ X6))=>(X4 @ X6))))=>(X4 @ 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.09/0.26 thf(c_0_5, plain, ![X3:a, X5:a]:(((epred2_1 @ X3 @ X5)|(epred1_0 @ X3)|~((cK @ (epred2_1 @ X3) @ X5)))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.09/0.26 thf(c_0_6, negated_conjecture, ![X1:a > $o]:(((cK @ X1 @ (esk3_1 @ X1))|(X1 @ esk2_0))), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.09/0.26 thf(c_0_7, negated_conjecture, ![X1:a > $o]:(((X1 @ esk2_0)|~((X1 @ (esk3_1 @ X1))))), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.09/0.26 thf(c_0_8, 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.09/0.26 thf(c_0_9, plain, ![X1:a > $o, X3:a]:(((cK @ X1 @ (esk4_2 @ X3 @ X1))|(X1 @ X3)|~((epred1_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.09/0.26 thf(c_0_10, plain, ![X3:a]:(((epred1_0 @ X3)|~((epred2_1 @ X3 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.09/0.26 thf(c_0_11, negated_conjecture, ![X3:a]:(((epred2_1 @ X3 @ esk2_0)|(epred1_0 @ X3))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5, c_0_6]), c_0_7])).
% 0.09/0.26 thf(c_0_12, plain, ![X1:a > $o, X2:a > $o, X3:a]:(((cK @ X1 @ (esk4_2 @ X3 @ X2))|(X2 @ (esk1_2 @ X2 @ X1))|(X2 @ X3)|~((epred1_0 @ X3)))), inference(spm,[status(thm)],[c_0_8, c_0_9])).
% 0.09/0.26 thf(c_0_13, plain, (epred1_0 @ esk2_0), inference(spm,[status(thm)],[c_0_10, c_0_11])).
% 0.09/0.26 thf(c_0_14, plain, ![X1:a > $o, X2:a > $o]:(((cK @ X1 @ (esk4_2 @ esk2_0 @ X2))|(X2 @ (esk1_2 @ X2 @ X1))|(X2 @ esk2_0))), inference(spm,[status(thm)],[c_0_12, c_0_13])).
% 0.09/0.26 thf(c_0_15, plain, ![X1:a > $o, X3:a]:(((X1 @ X3)|~((X1 @ (esk4_2 @ X3 @ X1)))|~((epred1_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.09/0.26 thf(c_0_16, negated_conjecture, ![X1:a > $o, X2:a > $o, X4:a > $o]:(((cK @ X1 @ (esk4_2 @ esk2_0 @ (cK @ X2)))|(cK @ X4 @ (esk1_2 @ (cK @ X2) @ X1))|(cK @ X2 @ esk2_0)|(X2 @ (esk1_2 @ X2 @ X4)))), inference(spm,[status(thm)],[c_0_8, c_0_14])).
% 0.09/0.26 thf(c_0_17, plain, ![X1:a > $o, X2:a > $o]:(((cK @ X1 @ (esk1_2 @ (cK @ X2) @ X2))|(X2 @ (esk1_2 @ X2 @ X1))|(cK @ X2 @ esk2_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_16]), c_0_13])])).
% 0.09/0.26 thf(c_0_18, plain, ![X23:a]:(((epred1_0 @ X23)<=>![X21:a > $o]:((![X22:a]:(((cK @ X21 @ X22)=>(X21 @ X22)))=>(X21 @ X23))))), introduced(definition)).
% 0.09/0.26 thf(c_0_19, 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.09/0.26 thf(c_0_20, plain, ![X3:a, X5:a]:(((epred2_1 @ X3 @ X5)|(epred1_0 @ X3)|~((epred1_0 @ X5)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5, c_0_9]), c_0_15])).
% 0.09/0.26 thf(c_0_21, plain, ![X1:a > $o, X3:a]:(((epred2_1 @ X3 @ (esk1_2 @ (cK @ X1) @ X1))|(X1 @ (esk1_2 @ X1 @ (epred2_1 @ X3)))|(cK @ X1 @ esk2_0)|(epred1_0 @ X3))), inference(spm,[status(thm)],[c_0_5, c_0_17])).
% 0.09/0.26 thf(c_0_22, negated_conjecture, ~((((cK @ epred1_0 @ esk2_0))=(($true)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_4]), c_0_18])).
% 0.09/0.26 thf(c_0_23, negated_conjecture, ![X1:a > $o, X3:a, X5:a]:(((cK @ (epred2_1 @ X3) @ X5)|(epred1_0 @ X3)|~((epred1_0 @ (esk1_2 @ X1 @ (epred2_1 @ X3))))|~((cK @ X1 @ X5)))), inference(spm,[status(thm)],[c_0_19, c_0_20])).
% 0.09/0.26 thf(c_0_24, plain, ![X1:a > $o]:(((X1 @ (esk1_2 @ X1 @ (epred2_1 @ (esk1_2 @ (cK @ X1) @ X1))))|(epred1_0 @ (esk1_2 @ (cK @ X1) @ X1))|(cK @ X1 @ esk2_0))), inference(spm,[status(thm)],[c_0_10, c_0_21])).
% 0.09/0.26 thf(c_0_25, negated_conjecture, ~((cK @ epred1_0 @ esk2_0)), inference(cn,[status(thm)],[c_0_22])).
% 0.09/0.26 thf(c_0_26, negated_conjecture, ![X3:a]:(((cK @ (epred2_1 @ (esk1_2 @ (cK @ epred1_0) @ epred1_0)) @ X3)|(epred1_0 @ (esk1_2 @ (cK @ epred1_0) @ epred1_0))|~((cK @ epred1_0 @ X3)))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_24]), c_0_25])).
% 0.09/0.26 thf(c_0_27, plain, ![X3:a]:(((epred2_1 @ (esk1_2 @ (cK @ epred1_0) @ epred1_0) @ X3)|(epred1_0 @ (esk1_2 @ (cK @ epred1_0) @ epred1_0))|~((cK @ epred1_0 @ X3)))), inference(spm,[status(thm)],[c_0_5, c_0_26])).
% 0.09/0.26 thf(c_0_28, plain, ((epred1_0 @ (esk1_2 @ (cK @ epred1_0) @ epred1_0))|~((cK @ epred1_0 @ (esk1_2 @ (cK @ epred1_0) @ epred1_0)))), inference(spm,[status(thm)],[c_0_10, c_0_27])).
% 0.09/0.26 thf(c_0_29, plain, ((cK @ epred1_0 @ (esk4_2 @ esk2_0 @ (cK @ epred1_0)))|(epred1_0 @ (esk1_2 @ (cK @ epred1_0) @ epred1_0))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_14]), c_0_25])).
% 0.09/0.26 thf(c_0_30, plain, (epred1_0 @ (esk1_2 @ (cK @ epred1_0) @ epred1_0)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_29]), c_0_13])]), c_0_25])).
% 0.09/0.26 thf(c_0_31, negated_conjecture, ![X3:a]:(((cK @ epred1_0 @ X3)|~((cK @ (cK @ epred1_0) @ X3)))), inference(spm,[status(thm)],[c_0_19, c_0_30])).
% 0.09/0.26 thf(c_0_32, negated_conjecture, (cK @ epred1_0 @ (esk3_1 @ (cK @ epred1_0))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31, c_0_6]), c_0_25])).
% 0.09/0.26 thf(c_0_33, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_7, c_0_32]), c_0_25]), ['proof']).
% 0.09/0.26 % SZS output end CNFRefutation
% 0.09/0.26 % Parsed axioms : 3
% 0.09/0.26 % Removed by relevancy pruning/SinE : 0
% 0.09/0.26 % Initial clauses : 11
% 0.09/0.26 % Removed in clause preprocessing : 2
% 0.09/0.26 % Initial clauses in saturation : 9
% 0.09/0.26 % Processed clauses : 60
% 0.09/0.26 % ...of these trivial : 0
% 0.09/0.26 % ...subsumed : 16
% 0.09/0.26 % ...remaining for further processing : 44
% 0.09/0.26 % Other redundant clauses eliminated : 0
% 0.09/0.26 % Clauses deleted for lack of memory : 0
% 0.09/0.26 % Backward-subsumed : 2
% 0.09/0.26 % Backward-rewritten : 4
% 0.09/0.26 % Generated clauses : 234
% 0.09/0.26 % ...of the previous two non-redundant : 200
% 0.09/0.26 % ...aggressively subsumed : 0
% 0.09/0.26 % Contextual simplify-reflections : 2
% 0.09/0.26 % Paramodulations : 220
% 0.09/0.26 % Factorizations : 14
% 0.09/0.26 % NegExts : 0
% 0.09/0.26 % Equation resolutions : 0
% 0.09/0.26 % Disequality decompositions : 0
% 0.09/0.26 % Total rewrite steps : 16
% 0.09/0.26 % ...of those cached : 14
% 0.09/0.26 % Propositional unsat checks : 0
% 0.09/0.26 % Propositional check models : 0
% 0.09/0.26 % Propositional check unsatisfiable : 0
% 0.09/0.26 % Propositional clauses : 0
% 0.09/0.26 % Propositional clauses after purity: 0
% 0.09/0.26 % Propositional unsat core size : 0
% 0.09/0.26 % Propositional preprocessing time : 0.000
% 0.09/0.26 % Propositional encoding time : 0.000
% 0.09/0.26 % Propositional solver time : 0.000
% 0.09/0.26 % Success case prop preproc time : 0.000
% 0.09/0.26 % Success case prop encoding time : 0.000
% 0.09/0.26 % Success case prop solver time : 0.000
% 0.09/0.26 % Current number of processed clauses : 38
% 0.09/0.26 % Positive orientable unit clauses : 3
% 0.09/0.26 % Positive unorientable unit clauses: 0
% 0.09/0.26 % Negative unit clauses : 1
% 0.09/0.26 % Non-unit-clauses : 34
% 0.09/0.26 % Current number of unprocessed clauses: 149
% 0.09/0.26 % ...number of literals in the above : 749
% 0.09/0.26 % Current number of archived formulas : 0
% 0.09/0.26 % Current number of archived clauses : 6
% 0.09/0.26 % Clause-clause subsumption calls (NU) : 327
% 0.09/0.26 % Rec. Clause-clause subsumption calls : 120
% 0.09/0.26 % Non-unit clause-clause subsumptions : 18
% 0.09/0.26 % Unit Clause-clause subsumption calls : 4
% 0.09/0.26 % Rewrite failures with RHS unbound : 0
% 0.09/0.26 % BW rewrite match attempts : 1
% 0.09/0.26 % BW rewrite match successes : 1
% 0.09/0.26 % Condensation attempts : 0
% 0.09/0.26 % Condensation successes : 0
% 0.09/0.26 % Termbank termtop insertions : 6707
% 0.09/0.26 % Search garbage collected termcells : 370
% 0.09/0.26
% 0.09/0.26 % -------------------------------------------------
% 0.09/0.26 % User time : 0.013 s
% 0.09/0.26 % System time : 0.001 s
% 0.09/0.26 % Total time : 0.015 s
% 0.09/0.26 % Maximum resident set size: 3580 pages
% 0.09/0.26
% 0.09/0.26 % -------------------------------------------------
% 0.09/0.26 % User time : 0.016 s
% 0.09/0.26 % System time : 0.005 s
% 0.09/0.26 % Total time : 0.022 s
% 0.09/0.26 % Maximum resident set size: 4864 pages
% 0.09/0.26 % E exiting
%------------------------------------------------------------------------------