↑ Up

E-SAT---3.5.1.THM-CRf.s

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

% Computer : n002.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 12:18:40 PM UTC 2026

% Result   : Theorem 33.40s 7.75s
% Output   : CNFRefutation 33.40s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   19
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   40 (  11 unt;   0 def)
%            Number of atoms       :  153 (  25 equ)
%            Maximal formula atoms :   45 (   3 avg)
%            Number of connectives :  180 (  67   ~;  75   |;  28   &)
%                                         (   3 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   24 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   6 con; 0-3 aty)
%            Number of variables   :   80 (  27 sgn  31   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(prove_from_SUMO,conjecture,
    ( s__mother(s__Bob7_1,s__Jane7_1)
    & s__mother(s__Bill7_1,s__Jane7_1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_from_SUMO) ).

fof(local_4,axiom,
    s__mother(s__Bill7_1,s__Jane7_1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_4) ).

fof(kb_SUMO_3496,axiom,
    ! [X171,X172,X173] :
      ( X172 = s__UnionFn(X173,X171)
    <=> ! [X174,X175,X176] :
          ( ( s__instance(X171,s__SetOrClass)
            & s__instance(X172,s__SetOrClass)
            & s__instance(X173,s__SetOrClass) )
         => ( ( s__instance(X176,X172)
              & s__instance(X175,X171)
              & s__instance(X174,X173) )
           => ( ( s__instance(X176,X171)
                | s__instance(X176,X173) )
              & s__instance(X175,X172)
              & s__instance(X174,X172) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_3496) ).

fof(kb_SUMO_3533,axiom,
    ! [X168] :
      ( s__instance(X168,s__SetOrClass)
     => ( s__instance(X168,s__NullSet)
       => ~ ? [X48] : s__instance(X48,X168) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_3533) ).

fof(kb_SUMO_276,axiom,
    ! [X9,X10] :
      ( s__disjoint(X9,X10)
    <=> ! [X48] :
          ( ( s__instance(X9,s__SetOrClass)
            & s__instance(X10,s__SetOrClass) )
         => ~ ( s__instance(X48,X10)
              & s__instance(X48,X9) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_276) ).

fof(kb_SUMO_3489,axiom,
    ! [X169,X170] :
      ( ! [X49] :
          ( ( s__instance(X169,s__Set)
            & s__instance(X170,s__Set) )
         => ( s__element(X49,X170)
          <=> s__element(X49,X169) ) )
     => X170 = X169 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_3489) ).

fof(c_0_6,negated_conjecture,
    ~ ( s__mother(s__Bob7_1,s__Jane7_1)
      & s__mother(s__Bill7_1,s__Jane7_1) ),
    inference(assume_negation,[status(cth)],[prove_from_SUMO]) ).

fof(c_0_7,negated_conjecture,
    ( ~ s__mother(s__Bob7_1,s__Jane7_1)
    | ~ s__mother(s__Bill7_1,s__Jane7_1) ),
    inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])]) ).

cnf(c_0_8,negated_conjecture,
    ( ~ s__mother(s__Bob7_1,s__Jane7_1)
    | ~ s__mother(s__Bill7_1,s__Jane7_1) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_9,plain,
    s__mother(s__Bill7_1,s__Jane7_1),
    inference(split_conjunct,[status(thm)],[local_4]) ).

fof(c_0_10,plain,
    ! [X6422,X6423,X6424,X6425,X6426,X6427,X6428,X6429,X6430] :
      ( ( X6429 = s__UnionFn(X6430,X6428)
        | ~ s__instance(esk159_3(X6428,X6429,X6430),X6429)
        | ~ s__instance(esk158_3(X6428,X6429,X6430),X6429)
        | ~ s__instance(esk160_3(X6428,X6429,X6430),X6428) )
      & ( X6429 = s__UnionFn(X6430,X6428)
        | ~ s__instance(esk159_3(X6428,X6429,X6430),X6429)
        | ~ s__instance(esk158_3(X6428,X6429,X6430),X6429)
        | ~ s__instance(esk160_3(X6428,X6429,X6430),X6430) )
      & ( X6429 = s__UnionFn(X6430,X6428)
        | s__instance(esk160_3(X6428,X6429,X6430),X6429) )
      & ( X6429 = s__UnionFn(X6430,X6428)
        | s__instance(esk159_3(X6428,X6429,X6430),X6428) )
      & ( X6429 = s__UnionFn(X6430,X6428)
        | s__instance(esk158_3(X6428,X6429,X6430),X6430) )
      & ( X6429 = s__UnionFn(X6430,X6428)
        | s__instance(X6428,s__SetOrClass) )
      & ( X6429 = s__UnionFn(X6430,X6428)
        | s__instance(X6429,s__SetOrClass) )
      & ( X6429 = s__UnionFn(X6430,X6428)
        | s__instance(X6430,s__SetOrClass) )
      & ( X6423 != s__UnionFn(X6424,X6422)
        | ~ s__instance(X6422,s__SetOrClass)
        | ~ s__instance(X6423,s__SetOrClass)
        | ~ s__instance(X6424,s__SetOrClass)
        | ~ s__instance(X6427,X6423)
        | ~ s__instance(X6426,X6422)
        | ~ s__instance(X6425,X6424)
        | s__instance(X6427,X6422)
        | s__instance(X6427,X6424) )
      & ( X6423 != s__UnionFn(X6424,X6422)
        | ~ s__instance(X6422,s__SetOrClass)
        | ~ s__instance(X6423,s__SetOrClass)
        | ~ s__instance(X6424,s__SetOrClass)
        | ~ s__instance(X6427,X6423)
        | ~ s__instance(X6426,X6422)
        | ~ s__instance(X6425,X6424)
        | s__instance(X6426,X6423) )
      & ( X6423 != s__UnionFn(X6424,X6422)
        | ~ s__instance(X6422,s__SetOrClass)
        | ~ s__instance(X6423,s__SetOrClass)
        | ~ s__instance(X6424,s__SetOrClass)
        | ~ s__instance(X6427,X6423)
        | ~ s__instance(X6426,X6422)
        | ~ s__instance(X6425,X6424)
        | s__instance(X6425,X6423) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_3496])])])])])])]) ).

cnf(c_0_11,negated_conjecture,
    ~ s__mother(s__Bob7_1,s__Jane7_1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]) ).

cnf(c_0_12,plain,
    ( X2 = s__UnionFn(X3,X1)
    | s__instance(X1,s__SetOrClass) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_13,negated_conjecture,
    ( ~ s__mother(s__UnionFn(X2,X1),s__Jane7_1)
    | s__instance(X1,s__SetOrClass) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

fof(c_0_14,plain,
    ! [X6434,X6435] :
      ( ~ s__instance(X6435,X6434)
      | ~ s__instance(X6434,s__NullSet)
      | ~ s__instance(X6434,s__SetOrClass) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_3533])])])]) ).

cnf(c_0_15,negated_conjecture,
    ( ~ s__mother(X2,s__Jane7_1)
    | s__instance(X1,s__SetOrClass) ),
    inference(spm,[status(thm)],[c_0_13,c_0_12]) ).

cnf(c_0_16,plain,
    ( ~ s__instance(X2,X1)
    | ~ s__instance(X1,s__NullSet)
    | ~ s__instance(X1,s__SetOrClass) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_17,negated_conjecture,
    s__instance(X1,s__SetOrClass),
    inference(spm,[status(thm)],[c_0_15,c_0_9]) ).

fof(c_0_18,plain,
    ! [X1512,X1513,X1514,X1515,X1516] :
      ( ( s__disjoint(X1515,X1516)
        | s__instance(esk1_2(X1515,X1516),X1516) )
      & ( s__disjoint(X1515,X1516)
        | s__instance(esk1_2(X1515,X1516),X1515) )
      & ( s__disjoint(X1515,X1516)
        | s__instance(X1515,s__SetOrClass) )
      & ( s__disjoint(X1515,X1516)
        | s__instance(X1516,s__SetOrClass) )
      & ( ~ s__instance(X1514,X1513)
        | ~ s__instance(X1514,X1512)
        | ~ s__instance(X1512,s__SetOrClass)
        | ~ s__instance(X1513,s__SetOrClass)
        | ~ s__disjoint(X1512,X1513) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_276])])])])])])]) ).

cnf(c_0_19,plain,
    ( ~ s__instance(X2,X1)
    | ~ s__instance(X1,s__NullSet) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).

cnf(c_0_20,plain,
    ( s__disjoint(X1,X2)
    | s__instance(esk1_2(X1,X2),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_21,plain,
    ( ~ s__instance(X2,esk1_2(s__NullSet,X1))
    | s__disjoint(s__NullSet,X1) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_22,plain,
    ( X2 = s__UnionFn(X3,X1)
    | s__instance(esk158_3(X1,X2,X3),X3) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_23,plain,
    ( s__disjoint(s__NullSet,X2)
    | X1 = s__UnionFn(esk1_2(s__NullSet,X2),X3) ),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_24,plain,
    ( s__disjoint(s__NullSet,X3)
    | X1 = X2 ),
    inference(spm,[status(thm)],[c_0_23,c_0_23]) ).

fof(c_0_25,plain,
    ! [X6419,X6420] :
      ( ( X6420 = X6419
        | s__element(esk157_2(X6419,X6420),X6419)
        | s__element(esk157_2(X6419,X6420),X6420) )
      & ( X6420 = X6419
        | ~ s__element(esk157_2(X6419,X6420),X6419)
        | ~ s__element(esk157_2(X6419,X6420),X6420) )
      & ( X6420 = X6419
        | s__instance(X6419,s__Set) )
      & ( X6420 = X6419
        | s__instance(X6420,s__Set) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_3489])])])])])]) ).

cnf(c_0_26,plain,
    ( ~ s__instance(X3,X2)
    | ~ s__instance(X3,X1)
    | ~ s__instance(X1,s__SetOrClass)
    | ~ s__instance(X2,s__SetOrClass)
    | ~ s__disjoint(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_27,negated_conjecture,
    ( ~ s__mother(X2,s__Jane7_1)
    | s__disjoint(s__NullSet,X1) ),
    inference(spm,[status(thm)],[c_0_11,c_0_24]) ).

cnf(c_0_28,plain,
    ( X2 = X1
    | s__instance(X1,s__Set) ),
    inference(split_conjunct,[status(thm)],[c_0_25]) ).

cnf(c_0_29,plain,
    ( ~ s__instance(X3,X1)
    | ~ s__instance(X3,X2)
    | ~ s__disjoint(X1,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_17]),c_0_17])]) ).

cnf(c_0_30,negated_conjecture,
    s__disjoint(s__NullSet,X1),
    inference(spm,[status(thm)],[c_0_27,c_0_9]) ).

cnf(c_0_31,negated_conjecture,
    ( ~ s__mother(X1,s__Jane7_1)
    | s__instance(s__Bob7_1,s__Set) ),
    inference(spm,[status(thm)],[c_0_11,c_0_28]) ).

cnf(c_0_32,negated_conjecture,
    ( ~ s__instance(X1,X2)
    | ~ s__instance(X1,s__NullSet) ),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_33,negated_conjecture,
    s__instance(s__Bob7_1,s__Set),
    inference(spm,[status(thm)],[c_0_31,c_0_9]) ).

cnf(c_0_34,negated_conjecture,
    ( ~ s__instance(esk158_3(X2,X1,s__NullSet),X3)
    | X1 = s__UnionFn(s__NullSet,X2) ),
    inference(spm,[status(thm)],[c_0_32,c_0_22]) ).

cnf(c_0_35,negated_conjecture,
    s__instance(X1,s__Set),
    inference(spm,[status(thm)],[c_0_33,c_0_28]) ).

cnf(c_0_36,negated_conjecture,
    X1 = s__UnionFn(s__NullSet,X2),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_37,negated_conjecture,
    X1 = X2,
    inference(spm,[status(thm)],[c_0_36,c_0_36]) ).

cnf(c_0_38,negated_conjecture,
    ~ s__mother(X1,s__Jane7_1),
    inference(spm,[status(thm)],[c_0_11,c_0_37]) ).

cnf(c_0_39,plain,
    $false,
    inference(sr,[status(thm)],[c_0_9,c_0_38]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CSR081+4 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.07  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.49  % Computer : n002.cluster.edu
% 0.18/0.49  % Model    : x86_64 x86_64
% 0.18/0.49  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.49  % Memory   : 8046.5625MB
% 0.18/0.49  % OS       : Linux 6.8.0-71-generic
% 0.18/0.49  % CPULimit : 300
% 0.18/0.49  % WCLimit  : 300
% 0.18/0.49  % DateTime : Mon Sep 21 14:53:17 UTC 2026
% 0.18/0.50  % CPUTime  : 
% 0.18/0.50  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.59  Running first-order theorem proving
% 0.23/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
% 33.40/7.75  % Version: 3.5.1
% 33.40/7.75  % Preprocessing class: FMLLSMSLSSSNFFN.
% 33.40/7.75  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 33.40/7.75  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 33.40/7.75  % Starting new_bool_3 with 300s (1) cores
% 33.40/7.75  % Starting new_bool_1 with 300s (1) cores
% 33.40/7.75  % Starting sh5l with 300s (1) cores
% 33.40/7.75  % G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 3543246 completed with status 0
% 33.40/7.75  % Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 33.40/7.75  % Preprocessing class: FMLLSMSLSSSNFFN.
% 33.40/7.75  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 33.40/7.75  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 33.40/7.75  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 33.40/7.75  % No SInE strategy applied
% 33.40/7.75  % Search class: FGHSM-SMLM31-MFFFFFNN
% 33.40/7.75  % Scheduled 7 strats onto 5 cores with 1499 seconds (1499 total)
% 33.40/7.75  % Starting SubtermCWHack with 135s (1) cores
% 33.40/7.75  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 150s (1) cores
% 33.40/7.75  % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 135s (1) cores
% 33.40/7.75  % Starting new_bool_3 with 135s (1) cores
% 33.40/7.75  % Starting new_bool_1 with 135s (1) cores
% 33.40/7.75  % G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 3543255 completed with status 0
% 33.40/7.75  % Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 33.40/7.75  % Preprocessing class: FMLLSMSLSSSNFFN.
% 33.40/7.75  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 33.40/7.75  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 33.40/7.75  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 33.40/7.75  % No SInE strategy applied
% 33.40/7.75  % Search class: FGHSM-SMLM31-MFFFFFNN
% 33.40/7.75  % Scheduled 7 strats onto 5 cores with 1499 seconds (1499 total)
% 33.40/7.75  % Starting SubtermCWHack with 135s (1) cores
% 33.40/7.75  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 150s (1) cores
% 33.40/7.75  % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 135s (1) cores
% 33.40/7.75  % Preprocessing time       : 0.108 s
% 33.40/7.75  % Presaturation interreduction done
% 33.40/7.75  
% 33.40/7.75  % Proof found!
% 33.40/7.75  % SZS status Theorem
% 33.40/7.75  % SZS output start CNFRefutation
% See solution above
% 33.40/7.75  % Parsed axioms                        : 7223
% 33.40/7.75  % Removed by relevancy pruning/SinE    : 0
% 33.40/7.75  % Initial clauses                      : 8414
% 33.40/7.75  % Removed in clause preprocessing      : 63
% 33.40/7.75  % Initial clauses in saturation        : 8351
% 33.40/7.75  % Processed clauses                    : 17613
% 33.40/7.75  % ...of these trivial                  : 927
% 33.40/7.75  % ...subsumed                          : 251
% 33.40/7.75  % ...remaining for further processing  : 16435
% 33.40/7.75  % Other redundant clauses eliminated   : 379
% 33.40/7.75  % Clauses deleted for lack of memory   : 0
% 33.40/7.75  % Backward-subsumed                    : 1114
% 33.40/7.75  % Backward-rewritten                   : 1415
% 33.40/7.75  % Generated clauses                    : 98424
% 33.40/7.75  % ...of the previous two non-redundant : 88680
% 33.40/7.75  % ...aggressively subsumed             : 0
% 33.40/7.75  % Contextual simplify-reflections      : 665
% 33.40/7.75  % Paramodulations                      : 98034
% 33.40/7.75  % Factorizations                       : 1
% 33.40/7.75  % NegExts                              : 0
% 33.40/7.75  % Equation resolutions                 : 381
% 33.40/7.75  % Disequality decompositions           : 0
% 33.40/7.75  % Total rewrite steps                  : 12230
% 33.40/7.75  % ...of those cached                   : 7722
% 33.40/7.75  % Propositional unsat checks           : 4
% 33.40/7.75  %    Propositional check models        : 3
% 33.40/7.75  %    Propositional check unsatisfiable : 0
% 33.40/7.75  %    Propositional clauses             : 0
% 33.40/7.75  %    Propositional clauses after purity: 0
% 33.40/7.75  %    Propositional unsat core size     : 0
% 33.40/7.75  %    Propositional preprocessing time  : 0.000
% 33.40/7.75  %    Propositional encoding time       : 0.090
% 33.40/7.75  %    Propositional solver time         : 0.103
% 33.40/7.75  %    Success case prop preproc time    : 0.000
% 33.40/7.75  %    Success case prop encoding time   : 0.000
% 33.40/7.75  %    Success case prop solver time     : 0.000
% 33.40/7.75  % Current number of processed clauses  : 5476
% 33.40/7.75  %    Positive orientable unit clauses  : 3945
% 33.40/7.75  %    Positive unorientable unit clauses: 1
% 33.40/7.75  %    Negative unit clauses             : 16
% 33.40/7.75  %    Non-unit-clauses                  : 1514
% 33.40/7.75  % Current number of unprocessed clauses: 54737
% 33.40/7.75  % ...number of literals in the above   : 106074
% 33.40/7.75  % Current number of archived formulas  : 0
% 33.40/7.75  % Current number of archived clauses   : 10704
% 33.40/7.75  % Clause-clause subsumption calls (NU) : 3048771
% 33.40/7.75  % Rec. Clause-clause subsumption calls : 848262
% 33.40/7.75  % Non-unit clause-clause subsumptions  : 920
% 33.40/7.75  % Unit Clause-clause subsumption calls : 275821
% 33.40/7.75  % Rewrite failures with RHS unbound    : 10046
% 33.40/7.75  % BW rewrite match attempts            : 33411
% 33.40/7.75  % BW rewrite match successes           : 11038
% 33.40/7.75  % Condensation attempts                : 0
% 33.40/7.75  % Condensation successes               : 0
% 33.40/7.75  % Termbank termtop insertions          : 1288463
% 33.40/7.75  % Search garbage collected termcells   : 89723
% 33.40/7.75  
% 33.40/7.75  % -------------------------------------------------
% 33.40/7.75  % User time                : 4.684 s
% 33.40/7.75  % System time              : 0.167 s
% 33.40/7.75  % Total time               : 4.851 s
% 33.40/7.75  % Maximum resident set size: 31280 pages
% 33.40/7.75  
% 33.40/7.75  % -------------------------------------------------
% 33.40/7.75  % User time                : 23.246 s
% 33.40/7.75  % System time              : 0.944 s
% 33.40/7.75  % Total time               : 24.190 s
% 33.40/7.75  % Maximum resident set size: 12288 pages
% 33.40/7.75  % E exiting
%------------------------------------------------------------------------------