%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ITP243^3 : 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 : n026.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:53 AM UTC 2026
% Result : Theorem 130.49s 48.03s
% Output : CNFRefutation 130.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 17 ( 14 unt; 0 typ; 0 def)
% Number of atoms : 22 ( 12 equ; 0 cnn)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 126 ( 7 ~; 3 |; 1 &; 114 @)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Number of types : 6 ( 5 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 18 ( 16 usr; 8 con; 0-3 aty)
% Number of variables : 6 ( 0 ^; 6 !; 0 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
nat: $tType ).
thf(decl_sort2,type,
num: $tType ).
thf(decl_sort3,type,
set_nat: $tType ).
thf(decl_sort4,type,
option_nat: $tType ).
thf(decl_sort5,type,
vEBT_VEBT: $tType ).
thf(decl_257,type,
one_one_nat: nat ).
thf(decl_466,type,
suc: nat > nat ).
thf(decl_534,type,
bit0: num > num ).
thf(decl_536,type,
one: num ).
thf(decl_544,type,
numeral_numeral_nat: num > nat ).
thf(decl_553,type,
some_nat: nat > option_nat ).
thf(decl_737,type,
divide_divide_nat: nat > nat > nat ).
thf(decl_880,type,
vEBT_VEBT_high: nat > nat > nat ).
thf(decl_898,type,
vEBT_VEBT_set_vebt: vEBT_VEBT > set_nat ).
thf(decl_916,type,
vEBT_is_succ_in_set: set_nat > nat > nat > $o ).
thf(decl_917,type,
vEBT_vebt_succ: vEBT_VEBT > nat > option_nat ).
thf(decl_940,type,
deg: nat ).
thf(decl_944,type,
na: nat ).
thf(decl_945,type,
sc: nat ).
thf(decl_946,type,
summary: vEBT_VEBT ).
thf(decl_948,type,
xa: nat ).
thf(conj_0,conjecture,
vEBT_is_succ_in_set @ ( vEBT_VEBT_set_vebt @ summary ) @ ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) @ sc,
file('/export/starexec/sandbox/tmp/tmp.AXSvvOt2Rz/E---3.1_1140836.p',conj_0) ).
thf(fact_4__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.AXSvvOt2Rz/E---3.1_1140836.p',fact_4__092_060open_062deg_Adiv_A2_A_061_An_092_060close_062) ).
thf(fact_2717_Suc__1,axiom,
( ( suc @ one_one_nat )
= ( numeral_numeral_nat @ ( bit0 @ one ) ) ),
file('/export/starexec/sandbox/tmp/tmp.AXSvvOt2Rz/E---3.1_1140836.p',fact_2717_Suc__1) ).
thf(fact_0__C4_Ohyps_C_I3_J,axiom,
! [X1: nat,X2: nat] :
( ( ( vEBT_vebt_succ @ summary @ X1 )
= ( some_nat @ X2 ) )
<=> ( vEBT_is_succ_in_set @ ( vEBT_VEBT_set_vebt @ summary ) @ X1 @ X2 ) ),
file('/export/starexec/sandbox/tmp/tmp.AXSvvOt2Rz/E---3.1_1140836.p',fact_0__C4_Ohyps_C_I3_J) ).
thf(fact_1__092_060open_062vebt__succ_Asummary_A_Ihigh_Ax_A_Ideg_Adiv_A2_J_J_A_061_ASome_Asc_092_060close_062,axiom,
( ( vEBT_vebt_succ @ summary @ ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) )
= ( some_nat @ sc ) ),
file('/export/starexec/sandbox/tmp/tmp.AXSvvOt2Rz/E---3.1_1140836.p',fact_1__092_060open_062vebt__succ_Asummary_A_Ihigh_Ax_A_Ideg_Adiv_A2_J_J_A_061_ASome_Asc_092_060close_062) ).
thf(c_0_5,negated_conjecture,
~ ( vEBT_is_succ_in_set @ ( vEBT_VEBT_set_vebt @ summary ) @ ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) @ sc ),
inference(assume_negation,[status(cth)],[conj_0]) ).
thf(c_0_6,negated_conjecture,
~ ( vEBT_is_succ_in_set @ ( vEBT_VEBT_set_vebt @ summary ) @ ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) @ sc ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
thf(c_0_7,plain,
( ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) )
= na ),
inference(split_conjunct,[status(thm)],[fact_4__092_060open_062deg_Adiv_A2_A_061_An_092_060close_062]) ).
thf(c_0_8,plain,
( ( suc @ one_one_nat )
= ( numeral_numeral_nat @ ( bit0 @ one ) ) ),
inference(split_conjunct,[status(thm)],[fact_2717_Suc__1]) ).
thf(c_0_9,negated_conjecture,
~ ( vEBT_is_succ_in_set @ ( vEBT_VEBT_set_vebt @ summary ) @ ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) @ sc ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,plain,
( ( divide_divide_nat @ deg @ ( suc @ one_one_nat ) )
= na ),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_11,plain,
! [X30931: nat,X30932: nat] :
( ( ( ( vEBT_vebt_succ @ summary @ X30931 )
!= ( some_nat @ X30932 ) )
| ( vEBT_is_succ_in_set @ ( vEBT_VEBT_set_vebt @ summary ) @ X30931 @ X30932 ) )
& ( ~ ( vEBT_is_succ_in_set @ ( vEBT_VEBT_set_vebt @ summary ) @ X30931 @ X30932 )
| ( ( vEBT_vebt_succ @ summary @ X30931 )
= ( some_nat @ X30932 ) ) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_0__C4_Ohyps_C_I3_J])]) ).
thf(c_0_12,plain,
( ( vEBT_vebt_succ @ summary @ ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) )
= ( some_nat @ sc ) ),
inference(split_conjunct,[status(thm)],[fact_1__092_060open_062vebt__succ_Asummary_A_Ihigh_Ax_A_Ideg_Adiv_A2_J_J_A_061_ASome_Asc_092_060close_062]) ).
thf(c_0_13,negated_conjecture,
~ ( vEBT_is_succ_in_set @ ( vEBT_VEBT_set_vebt @ summary ) @ ( vEBT_VEBT_high @ xa @ na ) @ sc ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_8]),c_0_10]) ).
thf(c_0_14,plain,
! [X1: nat,X2: nat] :
( ( vEBT_is_succ_in_set @ ( vEBT_VEBT_set_vebt @ summary ) @ X1 @ X2 )
| ( ( vEBT_vebt_succ @ summary @ X1 )
!= ( some_nat @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_15,plain,
( ( vEBT_vebt_succ @ summary @ ( vEBT_VEBT_high @ xa @ na ) )
= ( some_nat @ sc ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_8]),c_0_10]) ).
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.02 % Problem : ITP243^3 : 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.20 % Computer : n026.cluster.edu
% 0.08/0.20 % Model : x86_64 x86_64
% 0.08/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20 % Memory : 8046.5625MB
% 0.08/0.20 % OS : Linux 6.8.0-71-generic
% 0.08/0.20 % CPULimit : 300
% 0.08/0.20 % WCLimit : 300
% 0.08/0.20 % DateTime : Tue Sep 29 20:32:42 UTC 2026
% 0.08/0.20 % CPUTime :
% 0.08/0.20 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.25 Running higher-order theorem proving
% 4.53/4.60 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.AXSvvOt2Rz/E---3.1_1140836.p
% 130.49/48.03 % Version: 3.5.1-ho
% 130.49/48.03 % partial match(1): HMLMSMSMSSLCHFA
% 130.49/48.03 % Preprocessing class: HMLMSMLMSSLCHFA.
% 130.49/48.03 % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 130.49/48.03 % Starting new_ho_10 with 1495s (5) cores
% 130.49/48.03 % Starting sh5l with 299s (1) cores
% 130.49/48.03 % Starting new_bool_1 with 299s (1) cores
% 130.49/48.03 % Starting new_bool_2 with 299s (1) cores
% 130.49/48.03 % new_bool_2 with pid 1141078 completed with status 0
% 130.49/48.03 % Result found by new_bool_2
% 130.49/48.03 % partial match(1): HMLMSMSMSSLCHFA
% 130.49/48.03 % Preprocessing class: HMLMSMLMSSLCHFA.
% 130.49/48.03 % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 130.49/48.03 % Starting new_ho_10 with 1495s (5) cores
% 130.49/48.03 % Starting sh5l with 299s (1) cores
% 130.49/48.03 % Starting new_bool_1 with 299s (1) cores
% 130.49/48.03 % Starting new_bool_2 with 299s (1) cores
% 130.49/48.03 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 130.49/48.03 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 130.49/48.03 % Search class: HGHSM-SMLM32-DHFFFSBN
% 130.49/48.03 % Scheduled 5 strats onto 1 cores with 296 seconds (296 total)
% 130.49/48.03 % Starting SubtermCWHack with 30s (1) cores
% 130.49/48.03 % SubtermCWHack with pid 1141242 completed with status 8
% 130.49/48.03 % Starting new_ho_10 with 178s (1) cores
% 130.49/48.03 % new_ho_10 with pid 1141766 completed with status 0
% 130.49/48.03 % Result found by new_ho_10
% 130.49/48.03 % partial match(1): HMLMSMSMSSLCHFA
% 130.49/48.03 % Preprocessing class: HMLMSMLMSSLCHFA.
% 130.49/48.03 % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 130.49/48.03 % Starting new_ho_10 with 1495s (5) cores
% 130.49/48.03 % Starting sh5l with 299s (1) cores
% 130.49/48.03 % Starting new_bool_1 with 299s (1) cores
% 130.49/48.03 % Starting new_bool_2 with 299s (1) cores
% 130.49/48.03 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 130.49/48.03 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 130.49/48.03 % Search class: HGHSM-SMLM32-DHFFFSBN
% 130.49/48.03 % Scheduled 5 strats onto 1 cores with 296 seconds (296 total)
% 130.49/48.03 % Starting SubtermCWHack with 30s (1) cores
% 130.49/48.03 % SubtermCWHack with pid 1141242 completed with status 8
% 130.49/48.03 % Starting new_ho_10 with 178s (1) cores
% 130.49/48.03 % Preprocessing time : 0.165 s
% 130.49/48.03 % Presaturation interreduction done
% 130.49/48.03
% 130.49/48.03 % Proof found!
% 130.49/48.03 % SZS status Theorem
% 130.49/48.03 % SZS output start CNFRefutation
% See solution above
% 130.49/48.03 % Parsed axioms : 11271
% 130.49/48.03 % Removed by relevancy pruning/SinE : 6753
% 130.49/48.03 % Initial clauses : 11113
% 130.49/48.03 % Removed in clause preprocessing : 2112
% 130.49/48.03 % Initial clauses in saturation : 9001
% 130.49/48.03 % Processed clauses : 10877
% 130.49/48.03 % ...of these trivial : 388
% 130.49/48.03 % ...subsumed : 2358
% 130.49/48.03 % ...remaining for further processing : 8131
% 130.49/48.03 % Other redundant clauses eliminated : 1921
% 130.49/48.03 % Clauses deleted for lack of memory : 0
% 130.49/48.03 % Backward-subsumed : 63
% 130.49/48.03 % Backward-rewritten : 124
% 130.49/48.03 % Generated clauses : 2093
% 130.49/48.03 % ...of the previous two non-redundant : 1572
% 130.49/48.03 % ...aggressively subsumed : 0
% 130.49/48.03 % Contextual simplify-reflections : 116
% 130.49/48.03 % Paramodulations : 493
% 130.49/48.03 % Factorizations : 0
% 130.49/48.03 % NegExts : 0
% 130.49/48.03 % Equation resolutions : 1936
% 130.49/48.03 % Disequality decompositions : 0
% 130.49/48.03 % Total rewrite steps : 8651
% 130.49/48.03 % ...of those cached : 7731
% 172.28/48.03 % Propositional unsat checks : 0
% 172.28/48.03 % Propositional check models : 0
% 172.28/48.03 % Propositional check unsatisfiable : 0
% 172.28/48.03 % Propositional clauses : 0
% 172.28/48.03 % Propositional clauses after purity: 0
% 172.28/48.03 % Propositional unsat core size : 0
% 172.28/48.03 % Propositional preprocessing time : 0.000
% 172.28/48.03 % Propositional encoding time : 0.000
% 172.28/48.03 % Propositional solver time : 0.000
% 172.28/48.03 % Success case prop preproc time : 0.000
% 172.28/48.03 % Success case prop encoding time : 0.000
% 172.28/48.03 % Success case prop solver time : 0.000
% 172.28/48.03 % Current number of processed clauses : 549
% 172.28/48.03 % Positive orientable unit clauses : 241
% 172.28/48.03 % Positive unorientable unit clauses: 0
% 172.28/48.03 % Negative unit clauses : 182
% 172.28/48.03 % Non-unit-clauses : 126
% 172.28/48.03 % Current number of unprocessed clauses: 5552
% 172.28/48.03 % ...number of literals in the above : 20180
% 172.28/48.03 % Current number of archived formulas : 0
% 172.28/48.03 % Current number of archived clauses : 6054
% 172.28/48.03 % Clause-clause subsumption calls (NU) : 20194033
% 172.28/48.03 % Rec. Clause-clause subsumption calls : 1823019
% 172.28/48.03 % Non-unit clause-clause subsumptions : 2152
% 172.28/48.03 % Unit Clause-clause subsumption calls : 30983
% 172.28/48.03 % Rewrite failures with RHS unbound : 0
% 172.28/48.03 % BW rewrite match attempts : 1139
% 172.28/48.03 % BW rewrite match successes : 300
% 172.28/48.03 % Condensation attempts : 10877
% 172.28/48.03 % Condensation successes : 48
% 172.28/48.03 % Termbank termtop insertions : 2956622
% 172.28/48.03 % Search garbage collected termcells : 203421
% 172.28/48.03
% 172.28/48.03 % -------------------------------------------------
% 172.28/48.03 % User time : 40.737 s
% 172.28/48.03 % System time : 0.567 s
% 172.28/48.03 % Total time : 41.305 s
% 172.28/48.03 % Maximum resident set size: 52852 pages
% 172.28/48.03
% 172.28/48.03 % -------------------------------------------------
% 172.28/48.03 % User time : 42.339 s
% 172.28/48.03 % System time : 0.637 s
% 172.28/48.03 % Total time : 42.976 s
% 172.28/48.03 % Maximum resident set size: 30464 pages
% 172.28/48.03 % E exiting
%------------------------------------------------------------------------------