↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : NUM924_3 : TPTP v9.3.1. Released v5.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n006.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 : Thu Sep 24 01:51:00 PM UTC 2026

% Result   : Theorem 0.16s 0.85s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   35 (  35 unt;   0 typ;   0 def)
%            Number of atoms       :   35 (  24 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    6 (   6   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :   13 (   3 avg)
%            Number of types       :    8 (   7 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   18 (  18 usr;   7 con; 0-2 aty)
%            Number of variables   :   22 (   0 sgn  22   !;   0   ?;  22   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_sort1,type,
    fun_int_bool: $tType ).

tff(decl_sort2,type,
    fun_int_int: $tType ).

tff(decl_sort3,type,
    fun_int_fun_int_bool: $tType ).

tff(decl_sort4,type,
    int: $tType ).

tff(decl_sort5,type,
    nat: $tType ).

tff(decl_sort6,type,
    fun_nat_int: $tType ).

tff(decl_sort7,type,
    bool: $tType ).

tff(decl_31,type,
    one_one_int: int ).

tff(decl_34,type,
    plus_plus_int: int > fun_int_int ).

tff(decl_37,type,
    times_times_int: int > fun_int_int ).

tff(decl_40,type,
    zero_zero_int: int ).

tff(decl_48,type,
    bit0: int > int ).

tff(decl_49,type,
    bit1: int > int ).

tff(decl_51,type,
    pls: int ).

tff(decl_52,type,
    number_number_of_int: int > int ).

tff(decl_53,type,
    number_number_of_nat: int > nat ).

tff(decl_55,type,
    ord_less_int: fun_int_fun_int_bool ).

tff(decl_61,type,
    power_power_int: int > fun_nat_int ).

tff(decl_80,type,
    hAPP_int_bool: ( int * fun_int_bool ) > bool ).

tff(decl_81,type,
    hAPP_int_int: ( int * fun_int_int ) > int ).

tff(decl_83,type,
    hAPP_i1948725293t_bool: ( int * fun_int_fun_int_bool ) > fun_int_bool ).

tff(decl_85,type,
    hAPP_nat_int: ( nat * fun_nat_int ) > int ).

tff(decl_92,type,
    hBOOL: bool > $o ).

tff(decl_94,type,
    m: int ).

tff(decl_96,type,
    s: int ).

tff(decl_97,type,
    t: int ).

tff(fact_34_number__of__is__id,axiom,
    ! [X20: int] : ( number_number_of_int(X20) = X20 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_34_number__of__is__id) ).

tff(conj_0,conjecture,
    hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,hAPP_int_int(plus_plus_int(hAPP_nat_int(power_power_int(s),number_number_of_nat(bit0(bit1(pls))))),one_one_int)),zero_zero_int)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).

tff(fact_285_comm__semiring__1__class_Onormalizing__semiring__rules_I29_J,axiom,
    ! [X204: int] : ( hAPP_int_int(times_times_int(X204),X204) = hAPP_nat_int(power_power_int(X204),number_number_of_nat(bit0(bit1(pls)))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_285_comm__semiring__1__class_Onormalizing__semiring__rules_I29_J) ).

tff(fact_160_one__is__num__one,axiom,
    one_one_int = number_number_of_int(bit1(pls)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_160_one__is__num__one) ).

tff(fact_172_Pls__def,axiom,
    pls = zero_zero_int,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_172_Pls__def) ).

tff(fact_134_zadd__commute,axiom,
    ! [X21: int,X19: int] : ( hAPP_int_int(plus_plus_int(X21),X19) = hAPP_int_int(plus_plus_int(X19),X21) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_134_zadd__commute) ).

tff(fact_35_zmult__commute,axiom,
    ! [X21: int,X19: int] : ( hAPP_int_int(times_times_int(X21),X19) = hAPP_int_int(times_times_int(X19),X21) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_35_zmult__commute) ).

tff(fact_3_t,axiom,
    hAPP_int_int(plus_plus_int(hAPP_nat_int(power_power_int(s),number_number_of_nat(bit0(bit1(pls))))),one_one_int) = hAPP_int_int(times_times_int(hAPP_int_int(plus_plus_int(hAPP_int_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls))))),m)),one_one_int)),t),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_3_t) ).

tff(fact_367_comm__semiring__1__class_Onormalizing__semiring__rules_I10_J,axiom,
    ! [X383: int] : ( hAPP_int_int(times_times_int(X383),zero_zero_int) = zero_zero_int ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_367_comm__semiring__1__class_Onormalizing__semiring__rules_I10_J) ).

tff(fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096,axiom,
    hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,hAPP_int_int(times_times_int(hAPP_int_int(plus_plus_int(hAPP_int_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls))))),m)),one_one_int)),t)),hAPP_int_int(times_times_int(hAPP_int_int(plus_plus_int(hAPP_int_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls))))),m)),one_one_int)),zero_zero_int))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096) ).

tff(c_0_10,plain,
    ! [X2369: int] : ( number_number_of_int(X2369) = X2369 ),
    inference(variable_rename,[status(thm)],[fact_34_number__of__is__id]) ).

tff(c_0_11,negated_conjecture,
    ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,hAPP_int_int(plus_plus_int(hAPP_nat_int(power_power_int(s),number_number_of_nat(bit0(bit1(pls))))),one_one_int)),zero_zero_int)),
    inference(assume_negation,[status(cth)],[conj_0]) ).

tff(c_0_12,plain,
    ! [X2153: int] : ( hAPP_int_int(times_times_int(X2153),X2153) = hAPP_nat_int(power_power_int(X2153),number_number_of_nat(bit0(bit1(pls)))) ),
    inference(variable_rename,[status(thm)],[fact_285_comm__semiring__1__class_Onormalizing__semiring__rules_I29_J]) ).

tcf(c_0_13,plain,
    one_one_int = number_number_of_int(bit1(pls)),
    inference(split_conjunct,[status(thm)],[fact_160_one__is__num__one]) ).

tcf(c_0_14,plain,
    pls = zero_zero_int,
    inference(split_conjunct,[status(thm)],[fact_172_Pls__def]) ).

tcf(c_0_15,plain,
    ! [X3: int] : number_number_of_int(X3) = X3,
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

tff(c_0_16,negated_conjecture,
    ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,hAPP_int_int(plus_plus_int(hAPP_nat_int(power_power_int(s),number_number_of_nat(bit0(bit1(pls))))),one_one_int)),zero_zero_int)),
    inference(fof_simplification,[status(thm)],[c_0_11]) ).

tcf(c_0_17,plain,
    ! [X3: int] : hAPP_int_int(times_times_int(X3),X3) = hAPP_nat_int(power_power_int(X3),number_number_of_nat(bit0(bit1(pls)))),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

tcf(c_0_18,plain,
    bit1(zero_zero_int) = one_one_int,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).

tff(c_0_19,plain,
    ! [X1990: int,X1991: int] : ( hAPP_int_int(plus_plus_int(X1990),X1991) = hAPP_int_int(plus_plus_int(X1991),X1990) ),
    inference(variable_rename,[status(thm)],[fact_134_zadd__commute]) ).

tff(c_0_20,plain,
    ! [X2319: int,X2320: int] : ( hAPP_int_int(times_times_int(X2319),X2320) = hAPP_int_int(times_times_int(X2320),X2319) ),
    inference(variable_rename,[status(thm)],[fact_35_zmult__commute]) ).

tff(c_0_21,negated_conjecture,
    ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,hAPP_int_int(plus_plus_int(hAPP_nat_int(power_power_int(s),number_number_of_nat(bit0(bit1(pls))))),one_one_int)),zero_zero_int)),
    inference(fof_nnf,[status(thm)],[c_0_16]) ).

tcf(c_0_22,plain,
    hAPP_int_int(plus_plus_int(hAPP_nat_int(power_power_int(s),number_number_of_nat(bit0(bit1(pls))))),one_one_int) = hAPP_int_int(times_times_int(hAPP_int_int(plus_plus_int(hAPP_int_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls))))),m)),one_one_int)),t),
    inference(split_conjunct,[status(thm)],[fact_3_t]) ).

tcf(c_0_23,plain,
    ! [X3: int] : hAPP_int_int(times_times_int(X3),X3) = hAPP_nat_int(power_power_int(X3),number_number_of_nat(bit0(one_one_int))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_14]),c_0_18]) ).

tcf(c_0_24,plain,
    ! [X4: int,X3: int] : hAPP_int_int(plus_plus_int(X3),X4) = hAPP_int_int(plus_plus_int(X4),X3),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

tcf(c_0_25,plain,
    ! [X4: int,X3: int] : hAPP_int_int(times_times_int(X3),X4) = hAPP_int_int(times_times_int(X4),X3),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

tff(c_0_26,plain,
    ! [X1749: int] : ( hAPP_int_int(times_times_int(X1749),zero_zero_int) = zero_zero_int ),
    inference(variable_rename,[status(thm)],[fact_367_comm__semiring__1__class_Onormalizing__semiring__rules_I10_J]) ).

tcf(c_0_27,negated_conjecture,
    ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,hAPP_int_int(plus_plus_int(hAPP_nat_int(power_power_int(s),number_number_of_nat(bit0(bit1(pls))))),one_one_int)),zero_zero_int)),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

tcf(c_0_28,plain,
    hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,hAPP_int_int(times_times_int(hAPP_int_int(plus_plus_int(hAPP_int_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls))))),m)),one_one_int)),t)),hAPP_int_int(times_times_int(hAPP_int_int(plus_plus_int(hAPP_int_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls))))),m)),one_one_int)),zero_zero_int))),
    inference(split_conjunct,[status(thm)],[fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096]) ).

tcf(c_0_29,plain,
    hAPP_int_int(times_times_int(t),hAPP_int_int(plus_plus_int(one_one_int),hAPP_int_int(times_times_int(m),bit0(bit0(one_one_int))))) = hAPP_int_int(plus_plus_int(one_one_int),hAPP_int_int(times_times_int(s),s)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_14]),c_0_18]),c_0_23]),c_0_24]),c_0_14]),c_0_18]),c_0_15]),c_0_25]),c_0_24]),c_0_25]) ).

tcf(c_0_30,plain,
    ! [X3: int] : hAPP_int_int(times_times_int(X3),zero_zero_int) = zero_zero_int,
    inference(split_conjunct,[status(thm)],[c_0_26]) ).

tcf(c_0_31,negated_conjecture,
    ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,hAPP_int_int(plus_plus_int(hAPP_nat_int(power_power_int(s),number_number_of_nat(bit0(bit1(zero_zero_int))))),one_one_int)),zero_zero_int)),
    inference(rw,[status(thm)],[c_0_27,c_0_14]) ).

tcf(c_0_32,plain,
    hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,hAPP_int_int(plus_plus_int(one_one_int),hAPP_int_int(times_times_int(s),s))),zero_zero_int)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_14]),c_0_18]),c_0_15]),c_0_25]),c_0_24]),c_0_25]),c_0_29]),c_0_14]),c_0_18]),c_0_15]),c_0_25]),c_0_24]),c_0_30]) ).

tcf(c_0_33,negated_conjecture,
    ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,hAPP_int_int(plus_plus_int(one_one_int),hAPP_int_int(times_times_int(s),s))),zero_zero_int)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_18]),c_0_23]),c_0_24]) ).

cnf(c_0_34,plain,
    $false,
    inference(sr,[status(thm)],[c_0_32,c_0_33]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM924_3 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.55  % Computer : n006.cluster.edu
% 0.13/0.55  % Model    : x86_64 x86_64
% 0.13/0.55  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.55  % Memory   : 8046.5625MB
% 0.13/0.55  % OS       : Linux 6.8.0-71-generic
% 0.13/0.55  % CPULimit : 300
% 0.13/0.55  % WCLimit  : 300
% 0.13/0.55  % DateTime : Mon Sep 21 03:16:58 UTC 2026
% 0.13/0.55  % CPUTime  : 
% 0.13/0.55  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.59  Running first-order theorem proving
% 0.16/0.59  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.85  % Version: 3.5.1
% 0.16/0.85  % Preprocessing class: FMLSSMSMSSSNFFN.
% 0.16/0.85  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.85  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 900s (3) cores
% 0.16/0.85  % Starting new_bool_3 with 600s (2) cores
% 0.16/0.85  % Starting new_bool_1 with 600s (2) cores
% 0.16/0.85  % Starting sh5l with 300s (1) cores
% 0.16/0.85  % new_bool_1 with pid 1889078 completed with status 0
% 0.16/0.85  % Result found by new_bool_1
% 0.16/0.85  % Preprocessing class: FMLSSMSMSSSNFFN.
% 0.16/0.85  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.85  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 900s (3) cores
% 0.16/0.85  % Starting new_bool_3 with 600s (2) cores
% 0.16/0.85  % Starting new_bool_1 with 600s (2) cores
% 0.16/0.85  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.85  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.85  % Search class: FGHSM-SSLM31-DFFFFFNN
% 0.16/0.85  % Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 0.16/0.85  % Starting SubtermCWHack with 55s (1) cores
% 0.16/0.85  % Starting new_bool_1 with 61s (1) cores
% 0.16/0.85  % new_bool_1 with pid 1889116 completed with status 0
% 0.16/0.85  % Result found by new_bool_1
% 0.16/0.85  % Preprocessing class: FMLSSMSMSSSNFFN.
% 0.16/0.85  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.85  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 900s (3) cores
% 0.16/0.85  % Starting new_bool_3 with 600s (2) cores
% 0.16/0.85  % Starting new_bool_1 with 600s (2) cores
% 0.16/0.85  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.85  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.85  % Search class: FGHSM-SSLM31-DFFFFFNN
% 0.16/0.85  % Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 0.16/0.85  % Starting SubtermCWHack with 55s (1) cores
% 0.16/0.85  % Starting new_bool_1 with 61s (1) cores
% 0.16/0.85  % Preprocessing time       : 0.012 s
% 0.16/0.85  % Presaturation interreduction done
% 0.16/0.85  
% 0.16/0.85  % Proof found!
% 0.16/0.85  % SZS status Theorem
% 0.16/0.85  % SZS output start CNFRefutation
% See solution above
% 0.16/0.85  % Parsed axioms                        : 1299
% 0.16/0.85  % Removed by relevancy pruning/SinE    : 390
% 0.16/0.85  % Initial clauses                      : 1320
% 0.16/0.85  % Removed in clause preprocessing      : 83
% 0.16/0.85  % Initial clauses in saturation        : 1237
% 0.16/0.85  % Processed clauses                    : 1377
% 0.16/0.85  % ...of these trivial                  : 139
% 0.16/0.85  % ...subsumed                          : 255
% 0.16/0.85  % ...remaining for further processing  : 982
% 0.16/0.85  % Other redundant clauses eliminated   : 106
% 0.16/0.85  % Clauses deleted for lack of memory   : 0
% 0.16/0.85  % Backward-subsumed                    : 7
% 0.16/0.85  % Backward-rewritten                   : 17
% 0.16/0.85  % Generated clauses                    : 123
% 0.16/0.85  % ...of the previous two non-redundant : 79
% 0.16/0.85  % ...aggressively subsumed             : 0
% 0.16/0.85  % Contextual simplify-reflections      : 3
% 0.16/0.85  % Paramodulations                      : 28
% 0.16/0.85  % Factorizations                       : 0
% 0.16/0.85  % NegExts                              : 0
% 0.16/0.85  % Equation resolutions                 : 109
% 0.16/0.85  % Disequality decompositions           : 0
% 0.16/0.85  % Total rewrite steps                  : 1223
% 0.16/0.85  % ...of those cached                   : 1031
% 0.16/0.85  % Propositional unsat checks           : 0
% 0.16/0.85  %    Propositional check models        : 0
% 0.16/0.85  %    Propositional check unsatisfiable : 0
% 0.16/0.85  %    Propositional clauses             : 0
% 0.16/0.85  %    Propositional clauses after purity: 0
% 0.16/0.85  %    Propositional unsat core size     : 0
% 0.16/0.85  %    Propositional preprocessing time  : 0.000
% 0.16/0.85  %    Propositional encoding time       : 0.000
% 0.16/0.85  %    Propositional solver time         : 0.000
% 0.16/0.85  %    Success case prop preproc time    : 0.000
% 0.16/0.85  %    Success case prop encoding time   : 0.000
% 0.16/0.85  %    Success case prop solver time     : 0.000
% 0.16/0.85  % Current number of processed clauses  : 65
% 0.16/0.85  %    Positive orientable unit clauses  : 26
% 0.16/0.85  %    Positive unorientable unit clauses: 0
% 0.16/0.85  %    Negative unit clauses             : 20
% 0.16/0.85  %    Non-unit-clauses                  : 19
% 0.16/0.85  % Current number of unprocessed clauses: 740
% 0.16/0.85  % ...number of literals in the above   : 1775
% 0.16/0.85  % Current number of archived formulas  : 0
% 0.16/0.85  % Current number of archived clauses   : 825
% 0.16/0.85  % Clause-clause subsumption calls (NU) : 61127
% 0.16/0.85  % Rec. Clause-clause subsumption calls : 29346
% 0.16/0.85  % Non-unit clause-clause subsumptions  : 190
% 0.16/0.85  % Unit Clause-clause subsumption calls : 479
% 0.16/0.85  % Rewrite failures with RHS unbound    : 0
% 0.16/0.85  % BW rewrite match attempts            : 712
% 0.16/0.85  % BW rewrite match successes           : 102
% 0.16/0.85  % Condensation attempts                : 0
% 0.16/0.85  % Condensation successes               : 0
% 0.16/0.85  % Termbank termtop insertions          : 144724
% 0.16/0.85  % Search garbage collected termcells   : 17785
% 0.16/0.85  
% 0.16/0.85  % -------------------------------------------------
% 0.16/0.85  % User time                : 0.161 s
% 0.16/0.85  % System time              : 0.016 s
% 0.16/0.85  % Total time               : 0.177 s
% 0.16/0.85  % Maximum resident set size: 9928 pages
% 0.16/0.85  
% 0.16/0.85  % -------------------------------------------------
% 0.16/0.85  % User time                : 0.290 s
% 0.16/0.85  % System time              : 0.036 s
% 0.16/0.85  % Total time               : 0.326 s
% 0.16/0.85  % Maximum resident set size: 7424 pages
% 0.16/0.85  % E exiting
%------------------------------------------------------------------------------