↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SWV858-1 : TPTP v9.3.1. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/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 : Thu Sep 24 03:00:04 PM UTC 2026

% Result   : Unsatisfiable 0.76s 0.60s
% Output   : CNFRefutation 0.76s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   46 (  14 unt;   5 nHn;  33 RR)
%            Number of literals    :   90 (   4 equ;  43 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :   14 (  14 usr;   7 con; 0-4 aty)
%            Number of variables   :   88 (  13 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_insert__absorb_0,axiom,
    ( ~ hBOOL(hAPP(hAPP(c_in(X3),X1),X2))
    | c_Set_Oinsert(X1,X2,X3) = X2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_insert__absorb_0) ).

cnf(cls_le__funD_0,axiom,
    ( ~ c_lessequals(X2,X4,tc_fun(X5,X1))
    | ~ class_HOL_Oord(X1)
    | c_lessequals(hAPP(X2,X3),hAPP(X4,X3),X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_le__funD_0) ).

cnf(cls_insert__subset_0,axiom,
    ( ~ c_lessequals(c_Set_Oinsert(X2,X4,X1),X3,tc_fun(X1,tc_bool))
    | hBOOL(hAPP(hAPP(c_in(X1),X2),X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_insert__subset_0) ).

cnf(cls_conjecture_2,negated_conjecture,
    hBOOL(hAPP(hAPP(c_in(tc_Hoare__Mirabelle_Otriple(t_a)),v_xa),v_tsa)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).

cnf(cls_le__funI_0,axiom,
    ( ~ c_lessequals(hAPP(X2,c_ATP__Linkup_Osko__Orderings__Xle__funI__1__1(X2,X3,X4,X1)),hAPP(X3,c_ATP__Linkup_Osko__Orderings__Xle__funI__1__1(X2,X3,X4,X1)),X1)
    | ~ class_HOL_Oord(X1)
    | c_lessequals(X2,X3,tc_fun(X4,X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_le__funI_0) ).

cnf(cls_conjecture_1,negated_conjecture,
    c_lessequals(v_tsa,v_ts_H,tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).

cnf(clsarity_bool__HOL_Oord,axiom,
    class_HOL_Oord(tc_bool),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clsarity_bool__HOL_Oord) ).

cnf(cls_conjecture_6,negated_conjecture,
    ( ~ c_Hoare__Mirabelle_Otriple__valid(X1,v_n(X1),t_a)
    | ~ hBOOL(hAPP(hAPP(c_in(tc_Hoare__Mirabelle_Otriple(t_a)),X2),v_ts_H))
    | c_Hoare__Mirabelle_Otriple__valid(X1,X2,t_a) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_6) ).

cnf(cls_conjecture_4,negated_conjecture,
    ( ~ hBOOL(hAPP(hAPP(c_in(tc_Hoare__Mirabelle_Otriple(t_a)),X1),v_Ga))
    | c_Hoare__Mirabelle_Otriple__valid(v_x,X1,t_a) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_4) ).

cnf(cls_mem__def_1,axiom,
    ( ~ hBOOL(hAPP(X3,X2))
    | hBOOL(hAPP(hAPP(c_in(X1),X2),X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_mem__def_1) ).

cnf(cls_conjecture_5,negated_conjecture,
    ( ~ hBOOL(hAPP(hAPP(c_in(tc_Hoare__Mirabelle_Otriple(t_a)),X2),v_ts_H))
    | hBOOL(hAPP(hAPP(c_in(tc_Hoare__Mirabelle_Otriple(t_a)),v_n(X1)),v_Ga))
    | c_Hoare__Mirabelle_Otriple__valid(X1,X2,t_a) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_5) ).

cnf(cls_conjecture_3,negated_conjecture,
    ~ c_Hoare__Mirabelle_Otriple__valid(v_x,v_xa,t_a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).

cnf(cls_mem__def_0,axiom,
    ( ~ hBOOL(hAPP(hAPP(c_in(X3),X2),X1))
    | hBOOL(hAPP(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_mem__def_0) ).

cnf(c_0_13,plain,
    ( ~ hBOOL(hAPP(hAPP(c_in(X3),X1),X2))
    | c_Set_Oinsert(X1,X2,X3) = X2 ),
    inference(fof_simplification,[status(thm)],[cls_insert__absorb_0]) ).

cnf(c_0_14,plain,
    ( ~ c_lessequals(X2,X4,tc_fun(X5,X1))
    | ~ class_HOL_Oord(X1)
    | c_lessequals(hAPP(X2,X3),hAPP(X4,X3),X1) ),
    inference(fof_simplification,[status(thm)],[cls_le__funD_0]) ).

cnf(c_0_15,plain,
    ( ~ c_lessequals(c_Set_Oinsert(X2,X4,X1),X3,tc_fun(X1,tc_bool))
    | hBOOL(hAPP(hAPP(c_in(X1),X2),X3)) ),
    inference(fof_simplification,[status(thm)],[cls_insert__subset_0]) ).

cnf(c_0_16,plain,
    ( ~ hBOOL(hAPP(hAPP(c_in(X3),X1),X2))
    | c_Set_Oinsert(X1,X2,X3) = X2 ),
    c_0_13 ).

cnf(c_0_17,negated_conjecture,
    hBOOL(hAPP(hAPP(c_in(tc_Hoare__Mirabelle_Otriple(t_a)),v_xa),v_tsa)),
    cls_conjecture_2 ).

cnf(c_0_18,plain,
    ( ~ c_lessequals(hAPP(X2,c_ATP__Linkup_Osko__Orderings__Xle__funI__1__1(X2,X3,X4,X1)),hAPP(X3,c_ATP__Linkup_Osko__Orderings__Xle__funI__1__1(X2,X3,X4,X1)),X1)
    | ~ class_HOL_Oord(X1)
    | c_lessequals(X2,X3,tc_fun(X4,X1)) ),
    inference(fof_simplification,[status(thm)],[cls_le__funI_0]) ).

cnf(c_0_19,plain,
    ( ~ c_lessequals(X2,X4,tc_fun(X5,X1))
    | ~ class_HOL_Oord(X1)
    | c_lessequals(hAPP(X2,X3),hAPP(X4,X3),X1) ),
    c_0_14 ).

cnf(c_0_20,negated_conjecture,
    c_lessequals(v_tsa,v_ts_H,tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool)),
    cls_conjecture_1 ).

cnf(c_0_21,axiom,
    class_HOL_Oord(tc_bool),
    clsarity_bool__HOL_Oord ).

cnf(c_0_22,negated_conjecture,
    ( ~ c_Hoare__Mirabelle_Otriple__valid(X1,v_n(X1),t_a)
    | ~ hBOOL(hAPP(hAPP(c_in(tc_Hoare__Mirabelle_Otriple(t_a)),X2),v_ts_H))
    | c_Hoare__Mirabelle_Otriple__valid(X1,X2,t_a) ),
    inference(fof_simplification,[status(thm)],[cls_conjecture_6]) ).

cnf(c_0_23,plain,
    ( ~ c_lessequals(c_Set_Oinsert(X2,X4,X1),X3,tc_fun(X1,tc_bool))
    | hBOOL(hAPP(hAPP(c_in(X1),X2),X3)) ),
    c_0_15 ).

cnf(c_0_24,negated_conjecture,
    c_Set_Oinsert(v_xa,v_tsa,tc_Hoare__Mirabelle_Otriple(t_a)) = v_tsa,
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_25,negated_conjecture,
    ( ~ hBOOL(hAPP(hAPP(c_in(tc_Hoare__Mirabelle_Otriple(t_a)),X1),v_Ga))
    | c_Hoare__Mirabelle_Otriple__valid(v_x,X1,t_a) ),
    inference(fof_simplification,[status(thm)],[cls_conjecture_4]) ).

cnf(c_0_26,plain,
    ( ~ hBOOL(hAPP(X3,X2))
    | hBOOL(hAPP(hAPP(c_in(X1),X2),X3)) ),
    inference(fof_simplification,[status(thm)],[cls_mem__def_1]) ).

cnf(c_0_27,negated_conjecture,
    ( ~ hBOOL(hAPP(hAPP(c_in(tc_Hoare__Mirabelle_Otriple(t_a)),X2),v_ts_H))
    | hBOOL(hAPP(hAPP(c_in(tc_Hoare__Mirabelle_Otriple(t_a)),v_n(X1)),v_Ga))
    | c_Hoare__Mirabelle_Otriple__valid(X1,X2,t_a) ),
    inference(fof_simplification,[status(thm)],[cls_conjecture_5]) ).

cnf(c_0_28,plain,
    ( ~ c_lessequals(hAPP(X2,c_ATP__Linkup_Osko__Orderings__Xle__funI__1__1(X2,X3,X4,X1)),hAPP(X3,c_ATP__Linkup_Osko__Orderings__Xle__funI__1__1(X2,X3,X4,X1)),X1)
    | ~ class_HOL_Oord(X1)
    | c_lessequals(X2,X3,tc_fun(X4,X1)) ),
    c_0_18 ).

cnf(c_0_29,negated_conjecture,
    c_lessequals(hAPP(v_tsa,X1),hAPP(v_ts_H,X1),tc_bool),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).

cnf(c_0_30,negated_conjecture,
    ( ~ c_Hoare__Mirabelle_Otriple__valid(X1,v_n(X1),t_a)
    | ~ hBOOL(hAPP(hAPP(c_in(tc_Hoare__Mirabelle_Otriple(t_a)),X2),v_ts_H))
    | c_Hoare__Mirabelle_Otriple__valid(X1,X2,t_a) ),
    c_0_22 ).

cnf(c_0_31,negated_conjecture,
    ( ~ c_lessequals(v_tsa,X1,tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool))
    | hBOOL(hAPP(hAPP(c_in(tc_Hoare__Mirabelle_Otriple(t_a)),v_xa),X1)) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_32,negated_conjecture,
    ( ~ hBOOL(hAPP(hAPP(c_in(tc_Hoare__Mirabelle_Otriple(t_a)),X1),v_Ga))
    | c_Hoare__Mirabelle_Otriple__valid(v_x,X1,t_a) ),
    c_0_25 ).

cnf(c_0_33,plain,
    ( ~ hBOOL(hAPP(X3,X2))
    | hBOOL(hAPP(hAPP(c_in(X1),X2),X3)) ),
    c_0_26 ).

cnf(c_0_34,negated_conjecture,
    ~ c_Hoare__Mirabelle_Otriple__valid(v_x,v_xa,t_a),
    inference(fof_simplification,[status(thm)],[cls_conjecture_3]) ).

cnf(c_0_35,plain,
    ( ~ hBOOL(hAPP(hAPP(c_in(X3),X2),X1))
    | hBOOL(hAPP(X1,X2)) ),
    inference(fof_simplification,[status(thm)],[cls_mem__def_0]) ).

cnf(c_0_36,negated_conjecture,
    ( ~ hBOOL(hAPP(hAPP(c_in(tc_Hoare__Mirabelle_Otriple(t_a)),X2),v_ts_H))
    | hBOOL(hAPP(hAPP(c_in(tc_Hoare__Mirabelle_Otriple(t_a)),v_n(X1)),v_Ga))
    | c_Hoare__Mirabelle_Otriple__valid(X1,X2,t_a) ),
    c_0_27 ).

cnf(c_0_37,negated_conjecture,
    c_lessequals(v_tsa,v_ts_H,tc_fun(X1,tc_bool)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_21])]) ).

cnf(c_0_38,negated_conjecture,
    ( ~ c_Hoare__Mirabelle_Otriple__valid(X1,v_n(X1),t_a)
    | c_Hoare__Mirabelle_Otriple__valid(X1,v_xa,t_a) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_20])]) ).

cnf(c_0_39,negated_conjecture,
    ( ~ hBOOL(hAPP(v_Ga,X1))
    | c_Hoare__Mirabelle_Otriple__valid(v_x,X1,t_a) ),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_40,negated_conjecture,
    ~ c_Hoare__Mirabelle_Otriple__valid(v_x,v_xa,t_a),
    c_0_34 ).

cnf(c_0_41,plain,
    ( ~ hBOOL(hAPP(hAPP(c_in(X3),X2),X1))
    | hBOOL(hAPP(X1,X2)) ),
    c_0_35 ).

cnf(c_0_42,negated_conjecture,
    ( hBOOL(hAPP(hAPP(c_in(tc_Hoare__Mirabelle_Otriple(t_a)),v_n(X1)),v_Ga))
    | c_Hoare__Mirabelle_Otriple__valid(X1,v_xa,t_a) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_31]),c_0_37])]) ).

cnf(c_0_43,negated_conjecture,
    ~ hBOOL(hAPP(v_Ga,v_n(v_x))),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).

cnf(c_0_44,negated_conjecture,
    ( hBOOL(hAPP(v_Ga,v_n(X1)))
    | c_Hoare__Mirabelle_Otriple__valid(X1,v_xa,t_a) ),
    inference(spm,[status(thm)],[c_0_41,c_0_42]) ).

cnf(c_0_45,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_40]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV858-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36  % Computer : n017.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Mon Sep 21 09:24:12 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.03/0.41  Running first-order theorem proving
% 0.03/0.41  Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.76/0.60  % Version: 3.5.1
% 0.76/0.60  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.76/0.60  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.76/0.60  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.76/0.60  % Starting new_bool_3 with 300s (1) cores
% 0.76/0.60  % Starting new_bool_1 with 300s (1) cores
% 0.76/0.60  % Starting sh5l with 300s (1) cores
% 0.76/0.60  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1989203 completed with status 0
% 0.76/0.60  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.76/0.60  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.76/0.60  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.76/0.60  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.76/0.60  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.76/0.60  % No SInE strategy applied
% 0.76/0.60  % Search class: FGHSM-FSLM32-MFFFFFNN
% 0.76/0.60  % Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 0.76/0.60  % Starting SubtermCWHack with 136s (1) cores
% 0.76/0.60  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.76/0.60  % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 123s (1) cores
% 0.76/0.60  % Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 123s (1) cores
% 0.76/0.60  % Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 123s (1) cores
% 0.76/0.60  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1989210 completed with status 0
% 0.76/0.60  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.76/0.60  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.76/0.60  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.76/0.60  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.76/0.60  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.76/0.60  % No SInE strategy applied
% 0.76/0.60  % Search class: FGHSM-FSLM32-MFFFFFNN
% 0.76/0.60  % Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 0.76/0.60  % Starting SubtermCWHack with 136s (1) cores
% 0.76/0.60  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.76/0.60  % Preprocessing time       : 0.009 s
% 0.76/0.60  % Presaturation interreduction done
% 0.76/0.60  
% 0.76/0.60  % Proof found!
% 0.76/0.60  % SZS status Unsatisfiable
% 0.76/0.60  % SZS output start CNFRefutation
% See solution above
% 0.76/0.60  % Parsed axioms                        : 593
% 0.76/0.60  % Removed by relevancy pruning/SinE    : 0
% 0.76/0.60  % Initial clauses                      : 593
% 0.76/0.60  % Removed in clause preprocessing      : 0
% 0.76/0.60  % Initial clauses in saturation        : 593
% 0.76/0.60  % Processed clauses                    : 1203
% 0.76/0.60  % ...of these trivial                  : 19
% 0.76/0.60  % ...subsumed                          : 191
% 0.76/0.60  % ...remaining for further processing  : 993
% 0.76/0.60  % Other redundant clauses eliminated   : 38
% 0.76/0.60  % Clauses deleted for lack of memory   : 0
% 0.76/0.60  % Backward-subsumed                    : 8
% 0.76/0.60  % Backward-rewritten                   : 10
% 0.76/0.60  % Generated clauses                    : 3613
% 0.76/0.60  % ...of the previous two non-redundant : 2777
% 0.76/0.60  % ...aggressively subsumed             : 0
% 0.76/0.60  % Contextual simplify-reflections      : 5
% 0.76/0.60  % Paramodulations                      : 3564
% 0.76/0.60  % Factorizations                       : 0
% 0.76/0.60  % NegExts                              : 0
% 0.76/0.60  % Equation resolutions                 : 49
% 0.76/0.60  % Disequality decompositions           : 0
% 0.76/0.60  % Total rewrite steps                  : 1104
% 0.76/0.60  % ...of those cached                   : 737
% 0.76/0.60  % Propositional unsat checks           : 0
% 0.76/0.60  %    Propositional check models        : 0
% 0.76/0.60  %    Propositional check unsatisfiable : 0
% 0.76/0.60  %    Propositional clauses             : 0
% 0.76/0.60  %    Propositional clauses after purity: 0
% 0.76/0.60  %    Propositional unsat core size     : 0
% 0.76/0.60  %    Propositional preprocessing time  : 0.000
% 0.76/0.60  %    Propositional encoding time       : 0.000
% 0.76/0.60  %    Propositional solver time         : 0.000
% 0.76/0.60  %    Success case prop preproc time    : 0.000
% 0.76/0.60  %    Success case prop encoding time   : 0.000
% 0.76/0.60  %    Success case prop solver time     : 0.000
% 0.76/0.60  % Current number of processed clauses  : 486
% 0.76/0.60  %    Positive orientable unit clauses  : 129
% 0.76/0.60  %    Positive unorientable unit clauses: 3
% 0.76/0.60  %    Negative unit clauses             : 16
% 0.76/0.60  %    Non-unit-clauses                  : 338
% 0.76/0.60  % Current number of unprocessed clauses: 2654
% 0.76/0.60  % ...number of literals in the above   : 6871
% 0.76/0.60  % Current number of archived formulas  : 0
% 0.76/0.60  % Current number of archived clauses   : 506
% 0.76/0.60  % Clause-clause subsumption calls (NU) : 31623
% 0.76/0.60  % Rec. Clause-clause subsumption calls : 25695
% 0.76/0.60  % Non-unit clause-clause subsumptions  : 172
% 0.76/0.60  % Unit Clause-clause subsumption calls : 259
% 0.76/0.60  % Rewrite failures with RHS unbound    : 0
% 0.76/0.60  % BW rewrite match attempts            : 442
% 0.76/0.60  % BW rewrite match successes           : 107
% 0.76/0.60  % Condensation attempts                : 0
% 0.76/0.60  % Condensation successes               : 0
% 0.76/0.60  % Termbank termtop insertions          : 80809
% 0.76/0.60  % Search garbage collected termcells   : 987
% 0.76/0.60  
% 0.76/0.60  % -------------------------------------------------
% 0.76/0.60  % User time                : 0.146 s
% 0.76/0.60  % System time              : 0.016 s
% 0.76/0.60  % Total time               : 0.162 s
% 0.76/0.60  % Maximum resident set size: 4580 pages
% 0.76/0.60  
% 0.76/0.60  % -------------------------------------------------
% 0.76/0.60  % User time                : 0.713 s
% 0.76/0.60  % System time              : 0.072 s
% 0.76/0.60  % Total time               : 0.785 s
% 0.76/0.60  % Maximum resident set size: 5120 pages
% 0.76/0.60  % E exiting
%------------------------------------------------------------------------------