%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ITP262^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 : n014.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:58 AM UTC 2026
% Result : Theorem 131.24s 46.68s
% Output : CNFRefutation 131.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 25 ( 17 unt; 0 typ; 0 def)
% Number of atoms : 40 ( 13 equ; 0 cnn)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 310 ( 15 ~; 10 |; 2 &; 280 @)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Number of types : 6 ( 5 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 25 ( 23 usr; 9 con; 0-3 aty)
% Number of variables : 16 ( 0 ^; 13 !; 3 ?; 16 :)
% 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,
option_nat: $tType ).
thf(decl_sort5,type,
vEBT_VEBT: $tType ).
thf(decl_204,type,
one_one_nat: nat ).
thf(decl_342,type,
list_u1324408373059187874T_VEBT: list_VEBT_VEBT > nat > vEBT_VEBT > list_VEBT_VEBT ).
thf(decl_359,type,
nth_VEBT_VEBT: list_VEBT_VEBT > nat > vEBT_VEBT ).
thf(decl_382,type,
suc: nat > nat ).
thf(decl_411,type,
size_s6755466524823107622T_VEBT: list_VEBT_VEBT > nat ).
thf(decl_446,type,
bit0: num > num ).
thf(decl_448,type,
one: num ).
thf(decl_456,type,
numeral_numeral_nat: num > nat ).
thf(decl_465,type,
some_nat: nat > option_nat ).
thf(decl_493,type,
ord_less_nat: nat > nat > $o ).
thf(decl_553,type,
power_power_nat: nat > nat > nat ).
thf(decl_768,type,
vEBT_V8194947554948674370ptions: vEBT_VEBT > nat > $o ).
thf(decl_769,type,
vEBT_VEBT_high: nat > nat > nat ).
thf(decl_771,type,
vEBT_VEBT_low: nat > nat > nat ).
thf(decl_782,type,
vEBT_vebt_delete: vEBT_VEBT > nat > vEBT_VEBT ).
thf(decl_803,type,
vEBT_vebt_maxt: vEBT_VEBT > option_nat ).
thf(decl_837,type,
m: nat ).
thf(decl_839,type,
maxs: nat ).
thf(decl_841,type,
na: nat ).
thf(decl_842,type,
summary: vEBT_VEBT ).
thf(decl_843,type,
treeList: list_VEBT_VEBT ).
thf(decl_844,type,
xa: nat ).
thf(decl_1177,type,
esk304_1: nat > nat ).
thf(conj_0,conjecture,
? [X27: nat] : ( vEBT_V8194947554948674370ptions @ ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) @ ( vEBT_vebt_delete @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ) ) ) @ maxs ) @ X27 ),
file('/export/starexec/sandbox/tmp/tmp.BhsNOT4E2F/E---3.1_3188804.p',conj_0) ).
thf(fact_26__C111_C,axiom,
! [X7: nat] :
( ( ord_less_nat @ X7 @ ( power_power_nat @ ( numeral_numeral_nat @ ( bit0 @ one ) ) @ m ) )
=> ( ? [X8: nat] : ( vEBT_V8194947554948674370ptions @ ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) @ ( vEBT_vebt_delete @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ) ) ) @ X7 ) @ X8 )
<=> ( vEBT_V8194947554948674370ptions @ ( vEBT_vebt_delete @ summary @ ( vEBT_VEBT_high @ xa @ na ) ) @ X7 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.BhsNOT4E2F/E---3.1_3188804.p',fact_26__C111_C) ).
thf(fact_36__C2_C,axiom,
( ( size_s6755466524823107622T_VEBT @ treeList )
= ( power_power_nat @ ( numeral_numeral_nat @ ( bit0 @ one ) ) @ m ) ),
file('/export/starexec/sandbox/tmp/tmp.BhsNOT4E2F/E---3.1_3188804.p',fact_36__C2_C) ).
thf(fact_2830_Suc__1,axiom,
( ( suc @ one_one_nat )
= ( numeral_numeral_nat @ ( bit0 @ one ) ) ),
file('/export/starexec/sandbox/tmp/tmp.BhsNOT4E2F/E---3.1_3188804.p',fact_2830_Suc__1) ).
thf(fact_2__C8_C,axiom,
na = m,
file('/export/starexec/sandbox/tmp/tmp.BhsNOT4E2F/E---3.1_3188804.p',fact_2__C8_C) ).
thf(fact_10_bb,axiom,
( ( maxs
!= ( vEBT_VEBT_high @ xa @ na ) )
& ( ord_less_nat @ maxs @ ( power_power_nat @ ( numeral_numeral_nat @ ( bit0 @ one ) ) @ m ) ) ),
file('/export/starexec/sandbox/tmp/tmp.BhsNOT4E2F/E---3.1_3188804.p',fact_10_bb) ).
thf(fact_854_maxbmo,axiom,
! [X3: vEBT_VEBT,X1: nat] :
( ( ( vEBT_vebt_maxt @ X3 )
= ( some_nat @ X1 ) )
=> ( vEBT_V8194947554948674370ptions @ X3 @ X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.BhsNOT4E2F/E---3.1_3188804.p',fact_854_maxbmo) ).
thf(fact_837__092_060open_062Some_Amaxs_A_061_Avebt__maxt_A_Ivebt__delete_Asummary_A_Ihigh_Ax_An_J_J_092_060close_062,axiom,
( ( some_nat @ maxs )
= ( vEBT_vebt_maxt @ ( vEBT_vebt_delete @ summary @ ( vEBT_VEBT_high @ xa @ na ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.BhsNOT4E2F/E---3.1_3188804.p',fact_837__092_060open_062Some_Amaxs_A_061_Avebt__maxt_A_Ivebt__delete_Asummary_A_Ihigh_Ax_An_J_J_092_060close_062) ).
thf(c_0_8,negated_conjecture,
~ ? [X27: nat] : ( vEBT_V8194947554948674370ptions @ ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) @ ( vEBT_vebt_delete @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ) ) ) @ maxs ) @ X27 ),
inference(assume_negation,[status(cth)],[conj_0]) ).
thf(c_0_9,plain,
! [X29035: nat,X29036: nat] :
( ( ~ ( vEBT_V8194947554948674370ptions @ ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) @ ( vEBT_vebt_delete @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ) ) ) @ X29035 ) @ X29036 )
| ( vEBT_V8194947554948674370ptions @ ( vEBT_vebt_delete @ summary @ ( vEBT_VEBT_high @ xa @ na ) ) @ X29035 )
| ~ ( ord_less_nat @ X29035 @ ( power_power_nat @ ( numeral_numeral_nat @ ( bit0 @ one ) ) @ m ) ) )
& ( ~ ( vEBT_V8194947554948674370ptions @ ( vEBT_vebt_delete @ summary @ ( vEBT_VEBT_high @ xa @ na ) ) @ X29035 )
| ( vEBT_V8194947554948674370ptions @ ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) @ ( vEBT_vebt_delete @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ) ) ) @ X29035 ) @ ( esk304_1 @ X29035 ) )
| ~ ( ord_less_nat @ X29035 @ ( power_power_nat @ ( numeral_numeral_nat @ ( bit0 @ one ) ) @ m ) ) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_26__C111_C])])])])]) ).
thf(c_0_10,plain,
( ( size_s6755466524823107622T_VEBT @ treeList )
= ( power_power_nat @ ( numeral_numeral_nat @ ( bit0 @ one ) ) @ m ) ),
inference(split_conjunct,[status(thm)],[fact_36__C2_C]) ).
thf(c_0_11,plain,
( ( suc @ one_one_nat )
= ( numeral_numeral_nat @ ( bit0 @ one ) ) ),
inference(split_conjunct,[status(thm)],[fact_2830_Suc__1]) ).
thf(c_0_12,plain,
na = m,
inference(split_conjunct,[status(thm)],[fact_2__C8_C]) ).
thf(c_0_13,negated_conjecture,
! [X26703: nat] :
~ ( vEBT_V8194947554948674370ptions @ ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) @ ( vEBT_vebt_delete @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ) ) ) @ maxs ) @ X26703 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])]) ).
thf(c_0_14,plain,
! [X1: nat] :
( ( vEBT_V8194947554948674370ptions @ ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) @ ( vEBT_vebt_delete @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ) ) ) @ X1 ) @ ( esk304_1 @ X1 ) )
| ~ ( vEBT_V8194947554948674370ptions @ ( vEBT_vebt_delete @ summary @ ( vEBT_VEBT_high @ xa @ na ) ) @ X1 )
| ~ ( ord_less_nat @ X1 @ ( power_power_nat @ ( numeral_numeral_nat @ ( bit0 @ one ) ) @ m ) ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_15,plain,
( ( power_power_nat @ ( suc @ one_one_nat ) @ na )
= ( size_s6755466524823107622T_VEBT @ treeList ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
thf(c_0_16,plain,
ord_less_nat @ maxs @ ( power_power_nat @ ( numeral_numeral_nat @ ( bit0 @ one ) ) @ m ),
inference(split_conjunct,[status(thm)],[fact_10_bb]) ).
thf(c_0_17,negated_conjecture,
! [X1: nat] :
~ ( vEBT_V8194947554948674370ptions @ ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) @ ( vEBT_vebt_delete @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ) ) ) @ maxs ) @ X1 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_18,plain,
! [X1: nat] :
( ( vEBT_V8194947554948674370ptions @ ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) @ ( vEBT_vebt_delete @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ) ) ) @ X1 ) @ ( esk304_1 @ X1 ) )
| ~ ( vEBT_V8194947554948674370ptions @ ( vEBT_vebt_delete @ summary @ ( vEBT_VEBT_high @ xa @ na ) ) @ X1 )
| ~ ( ord_less_nat @ X1 @ ( size_s6755466524823107622T_VEBT @ treeList ) ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_11]),c_0_12]),c_0_15]) ).
thf(c_0_19,plain,
ord_less_nat @ maxs @ ( size_s6755466524823107622T_VEBT @ treeList ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_11]),c_0_12]),c_0_15]) ).
thf(c_0_20,plain,
! [X26728: vEBT_VEBT,X26729: nat] :
( ( ( vEBT_vebt_maxt @ X26728 )
!= ( some_nat @ X26729 ) )
| ( vEBT_V8194947554948674370ptions @ X26728 @ X26729 ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_854_maxbmo])]) ).
thf(c_0_21,negated_conjecture,
~ ( vEBT_V8194947554948674370ptions @ ( vEBT_vebt_delete @ summary @ ( vEBT_VEBT_high @ xa @ na ) ) @ maxs ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
thf(c_0_22,plain,
! [X3: vEBT_VEBT,X1: nat] :
( ( vEBT_V8194947554948674370ptions @ X3 @ X1 )
| ( ( vEBT_vebt_maxt @ X3 )
!= ( some_nat @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_23,plain,
( ( some_nat @ maxs )
= ( vEBT_vebt_maxt @ ( vEBT_vebt_delete @ summary @ ( vEBT_VEBT_high @ xa @ na ) ) ) ),
inference(split_conjunct,[status(thm)],[fact_837__092_060open_062Some_Amaxs_A_061_Avebt__maxt_A_Ivebt__delete_Asummary_A_Ihigh_Ax_An_J_J_092_060close_062]) ).
thf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP262^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.09/0.18 % Computer : n014.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Tue Sep 29 20:42:44 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 Running higher-order theorem proving
% 2.56/2.63 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.BhsNOT4E2F/E---3.1_3188804.p
% 131.24/46.68 % Version: 3.5.1-ho
% 131.24/46.68 % partial match(1): HMLMSMSMSSLCHFA
% 131.24/46.68 % Preprocessing class: HMLMSMLMSSLCHFA.
% 131.24/46.68 % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 131.24/46.68 % Starting new_ho_10 with 1495s (5) cores
% 131.24/46.68 % Starting sh5l with 299s (1) cores
% 131.24/46.68 % Starting new_bool_1 with 299s (1) cores
% 131.24/46.68 % Starting new_bool_2 with 299s (1) cores
% 131.24/46.68 % new_bool_2 with pid 3188821 completed with status 0
% 131.24/46.68 % Result found by new_bool_2
% 131.24/46.68 % partial match(1): HMLMSMSMSSLCHFA
% 131.24/46.68 % Preprocessing class: HMLMSMLMSSLCHFA.
% 131.24/46.68 % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 131.24/46.68 % Starting new_ho_10 with 1495s (5) cores
% 131.24/46.68 % Starting sh5l with 299s (1) cores
% 131.24/46.68 % Starting new_bool_1 with 299s (1) cores
% 131.24/46.68 % Starting new_bool_2 with 299s (1) cores
% 131.24/46.68 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 131.24/46.68 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 131.24/46.68 % Search class: HGHSM-SMLM32-DHFFFSBN
% 131.24/46.68 % Scheduled 5 strats onto 1 cores with 298 seconds (298 total)
% 131.24/46.68 % Starting SubtermCWHack with 30s (1) cores
% 131.24/46.68 % SubtermCWHack with pid 3188822 completed with status 8
% 131.24/46.68 % Starting new_ho_10 with 179s (1) cores
% 131.24/46.68 % new_ho_10 with pid 3188824 completed with status 0
% 131.24/46.68 % Result found by new_ho_10
% 131.24/46.68 % partial match(1): HMLMSMSMSSLCHFA
% 131.24/46.68 % Preprocessing class: HMLMSMLMSSLCHFA.
% 131.24/46.68 % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 131.24/46.68 % Starting new_ho_10 with 1495s (5) cores
% 131.24/46.68 % Starting sh5l with 299s (1) cores
% 131.24/46.68 % Starting new_bool_1 with 299s (1) cores
% 131.24/46.68 % Starting new_bool_2 with 299s (1) cores
% 131.24/46.68 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 131.24/46.68 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 131.24/46.68 % Search class: HGHSM-SMLM32-DHFFFSBN
% 131.24/46.68 % Scheduled 5 strats onto 1 cores with 298 seconds (298 total)
% 131.24/46.68 % Starting SubtermCWHack with 30s (1) cores
% 131.24/46.68 % SubtermCWHack with pid 3188822 completed with status 8
% 131.24/46.68 % Starting new_ho_10 with 179s (1) cores
% 131.24/46.68 % Preprocessing time : 0.260 s
% 131.24/46.68 % Presaturation interreduction done
% 131.24/46.68
% 131.24/46.68 % Proof found!
% 131.24/46.68 % SZS status Theorem
% 131.24/46.68 % SZS output start CNFRefutation
% See solution above
% 131.24/46.68 % Parsed axioms : 11165
% 131.24/46.68 % Removed by relevancy pruning/SinE : 7640
% 131.24/46.68 % Initial clauses : 9056
% 131.24/46.68 % Removed in clause preprocessing : 1960
% 131.24/46.68 % Initial clauses in saturation : 7096
% 131.24/46.68 % Processed clauses : 10346
% 131.24/46.68 % ...of these trivial : 373
% 131.24/46.68 % ...subsumed : 2279
% 131.24/46.68 % ...remaining for further processing : 7694
% 131.24/46.68 % Other redundant clauses eliminated : 1694
% 131.24/46.68 % Clauses deleted for lack of memory : 0
% 131.24/46.68 % Backward-subsumed : 39
% 131.24/46.68 % Backward-rewritten : 102
% 131.24/46.68 % Generated clauses : 17239
% 131.24/46.68 % ...of the previous two non-redundant : 13341
% 131.24/46.68 % ...aggressively subsumed : 0
% 131.24/46.68 % Contextual simplify-reflections : 100
% 131.24/46.68 % Paramodulations : 15661
% 131.24/46.68 % Factorizations : 7
% 131.24/46.68 % NegExts : 0
% 131.24/46.68 % Equation resolutions : 1728
% 131.24/46.68 % Disequality decompositions : 0
% 131.24/46.68 % Total rewrite steps : 10501
% 131.24/46.68 % ...of those cached : 9067
% 131.24/46.68 % Propositional unsat checks : 0
% 131.24/46.68 % Propositional check models : 0
% 131.24/46.68 % Propositional check unsatisfiable : 0
% 131.24/46.68 % Propositional clauses : 0
% 131.24/46.68 % Propositional clauses after purity: 0
% 131.24/46.68 % Propositional unsat core size : 0
% 131.24/46.68 % Propositional preprocessing time : 0.000
% 131.24/46.68 % Propositional encoding time : 0.000
% 131.24/46.68 % Propositional solver time : 0.000
% 131.24/46.68 % Success case prop preproc time : 0.000
% 131.24/46.68 % Success case prop encoding time : 0.000
% 131.24/46.68 % Success case prop solver time : 0.000
% 131.24/46.68 % Current number of processed clauses : 1692
% 131.24/46.68 % Positive orientable unit clauses : 613
% 131.24/46.68 % Positive unorientable unit clauses: 11
% 131.24/46.68 % Negative unit clauses : 178
% 131.24/46.68 % Non-unit-clauses : 890
% 131.24/46.68 % Current number of unprocessed clauses: 14954
% 131.24/46.68 % ...number of literals in the above : 41423
% 131.24/46.68 % Current number of archived formulas : 0
% 131.24/46.68 % Current number of archived clauses : 5038
% 131.24/46.68 % Clause-clause subsumption calls (NU) : 12073687
% 131.24/46.68 % Rec. Clause-clause subsumption calls : 1213228
% 131.24/46.68 % Non-unit clause-clause subsumptions : 1634
% 131.24/46.68 % Unit Clause-clause subsumption calls : 43058
% 131.24/46.68 % Rewrite failures with RHS unbound : 0
% 131.24/46.68 % BW rewrite match attempts : 1258
% 131.24/46.68 % BW rewrite match successes : 348
% 131.24/46.68 % Condensation attempts : 10346
% 131.24/46.68 % Condensation successes : 39
% 131.24/46.68 % Termbank termtop insertions : 2861600
% 131.24/46.68 % Search garbage collected termcells : 184706
% 131.24/46.68
% 131.24/46.68 % -------------------------------------------------
% 131.24/46.68 % User time : 41.926 s
% 131.24/46.68 % System time : 0.424 s
% 131.24/46.68 % Total time : 42.350 s
% 131.24/46.68 % Maximum resident set size: 48208 pages
% 131.24/46.68
% 131.24/46.68 % -------------------------------------------------
% 131.24/46.68 % User time : 43.391 s
% 131.24/46.68 % System time : 0.470 s
% 131.24/46.68 % Total time : 43.861 s
% 131.24/46.68 % Maximum resident set size: 29184 pages
% 131.24/46.68 % E exiting
%------------------------------------------------------------------------------