↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n013.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:17:17 PM UTC 2026

% Result   : Theorem 2.51s 1.34s
% Output   : CNFRefutation 2.51s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   27 (   6 unt;   0 def)
%            Number of atoms       :  245 (   0 equ)
%            Maximal formula atoms :  109 (   9 avg)
%            Number of connectives :  302 (  84   ~;  72   |; 144   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :  109 (  10 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   22 (  21 usr;   1 prp; 0-6 aty)
%            Number of functors    :   45 (  45 usr;  40 con; 0-3 aty)
%            Number of variables   :   87 (  32 sgn  17   !;  18   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(synth_qa07_007_mira_wp_484,conjecture,
    ? [X1,X2,X3,X4,X5,X6,X7] :
      ( val(X3,bmw_0)
      & val(X2,bmw_0)
      & sub(X3,name_1_1)
      & sub(X1,firma_1_1)
      & sub(X2,name_1_1)
      & obj(X5,X1)
      & attr(X6,X7)
      & attr(X4,X3)
      & attr(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',synth_qa07_007_mira_wp_484) ).

fof(ave07_era5_synth_qa07_007_mira_wp_484,hypothesis,
    ( varia(fahrzeug__1_1,varia_c)
    & refer(fahrzeug__1_1,refer_c)
    & quant(fahrzeug__1_1,one)
    & gener(fahrzeug__1_1,ge)
    & fact(fahrzeug__1_1,real)
    & etype(fahrzeug__1_1,int0)
    & card(fahrzeug__1_1,int1)
    & sort(fahrzeug__1_1,d)
    & sort(bmw_0,fe)
    & varia(name_1_1,varia_c)
    & refer(name_1_1,refer_c)
    & quant(name_1_1,one)
    & gener(name_1_1,ge)
    & fact(name_1_1,real)
    & etype(name_1_1,int0)
    & card(name_1_1,int1)
    & sort(name_1_1,na)
    & varia(c79,varia_c)
    & refer(c79,indet)
    & quant(c79,one)
    & gener(c79,sp)
    & fact(c79,real)
    & etype(c79,int0)
    & card(c79,int1)
    & sort(c79,na)
    & varia(umbau__1_1,varia_c)
    & refer(umbau__1_1,refer_c)
    & quant(umbau__1_1,one)
    & gener(umbau__1_1,ge)
    & fact(umbau__1_1,real)
    & etype(umbau__1_1,int0)
    & card(umbau__1_1,int1)
    & sort(umbau__1_1,ad)
    & varia(firma_1_1,varia_c)
    & refer(firma_1_1,refer_c)
    & quant(firma_1_1,one)
    & gener(firma_1_1,ge)
    & fact(firma_1_1,real)
    & etype(firma_1_1,int0)
    & card(firma_1_1,int1)
    & sort(firma_1_1,io)
    & sort(firma_1_1,d)
    & varia(bekanntheit_1_1,varia_c)
    & refer(bekanntheit_1_1,refer_c)
    & quant(bekanntheit_1_1,one)
    & gener(bekanntheit_1_1,ge)
    & fact(bekanntheit_1_1,real)
    & etype(bekanntheit_1_1,int0)
    & card(bekanntheit_1_1,int1)
    & sort(bekanntheit_1_1,na)
    & varia(c80,varia_c)
    & refer(c80,indet)
    & quant(c80,mult)
    & gener(c80,gener_c)
    & fact(c80,real)
    & etype(c80,int1)
    & card(c80,cons(x_constant,cons(int1,nil)))
    & sort(c80,d)
    & varia(c78,con)
    & refer(c78,det)
    & quant(c78,one)
    & gener(c78,sp)
    & fact(c78,real)
    & etype(c78,int0)
    & card(c78,int1)
    & sort(c78,io)
    & sort(c78,d)
    & varia(c66,varia_c)
    & refer(c66,indet)
    & quant(c66,mult)
    & gener(c66,gener_c)
    & fact(c66,real)
    & etype(c66,int1)
    & card(c66,cons(x_constant,cons(int1,nil)))
    & sort(c66,ad)
    & varia(c62,con)
    & refer(c62,det)
    & quant(c62,one)
    & gener(c62,sp)
    & fact(c62,real)
    & etype(c62,int0)
    & card(c62,int1)
    & sort(c62,io)
    & sort(c62,d)
    & varia(c56,varia_c)
    & refer(c56,refer_c)
    & quant(c56,one)
    & gener(c56,gener_c)
    & fact(c56,real)
    & etype(c56,int0)
    & card(c56,int1)
    & sort(c56,na)
    & varia(c112,varia_c)
    & refer(c112,refer_c)
    & quant(c112,quant_c)
    & gener(c112,gener_c)
    & fact(c112,real)
    & etype(c112,etype_c)
    & card(c112,card_c)
    & sort(c112,ent)
    & pred(c80,fahrzeug__1_1)
    & val(c79,bmw_0)
    & sub(c79,name_1_1)
    & sub(c78,firma_1_1)
    & attr(c78,c79)
    & preds(c66,umbau__1_1)
    & sub(c62,firma_1_1)
    & sub(c56,bekanntheit_1_1)
    & tupl_p6(c112,c56,c62,c66,c78,c80) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ave07_era5_synth_qa07_007_mira_wp_484) ).

fof(sub__bezeichnen_1_1_als,axiom,
    ! [X1,X2,X3] :
      ( ( subr(X1,sub_0)
        & arg2(X1,X3)
        & arg1(X1,X2) )
     => ? [X4,X5,X6] :
          ( subs(X4,bezeichnen_1_1)
          & subr(X5,rprs_0)
          & sub(X6,X3)
          & obj(X4,X2)
          & mcont(X4,X5)
          & hsit(X1,X4)
          & arg2(X5,X6)
          & arg1(X5,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR004+0.ax',sub__bezeichnen_1_1_als) ).

fof(sub__sub_0_expansion,axiom,
    ! [X1,X2] :
      ( sub(X1,X2)
     => ? [X3] :
          ( subr(X3,sub_0)
          & arg2(X3,X2)
          & arg1(X3,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR004+0.ax',sub__sub_0_expansion) ).

fof(c_0_4,negated_conjecture,
    ~ ? [X1,X2,X3,X4,X5,X6,X7] :
        ( val(X3,bmw_0)
        & val(X2,bmw_0)
        & sub(X3,name_1_1)
        & sub(X1,firma_1_1)
        & sub(X2,name_1_1)
        & obj(X5,X1)
        & attr(X6,X7)
        & attr(X4,X3)
        & attr(X1,X2) ),
    inference(assume_negation,[status(cth)],[synth_qa07_007_mira_wp_484]) ).

fof(c_0_5,negated_conjecture,
    ! [X8,X9,X10,X11,X12,X13,X14] :
      ( ~ val(X10,bmw_0)
      | ~ val(X9,bmw_0)
      | ~ sub(X10,name_1_1)
      | ~ sub(X8,firma_1_1)
      | ~ sub(X9,name_1_1)
      | ~ obj(X12,X8)
      | ~ attr(X13,X14)
      | ~ attr(X11,X10)
      | ~ attr(X8,X9) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).

cnf(c_0_6,negated_conjecture,
    ( ~ val(X4,bmw_0)
    | ~ val(X2,bmw_0)
    | ~ sub(X4,name_1_1)
    | ~ sub(X1,firma_1_1)
    | ~ sub(X2,name_1_1)
    | ~ obj(X7,X1)
    | ~ attr(X5,X6)
    | ~ attr(X3,X4)
    | ~ attr(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_7,hypothesis,
    val(c79,bmw_0),
    inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_wp_484]) ).

cnf(c_0_8,hypothesis,
    sub(c79,name_1_1),
    inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_wp_484]) ).

cnf(c_0_9,hypothesis,
    ( ~ sub(X5,firma_1_1)
    | ~ sub(X1,name_1_1)
    | ~ obj(X6,X5)
    | ~ attr(X5,X1)
    | ~ attr(X3,X4)
    | ~ attr(X2,c79)
    | ~ val(X1,bmw_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8])]) ).

cnf(c_0_10,hypothesis,
    ( ~ sub(X2,firma_1_1)
    | ~ obj(X5,X2)
    | ~ attr(X3,X4)
    | ~ attr(X2,c79)
    | ~ attr(X1,c79) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_7]),c_0_8])]) ).

cnf(c_0_11,hypothesis,
    attr(c78,c79),
    inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_wp_484]) ).

cnf(c_0_12,hypothesis,
    ( ~ sub(X1,firma_1_1)
    | ~ obj(X4,X1)
    | ~ attr(X2,X3)
    | ~ attr(X1,c79) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_13,hypothesis,
    sub(c78,firma_1_1),
    inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_wp_484]) ).

fof(c_0_14,plain,
    ! [X290,X291,X292] :
      ( ( ~ subr(X290,sub_0)
        | ~ arg2(X290,X292)
        | ~ arg1(X290,X291)
        | subs(esk40_3(X290,X291,X292),bezeichnen_1_1) )
      & ( ~ subr(X290,sub_0)
        | ~ arg2(X290,X292)
        | ~ arg1(X290,X291)
        | subr(esk41_3(X290,X291,X292),rprs_0) )
      & ( ~ subr(X290,sub_0)
        | ~ arg2(X290,X292)
        | ~ arg1(X290,X291)
        | sub(esk42_3(X290,X291,X292),X292) )
      & ( ~ subr(X290,sub_0)
        | ~ arg2(X290,X292)
        | ~ arg1(X290,X291)
        | obj(esk40_3(X290,X291,X292),X291) )
      & ( ~ subr(X290,sub_0)
        | ~ arg2(X290,X292)
        | ~ arg1(X290,X291)
        | mcont(esk40_3(X290,X291,X292),esk41_3(X290,X291,X292)) )
      & ( ~ subr(X290,sub_0)
        | ~ arg2(X290,X292)
        | ~ arg1(X290,X291)
        | hsit(X290,esk40_3(X290,X291,X292)) )
      & ( ~ subr(X290,sub_0)
        | ~ arg2(X290,X292)
        | ~ arg1(X290,X291)
        | arg2(esk41_3(X290,X291,X292),esk42_3(X290,X291,X292)) )
      & ( ~ subr(X290,sub_0)
        | ~ arg2(X290,X292)
        | ~ arg1(X290,X291)
        | arg1(esk41_3(X290,X291,X292),X291) ) ),
    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)],[sub__bezeichnen_1_1_als])])])])])]) ).

cnf(c_0_15,hypothesis,
    ( ~ obj(X3,c78)
    | ~ attr(X1,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_11]),c_0_13])]) ).

cnf(c_0_16,plain,
    ( ~ subr(X1,sub_0)
    | ~ arg2(X1,X3)
    | ~ arg1(X1,X2)
    | obj(esk40_3(X1,X2,X3),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

fof(c_0_17,plain,
    ! [X296,X297] :
      ( ( ~ sub(X296,X297)
        | subr(esk43_2(X296,X297),sub_0) )
      & ( ~ sub(X296,X297)
        | arg2(esk43_2(X296,X297),X297) )
      & ( ~ sub(X296,X297)
        | arg1(esk43_2(X296,X297),X296) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sub__sub_0_expansion])])])])]) ).

cnf(c_0_18,hypothesis,
    ( ~ arg1(X1,c78)
    | ~ arg2(X1,X4)
    | ~ attr(X2,X3)
    | ~ subr(X1,sub_0) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_19,plain,
    ( ~ sub(X1,X2)
    | subr(esk43_2(X1,X2),sub_0) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_20,hypothesis,
    ( ~ sub(X3,X4)
    | ~ arg1(esk43_2(X3,X4),c78)
    | ~ arg2(esk43_2(X3,X4),X5)
    | ~ attr(X1,X2) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_21,plain,
    ( ~ sub(X1,X2)
    | arg1(esk43_2(X1,X2),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_22,hypothesis,
    ( ~ sub(c78,X3)
    | ~ arg2(esk43_2(c78,X3),X4)
    | ~ attr(X1,X2) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_23,plain,
    ( ~ sub(X1,X2)
    | arg2(esk43_2(X1,X2),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_24,hypothesis,
    ( ~ sub(c78,X3)
    | ~ attr(X1,X2) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_25,hypothesis,
    ~ attr(X1,X2),
    inference(spm,[status(thm)],[c_0_24,c_0_13]) ).

cnf(c_0_26,hypothesis,
    $false,
    inference(sr,[status(thm)],[c_0_11,c_0_25]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : CSR115+74 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.49  % Computer : n013.cluster.edu
% 0.17/0.49  % Model    : x86_64 x86_64
% 0.17/0.49  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.49  % Memory   : 8046.5625MB
% 0.17/0.49  % OS       : Linux 6.8.0-71-generic
% 0.17/0.49  % CPULimit : 300
% 0.17/0.49  % WCLimit  : 300
% 0.17/0.49  % DateTime : Mon Sep 21 15:07:06 UTC 2026
% 0.17/0.50  % CPUTime  : 
% 0.17/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
% 2.51/1.34  % Version: 3.5.1
% 2.51/1.34  % Preprocessing class: FMLLSMSLSSSNFFN.
% 2.51/1.34  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.51/1.34  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.51/1.34  % Starting new_bool_3 with 300s (1) cores
% 2.51/1.34  % Starting new_bool_1 with 300s (1) cores
% 2.51/1.34  % Starting sh5l with 300s (1) cores
% 2.51/1.34  % G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 1043877 completed with status 0
% 2.51/1.34  % Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 2.51/1.34  % Preprocessing class: FMLLSMSLSSSNFFN.
% 2.51/1.34  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.51/1.34  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.51/1.34  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.51/1.34  % SinE strategy is gf500_h_gu_R04_F100_L20000
% 2.51/1.34  % Search class: FHHNS-FSLM32-MFFFFFNN
% 2.51/1.34  % partial match(2): FHHNS-SMLM32-MFFFFFNN
% 2.51/1.34  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.51/1.34  % Starting SubtermCWHack with 136s (1) cores
% 2.51/1.34  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 2.51/1.34  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 2.51/1.34  % Starting new_bool_3 with 136s (1) cores
% 2.51/1.34  % Starting new_bool_1 with 136s (1) cores
% 2.51/1.34  % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 1043886 completed with status 0
% 2.51/1.34  % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 2.51/1.34  % Preprocessing class: FMLLSMSLSSSNFFN.
% 2.51/1.34  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.51/1.34  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.51/1.34  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.51/1.34  % SinE strategy is gf500_h_gu_R04_F100_L20000
% 2.51/1.34  % Search class: FHHNS-FSLM32-MFFFFFNN
% 2.51/1.34  % partial match(2): FHHNS-SMLM32-MFFFFFNN
% 2.51/1.34  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.51/1.34  % Starting SubtermCWHack with 136s (1) cores
% 2.51/1.34  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 2.51/1.34  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 2.51/1.34  % Preprocessing time       : 0.027 s
% 2.51/1.34  % Presaturation interreduction done
% 2.51/1.34  
% 2.51/1.34  % Proof found!
% 2.51/1.34  % SZS status Theorem
% 2.51/1.34  % SZS output start CNFRefutation
% See solution above
% 2.51/1.34  % Parsed axioms                        : 10189
% 2.51/1.34  % Removed by relevancy pruning/SinE    : 9949
% 2.51/1.34  % Initial clauses                      : 501
% 2.51/1.34  % Removed in clause preprocessing      : 0
% 2.51/1.34  % Initial clauses in saturation        : 501
% 2.51/1.34  % Processed clauses                    : 1013
% 2.51/1.34  % ...of these trivial                  : 0
% 2.51/1.34  % ...subsumed                          : 1
% 2.51/1.34  % ...remaining for further processing  : 1012
% 2.51/1.34  % Other redundant clauses eliminated   : 0
% 2.51/1.34  % Clauses deleted for lack of memory   : 0
% 2.51/1.34  % Backward-subsumed                    : 20
% 2.51/1.34  % Backward-rewritten                   : 0
% 2.51/1.34  % Generated clauses                    : 437
% 2.51/1.34  % ...of the previous two non-redundant : 436
% 2.51/1.34  % ...aggressively subsumed             : 0
% 2.51/1.34  % Contextual simplify-reflections      : 1
% 2.51/1.34  % Paramodulations                      : 436
% 2.51/1.34  % Factorizations                       : 0
% 2.51/1.34  % NegExts                              : 0
% 2.51/1.34  % Equation resolutions                 : 0
% 2.51/1.34  % Disequality decompositions           : 0
% 2.51/1.34  % Total rewrite steps                  : 4
% 2.51/1.34  % ...of those cached                   : 1
% 2.51/1.34  % Propositional unsat checks           : 0
% 2.51/1.34  %    Propositional check models        : 0
% 2.51/1.34  %    Propositional check unsatisfiable : 0
% 2.51/1.34  %    Propositional clauses             : 0
% 2.51/1.34  %    Propositional clauses after purity: 0
% 2.51/1.34  %    Propositional unsat core size     : 0
% 2.51/1.34  %    Propositional preprocessing time  : 0.000
% 2.51/1.34  %    Propositional encoding time       : 0.000
% 2.51/1.34  %    Propositional solver time         : 0.000
% 2.51/1.34  %    Success case prop preproc time    : 0.000
% 2.51/1.34  %    Success case prop encoding time   : 0.000
% 2.51/1.34  %    Success case prop solver time     : 0.000
% 2.51/1.34  % Current number of processed clauses  : 490
% 2.51/1.34  %    Positive orientable unit clauses  : 286
% 2.51/1.34  %    Positive unorientable unit clauses: 0
% 2.51/1.34  %    Negative unit clauses             : 1
% 2.51/1.34  %    Non-unit-clauses                  : 203
% 2.51/1.34  % Current number of unprocessed clauses: 425
% 2.51/1.34  % ...number of literals in the above   : 1452
% 2.51/1.34  % Current number of archived formulas  : 0
% 2.51/1.34  % Current number of archived clauses   : 522
% 2.51/1.34  % Clause-clause subsumption calls (NU) : 37473
% 2.51/1.34  % Rec. Clause-clause subsumption calls : 17157
% 2.51/1.34  % Non-unit clause-clause subsumptions  : 7
% 2.51/1.34  % Unit Clause-clause subsumption calls : 192
% 2.51/1.34  % Rewrite failures with RHS unbound    : 0
% 2.51/1.34  % BW rewrite match attempts            : 0
% 2.51/1.34  % BW rewrite match successes           : 0
% 2.51/1.34  % Condensation attempts                : 0
% 2.51/1.34  % Condensation successes               : 0
% 2.51/1.34  % Termbank termtop insertions          : 74827
% 2.51/1.34  % Search garbage collected termcells   : 40743
% 2.51/1.34  
% 2.51/1.34  % -------------------------------------------------
% 2.51/1.34  % User time                : 0.252 s
% 2.51/1.34  % System time              : 0.169 s
% 2.51/1.34  % Total time               : 0.421 s
% 2.51/1.34  % Maximum resident set size: 50240 pages
% 2.51/1.34  
% 2.51/1.34  % -------------------------------------------------
% 2.51/1.34  % User time                : 0.839 s
% 2.51/1.34  % System time              : 0.499 s
% 2.51/1.34  % Total time               : 1.337 s
% 2.51/1.34  % Maximum resident set size: 14336 pages
% 2.51/1.34  % E exiting
%------------------------------------------------------------------------------