%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ITP130^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 : n007.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:27 AM UTC 2026
% Result : Theorem 0.23s 0.38s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 17 ( 14 unt; 0 typ; 0 def)
% Number of atoms : 22 ( 5 equ; 0 cnn)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 106 ( 8 ~; 3 |; 1 &; 93 @)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 0 ( 0 >; 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_27,type,
ring_1_of_int_real: int > real ).
thf(decl_28,type,
suc: nat > nat ).
thf(decl_30,type,
ord_less_int: int > int > $o ).
thf(decl_32,type,
ord_less_real: real > real > $o ).
thf(decl_36,type,
power_power_int: int > nat > int ).
thf(decl_38,type,
power_power_real: real > nat > real ).
thf(decl_43,type,
na: int ).
thf(decl_44,type,
p: nat ).
thf(decl_45,type,
pm: nat ).
thf(decl_48,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/sandbox/tmp/tmp.rkx1WWweLQ/E---3.1_3852669.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/sandbox/tmp/tmp.rkx1WWweLQ/E---3.1_3852669.p',fact_5_of__int__power) ).
thf(fact_86_p,axiom,
( p
= ( suc @ pm ) ),
file('/export/starexec/sandbox/tmp/tmp.rkx1WWweLQ/E---3.1_3852669.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/sandbox/tmp/tmp.rkx1WWweLQ/E---3.1_3852669.p',fact_11_of__int__less__iff) ).
thf(fact_81_yyn,axiom,
ord_less_int @ na @ ( power_power_int @ ya @ p ),
file('/export/starexec/sandbox/tmp/tmp.rkx1WWweLQ/E---3.1_3852669.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(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_simplification,[status(thm)],[c_0_5]) ).
thf(c_0_7,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_6]) ).
thf(c_0_8,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_9,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_7]) ).
thf(c_0_10,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_8]) ).
thf(c_0_11,plain,
( p
= ( suc @ pm ) ),
inference(split_conjunct,[status(thm)],[fact_86_p]) ).
thf(c_0_12,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_13,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_9,c_0_10]),c_0_11]) ).
thf(c_0_14,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_12]) ).
thf(c_0_15,plain,
ord_less_int @ na @ ( power_power_int @ ya @ p ),
inference(split_conjunct,[status(thm)],[fact_81_yyn]) ).
thf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP130^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.09/0.17 % Computer : n007.cluster.edu
% 0.09/0.17 % Model : x86_64 x86_64
% 0.09/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17 % Memory : 8046.5625MB
% 0.09/0.17 % OS : Linux 6.8.0-71-generic
% 0.09/0.17 % CPULimit : 300
% 0.09/0.17 % WCLimit : 300
% 0.09/0.17 % DateTime : Tue Sep 29 19:55:55 UTC 2026
% 0.09/0.17 % CPUTime :
% 0.09/0.17 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.21 Running higher-order theorem proving
% 0.09/0.25 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.rkx1WWweLQ/E---3.1_3852669.p
% 0.23/0.38 % Version: 3.5.1-ho
% 0.23/0.38 % Preprocessing class: HSLSSMSMSSSNSFA.
% 0.23/0.38 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.38 % Starting new_ho_10 with 900s (3) cores
% 0.23/0.38 % Starting sh2lt with 300s (1) cores
% 0.23/0.38 % Starting new_ho_5 with 300s (1) cores
% 0.23/0.38 % Starting full_lambda_5 with 300s (1) cores
% 0.23/0.38 % Starting sh9 with 300s (1) cores
% 0.23/0.38 % Starting ehoh_best8_lambda with 300s (1) cores
% 0.23/0.38 % new_ho_10 with pid 3852704 completed with status 0
% 0.23/0.38 % Result found by new_ho_10
% 0.23/0.38 % Preprocessing class: HSLSSMSMSSSNSFA.
% 0.23/0.38 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.38 % Starting new_ho_10 with 900s (3) cores
% 0.23/0.38 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.38 % No SInE strategy applied
% 0.23/0.38 % Search class: HGHSM-FSLM31-MSFFFSBN
% 0.23/0.38 % Scheduled 7 strats onto 3 cores with 900 seconds (900 total)
% 0.23/0.38 % Starting SubtermCWHack with 82s (1) cores
% 0.23/0.38 % Starting new_ho_10 with 91s (1) cores
% 0.23/0.38 % Starting sh2lt with 82s (1) cores
% 0.23/0.38 % new_ho_10 with pid 3852713 completed with status 0
% 0.23/0.38 % Result found by new_ho_10
% 0.23/0.38 % Preprocessing class: HSLSSMSMSSSNSFA.
% 0.23/0.38 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.38 % Starting new_ho_10 with 900s (3) cores
% 0.23/0.38 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.38 % No SInE strategy applied
% 0.23/0.38 % Search class: HGHSM-FSLM31-MSFFFSBN
% 0.23/0.38 % Scheduled 7 strats onto 3 cores with 900 seconds (900 total)
% 0.23/0.38 % Starting SubtermCWHack with 82s (1) cores
% 0.23/0.38 % Starting new_ho_10 with 91s (1) cores
% 0.23/0.38 % Preprocessing time : 0.009 s
% 0.23/0.38 % Presaturation interreduction done
% 0.23/0.38
% 0.23/0.38 % Proof found!
% 0.23/0.38 % SZS status Theorem
% 0.23/0.38 % SZS output start CNFRefutation
% See solution above
% 0.23/0.38 % Parsed axioms : 349
% 0.23/0.38 % Removed by relevancy pruning/SinE : 0
% 0.23/0.38 % Initial clauses : 555
% 0.23/0.38 % Removed in clause preprocessing : 44
% 0.23/0.38 % Initial clauses in saturation : 511
% 0.23/0.38 % Processed clauses : 627
% 0.23/0.38 % ...of these trivial : 12
% 0.23/0.38 % ...subsumed : 122
% 0.23/0.38 % ...remaining for further processing : 493
% 0.23/0.38 % Other redundant clauses eliminated : 50
% 0.23/0.38 % Clauses deleted for lack of memory : 0
% 0.23/0.38 % Backward-subsumed : 0
% 0.23/0.38 % Backward-rewritten : 2
% 0.23/0.38 % Generated clauses : 93
% 0.23/0.38 % ...of the previous two non-redundant : 57
% 0.23/0.38 % ...aggressively subsumed : 0
% 0.23/0.38 % Contextual simplify-reflections : 2
% 0.23/0.38 % Paramodulations : 39
% 0.23/0.38 % Factorizations : 0
% 0.23/0.38 % NegExts : 0
% 0.23/0.38 % Equation resolutions : 52
% 0.23/0.38 % Disequality decompositions : 0
% 0.23/0.38 % Total rewrite steps : 77
% 0.23/0.38 % ...of those cached : 45
% 0.23/0.38 % Propositional unsat checks : 0
% 0.23/0.38 % Propositional check models : 0
% 0.23/0.38 % Propositional check unsatisfiable : 0
% 0.23/0.38 % Propositional clauses : 0
% 0.23/0.38 % Propositional clauses after purity: 0
% 0.23/0.38 % Propositional unsat core size : 0
% 0.23/0.38 % Propositional preprocessing time : 0.000
% 0.23/0.38 % Propositional encoding time : 0.000
% 0.23/0.38 % Propositional solver time : 0.000
% 0.23/0.38 % Success case prop preproc time : 0.000
% 0.23/0.38 % Success case prop encoding time : 0.000
% 0.23/0.38 % Success case prop solver time : 0.000
% 0.23/0.38 % Current number of processed clauses : 78
% 0.23/0.38 % Positive orientable unit clauses : 43
% 0.23/0.38 % Positive unorientable unit clauses: 0
% 0.23/0.38 % Negative unit clauses : 17
% 0.23/0.38 % Non-unit-clauses : 18
% 0.23/0.38 % Current number of unprocessed clauses: 304
% 0.23/0.38 % ...number of literals in the above : 848
% 0.23/0.38 % Current number of archived formulas : 0
% 0.23/0.38 % Current number of archived clauses : 365
% 0.23/0.38 % Clause-clause subsumption calls (NU) : 19205
% 0.23/0.38 % Rec. Clause-clause subsumption calls : 12946
% 0.23/0.38 % Non-unit clause-clause subsumptions : 90
% 0.23/0.38 % Unit Clause-clause subsumption calls : 327
% 0.23/0.38 % Rewrite failures with RHS unbound : 0
% 0.23/0.38 % BW rewrite match attempts : 10
% 0.23/0.38 % BW rewrite match successes : 2
% 0.23/0.38 % Condensation attempts : 627
% 0.23/0.38 % Condensation successes : 0
% 0.23/0.38 % Termbank termtop insertions : 49228
% 0.23/0.38 % Search garbage collected termcells : 10777
% 0.23/0.38
% 0.23/0.38 % -------------------------------------------------
% 0.23/0.38 % User time : 0.079 s
% 0.23/0.38 % System time : 0.008 s
% 0.23/0.38 % Total time : 0.087 s
% 0.23/0.38 % Maximum resident set size: 6196 pages
% 0.23/0.38
% 0.23/0.38 % -------------------------------------------------
% 0.23/0.38 % User time : 0.204 s
% 0.23/0.38 % System time : 0.027 s
% 0.23/0.38 % Total time : 0.231 s
% 0.23/0.38 % Maximum resident set size: 5376 pages
% 0.23/0.38 % E exiting
%------------------------------------------------------------------------------