TSTP Solution File: SEU417+4 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SEU417+4 : TPTP v8.1.0. Released v3.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n014.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Tue Jul 19 09:19:55 EDT 2022

% Result   : Theorem 4.43s 62.60s
% Output   : CNFRefutation 4.43s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   41 (  12 unt;   0 def)
%            Number of atoms       :   95 (  11 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :  100 (  46   ~;  37   |;   5   &)
%                                         (   0 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   3 con; 0-3 aty)
%            Number of variables   :   80 (   4 sgn  48   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t7_relset_2,conjecture,
    ! [X1,X2] :
      ( m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))
     => ! [X3] :
          ( m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(X1)))
         => r1_tarski(k5_subset_1(X1,k8_setfam_1(X1,X2),k8_setfam_1(X1,X3)),k8_setfam_1(X1,k1_relset_2(X1,X2,X3))) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t7_relset_2) ).

fof(redefinition_k5_subset_1,axiom,
    ! [X1,X2,X3] :
      ( ( m1_subset_1(X2,k1_zfmisc_1(X1))
        & m1_subset_1(X3,k1_zfmisc_1(X1)) )
     => k5_subset_1(X1,X2,X3) = k3_xboole_0(X2,X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+7.ax',redefinition_k5_subset_1) ).

fof(t12_setfam_1,axiom,
    ! [X1,X2] : k1_setfam_1(k2_tarski(X1,X2)) = k3_xboole_0(X1,X2),
    file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+8.ax',t12_setfam_1) ).

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

fof(t59_setfam_1,axiom,
    ! [X1,X2] :
      ( m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))
     => ! [X3] :
          ( m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(X1)))
         => ( r1_tarski(X2,X3)
           => r1_tarski(k8_setfam_1(X1,X3),k8_setfam_1(X1,X2)) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+8.ax',t59_setfam_1) ).

fof(redefinition_k1_relset_2,axiom,
    ! [X1,X2,X3] :
      ( ( m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))
        & m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(X1))) )
     => k1_relset_2(X1,X2,X3) = k3_xboole_0(X2,X3) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',redefinition_k1_relset_2) ).

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

fof(dt_k1_relset_2,axiom,
    ! [X1,X2,X3] :
      ( ( m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))
        & m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(X1))) )
     => m1_subset_1(k1_relset_2(X1,X2,X3),k1_zfmisc_1(k1_zfmisc_1(X1))) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',dt_k1_relset_2) ).

fof(dt_k8_setfam_1,axiom,
    ! [X1,X2] :
      ( m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))
     => m1_subset_1(k8_setfam_1(X1,X2),k1_zfmisc_1(X1)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+8.ax',dt_k8_setfam_1) ).

fof(c_0_9,negated_conjecture,
    ~ ! [X1,X2] :
        ( m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))
       => ! [X3] :
            ( m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(X1)))
           => r1_tarski(k5_subset_1(X1,k8_setfam_1(X1,X2),k8_setfam_1(X1,X3)),k8_setfam_1(X1,k1_relset_2(X1,X2,X3))) ) ),
    inference(assume_negation,[status(cth)],[t7_relset_2]) ).

fof(c_0_10,plain,
    ! [X4,X5,X6] :
      ( ~ m1_subset_1(X5,k1_zfmisc_1(X4))
      | ~ m1_subset_1(X6,k1_zfmisc_1(X4))
      | k5_subset_1(X4,X5,X6) = k3_xboole_0(X5,X6) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k5_subset_1])]) ).

fof(c_0_11,plain,
    ! [X3,X4] : k1_setfam_1(k2_tarski(X3,X4)) = k3_xboole_0(X3,X4),
    inference(variable_rename,[status(thm)],[t12_setfam_1]) ).

fof(c_0_12,negated_conjecture,
    ( m1_subset_1(esk2_0,k1_zfmisc_1(k1_zfmisc_1(esk1_0)))
    & m1_subset_1(esk3_0,k1_zfmisc_1(k1_zfmisc_1(esk1_0)))
    & ~ r1_tarski(k5_subset_1(esk1_0,k8_setfam_1(esk1_0,esk2_0),k8_setfam_1(esk1_0,esk3_0)),k8_setfam_1(esk1_0,k1_relset_2(esk1_0,esk2_0,esk3_0))) ),
    inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])]) ).

cnf(c_0_13,plain,
    ( k5_subset_1(X1,X2,X3) = k3_xboole_0(X2,X3)
    | ~ m1_subset_1(X3,k1_zfmisc_1(X1))
    | ~ m1_subset_1(X2,k1_zfmisc_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_14,plain,
    k1_setfam_1(k2_tarski(X1,X2)) = k3_xboole_0(X1,X2),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

fof(c_0_15,plain,
    ! [X4,X5,X6] :
      ( ~ r1_tarski(X4,X5)
      | r1_tarski(k3_xboole_0(X4,X6),X5) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t108_xboole_1])])])]) ).

cnf(c_0_16,negated_conjecture,
    ~ r1_tarski(k5_subset_1(esk1_0,k8_setfam_1(esk1_0,esk2_0),k8_setfam_1(esk1_0,esk3_0)),k8_setfam_1(esk1_0,k1_relset_2(esk1_0,esk2_0,esk3_0))),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_17,plain,
    ( k5_subset_1(X1,X2,X3) = k1_setfam_1(k2_tarski(X2,X3))
    | ~ m1_subset_1(X3,k1_zfmisc_1(X1))
    | ~ m1_subset_1(X2,k1_zfmisc_1(X1)) ),
    inference(rw,[status(thm)],[c_0_13,c_0_14]) ).

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

cnf(c_0_19,negated_conjecture,
    ( ~ m1_subset_1(k8_setfam_1(esk1_0,esk3_0),k1_zfmisc_1(esk1_0))
    | ~ m1_subset_1(k8_setfam_1(esk1_0,esk2_0),k1_zfmisc_1(esk1_0))
    | ~ r1_tarski(k1_setfam_1(k2_tarski(k8_setfam_1(esk1_0,esk2_0),k8_setfam_1(esk1_0,esk3_0))),k8_setfam_1(esk1_0,k1_relset_2(esk1_0,esk2_0,esk3_0))) ),
    inference(pm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_20,plain,
    ( r1_tarski(k1_setfam_1(k2_tarski(X1,X2)),X3)
    | ~ r1_tarski(X1,X3) ),
    inference(rw,[status(thm)],[c_0_18,c_0_14]) ).

fof(c_0_21,plain,
    ! [X4,X5,X6] :
      ( ~ m1_subset_1(X5,k1_zfmisc_1(k1_zfmisc_1(X4)))
      | ~ m1_subset_1(X6,k1_zfmisc_1(k1_zfmisc_1(X4)))
      | ~ r1_tarski(X5,X6)
      | r1_tarski(k8_setfam_1(X4,X6),k8_setfam_1(X4,X5)) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t59_setfam_1])])])])]) ).

fof(c_0_22,plain,
    ! [X4,X5,X6] :
      ( ~ m1_subset_1(X5,k1_zfmisc_1(k1_zfmisc_1(X4)))
      | ~ m1_subset_1(X6,k1_zfmisc_1(k1_zfmisc_1(X4)))
      | k1_relset_2(X4,X5,X6) = k3_xboole_0(X5,X6) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k1_relset_2])]) ).

fof(c_0_23,plain,
    ! [X3,X4] : r1_tarski(k3_xboole_0(X3,X4),X3),
    inference(variable_rename,[status(thm)],[t17_xboole_1]) ).

cnf(c_0_24,negated_conjecture,
    ( ~ m1_subset_1(k8_setfam_1(esk1_0,esk3_0),k1_zfmisc_1(esk1_0))
    | ~ m1_subset_1(k8_setfam_1(esk1_0,esk2_0),k1_zfmisc_1(esk1_0))
    | ~ r1_tarski(k8_setfam_1(esk1_0,esk2_0),k8_setfam_1(esk1_0,k1_relset_2(esk1_0,esk2_0,esk3_0))) ),
    inference(pm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_25,plain,
    ( r1_tarski(k8_setfam_1(X1,X2),k8_setfam_1(X1,X3))
    | ~ r1_tarski(X3,X2)
    | ~ m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))
    | ~ m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(X1))) ),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

cnf(c_0_26,negated_conjecture,
    m1_subset_1(esk2_0,k1_zfmisc_1(k1_zfmisc_1(esk1_0))),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_27,plain,
    ( k1_relset_2(X1,X2,X3) = k3_xboole_0(X2,X3)
    | ~ m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(X1)))
    | ~ m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1))) ),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

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

cnf(c_0_29,negated_conjecture,
    ( ~ m1_subset_1(k1_relset_2(esk1_0,esk2_0,esk3_0),k1_zfmisc_1(k1_zfmisc_1(esk1_0)))
    | ~ m1_subset_1(k8_setfam_1(esk1_0,esk3_0),k1_zfmisc_1(esk1_0))
    | ~ m1_subset_1(k8_setfam_1(esk1_0,esk2_0),k1_zfmisc_1(esk1_0))
    | ~ r1_tarski(k1_relset_2(esk1_0,esk2_0,esk3_0),esk2_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).

cnf(c_0_30,plain,
    ( k1_relset_2(X1,X2,X3) = k1_setfam_1(k2_tarski(X2,X3))
    | ~ m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(X1)))
    | ~ m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1))) ),
    inference(rw,[status(thm)],[c_0_27,c_0_14]) ).

cnf(c_0_31,plain,
    r1_tarski(k1_setfam_1(k2_tarski(X1,X2)),X1),
    inference(rw,[status(thm)],[c_0_28,c_0_14]) ).

cnf(c_0_32,negated_conjecture,
    m1_subset_1(esk3_0,k1_zfmisc_1(k1_zfmisc_1(esk1_0))),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

fof(c_0_33,plain,
    ! [X4,X5,X6] :
      ( ~ m1_subset_1(X5,k1_zfmisc_1(k1_zfmisc_1(X4)))
      | ~ m1_subset_1(X6,k1_zfmisc_1(k1_zfmisc_1(X4)))
      | m1_subset_1(k1_relset_2(X4,X5,X6),k1_zfmisc_1(k1_zfmisc_1(X4))) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k1_relset_2])]) ).

cnf(c_0_34,negated_conjecture,
    ( ~ m1_subset_1(k1_relset_2(esk1_0,esk2_0,esk3_0),k1_zfmisc_1(k1_zfmisc_1(esk1_0)))
    | ~ m1_subset_1(k8_setfam_1(esk1_0,esk3_0),k1_zfmisc_1(esk1_0))
    | ~ m1_subset_1(k8_setfam_1(esk1_0,esk2_0),k1_zfmisc_1(esk1_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32]),c_0_26])]) ).

cnf(c_0_35,plain,
    ( m1_subset_1(k1_relset_2(X1,X2,X3),k1_zfmisc_1(k1_zfmisc_1(X1)))
    | ~ m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(X1)))
    | ~ m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1))) ),
    inference(split_conjunct,[status(thm)],[c_0_33]) ).

fof(c_0_36,plain,
    ! [X3,X4] :
      ( ~ m1_subset_1(X4,k1_zfmisc_1(k1_zfmisc_1(X3)))
      | m1_subset_1(k8_setfam_1(X3,X4),k1_zfmisc_1(X3)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k8_setfam_1])]) ).

cnf(c_0_37,negated_conjecture,
    ( ~ m1_subset_1(k8_setfam_1(esk1_0,esk3_0),k1_zfmisc_1(esk1_0))
    | ~ m1_subset_1(k8_setfam_1(esk1_0,esk2_0),k1_zfmisc_1(esk1_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_34,c_0_35]),c_0_32]),c_0_26])]) ).

cnf(c_0_38,plain,
    ( m1_subset_1(k8_setfam_1(X1,X2),k1_zfmisc_1(X1))
    | ~ m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1))) ),
    inference(split_conjunct,[status(thm)],[c_0_36]) ).

cnf(c_0_39,negated_conjecture,
    ~ m1_subset_1(k8_setfam_1(esk1_0,esk2_0),k1_zfmisc_1(esk1_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_37,c_0_38]),c_0_32])]) ).

cnf(c_0_40,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_39,c_0_38]),c_0_26])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SEU417+4 : TPTP v8.1.0. Released v3.4.0.
% 0.12/0.12  % Command  : run_ET %s %d
% 0.12/0.33  % Computer : n014.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sat Jun 18 23:26:43 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 4.24/27.31  eprover: CPU time limit exceeded, terminating
% 4.24/27.31  eprover: CPU time limit exceeded, terminating
% 4.24/27.31  eprover: CPU time limit exceeded, terminating
% 4.24/27.31  eprover: CPU time limit exceeded, terminating
% 4.36/50.34  eprover: CPU time limit exceeded, terminating
% 4.36/50.36  eprover: CPU time limit exceeded, terminating
% 4.36/50.39  eprover: CPU time limit exceeded, terminating
% 4.36/50.39  eprover: CPU time limit exceeded, terminating
% 4.43/62.60  # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 4.43/62.60  
% 4.43/62.60  # Failure: Resource limit exceeded (time)
% 4.43/62.60  # OLD status Res
% 4.43/62.60  # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 4.43/62.60  # Preprocessing time       : 3.162 s
% 4.43/62.60  # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 4.43/62.60  
% 4.43/62.60  # Failure: Resource limit exceeded (time)
% 4.43/62.60  # OLD status Res
% 4.43/62.60  # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 4.43/62.60  # Preprocessing time       : 2.951 s
% 4.43/62.60  # Running protocol protocol_eprover_48e494e00e0717ec2eabf59b73b2d711334607de for 23 seconds:
% 4.43/62.60  # SinE strategy is GSinE(CountFormulas,hypos,1.1,,03,20000,1.0)
% 4.43/62.60  # Preprocessing time       : 3.659 s
% 4.43/62.60  
% 4.43/62.60  # Proof found!
% 4.43/62.60  # SZS status Theorem
% 4.43/62.60  # SZS output start CNFRefutation
% See solution above
% 4.43/62.60  # Proof object total steps             : 41
% 4.43/62.60  # Proof object clause steps            : 22
% 4.43/62.60  # Proof object formula steps           : 19
% 4.43/62.60  # Proof object conjectures             : 13
% 4.43/62.60  # Proof object clause conjectures      : 10
% 4.43/62.60  # Proof object formula conjectures     : 3
% 4.43/62.60  # Proof object initial clauses used    : 11
% 4.43/62.60  # Proof object initial formulas used   : 9
% 4.43/62.60  # Proof object generating inferences   : 7
% 4.43/62.60  # Proof object simplifying inferences  : 17
% 4.43/62.60  # Training examples: 0 positive, 0 negative
% 4.43/62.60  # Parsed axioms                        : 71085
% 4.43/62.60  # Removed by relevancy pruning/SinE    : 68476
% 4.43/62.60  # Initial clauses                      : 5642
% 4.43/62.60  # Removed in clause preprocessing      : 182
% 4.43/62.60  # Initial clauses in saturation        : 5460
% 4.43/62.60  # Processed clauses                    : 5679
% 4.43/62.60  # ...of these trivial                  : 65
% 4.43/62.60  # ...subsumed                          : 428
% 4.43/62.60  # ...remaining for further processing  : 5186
% 4.43/62.60  # Other redundant clauses eliminated   : 597
% 4.43/62.60  # Clauses deleted for lack of memory   : 105125
% 4.43/62.60  # Backward-subsumed                    : 22
% 4.43/62.60  # Backward-rewritten                   : 5
% 4.43/62.60  # Generated clauses                    : 199313
% 4.43/62.60  # ...of the previous two non-trivial   : 194825
% 4.43/62.60  # Contextual simplify-reflections      : 766
% 4.43/62.60  # Paramodulations                      : 198531
% 4.43/62.60  # Factorizations                       : 29
% 4.43/62.60  # Equation resolutions                 : 757
% 4.43/62.60  # Current number of processed clauses  : 5075
% 4.43/62.60  #    Positive orientable unit clauses  : 547
% 4.43/62.60  #    Positive unorientable unit clauses: 6
% 4.43/62.60  #    Negative unit clauses             : 132
% 4.43/62.60  #    Non-unit-clauses                  : 4390
% 4.43/62.60  # Current number of unprocessed clauses: 88838
% 4.43/62.60  # ...number of literals in the above   : 593971
% 4.43/62.60  # Current number of archived formulas  : 0
% 4.43/62.60  # Current number of archived clauses   : 35
% 4.43/62.60  # Clause-clause subsumption calls (NU) : 10068833
% 4.43/62.60  # Rec. Clause-clause subsumption calls : 603337
% 4.43/62.60  # Non-unit clause-clause subsumptions  : 1141
% 4.43/62.60  # Unit Clause-clause subsumption calls : 89591
% 4.43/62.60  # Rewrite failures with RHS unbound    : 0
% 4.43/62.60  # BW rewrite match attempts            : 118
% 4.43/62.60  # BW rewrite match successes           : 46
% 4.43/62.60  # Condensation attempts                : 0
% 4.43/62.60  # Condensation successes               : 0
% 4.43/62.60  # Termbank termtop insertions          : 7317211
% 4.43/62.60  
% 4.43/62.60  # -------------------------------------------------
% 4.43/62.60  # User time                : 11.563 s
% 4.43/62.60  # System time              : 0.268 s
% 4.43/62.60  # Total time               : 11.831 s
% 4.43/62.60  # Maximum resident set size: 310216 pages
%------------------------------------------------------------------------------