↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n009.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 02:25:04 PM UTC 2026

% Result   : Theorem 278.89s 44.20s
% Output   : CNFRefutation 278.89s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   44 (  25 unt;   0 def)
%            Number of atoms       :   89 (  19 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   78 (  33   ~;  26   |;   5   &)
%                                         (   1 <=>;  13  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   74 (   2 sgn  44   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t8_relset_2,conjecture,
    ! [X1] :
      ( v1_relat_1(X1)
     => ! [X2] :
          ( v1_relat_1(X2)
         => ! [X3] :
              ( v1_relat_1(X3)
             => r1_tarski(k5_relat_1(k3_xboole_0(X1,X2),X3),k3_xboole_0(k5_relat_1(X1,X3),k5_relat_1(X2,X3))) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_relset_2) ).

fof(t48_xboole_1,axiom,
    ! [X1,X2] : k4_xboole_0(X1,k4_xboole_0(X1,X2)) = k3_xboole_0(X1,X2),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+4.ax',t48_xboole_1) ).

fof(t19_xboole_1,axiom,
    ! [X1,X2,X3] :
      ( ( r1_tarski(X1,X3)
        & r1_tarski(X1,X2) )
     => r1_tarski(X1,k3_xboole_0(X2,X3)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+4.ax',t19_xboole_1) ).

fof(t49_relat_1,axiom,
    ! [X1] :
      ( v1_relat_1(X1)
     => ! [X2] :
          ( v1_relat_1(X2)
         => ! [X3] :
              ( v1_relat_1(X3)
             => ( r1_tarski(X1,X2)
               => r1_tarski(k5_relat_1(X1,X3),k5_relat_1(X2,X3)) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+10.ax',t49_relat_1) ).

fof(t3_relat_1,axiom,
    ! [X1,X2] :
      ( v1_relat_1(X2)
     => ( r1_tarski(X1,X2)
       => v1_relat_1(X1) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+10.ax',t3_relat_1) ).

fof(t2_boole,axiom,
    ! [X1] : k3_xboole_0(X1,k1_xboole_0) = k1_xboole_0,
    file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+3.ax',t2_boole) ).

fof(t36_xboole_1,axiom,
    ! [X1,X2] : r1_tarski(k4_xboole_0(X1,X2),X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+4.ax',t36_xboole_1) ).

fof(t49_xboole_1,axiom,
    ! [X1,X2,X3] : k3_xboole_0(X1,k4_xboole_0(X2,X3)) = k4_xboole_0(k3_xboole_0(X1,X2),X3),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+4.ax',t49_xboole_1) ).

fof(t3_boole,axiom,
    ! [X1] : k4_xboole_0(X1,k1_xboole_0) = X1,
    file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+3.ax',t3_boole) ).

fof(t37_xboole_1,axiom,
    ! [X1,X2] :
      ( k4_xboole_0(X1,X2) = k1_xboole_0
    <=> r1_tarski(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+4.ax',t37_xboole_1) ).

fof(c_0_10,negated_conjecture,
    ~ ! [X1] :
        ( v1_relat_1(X1)
       => ! [X2] :
            ( v1_relat_1(X2)
           => ! [X3] :
                ( v1_relat_1(X3)
               => r1_tarski(k5_relat_1(k3_xboole_0(X1,X2),X3),k3_xboole_0(k5_relat_1(X1,X3),k5_relat_1(X2,X3))) ) ) ),
    inference(assume_negation,[status(cth)],[t8_relset_2]) ).

fof(c_0_11,negated_conjecture,
    ( ~ r1_tarski(k5_relat_1(k3_xboole_0(esk1_0,esk2_0),esk3_0),k3_xboole_0(k5_relat_1(esk1_0,esk3_0),k5_relat_1(esk2_0,esk3_0)))
    & v1_relat_1(esk3_0)
    & v1_relat_1(esk2_0)
    & v1_relat_1(esk1_0) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).

fof(c_0_12,plain,
    ! [X195,X196] : k4_xboole_0(X195,k4_xboole_0(X195,X196)) = k3_xboole_0(X195,X196),
    inference(variable_rename,[status(thm)],[t48_xboole_1]) ).

fof(c_0_13,plain,
    ! [X155,X156,X157] :
      ( r1_tarski(X155,k3_xboole_0(X156,X157))
      | ~ r1_tarski(X155,X157)
      | ~ r1_tarski(X155,X156) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t19_xboole_1])])]) ).

cnf(c_0_14,negated_conjecture,
    ~ r1_tarski(k5_relat_1(k3_xboole_0(esk1_0,esk2_0),esk3_0),k3_xboole_0(k5_relat_1(esk1_0,esk3_0),k5_relat_1(esk2_0,esk3_0))),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_15,plain,
    k4_xboole_0(X1,k4_xboole_0(X1,X2)) = k3_xboole_0(X1,X2),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_16,plain,
    ( ~ r1_tarski(X1,X3)
    | ~ r1_tarski(X1,X2)
    | r1_tarski(X1,k3_xboole_0(X2,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

fof(c_0_17,plain,
    ! [X436,X437,X438] :
      ( r1_tarski(k5_relat_1(X436,X438),k5_relat_1(X437,X438))
      | ~ r1_tarski(X436,X437)
      | ~ v1_relat_1(X438)
      | ~ v1_relat_1(X437)
      | ~ v1_relat_1(X436) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t49_relat_1])])])]) ).

fof(c_0_18,plain,
    ! [X86,X87] :
      ( v1_relat_1(X86)
      | ~ r1_tarski(X86,X87)
      | ~ v1_relat_1(X87) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_relat_1])])]) ).

cnf(c_0_19,negated_conjecture,
    ~ r1_tarski(k5_relat_1(k4_xboole_0(esk1_0,k4_xboole_0(esk1_0,esk2_0)),esk3_0),k4_xboole_0(k5_relat_1(esk1_0,esk3_0),k4_xboole_0(k5_relat_1(esk1_0,esk3_0),k5_relat_1(esk2_0,esk3_0)))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_15]) ).

cnf(c_0_20,plain,
    ( ~ r1_tarski(X1,X2)
    | ~ r1_tarski(X1,X3)
    | r1_tarski(X1,k4_xboole_0(X2,k4_xboole_0(X2,X3))) ),
    inference(rw,[status(thm)],[c_0_16,c_0_15]) ).

cnf(c_0_21,plain,
    ( ~ r1_tarski(X1,X2)
    | ~ v1_relat_1(X3)
    | ~ v1_relat_1(X2)
    | ~ v1_relat_1(X1)
    | r1_tarski(k5_relat_1(X1,X3),k5_relat_1(X2,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_22,plain,
    ( ~ r1_tarski(X2,X1)
    | ~ v1_relat_1(X1)
    | v1_relat_1(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

fof(c_0_23,plain,
    ! [X146] : k3_xboole_0(X146,k1_xboole_0) = k1_xboole_0,
    inference(variable_rename,[status(thm)],[t2_boole]) ).

cnf(c_0_24,negated_conjecture,
    ( ~ r1_tarski(k5_relat_1(k4_xboole_0(esk1_0,k4_xboole_0(esk1_0,esk2_0)),esk3_0),k5_relat_1(esk1_0,esk3_0))
    | ~ r1_tarski(k5_relat_1(k4_xboole_0(esk1_0,k4_xboole_0(esk1_0,esk2_0)),esk3_0),k5_relat_1(esk2_0,esk3_0)) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_25,plain,
    ( ~ r1_tarski(X1,X3)
    | ~ v1_relat_1(X3)
    | ~ v1_relat_1(X2)
    | r1_tarski(k5_relat_1(X1,X2),k5_relat_1(X3,X2)) ),
    inference(csr,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_26,negated_conjecture,
    v1_relat_1(esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_27,negated_conjecture,
    v1_relat_1(esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

fof(c_0_28,plain,
    ! [X1200,X1201] : r1_tarski(k4_xboole_0(X1200,X1201),X1200),
    inference(variable_rename,[status(thm)],[t36_xboole_1]) ).

fof(c_0_29,plain,
    ! [X197,X198,X199] : k3_xboole_0(X197,k4_xboole_0(X198,X199)) = k4_xboole_0(k3_xboole_0(X197,X198),X199),
    inference(variable_rename,[status(thm)],[t49_xboole_1]) ).

cnf(c_0_30,plain,
    k3_xboole_0(X1,k1_xboole_0) = k1_xboole_0,
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

fof(c_0_31,plain,
    ! [X1186] : k4_xboole_0(X1186,k1_xboole_0) = X1186,
    inference(variable_rename,[status(thm)],[t3_boole]) ).

cnf(c_0_32,negated_conjecture,
    ( ~ r1_tarski(k4_xboole_0(esk1_0,k4_xboole_0(esk1_0,esk2_0)),esk2_0)
    | ~ r1_tarski(k5_relat_1(k4_xboole_0(esk1_0,k4_xboole_0(esk1_0,esk2_0)),esk3_0),k5_relat_1(esk1_0,esk3_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27])]) ).

cnf(c_0_33,negated_conjecture,
    v1_relat_1(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_34,plain,
    r1_tarski(k4_xboole_0(X1,X2),X1),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

fof(c_0_35,plain,
    ! [X1202,X1203] :
      ( ( k4_xboole_0(X1202,X1203) = k1_xboole_0
        | ~ r1_tarski(X1202,X1203) )
      & ( r1_tarski(X1202,X1203)
        | k4_xboole_0(X1202,X1203) != k1_xboole_0 ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t37_xboole_1])])]) ).

cnf(c_0_36,plain,
    k3_xboole_0(X1,k4_xboole_0(X2,X3)) = k4_xboole_0(k3_xboole_0(X1,X2),X3),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

cnf(c_0_37,plain,
    k4_xboole_0(X1,k4_xboole_0(X1,k1_xboole_0)) = k1_xboole_0,
    inference(rw,[status(thm)],[c_0_30,c_0_15]) ).

cnf(c_0_38,plain,
    k4_xboole_0(X1,k1_xboole_0) = X1,
    inference(split_conjunct,[status(thm)],[c_0_31]) ).

cnf(c_0_39,negated_conjecture,
    ~ r1_tarski(k4_xboole_0(esk1_0,k4_xboole_0(esk1_0,esk2_0)),esk2_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_25]),c_0_26]),c_0_33]),c_0_34])]) ).

cnf(c_0_40,plain,
    ( k4_xboole_0(X1,X2) != k1_xboole_0
    | r1_tarski(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_35]) ).

cnf(c_0_41,plain,
    k4_xboole_0(X1,k4_xboole_0(X1,k4_xboole_0(X2,X3))) = k4_xboole_0(k4_xboole_0(X1,k4_xboole_0(X1,X2)),X3),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_15]),c_0_15]) ).

cnf(c_0_42,plain,
    k4_xboole_0(X1,X1) = k1_xboole_0,
    inference(rw,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_43,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_42]),c_0_38]),c_0_42])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU418+4 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.35  % Computer : n009.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Mon Sep 21 06:25:18 UTC 2026
% 0.13/0.36  % CPUTime  : 
% 0.13/0.36  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.40  Running first-order theorem proving
% 0.13/0.40  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
% 278.89/44.20  % Version: 3.5.1
% 278.89/44.20  % Preprocessing class: FMLLMLLLSSSNFFN.
% 278.89/44.20  % Scheduled 4 strats onto 8 cores with 293 seconds (2344 total)
% 278.89/44.20  % Starting new_bool_3 with 879s (3) cores
% 278.89/44.20  % Starting new_bool_1 with 879s (3) cores
% 278.89/44.20  % Starting sh5l with 293s (1) cores
% 278.89/44.20  % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 293s (1) cores
% 278.89/44.20  % G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with pid 1063353 completed with status 0
% 278.89/44.20  % Result found by G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 278.89/44.20  % Preprocessing class: FMLLMLLLSSSNFFN.
% 278.89/44.20  % Scheduled 4 strats onto 8 cores with 293 seconds (2344 total)
% 278.89/44.20  % Starting new_bool_3 with 879s (3) cores
% 278.89/44.20  % Starting new_bool_1 with 879s (3) cores
% 278.89/44.20  % Starting sh5l with 293s (1) cores
% 278.89/44.20  % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 293s (1) cores
% 278.89/44.20  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 278.89/44.20  % SinE strategy is gf120_h_gu_RUU_F100_L01000
% 278.89/44.20  % Search class: FGHSM-SMLM32-DFFFFFNN
% 278.89/44.20  % Scheduled 12 strats onto 1 cores with 293 seconds (293 total)
% 278.89/44.20  % Starting SubtermCWHack with 30s (1) cores
% 278.89/44.20  % SubtermCWHack with pid 1063354 completed with status 8
% 278.89/44.20  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 25s (1) cores
% 278.89/44.20  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with pid 1063455 completed with status 0
% 278.89/44.20  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y
% 278.89/44.20  % Preprocessing class: FMLLMLLLSSSNFFN.
% 278.89/44.20  % Scheduled 4 strats onto 8 cores with 293 seconds (2344 total)
% 278.89/44.20  % Starting new_bool_3 with 879s (3) cores
% 278.89/44.20  % Starting new_bool_1 with 879s (3) cores
% 278.89/44.20  % Starting sh5l with 293s (1) cores
% 278.89/44.20  % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 293s (1) cores
% 278.89/44.20  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 278.89/44.20  % SinE strategy is gf120_h_gu_RUU_F100_L01000
% 278.89/44.20  % Search class: FGHSM-SMLM32-DFFFFFNN
% 278.89/44.20  % Scheduled 12 strats onto 1 cores with 293 seconds (293 total)
% 278.89/44.20  % Starting SubtermCWHack with 30s (1) cores
% 278.89/44.20  % SubtermCWHack with pid 1063354 completed with status 8
% 278.89/44.20  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 25s (1) cores
% 278.89/44.20  % Preprocessing time       : 0.130 s
% 278.89/44.20  % Presaturation interreduction done
% 278.89/44.20  
% 278.89/44.20  % Proof found!
% 278.89/44.20  % SZS status Theorem
% 278.89/44.20  % SZS output start CNFRefutation
% See solution above
% 278.89/44.20  % Parsed axioms                        : 71086
% 278.89/44.20  % Removed by relevancy pruning/SinE    : 70085
% 278.89/44.20  % Initial clauses                      : 2082
% 278.89/44.20  % Removed in clause preprocessing      : 46
% 278.89/44.20  % Initial clauses in saturation        : 2036
% 278.89/44.20  % Processed clauses                    : 4031
% 278.89/44.20  % ...of these trivial                  : 32
% 278.89/44.20  % ...subsumed                          : 200
% 278.89/44.20  % ...remaining for further processing  : 3799
% 278.89/44.20  % Other redundant clauses eliminated   : 870
% 278.89/44.20  % Clauses deleted for lack of memory   : 0
% 278.89/44.20  % Backward-subsumed                    : 7
% 278.89/44.20  % Backward-rewritten                   : 17
% 278.89/44.20  % Generated clauses                    : 72350
% 278.89/44.20  % ...of the previous two non-redundant : 68695
% 278.89/44.20  % ...aggressively subsumed             : 0
% 278.89/44.20  % Contextual simplify-reflections      : 139
% 278.89/44.20  % Paramodulations                      : 71422
% 278.89/44.20  % Factorizations                       : 29
% 278.89/44.20  % NegExts                              : 0
% 278.89/44.20  % Equation resolutions                 : 907
% 278.89/44.20  % Disequality decompositions           : 0
% 278.89/44.20  % Total rewrite steps                  : 16520
% 278.89/44.20  % ...of those cached                   : 14587
% 278.89/44.20  % Propositional unsat checks           : 0
% 278.89/44.20  %    Propositional check models        : 0
% 278.89/44.20  %    Propositional check unsatisfiable : 0
% 278.89/44.20  %    Propositional clauses             : 0
% 278.89/44.20  %    Propositional clauses after purity: 0
% 278.89/44.20  %    Propositional unsat core size     : 0
% 278.89/44.20  %    Propositional preprocessing time  : 0.000
% 278.89/44.20  %    Propositional encoding time       : 0.000
% 278.89/44.20  %    Propositional solver time         : 0.000
% 278.89/44.20  %    Success case prop preproc time    : 0.000
% 278.89/44.20  %    Success case prop encoding time   : 0.000
% 278.89/44.20  %    Success case prop solver time     : 0.000
% 278.89/44.20  % Current number of processed clauses  : 1801
% 278.89/44.20  %    Positive orientable unit clauses  : 215
% 278.89/44.20  %    Positive unorientable unit clauses: 5
% 278.89/44.20  %    Negative unit clauses             : 51
% 278.89/44.20  %    Non-unit-clauses                  : 1530
% 278.89/44.20  % Current number of unprocessed clauses: 68482
% 278.89/44.20  % ...number of literals in the above   : 401626
% 278.89/44.20  % Current number of archived formulas  : 0
% 278.89/44.20  % Current number of archived clauses   : 1822
% 278.89/44.20  % Clause-clause subsumption calls (NU) : 1763038
% 278.89/44.20  % Rec. Clause-clause subsumption calls : 187043
% 278.89/44.20  % Non-unit clause-clause subsumptions  : 318
% 278.89/44.20  % Unit Clause-clause subsumption calls : 16412
% 278.89/44.20  % Rewrite failures with RHS unbound    : 0
% 278.89/44.20  % BW rewrite match attempts            : 238
% 278.89/44.20  % BW rewrite match successes           : 104
% 278.89/44.20  % Condensation attempts                : 0
% 278.89/44.20  % Condensation successes               : 0
% 278.89/44.20  % Termbank termtop insertions          : 4312838
% 278.89/44.20  % Search garbage collected termcells   : 802543
% 278.89/44.20  
% 278.89/44.20  % -------------------------------------------------
% 278.89/44.20  % User time                : 34.191 s
% 278.89/44.20  % System time              : 1.068 s
% 278.89/44.20  % Total time               : 35.259 s
% 278.89/44.20  % Maximum resident set size: 148924 pages
% 278.89/44.20  
% 278.89/44.20  % -------------------------------------------------
% 278.89/44.20  % User time                : 41.862 s
% 278.89/44.20  % System time              : 1.426 s
% 278.89/44.20  % Total time               : 43.288 s
% 278.89/44.20  % Maximum resident set size: 121088 pages
% 278.89/44.20  % E exiting
%------------------------------------------------------------------------------