%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ITP094^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 : n005.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:20 AM UTC 2026
% Result : Theorem 0.24s 0.41s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 27 ( 17 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 59 ( 10 ~; 2 |; 0 &; 45 @)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 13 ( 9 ^; 4 !; 0 ?; 13 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
real: $tType ).
thf(decl_sort2,type,
set_real: $tType ).
thf(decl_sort3,type,
poly_real: $tType ).
thf(decl_27,type,
finite_finite_real: set_real > $o ).
thf(decl_38,type,
zero_zero_poly_real: poly_real ).
thf(decl_39,type,
zero_zero_real: real ).
thf(decl_73,type,
pderiv_real: poly_real > poly_real ).
thf(decl_78,type,
poly_real2: poly_real > real > real ).
thf(decl_109,type,
collect_real: ( real > $o ) > set_real ).
thf(decl_115,type,
p: poly_real ).
thf(conj_0,conjecture,
( finite_finite_real
@ ( collect_real
@ ^ [X339: real] :
( ( poly_real2 @ ( pderiv_real @ p ) @ X339 )
= zero_zero_real ) ) ),
file('/export/starexec/sandbox/tmp/tmp.UpgEAEcCbd/E---3.1_2125821.p',conj_0) ).
thf(fact_2_poly__roots__finite,axiom,
! [X5: poly_real] :
( ( X5 != zero_zero_poly_real )
=> ( finite_finite_real
@ ( collect_real
@ ^ [X6: real] :
( ( poly_real2 @ X5 @ X6 )
= zero_zero_real ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.UpgEAEcCbd/E---3.1_2125821.p',fact_2_poly__roots__finite) ).
thf(fact_4__092_060open_062pderiv_Ap_A_092_060noteq_062_A0_092_060close_062,axiom,
( ( pderiv_real @ p )
!= zero_zero_poly_real ),
file('/export/starexec/sandbox/tmp/tmp.UpgEAEcCbd/E---3.1_2125821.p',fact_4__092_060open_062pderiv_Ap_A_092_060noteq_062_A0_092_060close_062) ).
thf(c_0_3,negated_conjecture,
~ ( finite_finite_real
@ ( collect_real
@ ^ [X339: real] :
( ( poly_real2 @ ( pderiv_real @ p ) @ X339 )
= zero_zero_real ) ) ),
inference(assume_negation,[status(cth)],[conj_0]) ).
thf(c_0_4,negated_conjecture,
~ ( finite_finite_real
@ ( collect_real
@ ^ [Z0: real] :
( ( poly_real2 @ ( pderiv_real @ p ) @ Z0 )
= zero_zero_real ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_3])]) ).
thf(c_0_5,plain,
! [X5: poly_real] :
( ( X5 != zero_zero_poly_real )
=> ( finite_finite_real
@ ( collect_real
@ ^ [Z0: real] :
( ( poly_real2 @ X5 @ Z0 )
= zero_zero_real ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_2_poly__roots__finite])]) ).
thf(c_0_6,plain,
( ( pderiv_real @ p )
!= zero_zero_poly_real ),
inference(fof_simplification,[status(thm)],[fact_4__092_060open_062pderiv_Ap_A_092_060noteq_062_A0_092_060close_062]) ).
thf(c_0_7,negated_conjecture,
~ ( finite_finite_real
@ ( collect_real
@ ^ [Z0: real] :
( ( poly_real2 @ ( pderiv_real @ p ) @ Z0 )
= zero_zero_real ) ) ),
inference(fof_nnf,[status(thm)],[c_0_4]) ).
thf(c_0_8,plain,
! [X885: poly_real] :
( ( X885 = zero_zero_poly_real )
| ( finite_finite_real
@ ( collect_real
@ ^ [Z0: real] :
( ( poly_real2 @ X885 @ Z0 )
= zero_zero_real ) ) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])]) ).
thf(c_0_9,plain,
( ( pderiv_real @ p )
!= zero_zero_poly_real ),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
thf(c_0_10,negated_conjecture,
~ ( finite_finite_real
@ ( collect_real
@ ^ [Z0: real] :
( ( poly_real2 @ ( pderiv_real @ p ) @ Z0 )
= zero_zero_real ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_11,plain,
! [X4: poly_real] :
( ( X4 = zero_zero_poly_real )
| ( finite_finite_real
@ ( collect_real
@ ^ [Z0: real] :
( ( poly_real2 @ X4 @ Z0 )
= zero_zero_real ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_12,plain,
( ( pderiv_real @ p )
!= zero_zero_poly_real ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_13,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ITP094^1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.17 % Computer : n005.cluster.edu
% 0.13/0.17 % Model : x86_64 x86_64
% 0.13/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.17 % Memory : 8046.5625MB
% 0.13/0.17 % OS : Linux 6.8.0-71-generic
% 0.13/0.18 % CPULimit : 300
% 0.13/0.18 % WCLimit : 300
% 0.13/0.18 % DateTime : Tue Sep 29 19:52:46 UTC 2026
% 0.13/0.18 % CPUTime :
% 0.13/0.18 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.22 Running higher-order theorem proving
% 0.13/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.UpgEAEcCbd/E---3.1_2125821.p
% 0.24/0.41 % Version: 3.5.1-ho
% 0.24/0.41 % Preprocessing class: HSLSSMSMSSLNHSA.
% 0.24/0.41 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.41 % Starting ho_unfolding_8 with 900s (3) cores
% 0.24/0.41 % Starting new_bool_8 with 300s (1) cores
% 0.24/0.41 % Starting post_as_ho6 with 300s (1) cores
% 0.24/0.41 % Starting ho_unfolding_1 with 300s (1) cores
% 0.24/0.41 % Starting full_lambda_4 with 300s (1) cores
% 0.24/0.41 % Starting pre_casc_5 with 300s (1) cores
% 0.24/0.41 % ho_unfolding_8 with pid 2125852 completed with status 0
% 0.24/0.41 % Result found by ho_unfolding_8
% 0.24/0.41 % Preprocessing class: HSLSSMSMSSLNHSA.
% 0.24/0.41 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.41 % Starting ho_unfolding_8 with 900s (3) cores
% 0.24/0.41 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.41 % No SInE strategy applied
% 0.24/0.41 % Search class: HGHSM-FSLM31-MHSFFSBN
% 0.24/0.41 % Scheduled 7 strats onto 3 cores with 900 seconds (900 total)
% 0.24/0.41 % Starting SubtermCWHack with 82s (1) cores
% 0.24/0.41 % Starting ho_unfolding_8 with 91s (1) cores
% 0.24/0.41 % Starting lpo4_lambdas_fix with 82s (1) cores
% 0.24/0.41 % ho_unfolding_8 with pid 2125870 completed with status 0
% 0.24/0.41 % Result found by ho_unfolding_8
% 0.24/0.41 % Preprocessing class: HSLSSMSMSSLNHSA.
% 0.24/0.41 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.41 % Starting ho_unfolding_8 with 900s (3) cores
% 0.24/0.41 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.41 % No SInE strategy applied
% 0.24/0.41 % Search class: HGHSM-FSLM31-MHSFFSBN
% 0.24/0.41 % Scheduled 7 strats onto 3 cores with 900 seconds (900 total)
% 0.24/0.41 % Starting SubtermCWHack with 82s (1) cores
% 0.24/0.41 % Starting ho_unfolding_8 with 91s (1) cores
% 0.24/0.41 % Preprocessing time : 0.011 s
% 0.24/0.41 % Presaturation interreduction done
% 0.24/0.41
% 0.24/0.41 % Proof found!
% 0.24/0.41 % SZS status Theorem
% 0.24/0.41 % SZS output start CNFRefutation
% See solution above
% 0.24/0.42 % Parsed axioms : 450
% 0.24/0.42 % Removed by relevancy pruning/SinE : 0
% 0.24/0.42 % Initial clauses : 668
% 0.24/0.42 % Removed in clause preprocessing : 134
% 0.24/0.42 % Initial clauses in saturation : 534
% 0.24/0.42 % Processed clauses : 831
% 0.24/0.42 % ...of these trivial : 12
% 0.24/0.42 % ...subsumed : 77
% 0.24/0.42 % ...remaining for further processing : 742
% 0.24/0.42 % Other redundant clauses eliminated : 74
% 0.24/0.42 % Clauses deleted for lack of memory : 0
% 0.24/0.42 % Backward-subsumed : 1
% 0.24/0.42 % Backward-rewritten : 7
% 0.24/0.42 % Generated clauses : 383
% 0.24/0.42 % ...of the previous two non-redundant : 252
% 0.24/0.42 % ...aggressively subsumed : 0
% 0.24/0.42 % Contextual simplify-reflections : 1
% 0.24/0.42 % Paramodulations : 263
% 0.24/0.42 % Factorizations : 4
% 0.24/0.42 % NegExts : 3
% 0.24/0.42 % Equation resolutions : 78
% 0.24/0.42 % Disequality decompositions : 0
% 0.24/0.42 % Total rewrite steps : 200
% 0.24/0.42 % ...of those cached : 127
% 0.24/0.42 % Propositional unsat checks : 0
% 0.24/0.42 % Propositional check models : 0
% 0.24/0.42 % Propositional check unsatisfiable : 0
% 0.24/0.42 % Propositional clauses : 0
% 0.24/0.42 % Propositional clauses after purity: 0
% 0.24/0.42 % Propositional unsat core size : 0
% 0.24/0.42 % Propositional preprocessing time : 0.000
% 0.24/0.42 % Propositional encoding time : 0.000
% 0.24/0.42 % Propositional solver time : 0.000
% 0.24/0.42 % Success case prop preproc time : 0.000
% 0.24/0.42 % Success case prop encoding time : 0.000
% 0.24/0.42 % Success case prop solver time : 0.000
% 0.24/0.42 % Current number of processed clauses : 255
% 0.24/0.42 % Positive orientable unit clauses : 95
% 0.24/0.42 % Positive unorientable unit clauses: 4
% 0.24/0.42 % Negative unit clauses : 23
% 0.24/0.42 % Non-unit-clauses : 133
% 0.24/0.42 % Current number of unprocessed clauses: 360
% 0.24/0.42 % ...number of literals in the above : 1001
% 0.24/0.42 % Current number of archived formulas : 0
% 0.24/0.42 % Current number of archived clauses : 417
% 0.24/0.42 % Clause-clause subsumption calls (NU) : 23786
% 0.24/0.42 % Rec. Clause-clause subsumption calls : 12395
% 0.24/0.42 % Non-unit clause-clause subsumptions : 55
% 0.24/0.42 % Unit Clause-clause subsumption calls : 1514
% 0.24/0.42 % Rewrite failures with RHS unbound : 0
% 0.24/0.42 % BW rewrite match attempts : 35
% 0.24/0.42 % BW rewrite match successes : 22
% 0.24/0.42 % Condensation attempts : 0
% 0.24/0.42 % Condensation successes : 0
% 0.24/0.42 % Termbank termtop insertions : 50891
% 0.24/0.42 % Search garbage collected termcells : 10723
% 0.24/0.42
% 0.24/0.42 % -------------------------------------------------
% 0.24/0.42 % User time : 0.091 s
% 0.24/0.42 % System time : 0.012 s
% 0.24/0.42 % Total time : 0.103 s
% 0.24/0.42 % Maximum resident set size: 6356 pages
% 0.24/0.42
% 0.24/0.42 % -------------------------------------------------
% 0.24/0.42 % User time : 0.186 s
% 0.24/0.42 % System time : 0.030 s
% 0.24/0.42 % Total time : 0.216 s
% 0.24/0.42 % Maximum resident set size: 5632 pages
% 0.24/0.42 % E exiting
%------------------------------------------------------------------------------