%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : ITP239^1 : TPTP v9.3.1. Bugfixed v9.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n015.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:00 AM UTC 2026
% Result : Theorem 171.64s 60.09s
% Output : CNFRefutation 171.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 18 ( 18 unt; 0 typ; 0 def)
% Number of atoms : 18 ( 8 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 159 ( 4 ~; 0 |; 0 &; 155 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 17 ( 15 usr; 8 con; 0-2 aty)
% Number of variables : 0 ( 0 ^; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
nat: $tType ).
thf(decl_sort2,type,
num: $tType ).
thf(decl_sort3,type,
list_VEBT_VEBT: $tType ).
thf(decl_sort4,type,
vEBT_VEBT: $tType ).
thf(decl_209,type,
one_one_nat: nat ).
thf(decl_380,type,
nth_VEBT_VEBT: list_VEBT_VEBT > nat > vEBT_VEBT ).
thf(decl_406,type,
suc: nat > nat ).
thf(decl_477,type,
bit0: num > num ).
thf(decl_479,type,
one: num ).
thf(decl_487,type,
numeral_numeral_nat: num > nat ).
thf(decl_698,type,
divide_divide_nat: nat > nat > nat ).
thf(decl_843,type,
vEBT_VEBT_high: nat > nat > nat ).
thf(decl_845,type,
vEBT_VEBT_low: nat > nat > nat ).
thf(decl_862,type,
vEBT_vebt_member: vEBT_VEBT > nat > $o ).
thf(decl_919,type,
deg: nat ).
thf(decl_924,type,
na: nat ).
thf(decl_925,type,
pr: nat ).
thf(decl_928,type,
treeList: list_VEBT_VEBT ).
thf(decl_930,type,
za: nat ).
thf(conj_0,conjecture,
vEBT_vebt_member @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ) @ ( vEBT_VEBT_low @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.QgfoyUnefe/E---3.1_4076012.p',conj_0) ).
thf(fact_2_abe,axiom,
vEBT_vebt_member @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ) @ ( vEBT_VEBT_low @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.QgfoyUnefe/E---3.1_4076012.p',fact_2_abe) ).
thf(fact_1019_Suc__1,axiom,
( ( suc @ one_one_nat )
= ( numeral_numeral_nat @ ( bit0 @ one ) ) ),
file('/export/starexec/sandbox/tmp/tmp.QgfoyUnefe/E---3.1_4076012.p',fact_1019_Suc__1) ).
thf(fact_9__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/sandbox/tmp/tmp.QgfoyUnefe/E---3.1_4076012.p',fact_9__092_060open_062deg_Adiv_A2_A_061_An_092_060close_062) ).
thf(fact_0_True,axiom,
( ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) )
= pr ),
file('/export/starexec/sandbox/tmp/tmp.QgfoyUnefe/E---3.1_4076012.p',fact_0_True) ).
thf(c_0_5,negated_conjecture,
~ ( vEBT_vebt_member @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ) @ ( vEBT_VEBT_low @ 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_member @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ) @ ( vEBT_VEBT_low @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
thf(c_0_7,plain,
vEBT_vebt_member @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ) @ ( vEBT_VEBT_low @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ),
inference(split_conjunct,[status(thm)],[fact_2_abe]) ).
thf(c_0_8,plain,
( ( suc @ one_one_nat )
= ( numeral_numeral_nat @ ( bit0 @ one ) ) ),
inference(split_conjunct,[status(thm)],[fact_1019_Suc__1]) ).
thf(c_0_9,plain,
( ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) )
= na ),
inference(split_conjunct,[status(thm)],[fact_9__092_060open_062deg_Adiv_A2_A_061_An_092_060close_062]) ).
thf(c_0_10,plain,
( ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) )
= pr ),
inference(split_conjunct,[status(thm)],[fact_0_True]) ).
thf(c_0_11,negated_conjecture,
~ ( vEBT_vebt_member @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ) @ ( vEBT_VEBT_low @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_12,plain,
vEBT_vebt_member @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( suc @ one_one_nat ) ) ) ) @ ( vEBT_VEBT_low @ za @ ( divide_divide_nat @ deg @ ( suc @ one_one_nat ) ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_8]) ).
thf(c_0_13,plain,
( ( divide_divide_nat @ deg @ ( suc @ one_one_nat ) )
= na ),
inference(rw,[status(thm)],[c_0_9,c_0_8]) ).
thf(c_0_14,plain,
( ( vEBT_VEBT_high @ za @ na )
= pr ),
inference(rw,[status(thm)],[c_0_10,c_0_9]) ).
thf(c_0_15,negated_conjecture,
~ ( vEBT_vebt_member @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ za @ na ) ) @ ( vEBT_VEBT_low @ za @ na ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_9]),c_0_9]) ).
thf(c_0_16,plain,
vEBT_vebt_member @ ( nth_VEBT_VEBT @ treeList @ pr ) @ ( vEBT_VEBT_low @ za @ na ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_13]) ).
thf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_14]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP239^1 : TPTP v9.3.1. Bugfixed v9.2.1.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n015.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 20:31:18 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.25 Running higher-order theorem proving
% 1.99/2.09 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.QgfoyUnefe/E---3.1_4076012.p
% 171.64/60.09 % Version: 3.5.1-ho
% 171.64/60.09 % partial match(1): HMLMSMSMSSLCHFA
% 171.64/60.09 % Preprocessing class: HMLMSMLMSSLCHFA.
% 171.64/60.09 % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 171.64/60.09 % Starting new_ho_10 with 1495s (5) cores
% 171.64/60.09 % Starting sh5l with 299s (1) cores
% 171.64/60.09 % Starting new_bool_1 with 299s (1) cores
% 171.64/60.09 % Starting new_bool_2 with 299s (1) cores
% 171.64/60.09 % new_bool_2 with pid 4076034 completed with status 0
% 171.64/60.09 % Result found by new_bool_2
% 171.64/60.09 % partial match(1): HMLMSMSMSSLCHFA
% 171.64/60.09 % Preprocessing class: HMLMSMLMSSLCHFA.
% 171.64/60.09 % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 171.64/60.09 % Starting new_ho_10 with 1495s (5) cores
% 171.64/60.09 % Starting sh5l with 299s (1) cores
% 171.64/60.09 % Starting new_bool_1 with 299s (1) cores
% 171.64/60.09 % Starting new_bool_2 with 299s (1) cores
% 171.64/60.09 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 171.64/60.09 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 171.64/60.09 % Search class: HGHSM-SMLM32-DHFFFFBN
% 171.64/60.09 % partial match(1): HGHSM-SMLM32-DHFFFSBN
% 171.64/60.09 % Scheduled 5 strats onto 1 cores with 297 seconds (297 total)
% 171.64/60.09 % Starting SubtermCWHack with 30s (1) cores
% 171.64/60.09 % SubtermCWHack with pid 4076039 completed with status 8
% 171.64/60.09 % Starting new_ho_10 with 179s (1) cores
% 171.64/60.09 % new_ho_10 with pid 4076097 completed with status 0
% 171.64/60.09 % Result found by new_ho_10
% 171.64/60.09 % partial match(1): HMLMSMSMSSLCHFA
% 171.64/60.09 % Preprocessing class: HMLMSMLMSSLCHFA.
% 171.64/60.09 % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 171.64/60.09 % Starting new_ho_10 with 1495s (5) cores
% 171.64/60.09 % Starting sh5l with 299s (1) cores
% 171.64/60.09 % Starting new_bool_1 with 299s (1) cores
% 171.64/60.09 % Starting new_bool_2 with 299s (1) cores
% 171.64/60.09 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 171.64/60.09 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 171.64/60.09 % Search class: HGHSM-SMLM32-DHFFFFBN
% 171.64/60.09 % partial match(1): HGHSM-SMLM32-DHFFFSBN
% 171.64/60.09 % Scheduled 5 strats onto 1 cores with 297 seconds (297 total)
% 171.64/60.09 % Starting SubtermCWHack with 30s (1) cores
% 171.64/60.09 % SubtermCWHack with pid 4076039 completed with status 8
% 171.64/60.09 % Starting new_ho_10 with 179s (1) cores
% 171.64/60.09 % Preprocessing time : 0.292 s
% 171.64/60.09 % Presaturation interreduction done
% 171.64/60.09
% 171.64/60.09 % Proof found!
% 171.64/60.09 % SZS status Theorem
% 171.64/60.09 % SZS output start CNFRefutation
% See solution above
% 171.64/60.09 % Parsed axioms : 11244
% 171.64/60.09 % Removed by relevancy pruning/SinE : 7135
% 171.64/60.09 % Initial clauses : 11379
% 171.64/60.09 % Removed in clause preprocessing : 2021
% 171.64/60.09 % Initial clauses in saturation : 9358
% 171.64/60.09 % Processed clauses : 11623
% 171.64/60.09 % ...of these trivial : 343
% 171.64/60.09 % ...subsumed : 3140
% 171.64/60.09 % ...remaining for further processing : 8139
% 171.64/60.09 % Other redundant clauses eliminated : 2959
% 171.64/60.09 % Clauses deleted for lack of memory : 0
% 171.64/60.09 % Backward-subsumed : 56
% 171.64/60.09 % Backward-rewritten : 111
% 171.64/60.09 % Generated clauses : 2591
% 171.64/60.09 % ...of the previous two non-redundant : 2224
% 171.64/60.09 % ...aggressively subsumed : 0
% 171.64/60.09 % Contextual simplify-reflections : 124
% 171.64/60.09 % Paramodulations : 7
% 171.64/60.09 % Factorizations : 0
% 171.64/60.09 % NegExts : 0
% 171.64/60.09 % Equation resolutions : 2959
% 171.64/60.09 % Disequality decompositions : 0
% 171.64/60.09 % Total rewrite steps : 19745
% 171.64/60.09 % ...of those cached : 18904
% 171.64/60.09 % Propositional unsat checks : 0
% 171.64/60.09 % Propositional check models : 0
% 171.64/60.09 % Propositional check unsatisfiable : 0
% 171.64/60.09 % Propositional clauses : 0
% 171.64/60.09 % Propositional clauses after purity: 0
% 171.64/60.09 % Propositional unsat core size : 0
% 171.64/60.09 % Propositional preprocessing time : 0.000
% 171.64/60.09 % Propositional encoding time : 0.000
% 171.64/60.09 % Propositional solver time : 0.000
% 171.64/60.09 % Success case prop preproc time : 0.000
% 171.64/60.09 % Success case prop encoding time : 0.000
% 171.64/60.09 % Success case prop solver time : 0.000
% 171.64/60.09 % Current number of processed clauses : 44
% 171.64/60.09 % Positive orientable unit clauses : 14
% 171.64/60.09 % Positive unorientable unit clauses: 0
% 171.64/60.09 % Negative unit clauses : 30
% 171.64/60.09 % Non-unit-clauses : 0
% 171.64/60.09 % Current number of unprocessed clauses: 5304
% 171.64/60.09 % ...number of literals in the above : 18665
% 171.64/60.09 % Current number of archived formulas : 0
% 171.64/60.09 % Current number of archived clauses : 5512
% 171.64/60.09 % Clause-clause subsumption calls (NU) : 31140517
% 171.64/60.09 % Rec. Clause-clause subsumption calls : 1796704
% 171.64/60.09 % Non-unit clause-clause subsumptions : 3104
% 171.64/60.09 % Unit Clause-clause subsumption calls : 26383
% 171.64/60.09 % Rewrite failures with RHS unbound : 0
% 171.64/60.09 % BW rewrite match attempts : 892
% 171.64/60.09 % BW rewrite match successes : 287
% 171.64/60.09 % Condensation attempts : 11624
% 171.64/60.09 % Condensation successes : 48
% 171.64/60.09 % Termbank termtop insertions : 3286827
% 171.64/60.09 % Search garbage collected termcells : 200299
% 171.64/60.09
% 171.64/60.09 % -------------------------------------------------
% 171.64/60.09 % User time : 55.317 s
% 171.64/60.09 % System time : 0.553 s
% 171.64/60.09 % Total time : 55.870 s
% 171.64/60.09 % Maximum resident set size: 52988 pages
% 171.64/60.09
% 171.64/60.09 % -------------------------------------------------
% 171.64/60.09 % User time : 56.915 s
% 171.64/60.09 % System time : 0.612 s
% 171.64/60.09 % Total time : 57.527 s
% 171.64/60.09 % Maximum resident set size: 30976 pages
% 171.64/60.09 % E exiting
%------------------------------------------------------------------------------