%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : ITP270^3 : TPTP v9.3.1. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n013.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:06:08 AM UTC 2026
% Result : Theorem 23.49s 11.59s
% Output : CNFRefutation 23.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 18 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 26 ( 2 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 104 ( 10 ~; 5 |; 1 &; 86 @)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 6 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 12 usr; 7 con; 0-2 aty)
% Number of variables : 10 ( 0 ^; 10 !; 0 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
num: $tType ).
thf(decl_sort2,type,
nat: $tType ).
thf(decl_319,type,
one_one_nat: nat ).
thf(decl_566,type,
suc: nat > nat ).
thf(decl_630,type,
bit0: num > num ).
thf(decl_632,type,
one: num ).
thf(decl_640,type,
numeral_numeral_nat: num > nat ).
thf(decl_680,type,
ord_less_nat: nat > nat > $o ).
thf(decl_695,type,
ord_less_eq_nat: nat > nat > $o ).
thf(decl_743,type,
power_power_nat: nat > nat > nat ).
thf(decl_1088,type,
deg: nat ).
thf(decl_1090,type,
ma: nat ).
thf(decl_1091,type,
mi: nat ).
thf(decl_1095,type,
x: nat ).
thf(conj_0,conjecture,
ord_less_nat @ x @ ( power_power_nat @ ( numeral_numeral_nat @ ( bit0 @ one ) ) @ deg ),
file('/export/starexec/sandbox2/tmp/tmp.zde9U42pKW/E---3.1_2634601.p',conj_0) ).
thf(fact_608_dual__order_Ostrict__trans2,axiom,
! [X1346: nat,X1347: nat,X1348: nat] :
( ( ord_less_nat @ X1346 @ X1347 )
=> ( ( ord_less_eq_nat @ X1348 @ X1346 )
=> ( ord_less_nat @ X1348 @ X1347 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.zde9U42pKW/E---3.1_2634601.p',fact_608_dual__order_Ostrict__trans2) ).
thf(fact_24__092_060open_062x_A_092_060le_062_Ama_A_092_060and_062_Ami_A_092_060le_062_Ax_092_060close_062,axiom,
( ( ord_less_eq_nat @ x @ ma )
& ( ord_less_eq_nat @ mi @ x ) ),
file('/export/starexec/sandbox2/tmp/tmp.zde9U42pKW/E---3.1_2634601.p',fact_24__092_060open_062x_A_092_060le_062_Ama_A_092_060and_062_Ami_A_092_060le_062_Ax_092_060close_062) ).
thf(fact_1__C5_Ohyps_C_I8_J,axiom,
ord_less_nat @ ma @ ( power_power_nat @ ( numeral_numeral_nat @ ( bit0 @ one ) ) @ deg ),
file('/export/starexec/sandbox2/tmp/tmp.zde9U42pKW/E---3.1_2634601.p',fact_1__C5_Ohyps_C_I8_J) ).
thf(fact_2973_Suc__1,axiom,
( ( suc @ one_one_nat )
= ( numeral_numeral_nat @ ( bit0 @ one ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.zde9U42pKW/E---3.1_2634601.p',fact_2973_Suc__1) ).
thf(c_0_5,negated_conjecture,
~ ( ord_less_nat @ x @ ( power_power_nat @ ( numeral_numeral_nat @ ( bit0 @ one ) ) @ deg ) ),
inference(assume_negation,[status(cth)],[conj_0]) ).
thf(c_0_6,negated_conjecture,
~ ( ord_less_nat @ x @ ( power_power_nat @ ( numeral_numeral_nat @ ( bit0 @ one ) ) @ deg ) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
thf(c_0_7,plain,
! [X27082: nat,X27083: nat,X27084: nat] :
( ~ ( ord_less_nat @ X27082 @ X27083 )
| ~ ( ord_less_eq_nat @ X27084 @ X27082 )
| ( ord_less_nat @ X27084 @ X27083 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_608_dual__order_Ostrict__trans2])])]) ).
thf(c_0_8,negated_conjecture,
~ ( ord_less_nat @ x @ ( power_power_nat @ ( numeral_numeral_nat @ ( bit0 @ one ) ) @ deg ) ),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
thf(c_0_9,plain,
! [X18: nat,X17: nat,X1: nat] :
( ( ord_less_nat @ X18 @ X17 )
| ~ ( ord_less_nat @ X1 @ X17 )
| ~ ( ord_less_eq_nat @ X18 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,plain,
ord_less_eq_nat @ x @ ma,
inference(split_conjunct,[status(thm)],[fact_24__092_060open_062x_A_092_060le_062_Ama_A_092_060and_062_Ami_A_092_060le_062_Ax_092_060close_062]) ).
thf(c_0_11,plain,
ord_less_nat @ ma @ ( power_power_nat @ ( numeral_numeral_nat @ ( bit0 @ one ) ) @ deg ),
inference(split_conjunct,[status(thm)],[fact_1__C5_Ohyps_C_I8_J]) ).
thf(c_0_12,plain,
( ( suc @ one_one_nat )
= ( numeral_numeral_nat @ ( bit0 @ one ) ) ),
inference(split_conjunct,[status(thm)],[fact_2973_Suc__1]) ).
thf(c_0_13,negated_conjecture,
~ ( ord_less_nat @ x @ ( power_power_nat @ ( numeral_numeral_nat @ ( bit0 @ one ) ) @ deg ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_14,plain,
! [X1: nat] :
( ( ord_less_nat @ x @ X1 )
| ~ ( ord_less_nat @ ma @ X1 ) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_15,plain,
ord_less_nat @ ma @ ( power_power_nat @ ( suc @ one_one_nat ) @ deg ),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_16,negated_conjecture,
~ ( ord_less_nat @ x @ ( power_power_nat @ ( suc @ one_one_nat ) @ deg ) ),
inference(rw,[status(thm)],[c_0_13,c_0_12]) ).
thf(c_0_17,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ITP270^3 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.21 % Computer : n013.cluster.edu
% 0.10/0.21 % Model : x86_64 x86_64
% 0.10/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.21 % Memory : 8046.5625MB
% 0.10/0.21 % OS : Linux 6.8.0-71-generic
% 0.10/0.21 % CPULimit : 300
% 0.10/0.21 % WCLimit : 300
% 0.10/0.21 % DateTime : Tue Sep 29 20:48:25 UTC 2026
% 0.10/0.21 % CPUTime :
% 0.10/0.21 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.25 Running higher-order theorem proving
% 4.98/5.13 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/tmp/tmp.zde9U42pKW/E---3.1_2634601.p
% 23.49/11.59 % Version: 3.5.1-ho
% 23.49/11.59 % partial match(2): HMLMSMSMSSLCHFA
% 23.49/11.59 % Preprocessing class: HMLLSMLMSSLCHFA.
% 23.49/11.59 % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 23.49/11.59 % Starting new_ho_10 with 1495s (5) cores
% 23.49/11.59 % Starting sh5l with 299s (1) cores
% 23.49/11.59 % Starting new_bool_1 with 299s (1) cores
% 23.49/11.59 % Starting new_bool_2 with 299s (1) cores
% 23.49/11.59 % new_bool_1 with pid 2634806 completed with status 0
% 23.49/11.59 % Result found by new_bool_1
% 23.49/11.59 % partial match(2): HMLMSMSMSSLCHFA
% 23.49/11.59 % Preprocessing class: HMLLSMLMSSLCHFA.
% 23.49/11.59 % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 23.49/11.59 % Starting new_ho_10 with 1495s (5) cores
% 23.49/11.59 % Starting sh5l with 299s (1) cores
% 23.49/11.59 % Starting new_bool_1 with 299s (1) cores
% 23.49/11.59 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 23.49/11.59 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 23.49/11.59 % Search class: HGHSM-SMLM32-DHFFFSBN
% 23.49/11.59 % Scheduled 5 strats onto 1 cores with 297 seconds (297 total)
% 23.49/11.59 % Starting SubtermCWHack with 30s (1) cores
% 23.49/11.59 % SubtermCWHack with pid 2634817 completed with status 0
% 23.49/11.59 % Result found by SubtermCWHack
% 23.49/11.59 % partial match(2): HMLMSMSMSSLCHFA
% 23.49/11.59 % Preprocessing class: HMLLSMLMSSLCHFA.
% 23.49/11.59 % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 23.49/11.59 % Starting new_ho_10 with 1495s (5) cores
% 23.49/11.59 % Starting sh5l with 299s (1) cores
% 23.49/11.59 % Starting new_bool_1 with 299s (1) cores
% 23.49/11.59 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 23.49/11.59 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 23.49/11.59 % Search class: HGHSM-SMLM32-DHFFFSBN
% 23.49/11.59 % Scheduled 5 strats onto 1 cores with 297 seconds (297 total)
% 23.49/11.59 % Starting SubtermCWHack with 30s (1) cores
% 23.49/11.59 % Preprocessing time : 0.202 s
% 23.49/11.59
% 23.49/11.59 % Proof found!
% 23.49/11.59 % SZS status Theorem
% 23.49/11.59 % SZS output start CNFRefutation
% See solution above
% 23.49/11.59 % Parsed axioms : 11424
% 23.49/11.59 % Removed by relevancy pruning/SinE : 7988
% 23.49/11.59 % Initial clauses : 9854
% 23.49/11.59 % Removed in clause preprocessing : 2364
% 23.49/11.59 % Initial clauses in saturation : 7490
% 23.49/11.59 % Processed clauses : 15957
% 23.49/11.59 % ...of these trivial : 932
% 23.49/11.59 % ...subsumed : 8690
% 23.49/11.59 % ...remaining for further processing : 6335
% 23.49/11.59 % Other redundant clauses eliminated : 901
% 23.49/11.59 % Clauses deleted for lack of memory : 0
% 23.49/11.59 % Backward-subsumed : 127
% 23.49/11.59 % Backward-rewritten : 311
% 23.49/11.59 % Generated clauses : 61771
% 23.49/11.59 % ...of the previous two non-redundant : 50344
% 23.49/11.59 % ...aggressively subsumed : 0
% 23.49/11.59 % Contextual simplify-reflections : 13
% 23.49/11.59 % Paramodulations : 60784
% 23.49/11.59 % Factorizations : 16
% 23.49/11.59 % NegExts : 0
% 23.49/11.59 % Equation resolutions : 938
% 23.49/11.59 % Disequality decompositions : 0
% 23.49/11.59 % Total rewrite steps : 17581
% 23.49/11.59 % ...of those cached : 13553
% 23.49/11.59 % Propositional unsat checks : 0
% 23.49/11.59 % Propositional check models : 0
% 23.49/11.59 % Propositional check unsatisfiable : 0
% 23.49/11.59 % Propositional clauses : 0
% 23.49/11.59 % Propositional clauses after purity: 0
% 23.49/11.59 % Propositional unsat core size : 0
% 23.49/11.59 % Propositional preprocessing time : 0.000
% 23.49/11.59 % Propositional encoding time : 0.000
% 23.49/11.59 % Propositional solver time : 0.000
% 23.49/11.59 % Success case prop preproc time : 0.000
% 23.49/11.59 % Success case prop encoding time : 0.000
% 23.49/11.59 % Success case prop solver time : 0.000
% 23.49/11.59 % Current number of processed clauses : 5427
% 23.49/11.59 % Positive orientable unit clauses : 2297
% 23.49/11.59 % Positive unorientable unit clauses: 26
% 23.49/11.59 % Negative unit clauses : 2157
% 23.49/11.59 % Non-unit-clauses : 947
% 23.49/11.59 % Current number of unprocessed clauses: 41352
% 23.49/11.59 % ...number of literals in the above : 88460
% 23.49/11.59 % Current number of archived formulas : 0
% 23.49/11.59 % Current number of archived clauses : 442
% 23.49/11.59 % Clause-clause subsumption calls (NU) : 207722
% 23.49/11.59 % Rec. Clause-clause subsumption calls : 178497
% 23.49/11.59 % Non-unit clause-clause subsumptions : 1103
% 23.49/11.59 % Unit Clause-clause subsumption calls : 1139817
% 23.49/11.59 % Rewrite failures with RHS unbound : 0
% 23.49/11.59 % BW rewrite match attempts : 6680
% 23.49/11.59 % BW rewrite match successes : 488
% 23.49/11.59 % Condensation attempts : 0
% 23.49/11.59 % Condensation successes : 0
% 23.49/11.59 % Termbank termtop insertions : 1355295
% 23.49/11.59 % Search garbage collected termcells : 216590
% 23.49/11.59
% 23.49/11.59 % -------------------------------------------------
% 23.49/11.59 % User time : 4.562 s
% 23.49/11.59 % System time : 0.213 s
% 23.49/11.59 % Total time : 4.775 s
% 23.49/11.59 % Maximum resident set size: 51268 pages
% 23.49/11.59
% 23.49/11.59 % -------------------------------------------------
% 23.49/11.59 % User time : 6.118 s
% 23.49/11.59 % System time : 0.263 s
% 23.49/11.59 % Total time : 6.382 s
% 23.49/11.59 % Maximum resident set size: 30720 pages
% 23.49/11.59 % E exiting
%------------------------------------------------------------------------------