↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : COM274_1 : TPTP v9.3.1. Released v9.3.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:11:50 PM UTC 2026

% Result   : Theorem 0.15s 5.51s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   42 (  20 unt;   0 typ;   0 def)
%            Number of atoms       :   83 (  42 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   78 (  37   ~;  16   |;  17   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    8 (   7 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   15 (  15 usr;   7 con; 0-3 aty)
%            Number of variables   :   57 (   0 sgn  51   !;   6   ?;  57   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_sort1,type,
    vAnsMap: $tType ).

tff(decl_sort2,type,
    vExp: $tType ).

tff(decl_sort3,type,
    vAType: $tType ).

tff(decl_sort4,type,
    vOptExp: $tType ).

tff(decl_sort5,type,
    vBinOpT: $tType ).

tff(decl_sort6,type,
    vOptAType: $tType ).

tff(decl_sort7,type,
    vATMap: $tType ).

tff(decl_27,type,
    vsomeExp: vExp > vOptExp ).

tff(decl_33,type,
    vnoAType: vOptAType ).

tff(decl_35,type,
    ve1: vExp ).

tff(decl_54,type,
    vnoExp: vOptExp ).

tff(decl_55,type,
    vbinop: ( vExp * ( vBinOpT * vExp ) ) > vExp ).

tff(decl_75,type,
    vsomeAType: vAType > vOptAType ).

tff(decl_76,type,
    ve2: vExp ).

tff(decl_83,type,
    vecheck: ( vExp * vATMap ) > vOptAType ).

tff(decl_93,type,
    vexpIsValue: vExp > $o ).

tff(decl_96,type,
    vtypeAM: vAnsMap > vATMap ).

tff(decl_103,type,
    visSomeAType: vOptAType > $o ).

tff(decl_120,type,
    visSomeExp: vOptExp > $o ).

tff(decl_128,type,
    vreduceExp: ( vAnsMap * vExp ) > vOptExp ).

tff(decl_150,type,
    esk1_0: vAnsMap ).

tff(decl_151,type,
    esk2_0: vBinOpT ).

tff(decl_152,type,
    esk3_0: vAType ).

tff(decl_161,type,
    esk12_1: vAnsMap > vExp ).

tff(decl_174,type,
    esk25_1: vOptAType > vAType ).

tff('reduceExpProgress-binop-expIsValue-False-isSomeExp-False',conjecture,
    ! [X126: vAnsMap,X501: vBinOpT,X73: vAType] :
      ( ( ( vecheck(vtypeAM(X126),vbinop(ve1,X501,ve2)) = vsomeAType(X73) )
        & ~ vexpIsValue(vbinop(ve1,X501,ve2))
        & ~ vexpIsValue(ve1)
        & ~ visSomeExp(vreduceExp(ve1,X126)) )
     => ? [X502: vExp] : ( vreduceExp(vbinop(ve1,X501,ve2),X126) = vsomeExp(X502) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','reduceExpProgress-binop-expIsValue-False-isSomeExp-False') ).

tff('reduceExpProgress-binop-IH0',axiom,
    ! [X126: vAnsMap,X73: vAType] :
      ( ( ( vecheck(vtypeAM(X126),ve1) = vsomeAType(X73) )
        & ~ vexpIsValue(ve1) )
     => ? [X500: vExp] : ( vreduceExp(ve1,X126) = vsomeExp(X500) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','reduceExpProgress-binop-IH0') ).

tff('dom-OptAType',axiom,
    ! [X46: vOptAType] :
      ( ? [X4: vAType] : ( X46 = vsomeAType(X4) )
      | ( X46 = vnoAType ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','dom-OptAType') ).

tff('isSomeExp-1',axiom,
    ! [X170: vExp] : visSomeExp(vsomeExp(X170)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','isSomeExp-1') ).

tff('isSomeAType-0',axiom,
    ~ visSomeAType(vnoAType),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','isSomeAType-0') ).

tff('isSomeExp-false-INV',axiom,
    ! [X171: vOptExp] :
      ( ~ visSomeExp(X171)
     => ( X171 = vnoExp ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','isSomeExp-false-INV') ).

tff('echeck-5',axiom,
    ! [X355: vATMap,X228: vExp,X229: vExp,X230: vBinOpT] :
      ( ~ ( visSomeAType(vecheck(X355,X229))
          & visSomeAType(vecheck(X355,X228)) )
     => ( vecheck(X355,vbinop(X228,X230,X229)) = vnoAType ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','echeck-5') ).

tff('DIFF-noAType-someAType',axiom,
    ! [X4: vAType] : ( vnoAType != vsomeAType(X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','DIFF-noAType-someAType') ).

tff('isSomeExp-0',axiom,
    ~ visSomeExp(vnoExp),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','isSomeExp-0') ).

tff(c_0_9,negated_conjecture,
    ~ ! [X126: vAnsMap,X501: vBinOpT,X73: vAType] :
        ( ( ( vecheck(vtypeAM(X126),vbinop(ve1,X501,ve2)) = vsomeAType(X73) )
          & ~ vexpIsValue(vbinop(ve1,X501,ve2))
          & ~ vexpIsValue(ve1)
          & ~ visSomeExp(vreduceExp(ve1,X126)) )
       => ? [X502: vExp] : ( vreduceExp(vbinop(ve1,X501,ve2),X126) = vsomeExp(X502) ) ),
    inference(assume_negation,[status(cth)],['reduceExpProgress-binop-expIsValue-False-isSomeExp-False']) ).

tff(c_0_10,plain,
    ! [X126: vAnsMap,X73: vAType] :
      ( ( ( vecheck(vtypeAM(X126),ve1) = vsomeAType(X73) )
        & ~ vexpIsValue(ve1) )
     => ? [X500: vExp] : ( vreduceExp(ve1,X126) = vsomeExp(X500) ) ),
    inference(fof_simplification,[status(thm)],['reduceExpProgress-binop-IH0']) ).

tff(c_0_11,negated_conjecture,
    ~ ! [X126: vAnsMap,X501: vBinOpT,X73: vAType] :
        ( ( ( vecheck(vtypeAM(X126),vbinop(ve1,X501,ve2)) = vsomeAType(X73) )
          & ~ vexpIsValue(vbinop(ve1,X501,ve2))
          & ~ vexpIsValue(ve1)
          & ~ visSomeExp(vreduceExp(ve1,X126)) )
       => ? [X502: vExp] : ( vreduceExp(vbinop(ve1,X501,ve2),X126) = vsomeExp(X502) ) ),
    inference(fof_simplification,[status(thm)],[c_0_9]) ).

tff(c_0_12,plain,
    ! [X553: vAnsMap,X554: vAType] :
      ( ( vreduceExp(ve1,X553) = vsomeExp(esk12_1(X553)) )
      | ( vecheck(vtypeAM(X553),ve1) != vsomeAType(X554) )
      | vexpIsValue(ve1) ),
    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)],[c_0_10])])])])])]) ).

tff(c_0_13,negated_conjecture,
    ! [X506: vExp] :
      ( ( vreduceExp(vbinop(ve1,esk2_0,ve2),esk1_0) != vsomeExp(X506) )
      & ( vecheck(vtypeAM(esk1_0),vbinop(ve1,esk2_0,ve2)) = vsomeAType(esk3_0) )
      & ~ vexpIsValue(vbinop(ve1,esk2_0,ve2))
      & ~ vexpIsValue(ve1)
      & ~ visSomeExp(vreduceExp(ve1,esk1_0)) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])]) ).

tcf(c_0_14,plain,
    ! [X55: vAnsMap,X4: vAType] :
      ( ( vecheck(vtypeAM(X55),ve1) != vsomeAType(X4) )
      | ( vreduceExp(ve1,X55) = vsomeExp(esk12_1(X55)) )
      | vexpIsValue(ve1) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

tcf(c_0_15,negated_conjecture,
    ~ vexpIsValue(ve1),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

tff(c_0_16,plain,
    ! [X646: vOptAType] :
      ( ( X646 = vsomeAType(esk25_1(X646)) )
      | ( X646 = vnoAType ) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['dom-OptAType'])]) ).

tff(c_0_17,plain,
    ! [X606: vExp] : visSomeExp(vsomeExp(X606)),
    inference(variable_rename,[status(thm)],['isSomeExp-1']) ).

tcf(c_0_18,plain,
    ! [X55: vAnsMap,X4: vAType] :
      ( ( vecheck(vtypeAM(X55),ve1) != vsomeAType(X4) )
      | ( vsomeExp(esk12_1(X55)) = vreduceExp(ve1,X55) ) ),
    inference(sr,[status(thm)],[c_0_14,c_0_15]) ).

tcf(c_0_19,plain,
    ! [X46: vOptAType] :
      ( ( X46 = vsomeAType(esk25_1(X46)) )
      | ( X46 = vnoAType ) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

tff(c_0_20,plain,
    ~ visSomeAType(vnoAType),
    inference(fof_simplification,[status(thm)],['isSomeAType-0']) ).

tff(c_0_21,plain,
    ! [X171: vOptExp] :
      ( ~ visSomeExp(X171)
     => ( X171 = vnoExp ) ),
    inference(fof_simplification,[status(thm)],['isSomeExp-false-INV']) ).

tff(c_0_22,plain,
    ! [X546: vATMap,X547: vExp,X548: vExp,X549: vBinOpT] :
      ( ( ( vecheck(X546,vbinop(X547,X549,X548)) = vnoAType )
        | visSomeAType(vecheck(X546,X548)) )
      & ( ( vecheck(X546,vbinop(X547,X549,X548)) = vnoAType )
        | visSomeAType(vecheck(X546,X547)) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['echeck-5'])])]) ).

tcf(c_0_23,plain,
    ! [X5: vExp] : visSomeExp(vsomeExp(X5)),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

tcf(c_0_24,plain,
    ! [X55: vAnsMap] :
      ( ( vecheck(vtypeAM(X55),ve1) = vnoAType )
      | ( vsomeExp(esk12_1(X55)) = vreduceExp(ve1,X55) ) ),
    inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19])]) ).

tff(c_0_25,plain,
    ~ visSomeAType(vnoAType),
    inference(fof_nnf,[status(thm)],[c_0_20]) ).

tff(c_0_26,plain,
    ! [X609: vOptExp] :
      ( ( X609 = vnoExp )
      | visSomeExp(X609) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])]) ).

tff(c_0_27,plain,
    ! [X4: vAType] : ( vnoAType != vsomeAType(X4) ),
    inference(fof_simplification,[status(thm)],['DIFF-noAType-someAType']) ).

tff(c_0_28,plain,
    ~ visSomeExp(vnoExp),
    inference(fof_simplification,[status(thm)],['isSomeExp-0']) ).

tcf(c_0_29,plain,
    ! [X5: vExp,X22: vBinOpT,X15: vATMap,X9: vExp] :
      ( ( vecheck(X15,vbinop(X5,X22,X9)) = vnoAType )
      | visSomeAType(vecheck(X15,X5)) ),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

tcf(c_0_30,plain,
    ! [X55: vAnsMap] :
      ( visSomeExp(vreduceExp(ve1,X55))
      | ( vecheck(vtypeAM(X55),ve1) = vnoAType ) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

tcf(c_0_31,plain,
    ~ visSomeAType(vnoAType),
    inference(split_conjunct,[status(thm)],[c_0_25]) ).

tcf(c_0_32,negated_conjecture,
    ~ visSomeExp(vreduceExp(ve1,esk1_0)),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

tcf(c_0_33,plain,
    ! [X53: vOptExp] :
      ( ( X53 = vnoExp )
      | visSomeExp(X53) ),
    inference(split_conjunct,[status(thm)],[c_0_26]) ).

tff(c_0_34,plain,
    ! [X648: vAType] : ( vnoAType != vsomeAType(X648) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_27])]) ).

tff(c_0_35,plain,
    ~ visSomeExp(vnoExp),
    inference(fof_nnf,[status(thm)],[c_0_28]) ).

tcf(c_0_36,negated_conjecture,
    vecheck(vtypeAM(esk1_0),vbinop(ve1,esk2_0,ve2)) = vsomeAType(esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

tcf(c_0_37,plain,
    ! [X5: vExp,X22: vBinOpT,X55: vAnsMap] :
      ( visSomeExp(vreduceExp(ve1,X55))
      | ( vecheck(vtypeAM(X55),vbinop(ve1,X22,X5)) = vnoAType ) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).

tcf(c_0_38,negated_conjecture,
    vreduceExp(ve1,esk1_0) = vnoExp,
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

tcf(c_0_39,plain,
    ! [X4: vAType] : vnoAType != vsomeAType(X4),
    inference(split_conjunct,[status(thm)],[c_0_34]) ).

tcf(c_0_40,plain,
    ~ visSomeExp(vnoExp),
    inference(split_conjunct,[status(thm)],[c_0_35]) ).

cnf(c_0_41,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),c_0_39]),c_0_40]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : COM274_1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/5.37  % Computer : n013.cluster.edu
% 0.10/5.37  % Model    : x86_64 x86_64
% 0.10/5.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37  % Memory   : 8046.5625MB
% 0.10/5.37  % OS       : Linux 6.8.0-71-generic
% 0.10/5.37  % CPULimit : 300
% 0.10/5.37  % WCLimit  : 300
% 0.10/5.37  % DateTime : Mon Sep 21 14:22:12 UTC 2026
% 0.10/5.37  % CPUTime  : 
% 0.10/5.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/5.42  Running first-order theorem proving
% 0.15/5.42  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
% 0.15/5.51  % Version: 3.5.1
% 0.15/5.51  % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.15/5.51  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.51  % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.15/5.51  % Starting new_bool_3 with 600s (2) cores
% 0.15/5.51  % Starting new_bool_1 with 300s (1) cores
% 0.15/5.51  % Starting sh5l with 300s (1) cores
% 0.15/5.51  % new_bool_1 with pid 988224 completed with status 0
% 0.15/5.51  % Result found by new_bool_1
% 0.15/5.51  % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.15/5.51  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.51  % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.15/5.51  % Starting new_bool_3 with 600s (2) cores
% 0.15/5.51  % Starting new_bool_1 with 300s (1) cores
% 0.15/5.51  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/5.51  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/5.51  % Search class: FGUSM-FSLM32-DFFFFFNN
% 0.15/5.51  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.51  % Starting SubtermCWHack with 31s (1) cores
% 0.15/5.51  % SubtermCWHack with pid 988226 completed with status 0
% 0.15/5.51  % Result found by SubtermCWHack
% 0.15/5.51  % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.15/5.51  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.51  % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.15/5.51  % Starting new_bool_3 with 600s (2) cores
% 0.15/5.51  % Starting new_bool_1 with 300s (1) cores
% 0.15/5.51  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/5.51  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/5.51  % Search class: FGUSM-FSLM32-DFFFFFNN
% 0.15/5.51  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.51  % Starting SubtermCWHack with 31s (1) cores
% 0.15/5.51  % Preprocessing time       : 0.008 s
% 0.15/5.51  
% 0.15/5.51  % Proof found!
% 0.15/5.51  % SZS status Theorem
% 0.15/5.51  % SZS output start CNFRefutation
% See solution above
% 0.15/5.51  % Parsed axioms                        : 508
% 0.15/5.51  % Removed by relevancy pruning/SinE    : 295
% 0.15/5.51  % Initial clauses                      : 687
% 0.15/5.51  % Removed in clause preprocessing      : 0
% 0.15/5.51  % Initial clauses in saturation        : 687
% 0.15/5.51  % Processed clauses                    : 775
% 0.15/5.51  % ...of these trivial                  : 33
% 0.15/5.51  % ...subsumed                          : 311
% 0.15/5.51  % ...remaining for further processing  : 431
% 0.15/5.51  % Other redundant clauses eliminated   : 171
% 0.15/5.51  % Clauses deleted for lack of memory   : 0
% 0.15/5.51  % Backward-subsumed                    : 1
% 0.15/5.51  % Backward-rewritten                   : 7
% 0.15/5.51  % Generated clauses                    : 1582
% 0.15/5.51  % ...of the previous two non-redundant : 920
% 0.15/5.51  % ...aggressively subsumed             : 0
% 0.15/5.51  % Contextual simplify-reflections      : 4
% 0.15/5.51  % Paramodulations                      : 1323
% 0.15/5.51  % Factorizations                       : 46
% 0.15/5.51  % NegExts                              : 0
% 0.15/5.51  % Equation resolutions                 : 213
% 0.15/5.51  % Disequality decompositions           : 0
% 0.15/5.51  % Total rewrite steps                  : 722
% 0.15/5.51  % ...of those cached                   : 592
% 0.15/5.51  % Propositional unsat checks           : 0
% 0.15/5.51  %    Propositional check models        : 0
% 0.15/5.51  %    Propositional check unsatisfiable : 0
% 0.15/5.51  %    Propositional clauses             : 0
% 0.15/5.51  %    Propositional clauses after purity: 0
% 0.15/5.51  %    Propositional unsat core size     : 0
% 0.15/5.51  %    Propositional preprocessing time  : 0.000
% 0.15/5.51  %    Propositional encoding time       : 0.000
% 0.15/5.51  %    Propositional solver time         : 0.000
% 0.15/5.51  %    Success case prop preproc time    : 0.000
% 0.15/5.51  %    Success case prop encoding time   : 0.000
% 0.15/5.51  %    Success case prop solver time     : 0.000
% 0.15/5.51  % Current number of processed clauses  : 423
% 0.15/5.51  %    Positive orientable unit clauses  : 81
% 0.15/5.51  %    Positive unorientable unit clauses: 2
% 0.15/5.51  %    Negative unit clauses             : 78
% 0.15/5.51  %    Non-unit-clauses                  : 262
% 0.15/5.51  % Current number of unprocessed clauses: 811
% 0.15/5.51  % ...number of literals in the above   : 2866
% 0.15/5.51  % Current number of archived formulas  : 0
% 0.15/5.51  % Current number of archived clauses   : 8
% 0.15/5.51  % Clause-clause subsumption calls (NU) : 17513
% 0.15/5.51  % Rec. Clause-clause subsumption calls : 14795
% 0.15/5.51  % Non-unit clause-clause subsumptions  : 251
% 0.15/5.51  % Unit Clause-clause subsumption calls : 2633
% 0.15/5.51  % Rewrite failures with RHS unbound    : 16
% 0.15/5.51  % BW rewrite match attempts            : 9
% 0.15/5.51  % BW rewrite match successes           : 8
% 0.15/5.51  % Condensation attempts                : 0
% 0.15/5.51  % Condensation successes               : 0
% 0.15/5.51  % Termbank termtop insertions          : 44123
% 0.15/5.51  % Search garbage collected termcells   : 7857
% 0.15/5.51  
% 0.15/5.51  % -------------------------------------------------
% 0.15/5.51  % User time                : 0.056 s
% 0.15/5.51  % System time              : 0.008 s
% 0.15/5.51  % Total time               : 0.063 s
% 0.15/5.51  % Maximum resident set size: 5816 pages
% 0.15/5.51  
% 0.15/5.51  % -------------------------------------------------
% 0.15/5.51  % User time                : 0.072 s
% 0.15/5.51  % System time              : 0.012 s
% 0.15/5.51  % Total time               : 0.083 s
% 0.15/5.51  % Maximum resident set size: 5376 pages
% 0.15/5.51  % E exiting
%------------------------------------------------------------------------------