%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU827^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n001.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:25:47 AM UTC 2026
% Result : Theorem 0.25s 0.33s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU827^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 % Computer : n001.cluster.edu
% 0.09/0.22 % Model : x86_64 x86_64
% 0.09/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.22 % Memory : 8046.5625MB
% 0.09/0.22 % OS : Linux 6.8.0-71-generic
% 0.09/0.22 % CPULimit : 300
% 0.09/0.22 % WCLimit : 300
% 0.09/0.22 % DateTime : Tue Sep 29 14:41:20 UTC 2026
% 0.09/0.22 % CPUTime :
% 0.09/0.23 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.29 Running higher-order theorem proving
% 0.25/0.30 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.Ls2O0UQEyN/E---3.1_1337648.p
% 0.25/0.33 % Version: 3.5.1-ho
% 0.25/0.33 % Preprocessing class: HSSSSMSSSLSNHSN.
% 0.25/0.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.33 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.25/0.33 % Starting lpo8_lambda_fix with 300s (1) cores
% 0.25/0.33 % Starting lpo8_s with 300s (1) cores
% 0.25/0.33 % Starting new_bool_11 with 300s (1) cores
% 0.25/0.33 % ho_unfolding_3 with pid 1337661 completed with status 0
% 0.25/0.33 % Result found by ho_unfolding_3
% 0.25/0.33 % Preprocessing class: HSSSSMSSSLSNHSN.
% 0.25/0.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.33 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.25/0.33 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/0.33 % No SInE strategy applied
% 0.25/0.33 % Search class: HGUNF-FFSF00-SHSFMFNN
% 0.25/0.33 % partial match(1): HGUNF-FFSF00-SHSSMFNN
% 0.25/0.33 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/0.33 % Starting SubtermCWHack with 136s (1) cores
% 0.25/0.33 % Starting ho_unfolding_3 with 151s (1) cores
% 0.25/0.33 % Starting sh5l with 136s (1) cores
% 0.25/0.33 % Starting ehoh_best_sine_rwall with 136s (1) cores
% 0.25/0.33 % Starting lpo1_def_fix with 136s (1) cores
% 0.25/0.33 % ho_unfolding_3 with pid 1337667 completed with status 0
% 0.25/0.33 % Result found by ho_unfolding_3
% 0.25/0.33 % Preprocessing class: HSSSSMSSSLSNHSN.
% 0.25/0.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.33 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.25/0.33 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/0.33 % No SInE strategy applied
% 0.25/0.33 % Search class: HGUNF-FFSF00-SHSFMFNN
% 0.25/0.33 % partial match(1): HGUNF-FFSF00-SHSSMFNN
% 0.25/0.33 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/0.33 % Starting SubtermCWHack with 136s (1) cores
% 0.25/0.33 % Starting ho_unfolding_3 with 151s (1) cores
% 0.25/0.33 % Preprocessing time : 0.001 s
% 0.25/0.33 % Presaturation interreduction done
% 0.25/0.33
% 0.25/0.33 % Proof found!
% 0.25/0.33 % SZS status Theorem
% 0.25/0.33 % SZS output start CNFRefutation
% 0.25/0.33 thf(decl_23, type, leibeq: ($i > $o) > ($i > $o) > $o).
% 0.25/0.33 thf(decl_24, type, u: ($i > $o) > ($i > $o) > $i > $o).
% 0.25/0.33 thf(decl_25, type, n: ($i > $o) > ($i > $o) > $i > $o).
% 0.25/0.33 thf(decl_26, type, a: $i > $o).
% 0.25/0.33 thf(decl_27, type, b: $i > $o).
% 0.25/0.33 thf(decl_28, type, c: $i > $o).
% 0.25/0.33 thf(decl_29, type, epred1_0: ($i > $o) > $o).
% 0.25/0.33 thf(decl_30, type, epred2_0: $i > $o).
% 0.25/0.33 thf(decl_31, type, epred3_0: $i > $o).
% 0.25/0.33 thf(decl_32, type, esk4_0: $i).
% 0.25/0.33 thf(conj, conjecture, (leibeq @ (u @ a @ (n @ b @ c)) @ (n @ (u @ a @ b) @ (u @ a @ c))), file('/export/starexec/sandbox2/tmp/tmp.Ls2O0UQEyN/E---3.1_1337648.p', conj)).
% 0.25/0.33 thf(leibeq, axiom, ((leibeq)=(^[X1:$i > $o, X2:$i > $o]:(![X3:($i > $o) > $o]:((((X3 @ X1))=>((X3 @ X2))))))), file('/export/starexec/sandbox2/tmp/tmp.Ls2O0UQEyN/E---3.1_1337648.p', leibeq)).
% 0.25/0.33 thf(u, axiom, ((u)=(^[X1:$i > $o, X2:$i > $o, X4:$i]:((((X1 @ X4))|((X2 @ X4)))))), file('/export/starexec/sandbox2/tmp/tmp.Ls2O0UQEyN/E---3.1_1337648.p', u)).
% 0.25/0.33 thf(n, axiom, ((n)=(^[X1:$i > $o, X2:$i > $o, X4:$i]:((((X1 @ X4))&((X2 @ X4)))))), file('/export/starexec/sandbox2/tmp/tmp.Ls2O0UQEyN/E---3.1_1337648.p', n)).
% 0.25/0.33 thf(c_0_4, negated_conjecture, ~((leibeq @ (u @ a @ (n @ b @ c)) @ (n @ (u @ a @ b) @ (u @ a @ c)))), inference(assume_negation,[status(cth)],[conj])).
% 0.25/0.33 thf(c_0_5, plain, ((leibeq)=(^[Z0:$i > $o, Z1:$i > $o]:(![X3:($i > $o) > $o]:((((X3 @ Z0))=>((X3 @ Z1))))))), inference(fof_simplification,[status(thm)],[leibeq])).
% 0.25/0.33 thf(c_0_6, plain, ((u)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:((((Z0 @ Z2))|((Z1 @ Z2)))))), inference(fof_simplification,[status(thm)],[u])).
% 0.25/0.33 thf(c_0_7, plain, ((n)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:((((Z0 @ Z2))&((Z1 @ Z2)))))), inference(fof_simplification,[status(thm)],[n])).
% 0.25/0.33 thf(c_0_8, negated_conjecture, ~(![X5:($i > $o) > $o]:(((X5 @ (^[Z0:$i]:((((a @ Z0))|((((b @ Z0))&((c @ Z0))))))))=>(X5 @ (^[Z0:$i]:((((((a @ Z0))|((b @ Z0))))&((((a @ Z0))|((c @ Z0))))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_4, c_0_5]), c_0_6]), c_0_7])).
% 0.25/0.33 thf(c_0_9, negated_conjecture, ((epred1_0 @ (^[Z0:$i]:((((a @ Z0))|((((b @ Z0))&((c @ Z0))))))))&~(epred1_0 @ (^[Z0:$i]:((((((a @ Z0))|((b @ Z0))))&((((a @ Z0))|((c @ Z0))))))))), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])).
% 0.25/0.33 thf(c_0_10, plain, ![X7:$i]:(((epred2_0 @ X7)<=>(((a @ X7)|(b @ X7))&((a @ X7)|(c @ X7))))), introduced(definition)).
% 0.25/0.33 thf(c_0_11, plain, ![X8:$i]:(((epred3_0 @ X8)<=>((a @ X8)|((b @ X8)&(c @ X8))))), introduced(definition)).
% 0.25/0.33 thf(c_0_12, negated_conjecture, ~((((epred1_0 @ epred2_0))=(($true)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_9]), c_0_10])).
% 0.25/0.33 thf(c_0_13, negated_conjecture, (((epred1_0 @ epred3_0))=(($true))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_9]), c_0_11])).
% 0.25/0.33 thf(c_0_14, negated_conjecture, ~((epred1_0 @ epred2_0)), inference(cn,[status(thm)],[c_0_12])).
% 0.25/0.33 thf(c_0_15, negated_conjecture, (epred1_0 @ epred3_0), inference(cn,[status(thm)],[c_0_13])).
% 0.25/0.33 thf(c_0_16, plain, ((epred3_0)!=(epred2_0)), inference(ext_sup,[status(thm)],[c_0_14, c_0_15])).
% 0.25/0.33 thf(c_0_17, plain, ![X9:$i]:(((((a @ X9)|(b @ X9)|~(epred2_0 @ X9))&((a @ X9)|(c @ X9)|~(epred2_0 @ X9)))&(((~(a @ X9)|~(a @ X9)|(epred2_0 @ X9))&(~(c @ X9)|~(a @ X9)|(epred2_0 @ X9)))&((~(a @ X9)|~(b @ X9)|(epred2_0 @ X9))&(~(c @ X9)|~(b @ X9)|(epred2_0 @ X9)))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])])).
% 0.25/0.33 thf(c_0_18, plain, ((epred3_0 @ esk4_0)<~>(epred2_0 @ esk4_0)), inference(neg_ext,[status(thm)],[c_0_16])).
% 0.25/0.33 thf(c_0_19, plain, ![X10:$i]:(((((b @ X10)|(a @ X10)|~(epred3_0 @ X10))&((c @ X10)|(a @ X10)|~(epred3_0 @ X10)))&((~(a @ X10)|(epred3_0 @ X10))&(~(b @ X10)|~(c @ X10)|(epred3_0 @ X10))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])])).
% 0.25/0.33 thf(c_0_20, plain, ![X4:$i]:(((epred2_0 @ X4)|~((a @ X4))|~((a @ X4)))), inference(split_conjunct,[status(thm)],[c_0_17])).
% 0.25/0.33 thf(c_0_21, plain, (~((epred3_0 @ esk4_0))|~((epred2_0 @ esk4_0))), inference(dynamic_cnf,[status(thm)],[c_0_18])).
% 0.25/0.33 thf(c_0_22, plain, ![X4:$i]:(((epred3_0 @ X4)|~((a @ X4)))), inference(split_conjunct,[status(thm)],[c_0_19])).
% 0.25/0.33 thf(c_0_23, plain, ![X4:$i]:(((epred2_0 @ X4)|~((a @ X4)))), inference(cn,[status(thm)],[c_0_20])).
% 0.25/0.33 thf(c_0_24, plain, ![X4:$i]:(((c @ X4)|(a @ X4)|~((epred3_0 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_19])).
% 0.25/0.33 thf(c_0_25, plain, ((epred2_0 @ esk4_0)|(epred3_0 @ esk4_0)), inference(dynamic_cnf,[status(thm)],[c_0_18])).
% 0.25/0.33 thf(c_0_26, plain, ~((a @ esk4_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_22]), c_0_23])).
% 0.25/0.33 thf(c_0_27, plain, ![X4:$i]:(((b @ X4)|(a @ X4)|~((epred3_0 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_19])).
% 0.25/0.33 thf(c_0_28, plain, ![X4:$i]:(((epred2_0 @ X4)|~((c @ X4))|~((b @ X4)))), inference(split_conjunct,[status(thm)],[c_0_17])).
% 0.25/0.33 thf(c_0_29, plain, ((epred2_0 @ esk4_0)|(c @ esk4_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_25]), c_0_26])).
% 0.25/0.33 thf(c_0_30, plain, ((epred2_0 @ esk4_0)|(b @ esk4_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27, c_0_25]), c_0_26])).
% 0.25/0.33 thf(c_0_31, plain, ![X4:$i]:(((a @ X4)|(c @ X4)|~((epred2_0 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_17])).
% 0.25/0.33 thf(c_0_32, plain, (epred2_0 @ esk4_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_29]), c_0_30])).
% 0.25/0.33 thf(c_0_33, plain, ![X4:$i]:(((a @ X4)|(b @ X4)|~((epred2_0 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_17])).
% 0.25/0.33 thf(c_0_34, plain, ![X4:$i]:(((epred3_0 @ X4)|~((b @ X4))|~((c @ X4)))), inference(split_conjunct,[status(thm)],[c_0_19])).
% 0.25/0.33 thf(c_0_35, plain, (c @ esk4_0), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31, c_0_32]), c_0_26])).
% 0.25/0.33 thf(c_0_36, plain, (b @ esk4_0), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33, c_0_32]), c_0_26])).
% 0.25/0.33 thf(c_0_37, plain, ~((epred3_0 @ esk4_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21, c_0_32])])).
% 0.25/0.33 thf(c_0_38, plain, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34, c_0_35]), c_0_36])]), c_0_37]), ['proof']).
% 0.25/0.33 % SZS output end CNFRefutation
% 0.25/0.33 % Parsed axioms : 10
% 0.25/0.33 % Removed by relevancy pruning/SinE : 0
% 0.25/0.33 % Initial clauses : 18
% 0.25/0.33 % Removed in clause preprocessing : 6
% 0.25/0.33 % Initial clauses in saturation : 12
% 0.25/0.33 % Processed clauses : 34
% 0.25/0.33 % ...of these trivial : 0
% 0.25/0.33 % ...subsumed : 3
% 0.25/0.33 % ...remaining for further processing : 31
% 0.25/0.33 % Other redundant clauses eliminated : 0
% 0.25/0.33 % Clauses deleted for lack of memory : 0
% 0.25/0.33 % Backward-subsumed : 0
% 0.25/0.33 % Backward-rewritten : 4
% 0.25/0.33 % Generated clauses : 19
% 0.25/0.33 % ...of the previous two non-redundant : 13
% 0.25/0.33 % ...aggressively subsumed : 0
% 0.25/0.33 % Contextual simplify-reflections : 2
% 0.25/0.33 % Paramodulations : 15
% 0.25/0.33 % Factorizations : 0
% 0.25/0.33 % NegExts : 1
% 0.25/0.33 % Equation resolutions : 0
% 0.25/0.33 % Disequality decompositions : 0
% 0.25/0.33 % Total rewrite steps : 7
% 0.25/0.33 % ...of those cached : 5
% 0.25/0.33 % Propositional unsat checks : 0
% 0.25/0.33 % Propositional check models : 0
% 0.25/0.33 % Propositional check unsatisfiable : 0
% 0.25/0.33 % Propositional clauses : 0
% 0.25/0.33 % Propositional clauses after purity: 0
% 0.25/0.33 % Propositional unsat core size : 0
% 0.25/0.33 % Propositional preprocessing time : 0.000
% 0.25/0.33 % Propositional encoding time : 0.000
% 0.25/0.33 % Propositional solver time : 0.000
% 0.25/0.33 % Success case prop preproc time : 0.000
% 0.25/0.33 % Success case prop encoding time : 0.000
% 0.25/0.33 % Success case prop solver time : 0.000
% 0.25/0.33 % Current number of processed clauses : 16
% 0.25/0.33 % Positive orientable unit clauses : 4
% 0.25/0.33 % Positive unorientable unit clauses: 0
% 0.25/0.33 % Negative unit clauses : 4
% 0.25/0.33 % Non-unit-clauses : 8
% 0.25/0.33 % Current number of unprocessed clauses: 1
% 0.25/0.33 % ...number of literals in the above : 3
% 0.25/0.33 % Current number of archived formulas : 0
% 0.25/0.33 % Current number of archived clauses : 15
% 0.25/0.33 % Clause-clause subsumption calls (NU) : 4
% 0.25/0.33 % Rec. Clause-clause subsumption calls : 4
% 0.25/0.33 % Non-unit clause-clause subsumptions : 4
% 0.25/0.33 % Unit Clause-clause subsumption calls : 10
% 0.25/0.33 % Rewrite failures with RHS unbound : 0
% 0.25/0.33 % BW rewrite match attempts : 1
% 0.25/0.33 % BW rewrite match successes : 1
% 0.25/0.33 % Condensation attempts : 34
% 0.25/0.33 % Condensation successes : 0
% 0.25/0.33 % Termbank termtop insertions : 1320
% 0.25/0.33 % Search garbage collected termcells : 182
% 0.25/0.33
% 0.25/0.33 % -------------------------------------------------
% 0.25/0.33 % User time : 0.005 s
% 0.25/0.33 % System time : 0.003 s
% 0.25/0.33 % Total time : 0.008 s
% 0.25/0.33 % Maximum resident set size: 3636 pages
% 0.25/0.33
% 0.25/0.33 % -------------------------------------------------
% 0.25/0.33 % User time : 0.019 s
% 0.25/0.33 % System time : 0.009 s
% 0.25/0.33 % Total time : 0.028 s
% 0.25/0.33 % Maximum resident set size: 4864 pages
% 0.25/0.33 % E exiting
%------------------------------------------------------------------------------