TSTP Solution File: ITP130^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP130^1 : TPTP v8.2.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:27 EDT 2024
% Result : Theorem 0.19s 0.57s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 18
% Syntax : Number of formulae : 29 ( 13 unt; 13 typ; 0 def)
% Number of atoms : 21 ( 5 equ; 0 cnn)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 98 ( 7 ~; 3 |; 1 &; 86 @)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 10 ( 10 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 12 ( 0 ^ 12 !; 0 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
int: $tType ).
thf(decl_sort2,type,
nat: $tType ).
thf(decl_sort3,type,
real: $tType ).
thf(decl_26,type,
ring_1_of_int_real: int > real ).
thf(decl_27,type,
suc: nat > nat ).
thf(decl_29,type,
ord_less_int: int > int > $o ).
thf(decl_31,type,
ord_less_real: real > real > $o ).
thf(decl_35,type,
power_power_int: int > nat > int ).
thf(decl_37,type,
power_power_real: real > nat > real ).
thf(decl_42,type,
na: int ).
thf(decl_43,type,
p: nat ).
thf(decl_44,type,
pm: nat ).
thf(decl_47,type,
ya: int ).
thf(conj_0,conjecture,
ord_less_real @ ( ring_1_of_int_real @ na ) @ ( power_power_real @ ( ring_1_of_int_real @ ya ) @ ( suc @ pm ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
thf(fact_5_of__int__power,axiom,
! [X4: int,X5: nat] :
( ( ring_1_of_int_real @ ( power_power_int @ X4 @ X5 ) )
= ( power_power_real @ ( ring_1_of_int_real @ X4 ) @ X5 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_5_of__int__power) ).
thf(fact_86_p,axiom,
( p
= ( suc @ pm ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_86_p) ).
thf(fact_11_of__int__less__iff,axiom,
! [X6: int,X4: int] :
( ( ord_less_real @ ( ring_1_of_int_real @ X6 ) @ ( ring_1_of_int_real @ X4 ) )
<=> ( ord_less_int @ X6 @ X4 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_11_of__int__less__iff) ).
thf(fact_81_yyn,axiom,
ord_less_int @ na @ ( power_power_int @ ya @ p ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_81_yyn) ).
thf(c_0_5,negated_conjecture,
~ ( ord_less_real @ ( ring_1_of_int_real @ na ) @ ( power_power_real @ ( ring_1_of_int_real @ ya ) @ ( suc @ pm ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
thf(c_0_6,negated_conjecture,
~ ( ord_less_real @ ( ring_1_of_int_real @ na ) @ ( power_power_real @ ( ring_1_of_int_real @ ya ) @ ( suc @ pm ) ) ),
inference(fof_nnf,[status(thm)],[c_0_5]) ).
thf(c_0_7,plain,
! [X892: int,X893: nat] :
( ( ring_1_of_int_real @ ( power_power_int @ X892 @ X893 ) )
= ( power_power_real @ ( ring_1_of_int_real @ X892 ) @ X893 ) ),
inference(variable_rename,[status(thm)],[fact_5_of__int__power]) ).
thf(c_0_8,negated_conjecture,
~ ( ord_less_real @ ( ring_1_of_int_real @ na ) @ ( power_power_real @ ( ring_1_of_int_real @ ya ) @ ( suc @ pm ) ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,plain,
! [X1: int,X2: nat] :
( ( ring_1_of_int_real @ ( power_power_int @ X1 @ X2 ) )
= ( power_power_real @ ( ring_1_of_int_real @ X1 ) @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,plain,
( p
= ( suc @ pm ) ),
inference(split_conjunct,[status(thm)],[fact_86_p]) ).
thf(c_0_11,plain,
! [X908: int,X909: int] :
( ( ~ ( ord_less_real @ ( ring_1_of_int_real @ X908 ) @ ( ring_1_of_int_real @ X909 ) )
| ( ord_less_int @ X908 @ X909 ) )
& ( ~ ( ord_less_int @ X908 @ X909 )
| ( ord_less_real @ ( ring_1_of_int_real @ X908 ) @ ( ring_1_of_int_real @ X909 ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_11_of__int__less__iff])])]) ).
thf(c_0_12,negated_conjecture,
~ ( ord_less_real @ ( ring_1_of_int_real @ na ) @ ( ring_1_of_int_real @ ( power_power_int @ ya @ p ) ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
thf(c_0_13,plain,
! [X1: int,X3: int] :
( ( ord_less_real @ ( ring_1_of_int_real @ X1 ) @ ( ring_1_of_int_real @ X3 ) )
| ~ ( ord_less_int @ X1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_14,plain,
ord_less_int @ na @ ( power_power_int @ ya @ p ),
inference(split_conjunct,[status(thm)],[fact_81_yyn]) ).
thf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : ITP130^1 : TPTP v8.2.0. Released v7.5.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n004.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sat May 18 15:51:38 EDT 2024
% 0.12/0.35 % CPUTime :
% 0.19/0.49 Running higher-order theorem proving
% 0.19/0.49 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/benchmark/theBenchmark.p
% 0.19/0.57 # Version: 3.1.0-ho
% 0.19/0.57 # Preprocessing class: HSLSSMSMSSSNSFA.
% 0.19/0.57 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.57 # Starting new_ho_10 with 900s (3) cores
% 0.19/0.57 # Starting sh2lt with 300s (1) cores
% 0.19/0.57 # Starting new_ho_5 with 300s (1) cores
% 0.19/0.57 # Starting full_lambda_5 with 300s (1) cores
% 0.19/0.57 # Starting sh9 with 300s (1) cores
% 0.19/0.57 # Starting ehoh_best8_lambda with 300s (1) cores
% 0.19/0.57 # new_ho_10 with pid 3985 completed with status 0
% 0.19/0.57 # Result found by new_ho_10
% 0.19/0.57 # Preprocessing class: HSLSSMSMSSSNSFA.
% 0.19/0.57 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.57 # Starting new_ho_10 with 900s (3) cores
% 0.19/0.57 # No SInE strategy applied
% 0.19/0.57 # Search class: HGHSM-FSLM31-MSFFFSBN
% 0.19/0.57 # Scheduled 6 strats onto 3 cores with 900 seconds (900 total)
% 0.19/0.57 # Starting new_bool_8 with 487s (1) cores
% 0.19/0.57 # Starting new_ho_10 with 91s (1) cores
% 0.19/0.57 # Starting sh2 with 82s (1) cores
% 0.19/0.57 # new_bool_8 with pid 3991 completed with status 0
% 0.19/0.57 # Result found by new_bool_8
% 0.19/0.57 # Preprocessing class: HSLSSMSMSSSNSFA.
% 0.19/0.57 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.57 # Starting new_ho_10 with 900s (3) cores
% 0.19/0.57 # No SInE strategy applied
% 0.19/0.57 # Search class: HGHSM-FSLM31-MSFFFSBN
% 0.19/0.57 # Scheduled 6 strats onto 3 cores with 900 seconds (900 total)
% 0.19/0.57 # Starting new_bool_8 with 487s (1) cores
% 0.19/0.57 # Preprocessing time : 0.005 s
% 0.19/0.57 # Presaturation interreduction done
% 0.19/0.57
% 0.19/0.57 # Proof found!
% 0.19/0.57 # SZS status Theorem
% 0.19/0.57 # SZS output start CNFRefutation
% See solution above
% 0.19/0.57 # Parsed axioms : 349
% 0.19/0.57 # Removed by relevancy pruning/SinE : 0
% 0.19/0.57 # Initial clauses : 555
% 0.19/0.57 # Removed in clause preprocessing : 44
% 0.19/0.57 # Initial clauses in saturation : 511
% 0.19/0.57 # Processed clauses : 771
% 0.19/0.57 # ...of these trivial : 13
% 0.19/0.57 # ...subsumed : 153
% 0.19/0.57 # ...remaining for further processing : 605
% 0.19/0.57 # Other redundant clauses eliminated : 64
% 0.19/0.57 # Clauses deleted for lack of memory : 0
% 0.19/0.57 # Backward-subsumed : 0
% 0.19/0.57 # Backward-rewritten : 16
% 0.19/0.57 # Generated clauses : 617
% 0.19/0.57 # ...of the previous two non-redundant : 497
% 0.19/0.57 # ...aggressively subsumed : 0
% 0.19/0.57 # Contextual simplify-reflections : 2
% 0.19/0.57 # Paramodulations : 545
% 0.19/0.57 # Factorizations : 0
% 0.19/0.57 # NegExts : 0
% 0.19/0.57 # Equation resolutions : 67
% 0.19/0.57 # Disequality decompositions : 0
% 0.19/0.57 # Total rewrite steps : 261
% 0.19/0.57 # ...of those cached : 198
% 0.19/0.57 # Propositional unsat checks : 0
% 0.19/0.57 # Propositional check models : 0
% 0.19/0.57 # Propositional check unsatisfiable : 0
% 0.19/0.57 # Propositional clauses : 0
% 0.19/0.57 # Propositional clauses after purity: 0
% 0.19/0.57 # Propositional unsat core size : 0
% 0.19/0.57 # Propositional preprocessing time : 0.000
% 0.19/0.57 # Propositional encoding time : 0.000
% 0.19/0.57 # Propositional solver time : 0.000
% 0.19/0.57 # Success case prop preproc time : 0.000
% 0.19/0.57 # Success case prop encoding time : 0.000
% 0.19/0.57 # Success case prop solver time : 0.000
% 0.19/0.57 # Current number of processed clauses : 176
% 0.19/0.57 # Positive orientable unit clauses : 65
% 0.19/0.57 # Positive unorientable unit clauses: 0
% 0.19/0.57 # Negative unit clauses : 23
% 0.19/0.57 # Non-unit-clauses : 88
% 0.19/0.57 # Current number of unprocessed clauses: 599
% 0.19/0.57 # ...number of literals in the above : 1556
% 0.19/0.57 # Current number of archived formulas : 0
% 0.19/0.57 # Current number of archived clauses : 379
% 0.19/0.57 # Clause-clause subsumption calls (NU) : 25339
% 0.19/0.57 # Rec. Clause-clause subsumption calls : 17651
% 0.19/0.57 # Non-unit clause-clause subsumptions : 89
% 0.19/0.57 # Unit Clause-clause subsumption calls : 918
% 0.19/0.57 # Rewrite failures with RHS unbound : 0
% 0.19/0.57 # BW rewrite match attempts : 10
% 0.19/0.57 # BW rewrite match successes : 3
% 0.19/0.57 # Condensation attempts : 0
% 0.19/0.57 # Condensation successes : 0
% 0.19/0.57 # Termbank termtop insertions : 51701
% 0.19/0.57 # Search garbage collected termcells : 10779
% 0.19/0.57
% 0.19/0.57 # -------------------------------------------------
% 0.19/0.57 # User time : 0.051 s
% 0.19/0.57 # System time : 0.010 s
% 0.19/0.57 # Total time : 0.061 s
% 0.19/0.57 # Maximum resident set size: 4108 pages
% 0.19/0.57
% 0.19/0.57 # -------------------------------------------------
% 0.19/0.57 # User time : 0.136 s
% 0.19/0.57 # System time : 0.021 s
% 0.19/0.57 # Total time : 0.157 s
% 0.19/0.57 # Maximum resident set size: 2216 pages
% 0.19/0.57 % E---3.1 exiting
% 0.78/0.58 % E exiting
%------------------------------------------------------------------------------