%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ITP193^1 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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:04:38 AM UTC 2026
% Result : Theorem 228.05s 33.66s
% Output : CNFRefutation 228.05s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP193^1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n026.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 20:12:42 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.23 Running higher-order theorem proving
% 0.08/0.26 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.Otdk4vo5u1/E---3.1_1116112.p
% 228.05/33.66 % Version: 3.5.1-ho
% 228.05/33.66 % Preprocessing class: HSLSSMSMSSLNSSA.
% 228.05/33.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 228.05/33.66 % Starting ehoh_best8 with 1200s (4) cores
% 228.05/33.66 % Starting new_ho_10_cnf2 with 600s (2) cores
% 228.05/33.66 % Starting post_as_ho6 with 300s (1) cores
% 228.05/33.66 % Starting new_bool_5 with 300s (1) cores
% 228.05/33.66 % new_bool_5 with pid 1116128 completed with status 0
% 228.05/33.66 % Result found by new_bool_5
% 228.05/33.66 % Preprocessing class: HSLSSMSMSSLNSSA.
% 228.05/33.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 228.05/33.66 % Starting ehoh_best8 with 1200s (4) cores
% 228.05/33.66 % Starting new_ho_10_cnf2 with 600s (2) cores
% 228.05/33.66 % Starting post_as_ho6 with 300s (1) cores
% 228.05/33.66 % Starting new_bool_5 with 300s (1) cores
% 228.05/33.66 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,1.0,,1,20000,1.0))
% 228.05/33.66 % SinE strategy is GSinE(CountFormulas,hypos,1.0,,1,20000,1.0)
% 228.05/33.66 % Search class: HGHSM-FSLS32-MSSFFMBN
% 228.05/33.66 % partial match(1): HGHSM-FSLS32-MSSFFSBN
% 228.05/33.66 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 228.05/33.66 % Starting SubtermCWHack with 28s (1) cores
% 228.05/33.66 % SubtermCWHack with pid 1116129 completed with status 8
% 228.05/33.66 % Starting new_bool_5 with 31s (1) cores
% 228.05/33.66 % new_bool_5 with pid 1116144 completed with status 0
% 228.05/33.66 % Result found by new_bool_5
% 228.05/33.66 % Preprocessing class: HSLSSMSMSSLNSSA.
% 228.05/33.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 228.05/33.66 % Starting ehoh_best8 with 1200s (4) cores
% 228.05/33.66 % Starting new_ho_10_cnf2 with 600s (2) cores
% 228.05/33.66 % Starting post_as_ho6 with 300s (1) cores
% 228.05/33.66 % Starting new_bool_5 with 300s (1) cores
% 228.05/33.66 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,1.0,,1,20000,1.0))
% 228.05/33.66 % SinE strategy is GSinE(CountFormulas,hypos,1.0,,1,20000,1.0)
% 228.05/33.66 % Search class: HGHSM-FSLS32-MSSFFMBN
% 228.05/33.66 % partial match(1): HGHSM-FSLS32-MSSFFSBN
% 228.05/33.66 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 228.05/33.66 % Starting SubtermCWHack with 28s (1) cores
% 228.05/33.66 % SubtermCWHack with pid 1116129 completed with status 8
% 228.05/33.66 % Starting new_bool_5 with 31s (1) cores
% 228.05/33.66 % Preprocessing time : 0.006 s
% 228.05/33.66 % Presaturation interreduction done
% 228.05/33.66
% 228.05/33.66 % Proof found!
% 228.05/33.66 % SZS status Theorem
% 228.05/33.66 % SZS output start CNFRefutation
% 228.05/33.66 thf(decl_sort1, type, set_real: $tType).
% 228.05/33.66 thf(decl_sort2, type, poly_real: $tType).
% 228.05/33.66 thf(decl_sort3, type, real: $tType).
% 228.05/33.66 thf(decl_27, type, finite_finite_real: set_real > $o).
% 228.05/33.66 thf(decl_38, type, zero_zero_real: real).
% 228.05/33.66 thf(decl_44, type, ord_less_real: real > real > $o).
% 228.05/33.66 thf(decl_62, type, poly_real2: poly_real > real > real).
% 228.05/33.66 thf(decl_70, type, collect_real: (real > $o) > set_real).
% 228.05/33.66 thf(decl_78, type, a: real).
% 228.05/33.66 thf(decl_80, type, b: real).
% 228.05/33.66 thf(decl_82, type, p: poly_real).
% 228.05/33.66 thf(decl_133, type, epred1_0: real > $o).
% 228.05/33.66 thf(decl_134, type, epred2_2: (real > $o) > (real > $o) > real > $o).
% 228.05/33.66 thf(decl_136, type, epred4_1: poly_real > real > $o).
% 228.05/33.66 thf(decl_145, type, esk15_1: (real > $o) > real).
% 228.05/33.66 thf(conj_0, conjecture, (finite_finite_real @ (collect_real @ (^[X1:real]:(((((((poly_real2 @ p @ X1)=(zero_zero_real)))&((ord_less_real @ a @ X1))))&((ord_less_real @ X1 @ b))))))), file('/export/starexec/sandbox/tmp/tmp.Otdk4vo5u1/E---3.1_1116112.p', conj_0)).
% 228.05/33.66 thf(fact_11_finite__Collect__conjI, axiom, ![X8:real > $o, X9:real > $o]:((((finite_finite_real @ (collect_real @ X8))|(finite_finite_real @ (collect_real @ X9)))=>(finite_finite_real @ (collect_real @ (^[X1:real]:((((X8 @ X1))&((X9 @ X1))))))))), file('/export/starexec/sandbox/tmp/tmp.Otdk4vo5u1/E---3.1_1116112.p', fact_11_finite__Collect__conjI)).
% 228.05/33.66 thf(fact_0__092_060open_062finite_A_123x_O_Apoly_Ap_Ax_A_061_A0_125_092_060close_062, axiom, (finite_finite_real @ (collect_real @ (^[X1:real]:(((poly_real2 @ p @ X1)=(zero_zero_real)))))), file('/export/starexec/sandbox/tmp/tmp.Otdk4vo5u1/E---3.1_1116112.p', fact_0__092_060open_062finite_A_123x_O_Apoly_Ap_Ax_A_061_A0_125_092_060close_062)).
% 228.05/33.66 thf(c_0_3, negated_conjecture, ~((finite_finite_real @ (collect_real @ (^[X1:real]:(((((((poly_real2 @ p @ X1)=(zero_zero_real)))&((ord_less_real @ a @ X1))))&((ord_less_real @ X1 @ b)))))))), inference(assume_negation,[status(cth)],[conj_0])).
% 228.05/33.66 thf(c_0_4, negated_conjecture, ~(finite_finite_real @ (collect_real @ (^[Z0:real]:(((((((poly_real2 @ p @ Z0)=(zero_zero_real)))&((ord_less_real @ a @ Z0))))&((ord_less_real @ Z0 @ b))))))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_3])])).
% 228.05/33.66 thf(c_0_5, plain, ![X8:real > $o, X9:real > $o]:((((finite_finite_real @ (collect_real @ X8))|(finite_finite_real @ (collect_real @ X9)))=>(finite_finite_real @ (collect_real @ (^[Z0:real]:(((X8 @ Z0)&(X9 @ Z0)))))))), inference(fof_simplification,[status(thm)],[fact_11_finite__Collect__conjI])).
% 228.05/33.66 thf(c_0_6, negated_conjecture, ~(finite_finite_real @ (collect_real @ (^[Z0:real]:(((((((poly_real2 @ p @ Z0)=(zero_zero_real)))&((ord_less_real @ a @ Z0))))&((ord_less_real @ Z0 @ b))))))), inference(fof_nnf,[status(thm)],[c_0_4])).
% 228.05/33.66 thf(c_0_7, plain, ![X1063:real]:(((epred1_0 @ X1063)<=>((((poly_real2 @ p @ X1063)=(zero_zero_real))&(ord_less_real @ a @ X1063))&(ord_less_real @ X1063 @ b)))), introduced(definition)).
% 228.05/33.66 thf(c_0_8, plain, ![X843:real > $o, X844:real > $o]:(((~(finite_finite_real @ (collect_real @ X843))|(finite_finite_real @ (collect_real @ (^[Z0:real]:(((X843 @ Z0)&(X844 @ Z0)))))))&(~(finite_finite_real @ (collect_real @ X844))|(finite_finite_real @ (collect_real @ (^[Z0:real]:(((X843 @ Z0)&(X844 @ Z0))))))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])).
% 228.05/33.66 thf(c_0_9, plain, ![X1064:real, X9:real > $o, X8:real > $o]:(((epred2_2 @ X8 @ X9 @ X1064)<=>((X9 @ X1064)&(X8 @ X1064)))), introduced(definition)).
% 228.05/33.66 thf(c_0_10, negated_conjecture, ~((((finite_finite_real @ (collect_real @ epred1_0)))=(($true)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_6]), c_0_7])).
% 228.05/33.66 thf(c_0_11, plain, ![X9:real > $o, X8:real > $o]:(((((finite_finite_real @ (collect_real @ (epred2_2 @ X9 @ X8))))=(($true)))|~((finite_finite_real @ (collect_real @ X8))))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_8]), c_0_9])).
% 228.05/33.66 thf(c_0_12, plain, (finite_finite_real @ (collect_real @ (^[Z0:real]:(((poly_real2 @ p @ Z0)=(zero_zero_real)))))), inference(fof_simplification,[status(thm)],[fact_0__092_060open_062finite_A_123x_O_Apoly_Ap_Ax_A_061_A0_125_092_060close_062])).
% 228.05/33.66 thf(c_0_13, plain, ![X1069:real, X4:poly_real]:(((epred4_1 @ X4 @ X1069)<=>((poly_real2 @ X4 @ X1069)=(zero_zero_real)))), introduced(definition)).
% 228.05/33.66 thf(c_0_14, negated_conjecture, ~((finite_finite_real @ (collect_real @ epred1_0))), inference(cn,[status(thm)],[c_0_10])).
% 228.05/33.66 thf(c_0_15, plain, ![X8:real > $o, X9:real > $o]:(((finite_finite_real @ (collect_real @ (epred2_2 @ X8 @ X9)))|~((finite_finite_real @ (collect_real @ X9))))), inference(cn,[status(thm)],[c_0_11])).
% 228.05/33.66 thf(c_0_16, plain, (((finite_finite_real @ (collect_real @ (epred4_1 @ p))))=(($true))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_12]), c_0_13])).
% 228.05/33.66 thf(c_0_17, plain, ![X8:real > $o, X9:real > $o]:((((epred2_2 @ X8 @ X9)!=(epred1_0))|~((finite_finite_real @ (collect_real @ X9))))), inference(ext_sup,[status(thm)],[c_0_14, c_0_15])).
% 228.05/33.66 thf(c_0_18, plain, (finite_finite_real @ (collect_real @ (epred4_1 @ p))), inference(cn,[status(thm)],[c_0_16])).
% 228.05/33.66 thf(c_0_19, plain, ![X8:real > $o]:(((epred2_2 @ X8 @ (epred4_1 @ p))!=(epred1_0))), inference(spm,[status(thm)],[c_0_17, c_0_18])).
% 228.05/33.66 thf(c_0_20, plain, ![X8:real > $o]:(((epred2_2 @ X8 @ (epred4_1 @ p) @ (esk15_1 @ X8))<~>(epred1_0 @ (esk15_1 @ X8)))), inference(neg_ext,[status(thm)],[c_0_19])).
% 228.05/33.66 thf(c_0_21, plain, ![X1085:real, X1086:real > $o, X1087:real > $o]:(((((X1086 @ X1085)|~(epred2_2 @ X1087 @ X1086 @ X1085))&((X1087 @ X1085)|~(epred2_2 @ X1087 @ X1086 @ X1085)))&(~(X1086 @ X1085)|~(X1087 @ X1085)|(epred2_2 @ X1087 @ X1086 @ X1085)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])])).
% 228.05/33.66 thf(c_0_22, plain, ![X8:real > $o]:((~((epred2_2 @ X8 @ (epred4_1 @ p) @ (esk15_1 @ X8)))|~((epred1_0 @ (esk15_1 @ X8))))), inference(dynamic_cnf,[status(thm)],[c_0_20])).
% 228.05/33.66 thf(c_0_23, plain, ![X9:real > $o, X8:real > $o, X1:real]:(((epred2_2 @ X9 @ X8 @ X1)|~((X8 @ X1))|~((X9 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_21])).
% 228.05/33.66 thf(c_0_24, plain, ![X1080:real, X1081:poly_real]:(((~(epred4_1 @ X1081 @ X1080)|((poly_real2 @ X1081 @ X1080)=(zero_zero_real)))&(((poly_real2 @ X1081 @ X1080)!=(zero_zero_real))|(epred4_1 @ X1081 @ X1080)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])).
% 228.05/33.66 thf(c_0_25, plain, ![X1088:real]:(((((((poly_real2 @ p @ X1088)=(zero_zero_real))|~(epred1_0 @ X1088))&((ord_less_real @ a @ X1088)|~(epred1_0 @ X1088)))&((ord_less_real @ X1088 @ b)|~(epred1_0 @ X1088)))&(((poly_real2 @ p @ X1088)!=(zero_zero_real))|~(ord_less_real @ a @ X1088)|~(ord_less_real @ X1088 @ b)|(epred1_0 @ X1088)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])])).
% 228.05/33.66 thf(c_0_26, plain, ![X9:real > $o, X8:real > $o, X1:real]:(((X8 @ X1)|~((epred2_2 @ X8 @ X9 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_21])).
% 228.05/33.66 thf(c_0_27, plain, ![X8:real > $o]:(((epred2_2 @ X8 @ (epred4_1 @ p) @ (esk15_1 @ X8))|(epred1_0 @ (esk15_1 @ X8)))), inference(dynamic_cnf,[status(thm)],[c_0_20])).
% 228.05/33.66 thf(c_0_28, plain, ![X8:real > $o]:((~((epred4_1 @ p @ (esk15_1 @ X8)))|~((epred1_0 @ (esk15_1 @ X8)))|~((X8 @ (esk15_1 @ X8))))), inference(spm,[status(thm)],[c_0_22, c_0_23])).
% 228.05/33.66 thf(c_0_29, plain, ![X4:poly_real, X1:real]:(((epred4_1 @ X4 @ X1)|((poly_real2 @ X4 @ X1)!=(zero_zero_real)))), inference(split_conjunct,[status(thm)],[c_0_24])).
% 228.05/33.66 thf(c_0_30, plain, ![X1:real]:((((poly_real2 @ p @ X1)=(zero_zero_real))|~((epred1_0 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_25])).
% 228.05/33.66 thf(c_0_31, plain, ![X8:real > $o]:(((epred1_0 @ (esk15_1 @ X8))|(X8 @ (esk15_1 @ X8)))), inference(spm,[status(thm)],[c_0_26, c_0_27])).
% 228.05/33.66 thf(c_0_32, plain, ![X8:real > $o]:((~((epred1_0 @ (esk15_1 @ X8)))|~((X8 @ (esk15_1 @ X8))))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_29]), c_0_30])).
% 228.05/33.66 thf(c_0_33, plain, (epred1_0 @ (esk15_1 @ epred1_0)), inference(ef,[status(thm)],[c_0_31])).
% 228.05/33.66 thf(c_0_34, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32, c_0_33]), c_0_33])]), ['proof']).
% 228.05/33.66 % SZS output end CNFRefutation
% 228.05/33.66 % Parsed axioms : 426
% 228.05/33.66 % Removed by relevancy pruning/SinE : 356
% 228.05/33.66 % Initial clauses : 276
% 228.05/33.66 % Removed in clause preprocessing : 6
% 228.05/33.66 % Initial clauses in saturation : 270
% 228.05/33.66 % Processed clauses : 4825
% 228.05/33.66 % ...of these trivial : 12
% 228.05/33.66 % ...subsumed : 1211
% 228.05/33.66 % ...remaining for further processing : 3602
% 228.05/33.66 % Other redundant clauses eliminated : 15
% 228.05/33.66 % Clauses deleted for lack of memory : 0
% 228.05/33.66 % Backward-subsumed : 19
% 228.05/33.66 % Backward-rewritten : 3
% 228.05/33.66 % Generated clauses : 92702
% 228.05/33.66 % ...of the previous two non-redundant : 91838
% 228.05/33.66 % ...aggressively subsumed : 0
% 228.05/33.66 % Contextual simplify-reflections : 7
% 228.05/33.66 % Paramodulations : 92433
% 228.05/33.66 % Factorizations : 36
% 228.05/33.66 % NegExts : 98
% 228.05/33.66 % Equation resolutions : 17
% 228.05/33.66 % Disequality decompositions : 0
% 228.05/33.66 % Total rewrite steps : 919
% 228.05/33.66 % ...of those cached : 833
% 228.05/33.66 % Propositional unsat checks : 0
% 228.05/33.66 % Propositional check models : 0
% 228.05/33.66 % Propositional check unsatisfiable : 0
% 228.05/33.66 % Propositional clauses : 0
% 228.05/33.66 % Propositional clauses after purity: 0
% 228.05/33.66 % Propositional unsat core size : 0
% 228.05/33.66 % Propositional preprocessing time : 0.000
% 228.05/33.66 % Propositional encoding time : 0.000
% 228.05/33.66 % Propositional solver time : 0.000
% 228.05/33.66 % Success case prop preproc time : 0.000
% 228.05/33.66 % Success case prop encoding time : 0.000
% 228.05/33.66 % Success case prop solver time : 0.000
% 228.05/33.66 % Current number of processed clauses : 3278
% 228.05/33.66 % Positive orientable unit clauses : 69
% 228.05/33.66 % Positive unorientable unit clauses: 0
% 228.05/33.66 % Negative unit clauses : 381
% 228.05/33.66 % Non-unit-clauses : 2828
% 228.05/33.66 % Current number of unprocessed clauses: 87444
% 228.05/33.66 % ...number of literals in the above : 632568
% 228.05/33.66 % Current number of archived formulas : 0
% 228.05/33.66 % Current number of archived clauses : 309
% 228.05/33.66 % Clause-clause subsumption calls (NU) : 2180417
% 228.05/33.66 % Rec. Clause-clause subsumption calls : 97535
% 228.05/33.66 % Non-unit clause-clause subsumptions : 452
% 228.05/33.66 % Unit Clause-clause subsumption calls : 48489
% 228.05/33.66 % Rewrite failures with RHS unbound : 0
% 228.05/33.66 % BW rewrite match attempts : 373
% 228.05/33.66 % BW rewrite match successes : 3
% 228.05/33.66 % Condensation attempts : 4825
% 228.05/33.66 % Condensation successes : 12
% 228.05/33.66 % Termbank termtop insertions : 3937433
% 228.05/33.66 % Search garbage collected termcells : 7556
% 228.05/33.66
% 228.05/33.66 % -------------------------------------------------
% 228.05/33.66 % User time : 31.980 s
% 228.05/33.66 % System time : 0.663 s
% 228.05/33.66 % Total time : 32.644 s
% 228.05/33.66 % Maximum resident set size: 5360 pages
% 228.05/33.66
% 228.05/33.66 % -------------------------------------------------
% 228.05/33.66 % User time : 31.994 s
% 228.05/33.66 % System time : 0.670 s
% 228.05/33.66 % Total time : 32.665 s
% 228.05/33.66 % Maximum resident set size: 5888 pages
% 228.05/33.66 % E exiting
%------------------------------------------------------------------------------