%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEV246^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 : n012.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:16 AM UTC 2026
% Result : Theorem 0.09s 0.15s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SEV246^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.00/0.10 % Computer : n012.cluster.edu
% 0.00/0.10 % Model : x86_64 x86_64
% 0.00/0.10 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.10 % Memory : 8046.5625MB
% 0.00/0.10 % OS : Linux 6.8.0-71-generic
% 0.00/0.10 % CPULimit : 300
% 0.00/0.10 % WCLimit : 300
% 0.00/0.10 % DateTime : Tue Sep 29 15:26:48 UTC 2026
% 0.00/0.10 % CPUTime :
% 0.00/0.10 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.13 Running higher-order theorem proving
% 0.09/0.13 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.HiAa3hPux8/E---3.1_243426.p
% 0.09/0.15 % Version: 3.5.1-ho
% 0.09/0.15 % Preprocessing class: HSSSSMSSSSSNHHA.
% 0.09/0.15 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.15 % Starting sh2lt with 1200s (4) cores
% 0.09/0.15 % Starting new_ho_10_unif with 300s (1) cores
% 0.09/0.15 % Starting full_lambda_6 with 300s (1) cores
% 0.09/0.15 % Starting post_as_ho1 with 300s (1) cores
% 0.09/0.15 % Starting ehoh_best3_rw with 300s (1) cores
% 0.09/0.15 % post_as_ho1 with pid 243461 completed with status 0
% 0.09/0.15 % Result found by post_as_ho1
% 0.09/0.15 % Preprocessing class: HSSSSMSSSSSNHHA.
% 0.09/0.15 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.15 % Starting sh2lt with 1200s (4) cores
% 0.09/0.15 % Starting new_ho_10_unif with 300s (1) cores
% 0.09/0.15 % Starting full_lambda_6 with 300s (1) cores
% 0.09/0.15 % Starting post_as_ho1 with 300s (1) cores
% 0.09/0.15 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.15 % No SInE strategy applied
% 0.09/0.15 % Search class: HGHNF-FFSF21-SHHFFMBN
% 0.09/0.15 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.15 % Starting SubtermCWHack with 28s (1) cores
% 0.09/0.15 % SubtermCWHack with pid 243470 completed with status 0
% 0.09/0.15 % Result found by SubtermCWHack
% 0.09/0.15 % Preprocessing class: HSSSSMSSSSSNHHA.
% 0.09/0.15 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.15 % Starting sh2lt with 1200s (4) cores
% 0.09/0.15 % Starting new_ho_10_unif with 300s (1) cores
% 0.09/0.15 % Starting full_lambda_6 with 300s (1) cores
% 0.09/0.15 % Starting post_as_ho1 with 300s (1) cores
% 0.09/0.15 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.15 % No SInE strategy applied
% 0.09/0.15 % Search class: HGHNF-FFSF21-SHHFFMBN
% 0.09/0.15 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.15 % Starting SubtermCWHack with 28s (1) cores
% 0.09/0.15 % Preprocessing time : 0.001 s
% 0.09/0.15
% 0.09/0.15 % Proof found!
% 0.09/0.15 % SZS status Theorem
% 0.09/0.15 % SZS output start CNFRefutation
% 0.09/0.15 thf(decl_23, type, epred1_0: ($i > $o) > $i > $o).
% 0.09/0.15 thf(decl_24, type, esk1_2: ($i > $o) > ($i > $o) > $i).
% 0.09/0.15 thf(decl_25, type, esk2_0: $i).
% 0.09/0.15 thf(decl_26, type, esk3_1: ($i > $o) > $i).
% 0.09/0.15 thf(decl_27, type, epred2_0: $i > $o).
% 0.09/0.15 thf(decl_28, type, epred3_1: $i > $i > $o).
% 0.09/0.15 thf(decl_29, type, esk4_2: $i > ($i > $o) > $i).
% 0.09/0.15 thf(cTHM2A_ONE_pme, conjecture, ![X1:($i > $o) > $i > $o]:((![X2:$i > $o, X3:$i > $o]:((![X4:$i]:(((X2 @ X4)=>(X3 @ X4)))=>![X4:$i]:(((X1 @ X2 @ X4)=>(X1 @ X3 @ X4)))))=>![X5:$i]:(((X1 @ (^[X4:$i]:(?[X6:$i > $o]:(((![X7:$i]:((((X6 @ X7))=>((X1 @ X6 @ X7)))))&((X6 @ X4)))))) @ X5)=>?[X6:$i > $o]:((![X4:$i]:(((X6 @ X4)=>(X1 @ X6 @ X4)))&(X6 @ X5))))))), file('/export/starexec/sandbox/tmp/tmp.HiAa3hPux8/E---3.1_243426.p', cTHM2A_ONE_pme)).
% 0.09/0.15 thf(c_0_1, negated_conjecture, ~(![X1:($i > $o) > $i > $o]:((![X2:$i > $o, X3:$i > $o]:((![X4:$i]:(((X2 @ X4)=>(X3 @ X4)))=>![X4:$i]:(((X1 @ X2 @ X4)=>(X1 @ X3 @ X4)))))=>![X5:$i]:(((X1 @ (^[X4:$i]:(?[X6:$i > $o]:(((![X7:$i]:((((X6 @ X7))=>((X1 @ X6 @ X7)))))&((X6 @ X4)))))) @ X5)=>?[X6:$i > $o]:((![X4:$i]:(((X6 @ X4)=>(X1 @ X6 @ X4)))&(X6 @ X5)))))))), inference(assume_negation,[status(cth)],[cTHM2A_ONE_pme])).
% 0.09/0.15 thf(c_0_2, negated_conjecture, ~(![X1:($i > $o) > $i > $o]:((![X2:$i > $o, X3:$i > $o]:((![X4:$i]:(((X2 @ X4)=>(X3 @ X4)))=>![X4:$i]:(((X1 @ X2 @ X4)=>(X1 @ X3 @ X4)))))=>![X5:$i]:(((X1 @ (^[Z0:$i]:(?[X6:$i > $o]:(((![X7:$i]:(((X6 @ X7)=>(X1 @ X6 @ X7))))&(X6 @ Z0))))) @ X5)=>?[X6:$i > $o]:((![X4:$i]:(((X6 @ X4)=>(X1 @ X6 @ X4)))&(X6 @ X5)))))))), inference(fof_simplification,[status(thm)],[c_0_1])).
% 0.09/0.15 thf(c_0_3, negated_conjecture, ![X17:$i > $o, X18:$i > $o, X20:$i, X22:$i > $o]:(((((X17 @ (esk1_2 @ X17 @ X18))|(~(epred1_0 @ X17 @ X20)|(epred1_0 @ X18 @ X20)))&(~(X18 @ (esk1_2 @ X17 @ X18))|(~(epred1_0 @ X17 @ X20)|(epred1_0 @ X18 @ X20))))&((epred1_0 @ (^[Z0:$i]:(?[X6:$i > $o]:(((![X7:$i]:(((X6 @ X7)=>(epred1_0 @ X6 @ X7))))&(X6 @ Z0))))) @ esk2_0)&(((X22 @ (esk3_1 @ X22))|~(X22 @ esk2_0))&(~(epred1_0 @ X22 @ (esk3_1 @ X22))|~(X22 @ 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.15 thf(c_0_4, plain, ![X27:$i, X29:$i, X30:$i > $o]:((((~(epred3_1 @ X27 @ X29)|(epred1_0 @ (epred3_1 @ X27) @ X29)|~(epred2_0 @ X27))&((epred3_1 @ X27 @ X27)|~(epred2_0 @ X27)))&(((X30 @ (esk4_2 @ X27 @ X30))|~(X30 @ X27)|(epred2_0 @ X27))&(~(epred1_0 @ X30 @ (esk4_2 @ X27 @ X30))|~(X30 @ X27)|(epred2_0 @ X27))))), 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.15 thf(c_0_5, negated_conjecture, ![X2:$i > $o, X3:$i > $o, X4:$i]:(((X2 @ (esk1_2 @ X2 @ X3))|(epred1_0 @ X3 @ X4)|~((epred1_0 @ X2 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.09/0.15 thf(c_0_6, plain, ![X5:$i, X4:$i]:(((epred1_0 @ (epred3_1 @ X4) @ X5)|~((epred3_1 @ X4 @ X5))|~((epred2_0 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.09/0.15 thf(c_0_7, plain, ![X2:$i > $o, X4:$i]:(((epred2_0 @ X4)|~((epred1_0 @ X2 @ (esk4_2 @ X4 @ X2)))|~((X2 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.09/0.15 thf(c_0_8, plain, ![X2:$i > $o, X4:$i]:(((X2 @ (esk4_2 @ X4 @ X2))|(epred2_0 @ X4)|~((X2 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.09/0.15 thf(c_0_9, plain, ![X2:$i > $o, X5:$i, X4:$i]:(((epred3_1 @ X4 @ (esk1_2 @ (epred3_1 @ X4) @ X2))|(epred1_0 @ X2 @ X5)|~((epred3_1 @ X4 @ X5))|~((epred2_0 @ X4)))), inference(spm,[status(thm)],[c_0_5, c_0_6])).
% 0.09/0.15 thf(c_0_10, plain, ![X4:$i]:(((epred3_1 @ X4 @ X4)|~((epred2_0 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.09/0.15 thf(c_0_11, plain, ![X4:$i, X5:$i]:(((epred2_0 @ X4)|~((epred3_1 @ X5 @ X4))|~((epred2_0 @ X5)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7, c_0_6]), c_0_8])).
% 0.09/0.15 thf(c_0_12, plain, ![X2:$i > $o, X4:$i]:(((epred3_1 @ X4 @ (esk1_2 @ (epred3_1 @ X4) @ X2))|(epred1_0 @ X2 @ X4)|~((epred2_0 @ X4)))), inference(spm,[status(thm)],[c_0_9, c_0_10])).
% 0.09/0.15 thf(c_0_13, negated_conjecture, ![X2:$i > $o, X3:$i > $o, X4:$i]:(((epred1_0 @ X2 @ X4)|~((X2 @ (esk1_2 @ X3 @ X2)))|~((epred1_0 @ X3 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.09/0.15 thf(c_0_14, plain, ![X2:$i > $o, X4:$i]:(((epred2_0 @ (esk1_2 @ (epred3_1 @ X4) @ X2))|(epred1_0 @ X2 @ X4)|~((epred2_0 @ X4)))), inference(spm,[status(thm)],[c_0_11, c_0_12])).
% 0.09/0.15 thf(c_0_15, plain, ![X26:$i]:(((epred2_0 @ X26)<=>?[X24:$i > $o]:((![X25:$i]:(((X24 @ X25)=>(epred1_0 @ X24 @ X25)))&(X24 @ X26))))), introduced(definition)).
% 0.09/0.15 thf(c_0_16, negated_conjecture, ![X5:$i, X4:$i]:(((epred1_0 @ epred2_0 @ X4)|(epred1_0 @ epred2_0 @ X5)|~((epred1_0 @ (epred3_1 @ X4) @ X5))|~((epred2_0 @ X4)))), inference(spm,[status(thm)],[c_0_13, c_0_14])).
% 0.09/0.15 thf(c_0_17, negated_conjecture, ![X2:$i > $o]:(((X2 @ (esk3_1 @ X2))|~((X2 @ esk2_0)))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.09/0.15 thf(c_0_18, negated_conjecture, (((epred1_0 @ epred2_0 @ esk2_0))=(($true))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_3]), c_0_15])).
% 0.09/0.15 thf(c_0_19, plain, ![X4:$i, X5:$i]:(((epred1_0 @ epred2_0 @ X4)|(epred1_0 @ epred2_0 @ X5)|~((epred3_1 @ X5 @ X4))|~((epred2_0 @ X5)))), inference(spm,[status(thm)],[c_0_16, c_0_6])).
% 0.09/0.15 thf(c_0_20, negated_conjecture, ![X2:$i > $o, X3:$i > $o]:(((epred1_0 @ X2 @ (esk3_1 @ (epred1_0 @ X3)))|(X3 @ (esk1_2 @ X3 @ X2))|~((epred1_0 @ X3 @ esk2_0)))), inference(spm,[status(thm)],[c_0_5, c_0_17])).
% 0.09/0.15 thf(c_0_21, negated_conjecture, (epred1_0 @ epred2_0 @ esk2_0), inference(cn,[status(thm)],[c_0_18])).
% 0.09/0.15 thf(c_0_22, plain, ![X4:$i]:(((epred1_0 @ epred2_0 @ X4)|~((epred2_0 @ X4)))), inference(spm,[status(thm)],[c_0_19, c_0_10])).
% 0.09/0.15 thf(c_0_23, negated_conjecture, ![X2:$i > $o]:((~((epred1_0 @ X2 @ (esk3_1 @ X2)))|~((X2 @ esk2_0)))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.09/0.15 thf(c_0_24, negated_conjecture, ![X2:$i > $o]:(((epred1_0 @ X2 @ (esk3_1 @ (epred1_0 @ epred2_0)))|(epred2_0 @ (esk1_2 @ epred2_0 @ X2)))), inference(spm,[status(thm)],[c_0_20, c_0_21])).
% 0.09/0.15 thf(c_0_25, negated_conjecture, ![X2:$i > $o, X4:$i]:(((epred1_0 @ (epred1_0 @ epred2_0) @ X4)|~((epred2_0 @ (esk1_2 @ X2 @ (epred1_0 @ epred2_0))))|~((epred1_0 @ X2 @ X4)))), inference(spm,[status(thm)],[c_0_13, c_0_22])).
% 0.09/0.15 thf(c_0_26, negated_conjecture, (epred2_0 @ (esk1_2 @ epred2_0 @ (epred1_0 @ epred2_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_24]), c_0_21])])).
% 0.09/0.15 thf(c_0_27, negated_conjecture, ![X4:$i]:(((epred1_0 @ (epred1_0 @ epred2_0) @ X4)|~((epred1_0 @ epred2_0 @ X4)))), inference(spm,[status(thm)],[c_0_25, c_0_26])).
% 0.09/0.15 thf(c_0_28, negated_conjecture, ~((epred1_0 @ epred2_0 @ (esk3_1 @ (epred1_0 @ epred2_0)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_27]), c_0_21])])).
% 0.09/0.15 thf(c_0_29, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_17]), c_0_21])]), ['proof']).
% 0.09/0.15 % SZS output end CNFRefutation
% 0.09/0.15 % Parsed axioms : 1
% 0.09/0.15 % Removed by relevancy pruning/SinE : 0
% 0.09/0.15 % Initial clauses : 9
% 0.09/0.15 % Removed in clause preprocessing : 0
% 0.09/0.15 % Initial clauses in saturation : 9
% 0.09/0.15 % Processed clauses : 43
% 0.09/0.15 % ...of these trivial : 0
% 0.09/0.15 % ...subsumed : 5
% 0.09/0.15 % ...remaining for further processing : 38
% 0.09/0.15 % Other redundant clauses eliminated : 0
% 0.09/0.15 % Clauses deleted for lack of memory : 0
% 0.09/0.15 % Backward-subsumed : 3
% 0.09/0.15 % Backward-rewritten : 2
% 0.09/0.15 % Generated clauses : 111
% 0.09/0.15 % ...of the previous two non-redundant : 91
% 0.09/0.15 % ...aggressively subsumed : 0
% 0.09/0.15 % Contextual simplify-reflections : 2
% 0.09/0.15 % Paramodulations : 111
% 0.09/0.15 % Factorizations : 0
% 0.09/0.15 % NegExts : 0
% 0.09/0.15 % Equation resolutions : 0
% 0.09/0.15 % Disequality decompositions : 0
% 0.09/0.15 % Total rewrite steps : 18
% 0.09/0.15 % ...of those cached : 15
% 0.09/0.15 % Propositional unsat checks : 0
% 0.09/0.15 % Propositional check models : 0
% 0.09/0.15 % Propositional check unsatisfiable : 0
% 0.09/0.15 % Propositional clauses : 0
% 0.09/0.15 % Propositional clauses after purity: 0
% 0.09/0.15 % Propositional unsat core size : 0
% 0.09/0.15 % Propositional preprocessing time : 0.000
% 0.09/0.15 % Propositional encoding time : 0.000
% 0.09/0.15 % Propositional solver time : 0.000
% 0.09/0.15 % Success case prop preproc time : 0.000
% 0.09/0.15 % Success case prop encoding time : 0.000
% 0.09/0.15 % Success case prop solver time : 0.000
% 0.09/0.15 % Current number of processed clauses : 33
% 0.09/0.15 % Positive orientable unit clauses : 3
% 0.09/0.15 % Positive unorientable unit clauses: 0
% 0.09/0.15 % Negative unit clauses : 2
% 0.09/0.15 % Non-unit-clauses : 28
% 0.09/0.15 % Current number of unprocessed clauses: 53
% 0.09/0.15 % ...number of literals in the above : 210
% 0.09/0.15 % Current number of archived formulas : 0
% 0.09/0.15 % Current number of archived clauses : 5
% 0.09/0.15 % Clause-clause subsumption calls (NU) : 115
% 0.09/0.15 % Rec. Clause-clause subsumption calls : 97
% 0.09/0.15 % Non-unit clause-clause subsumptions : 6
% 0.09/0.15 % Unit Clause-clause subsumption calls : 9
% 0.09/0.15 % Rewrite failures with RHS unbound : 0
% 0.09/0.15 % BW rewrite match attempts : 1
% 0.09/0.15 % BW rewrite match successes : 1
% 0.09/0.15 % Condensation attempts : 0
% 0.09/0.15 % Condensation successes : 0
% 0.09/0.15 % Termbank termtop insertions : 3074
% 0.09/0.15 % Search garbage collected termcells : 385
% 0.09/0.15
% 0.09/0.15 % -------------------------------------------------
% 0.09/0.15 % User time : 0.006 s
% 0.09/0.15 % System time : 0.000 s
% 0.09/0.15 % Total time : 0.006 s
% 0.09/0.15 % Maximum resident set size: 3636 pages
% 0.09/0.15
% 0.09/0.15 % -------------------------------------------------
% 0.09/0.15 % User time : 0.007 s
% 0.09/0.15 % System time : 0.002 s
% 0.09/0.15 % Total time : 0.009 s
% 0.09/0.15 % Maximum resident set size: 4608 pages
% 0.09/0.15 % E exiting
%------------------------------------------------------------------------------