%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ITP246^3 : TPTP v9.3.1. Bugfixed v9.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n017.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:54 AM UTC 2026
% Result : Theorem 36.14s 16.17s
% Output : CNFRefutation 36.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 19 ( 15 unt; 0 typ; 0 def)
% Number of atoms : 27 ( 12 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 177 ( 13 ~; 8 |; 0 &; 156 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 8 ( 0 ^; 8 !; 0 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
nat: $tType ).
thf(decl_sort2,type,
num: $tType ).
thf(decl_528,type,
bit0: num > num ).
thf(decl_530,type,
one: num ).
thf(decl_538,type,
numeral_numeral_nat: num > nat ).
thf(decl_594,type,
ord_less_eq_nat: nat > nat > $o ).
thf(decl_712,type,
divide_divide_nat: nat > nat > nat ).
thf(decl_843,type,
vEBT_VEBT_high: nat > nat > nat ).
thf(decl_904,type,
deg: nat ).
thf(decl_909,type,
na: nat ).
thf(decl_914,type,
xa: nat ).
thf(decl_915,type,
za: nat ).
thf(conj_0,conjecture,
( ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) )
= ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.v5JsBZUmlF/E---3.1_862545.p',conj_0) ).
thf(fact_49_verit__la__disequality,axiom,
! [X36: nat,X37: nat] :
( ( X36 = X37 )
| ~ ( ord_less_eq_nat @ X36 @ X37 )
| ~ ( ord_less_eq_nat @ X37 @ X36 ) ),
file('/export/starexec/sandbox2/tmp/tmp.v5JsBZUmlF/E---3.1_862545.p',fact_49_verit__la__disequality) ).
thf(fact_0_bbbb,axiom,
ord_less_eq_nat @ ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) @ ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.v5JsBZUmlF/E---3.1_862545.p',fact_0_bbbb) ).
thf(fact_5__092_060open_062deg_Adiv_A2_A_061_An_092_060close_062,axiom,
( ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) )
= na ),
file('/export/starexec/sandbox2/tmp/tmp.v5JsBZUmlF/E---3.1_862545.p',fact_5__092_060open_062deg_Adiv_A2_A_061_An_092_060close_062) ).
thf(fact_2_aaaa,axiom,
ord_less_eq_nat @ ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) @ ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.v5JsBZUmlF/E---3.1_862545.p',fact_2_aaaa) ).
thf(c_0_5,negated_conjecture,
( ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) )
!= ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ),
inference(assume_negation,[status(cth)],[conj_0]) ).
thf(c_0_6,negated_conjecture,
( ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) )
!= ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
thf(c_0_7,plain,
! [X36: nat,X37: nat] :
( ( X36 = X37 )
| ~ ( ord_less_eq_nat @ X36 @ X37 )
| ~ ( ord_less_eq_nat @ X37 @ X36 ) ),
inference(fof_simplification,[status(thm)],[fact_49_verit__la__disequality]) ).
thf(c_0_8,negated_conjecture,
( ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) )
!= ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
thf(c_0_9,plain,
! [X28209: nat,X28210: nat] :
( ( X28209 = X28210 )
| ~ ( ord_less_eq_nat @ X28209 @ X28210 )
| ~ ( ord_less_eq_nat @ X28210 @ X28209 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_7])]) ).
thf(c_0_10,plain,
ord_less_eq_nat @ ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) @ ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ),
inference(split_conjunct,[status(thm)],[fact_0_bbbb]) ).
thf(c_0_11,plain,
( ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) )
= na ),
inference(split_conjunct,[status(thm)],[fact_5__092_060open_062deg_Adiv_A2_A_061_An_092_060close_062]) ).
thf(c_0_12,plain,
ord_less_eq_nat @ ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) @ ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ),
inference(split_conjunct,[status(thm)],[fact_2_aaaa]) ).
thf(c_0_13,negated_conjecture,
( ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) )
!= ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_14,plain,
! [X3: nat,X2: nat] :
( ( X2 = X3 )
| ~ ( ord_less_eq_nat @ X2 @ X3 )
| ~ ( ord_less_eq_nat @ X3 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_15,plain,
ord_less_eq_nat @ ( vEBT_VEBT_high @ za @ na ) @ ( vEBT_VEBT_high @ xa @ na ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_11]) ).
thf(c_0_16,plain,
ord_less_eq_nat @ ( vEBT_VEBT_high @ xa @ na ) @ ( vEBT_VEBT_high @ za @ na ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_11]),c_0_11]) ).
thf(c_0_17,negated_conjecture,
( ( vEBT_VEBT_high @ za @ na )
!= ( vEBT_VEBT_high @ xa @ na ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_11]),c_0_11]) ).
thf(c_0_18,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP246^3 : TPTP v9.3.1. Bugfixed v9.2.1.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.20 % Computer : n017.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Tue Sep 29 20:27:37 UTC 2026
% 0.09/0.21 % CPUTime :
% 0.09/0.21 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.25 Running higher-order theorem proving
% 4.45/4.58 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.v5JsBZUmlF/E---3.1_862545.p
% 36.14/16.17 % Version: 3.5.1-ho
% 36.14/16.17 % partial match(1): HMLMSMSMSSLCHFA
% 36.14/16.17 % Preprocessing class: HMLMSMLMSSLCHFA.
% 36.14/16.17 % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 36.14/16.17 % Starting new_ho_10 with 1495s (5) cores
% 36.14/16.17 % Starting sh5l with 299s (1) cores
% 36.14/16.17 % Starting new_bool_1 with 299s (1) cores
% 36.14/16.17 % Starting new_bool_2 with 299s (1) cores
% 36.14/16.17 % new_bool_1 with pid 862560 completed with status 0
% 36.14/16.17 % Result found by new_bool_1
% 36.14/16.17 % partial match(1): HMLMSMSMSSLCHFA
% 36.14/16.17 % Preprocessing class: HMLMSMLMSSLCHFA.
% 36.14/16.17 % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 36.14/16.17 % Starting new_ho_10 with 1495s (5) cores
% 36.14/16.17 % Starting sh5l with 299s (1) cores
% 36.14/16.17 % Starting new_bool_1 with 299s (1) cores
% 36.14/16.17 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 36.14/16.17 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 36.14/16.17 % Search class: HGHSM-SMLM32-DHFFFSBN
% 36.14/16.17 % Scheduled 5 strats onto 1 cores with 297 seconds (297 total)
% 36.14/16.17 % Starting SubtermCWHack with 30s (1) cores
% 36.14/16.17 % SubtermCWHack with pid 862563 completed with status 0
% 36.14/16.17 % Result found by SubtermCWHack
% 36.14/16.17 % partial match(1): HMLMSMSMSSLCHFA
% 36.14/16.17 % Preprocessing class: HMLMSMLMSSLCHFA.
% 36.14/16.17 % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 36.14/16.17 % Starting new_ho_10 with 1495s (5) cores
% 36.14/16.17 % Starting sh5l with 299s (1) cores
% 36.14/16.17 % Starting new_bool_1 with 299s (1) cores
% 36.14/16.17 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 36.14/16.17 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 36.14/16.17 % Search class: HGHSM-SMLM32-DHFFFSBN
% 36.14/16.17 % Scheduled 5 strats onto 1 cores with 297 seconds (297 total)
% 36.14/16.17 % Starting SubtermCWHack with 30s (1) cores
% 36.14/16.17 % Preprocessing time : 0.091 s
% 36.14/16.17
% 36.14/16.17 % Proof found!
% 36.14/16.17 % SZS status Theorem
% 36.14/16.17 % SZS output start CNFRefutation
% See solution above
% 36.14/16.17 % Parsed axioms : 11234
% 36.14/16.17 % Removed by relevancy pruning/SinE : 7424
% 36.14/16.17 % Initial clauses : 10298
% 36.14/16.17 % Removed in clause preprocessing : 2316
% 36.14/16.17 % Initial clauses in saturation : 7982
% 36.14/16.17 % Processed clauses : 53559
% 36.14/16.17 % ...of these trivial : 13372
% 36.14/16.17 % ...subsumed : 25985
% 36.14/16.17 % ...remaining for further processing : 14202
% 36.14/16.17 % Other redundant clauses eliminated : 2111
% 36.14/16.17 % Clauses deleted for lack of memory : 0
% 36.14/16.17 % Backward-subsumed : 276
% 36.14/16.17 % Backward-rewritten : 497
% 36.14/16.17 % Generated clauses : 353650
% 36.14/16.17 % ...of the previous two non-redundant : 296164
% 36.14/16.17 % ...aggressively subsumed : 0
% 36.14/16.17 % Contextual simplify-reflections : 56
% 36.14/16.17 % Paramodulations : 351370
% 36.14/16.17 % Factorizations : 32
% 36.14/16.17 % NegExts : 0
% 36.14/16.17 % Equation resolutions : 2203
% 36.14/16.17 % Disequality decompositions : 0
% 36.14/16.17 % Total rewrite steps : 131765
% 36.14/16.17 % ...of those cached : 111905
% 36.14/16.17 % Propositional unsat checks : 0
% 36.14/16.17 % Propositional check models : 0
% 36.14/16.17 % Propositional check unsatisfiable : 0
% 36.14/16.17 % Propositional clauses : 0
% 36.14/16.17 % Propositional clauses after purity: 0
% 36.14/16.17 % Propositional unsat core size : 0
% 36.14/16.17 % Propositional preprocessing time : 0.000
% 36.14/16.17 % Propositional encoding time : 0.000
% 36.14/16.17 % Propositional solver time : 0.000
% 36.14/16.17 % Success case prop preproc time : 0.000
% 36.14/16.17 % Success case prop encoding time : 0.000
% 36.14/16.17 % Success case prop solver time : 0.000
% 36.14/16.17 % Current number of processed clauses : 12778
% 36.14/16.17 % Positive orientable unit clauses : 5274
% 36.14/16.17 % Positive unorientable unit clauses: 45
% 36.14/16.17 % Negative unit clauses : 4234
% 36.14/16.17 % Non-unit-clauses : 3225
% 36.14/16.17 % Current number of unprocessed clauses: 249574
% 36.14/16.17 % ...number of literals in the above : 676693
% 36.14/16.17 % Current number of archived formulas : 0
% 36.14/16.17 % Current number of archived clauses : 777
% 36.14/16.17 % Clause-clause subsumption calls (NU) : 2584875
% 36.14/16.17 % Rec. Clause-clause subsumption calls : 1268570
% 36.14/16.17 % Non-unit clause-clause subsumptions : 4044
% 36.14/16.17 % Unit Clause-clause subsumption calls : 5675656
% 36.14/16.17 % Rewrite failures with RHS unbound : 0
% 36.14/16.17 % BW rewrite match attempts : 22171
% 36.14/16.17 % BW rewrite match successes : 676
% 36.14/16.17 % Condensation attempts : 0
% 36.14/16.17 % Condensation successes : 0
% 36.14/16.17 % Termbank termtop insertions : 5035186
% 36.14/16.17 % Search garbage collected termcells : 206070
% 36.14/16.17
% 36.14/16.17 % -------------------------------------------------
% 36.14/16.17 % User time : 9.784 s
% 36.14/16.17 % System time : 0.244 s
% 36.14/16.17 % Total time : 10.028 s
% 36.14/16.17 % Maximum resident set size: 47808 pages
% 36.14/16.17
% 36.14/16.17 % -------------------------------------------------
% 36.14/16.17 % User time : 11.127 s
% 36.14/16.17 % System time : 0.301 s
% 36.14/16.17 % Total time : 11.428 s
% 36.14/16.17 % Maximum resident set size: 28160 pages
% 36.14/16.17 % E exiting
%------------------------------------------------------------------------------