TSTP Solution File: ITP195^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP195^1 : TPTP v8.2.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon May 20 22:16:45 EDT 2024
% Result : Theorem 0.49s 0.56s
% Output : CNFRefutation 0.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 13
% Syntax : Number of formulae : 27 ( 7 unt; 9 typ; 0 def)
% Number of atoms : 53 ( 16 equ; 0 cnn)
% Maximal formula atoms : 18 ( 2 avg)
% Number of connectives : 200 ( 28 ~; 20 |; 7 &; 137 @)
% ( 1 <=>; 6 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 ^ 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
poly_real: $tType ).
thf(decl_sort2,type,
real: $tType ).
thf(decl_32,type,
zero_zero_real: real ).
thf(decl_39,type,
ord_less_real: real > real > $o ).
thf(decl_58,type,
pderiv_real: poly_real > poly_real ).
thf(decl_65,type,
poly_real2: poly_real > real > real ).
thf(decl_84,type,
sturm_469514713_r_pos: poly_real > real > $o ).
thf(decl_87,type,
p: poly_real ).
thf(decl_88,type,
x: real ).
thf(conj_0,conjecture,
( ( sturm_469514713_r_pos @ p @ x )
<~> ~ ( ( ( ( poly_real2 @ p @ x )
= zero_zero_real )
=> ( sturm_469514713_r_pos @ ( pderiv_real @ p ) @ x ) )
& ( ( ( poly_real2 @ p @ x )
!= zero_zero_real )
=> ( ord_less_real @ zero_zero_real @ ( poly_real2 @ p @ x ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
thf(fact_0_False,axiom,
( ( poly_real2 @ p @ x )
!= zero_zero_real ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_False) ).
thf(fact_2__092_060open_0620_A_060_Apoly_Ap_Ax_A_092_060Longrightarrow_062_Asign__r__pos_Ap_Ax_092_060close_062,axiom,
( ( ord_less_real @ zero_zero_real @ ( poly_real2 @ p @ x ) )
=> ( sturm_469514713_r_pos @ p @ x ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2__092_060open_0620_A_060_Apoly_Ap_Ax_A_092_060Longrightarrow_062_Asign__r__pos_Ap_Ax_092_060close_062) ).
thf(fact_1__092_060open_062sign__r__pos_Ap_Ax_A_092_060Longrightarrow_062_A0_A_060_Apoly_Ap_Ax_092_060close_062,axiom,
( ( sturm_469514713_r_pos @ p @ x )
=> ( ord_less_real @ zero_zero_real @ ( poly_real2 @ p @ x ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1__092_060open_062sign__r__pos_Ap_Ax_A_092_060Longrightarrow_062_A0_A_060_Apoly_Ap_Ax_092_060close_062) ).
thf(c_0_4,negated_conjecture,
~ ~ ( ( sturm_469514713_r_pos @ p @ x )
<=> ~ ( ( ( ( poly_real2 @ p @ x )
= zero_zero_real )
=> ( sturm_469514713_r_pos @ ( pderiv_real @ p ) @ x ) )
& ( ( ( poly_real2 @ p @ x )
!= zero_zero_real )
=> ( ord_less_real @ zero_zero_real @ ( poly_real2 @ p @ x ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
thf(c_0_5,plain,
( ( poly_real2 @ p @ x )
!= zero_zero_real ),
inference(fof_simplification,[status(thm)],[fact_0_False]) ).
thf(c_0_6,negated_conjecture,
( ( ( ( poly_real2 @ p @ x )
!= zero_zero_real )
| ( ( poly_real2 @ p @ x )
= zero_zero_real )
| ~ ( sturm_469514713_r_pos @ p @ x ) )
& ( ~ ( ord_less_real @ zero_zero_real @ ( poly_real2 @ p @ x ) )
| ( ( poly_real2 @ p @ x )
= zero_zero_real )
| ~ ( sturm_469514713_r_pos @ p @ x ) )
& ( ( ( poly_real2 @ p @ x )
!= zero_zero_real )
| ~ ( sturm_469514713_r_pos @ ( pderiv_real @ p ) @ x )
| ~ ( sturm_469514713_r_pos @ p @ x ) )
& ( ~ ( ord_less_real @ zero_zero_real @ ( poly_real2 @ p @ x ) )
| ~ ( sturm_469514713_r_pos @ ( pderiv_real @ p ) @ x )
| ~ ( sturm_469514713_r_pos @ p @ x ) )
& ( ( ( poly_real2 @ p @ x )
!= zero_zero_real )
| ( sturm_469514713_r_pos @ ( pderiv_real @ p ) @ x )
| ( sturm_469514713_r_pos @ p @ x ) )
& ( ( ( poly_real2 @ p @ x )
= zero_zero_real )
| ( ord_less_real @ zero_zero_real @ ( poly_real2 @ p @ x ) )
| ( sturm_469514713_r_pos @ p @ x ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
thf(c_0_7,plain,
( ( poly_real2 @ p @ x )
!= zero_zero_real ),
inference(fof_nnf,[status(thm)],[c_0_5]) ).
thf(c_0_8,plain,
( ~ ( ord_less_real @ zero_zero_real @ ( poly_real2 @ p @ x ) )
| ( sturm_469514713_r_pos @ p @ x ) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_2__092_060open_0620_A_060_Apoly_Ap_Ax_A_092_060Longrightarrow_062_Asign__r__pos_Ap_Ax_092_060close_062])]) ).
thf(c_0_9,negated_conjecture,
( ( ( poly_real2 @ p @ x )
= zero_zero_real )
| ~ ( ord_less_real @ zero_zero_real @ ( poly_real2 @ p @ x ) )
| ~ ( sturm_469514713_r_pos @ p @ x ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,plain,
( ( poly_real2 @ p @ x )
!= zero_zero_real ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_11,plain,
( ( sturm_469514713_r_pos @ p @ x )
| ~ ( ord_less_real @ zero_zero_real @ ( poly_real2 @ p @ x ) ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_12,plain,
( ~ ( sturm_469514713_r_pos @ p @ x )
| ( ord_less_real @ zero_zero_real @ ( poly_real2 @ p @ x ) ) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_1__092_060open_062sign__r__pos_Ap_Ax_A_092_060Longrightarrow_062_A0_A_060_Apoly_Ap_Ax_092_060close_062])]) ).
thf(c_0_13,negated_conjecture,
( ( ( poly_real2 @ p @ x )
= zero_zero_real )
| ( ord_less_real @ zero_zero_real @ ( poly_real2 @ p @ x ) )
| ( sturm_469514713_r_pos @ p @ x ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_14,negated_conjecture,
~ ( ord_less_real @ zero_zero_real @ ( poly_real2 @ p @ x ) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
thf(c_0_15,plain,
( ( ord_less_real @ zero_zero_real @ ( poly_real2 @ p @ x ) )
| ~ ( sturm_469514713_r_pos @ p @ x ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_16,negated_conjecture,
sturm_469514713_r_pos @ p @ x,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_13,c_0_10]),c_0_14]) ).
thf(c_0_17,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : ITP195^1 : TPTP v8.2.0. Released v7.5.0.
% 0.04/0.13 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n014.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sat May 18 16:41:53 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.48 Running higher-order theorem proving
% 0.21/0.48 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/benchmark/theBenchmark.p
% 0.49/0.56 # Version: 3.1.0-ho
% 0.49/0.56 # Preprocessing class: HSLSSMSMSSSNHFA.
% 0.49/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.49/0.56 # Starting new_ho_10 with 1500s (5) cores
% 0.49/0.56 # Starting new_ho_10_cnf2 with 300s (1) cores
% 0.49/0.56 # Starting full_lambda_6 with 300s (1) cores
% 0.49/0.56 # Starting full_lambda_9 with 300s (1) cores
% 0.49/0.56 # full_lambda_6 with pid 20187 completed with status 0
% 0.49/0.56 # Result found by full_lambda_6
% 0.49/0.56 # Preprocessing class: HSLSSMSMSSSNHFA.
% 0.49/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.49/0.56 # Starting new_ho_10 with 1500s (5) cores
% 0.49/0.56 # Starting new_ho_10_cnf2 with 300s (1) cores
% 0.49/0.56 # Starting full_lambda_6 with 300s (1) cores
% 0.49/0.56 # SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
% 0.49/0.56 # Search class: HGHSM-FSLM33-DHFFFSBN
% 0.49/0.56 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.49/0.56 # Starting new_ho_10 with 163s (1) cores
% 0.49/0.56 # new_ho_10 with pid 20190 completed with status 0
% 0.49/0.56 # Result found by new_ho_10
% 0.49/0.56 # Preprocessing class: HSLSSMSMSSSNHFA.
% 0.49/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.49/0.56 # Starting new_ho_10 with 1500s (5) cores
% 0.49/0.56 # Starting new_ho_10_cnf2 with 300s (1) cores
% 0.49/0.56 # Starting full_lambda_6 with 300s (1) cores
% 0.49/0.56 # SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
% 0.49/0.56 # Search class: HGHSM-FSLM33-DHFFFSBN
% 0.49/0.56 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.49/0.56 # Starting new_ho_10 with 163s (1) cores
% 0.49/0.56 # Preprocessing time : 0.010 s
% 0.49/0.56 # Presaturation interreduction done
% 0.49/0.56
% 0.49/0.56 # Proof found!
% 0.49/0.56 # SZS status Theorem
% 0.49/0.56 # SZS output start CNFRefutation
% See solution above
% 0.49/0.56 # Parsed axioms : 424
% 0.49/0.56 # Removed by relevancy pruning/SinE : 155
% 0.49/0.56 # Initial clauses : 610
% 0.49/0.56 # Removed in clause preprocessing : 25
% 0.49/0.56 # Initial clauses in saturation : 585
% 0.49/0.56 # Processed clauses : 16
% 0.49/0.56 # ...of these trivial : 0
% 0.49/0.56 # ...subsumed : 3
% 0.49/0.56 # ...remaining for further processing : 13
% 0.49/0.56 # Other redundant clauses eliminated : 0
% 0.49/0.56 # Clauses deleted for lack of memory : 0
% 0.49/0.56 # Backward-subsumed : 3
% 0.49/0.56 # Backward-rewritten : 1
% 0.49/0.56 # Generated clauses : 0
% 0.49/0.56 # ...of the previous two non-redundant : 0
% 0.49/0.56 # ...aggressively subsumed : 0
% 0.49/0.56 # Contextual simplify-reflections : 2
% 0.49/0.56 # Paramodulations : 0
% 0.49/0.56 # Factorizations : 0
% 0.49/0.56 # NegExts : 0
% 0.49/0.56 # Equation resolutions : 0
% 0.49/0.56 # Disequality decompositions : 0
% 0.49/0.56 # Total rewrite steps : 1
% 0.49/0.56 # ...of those cached : 0
% 0.49/0.56 # Propositional unsat checks : 0
% 0.49/0.56 # Propositional check models : 0
% 0.49/0.56 # Propositional check unsatisfiable : 0
% 0.49/0.56 # Propositional clauses : 0
% 0.49/0.56 # Propositional clauses after purity: 0
% 0.49/0.56 # Propositional unsat core size : 0
% 0.49/0.56 # Propositional preprocessing time : 0.000
% 0.49/0.56 # Propositional encoding time : 0.000
% 0.49/0.56 # Propositional solver time : 0.000
% 0.49/0.56 # Success case prop preproc time : 0.000
% 0.49/0.56 # Success case prop encoding time : 0.000
% 0.49/0.56 # Success case prop solver time : 0.000
% 0.49/0.56 # Current number of processed clauses : 9
% 0.49/0.56 # Positive orientable unit clauses : 4
% 0.49/0.56 # Positive unorientable unit clauses: 0
% 0.49/0.56 # Negative unit clauses : 5
% 0.49/0.56 # Non-unit-clauses : 0
% 0.49/0.56 # Current number of unprocessed clauses: 569
% 0.49/0.56 # ...number of literals in the above : 1969
% 0.49/0.56 # Current number of archived formulas : 0
% 0.49/0.56 # Current number of archived clauses : 4
% 0.49/0.56 # Clause-clause subsumption calls (NU) : 4
% 0.49/0.56 # Rec. Clause-clause subsumption calls : 4
% 0.49/0.56 # Non-unit clause-clause subsumptions : 2
% 0.49/0.56 # Unit Clause-clause subsumption calls : 5
% 0.49/0.56 # Rewrite failures with RHS unbound : 0
% 0.49/0.56 # BW rewrite match attempts : 1
% 0.49/0.56 # BW rewrite match successes : 1
% 0.49/0.56 # Condensation attempts : 16
% 0.49/0.56 # Condensation successes : 0
% 0.49/0.56 # Termbank termtop insertions : 42577
% 0.49/0.56 # Search garbage collected termcells : 13545
% 0.49/0.56
% 0.49/0.56 # -------------------------------------------------
% 0.49/0.56 # User time : 0.048 s
% 0.49/0.56 # System time : 0.004 s
% 0.49/0.56 # Total time : 0.052 s
% 0.49/0.56 # Maximum resident set size: 4760 pages
% 0.49/0.56
% 0.49/0.56 # -------------------------------------------------
% 0.49/0.56 # User time : 0.059 s
% 0.49/0.56 # System time : 0.008 s
% 0.49/0.56 # Total time : 0.067 s
% 0.49/0.56 # Maximum resident set size: 2592 pages
% 0.49/0.56 % E---3.1 exiting
% 0.49/0.56 % E exiting
%------------------------------------------------------------------------------