↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : GEO603+1 : TPTP v9.3.1. Released v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n011.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:28:34 PM UTC 2026

% Result   : Theorem 0.19s 0.52s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   55 (  21 unt;   0 def)
%            Number of atoms       :  108 (   0 equ)
%            Maximal formula atoms :    6 (   1 avg)
%            Number of connectives :   83 (  30   ~;  27   |;  15   &)
%                                         (   0 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-4 aty)
%            Number of functors    :    8 (   8 usr;   7 con; 0-4 aty)
%            Number of variables   :  135 (   2 sgn  84   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(ruleD9,axiom,
    ! [X1,X2,X3,X4,X5,X6] :
      ( ( perp(X3,X4,X5,X6)
        & perp(X1,X2,X3,X4) )
     => para(X1,X2,X5,X6) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO012+0.ax',ruleD9) ).

fof(ruleX11,axiom,
    ! [X1,X2,X3,X8] :
    ? [X9] :
      ( circle(X8,X1,X2,X3)
     => perp(X9,X1,X1,X8) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO012+0.ax',ruleX11) ).

fof(ruleD8,axiom,
    ! [X1,X2,X3,X4] :
      ( perp(X1,X2,X3,X4)
     => perp(X3,X4,X1,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO012+0.ax',ruleD8) ).

fof(exemplo6GDDFULL618065,conjecture,
    ! [X1,X2,X3,X4,X5,X6,X13] :
      ( ( circle(X13,X1,X5,X6)
        & coll(X6,X1,X3)
        & para(X2,X3,X6,X5)
        & coll(X5,X1,X2)
        & circle(X4,X1,X2,X3) )
     => coll(X1,X13,X4) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',exemplo6GDDFULL618065) ).

fof(ruleD4,axiom,
    ! [X1,X2,X3,X4] :
      ( para(X1,X2,X3,X4)
     => para(X1,X2,X4,X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO012+0.ax',ruleD4) ).

fof(ruleD5,axiom,
    ! [X1,X2,X3,X4] :
      ( para(X1,X2,X3,X4)
     => para(X3,X4,X1,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO012+0.ax',ruleD5) ).

fof(ruleD66,axiom,
    ! [X1,X2,X3] :
      ( para(X1,X2,X1,X3)
     => coll(X1,X2,X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO012+0.ax',ruleD66) ).

fof(ruleD2,axiom,
    ! [X1,X2,X3] :
      ( coll(X1,X2,X3)
     => coll(X2,X1,X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO012+0.ax',ruleD2) ).

fof(ruleD1,axiom,
    ! [X1,X2,X3] :
      ( coll(X1,X2,X3)
     => coll(X1,X3,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO012+0.ax',ruleD1) ).

fof(ruleD3,axiom,
    ! [X1,X2,X3,X4] :
      ( ( coll(X1,X2,X4)
        & coll(X1,X2,X3) )
     => coll(X3,X4,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO012+0.ax',ruleD3) ).

fof(c_0_10,plain,
    ! [X51,X52,X53,X54,X55,X56] :
      ( para(X51,X52,X55,X56)
      | ~ perp(X53,X54,X55,X56)
      | ~ perp(X51,X52,X53,X54) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD9])])]) ).

fof(c_0_11,plain,
    ! [X493,X494,X495,X496] :
      ( perp(esk12_4(X493,X494,X495,X496),X493,X493,X496)
      | ~ circle(X496,X493,X494,X495) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleX11])])])])]) ).

fof(c_0_12,plain,
    ! [X47,X48,X49,X50] :
      ( perp(X49,X50,X47,X48)
      | ~ perp(X47,X48,X49,X50) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD8])])]) ).

cnf(c_0_13,plain,
    ( ~ perp(X3,X4,X5,X6)
    | ~ perp(X1,X2,X3,X4)
    | para(X1,X2,X5,X6) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_14,plain,
    ( ~ circle(X1,X2,X3,X4)
    | perp(esk12_4(X2,X3,X4,X1),X2,X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_15,plain,
    ( ~ perp(X1,X2,X3,X4)
    | perp(X3,X4,X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

fof(c_0_16,negated_conjecture,
    ~ ! [X1,X2,X3,X4,X5,X6,X13] :
        ( ( circle(X13,X1,X5,X6)
          & coll(X6,X1,X3)
          & para(X2,X3,X6,X5)
          & coll(X5,X1,X2)
          & circle(X4,X1,X2,X3) )
       => coll(X1,X13,X4) ),
    inference(assume_negation,[status(cth)],[exemplo6GDDFULL618065]) ).

cnf(c_0_17,plain,
    ( ~ perp(X1,X2,esk12_4(X3,X5,X6,X4),X3)
    | ~ circle(X4,X3,X5,X6)
    | para(X1,X2,X3,X4) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_18,plain,
    ( ~ circle(X2,X1,X3,X4)
    | perp(X1,X2,esk12_4(X1,X3,X4,X2),X1) ),
    inference(spm,[status(thm)],[c_0_15,c_0_14]) ).

fof(c_0_19,negated_conjecture,
    ( ~ coll(esk21_0,esk27_0,esk24_0)
    & circle(esk27_0,esk21_0,esk25_0,esk26_0)
    & coll(esk26_0,esk21_0,esk23_0)
    & para(esk22_0,esk23_0,esk26_0,esk25_0)
    & coll(esk25_0,esk21_0,esk22_0)
    & circle(esk24_0,esk21_0,esk22_0,esk23_0) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])]) ).

fof(c_0_20,plain,
    ! [X29,X30,X31,X32] :
      ( para(X29,X30,X32,X31)
      | ~ para(X29,X30,X31,X32) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD4])])]) ).

cnf(c_0_21,plain,
    ( ~ circle(X2,X1,X3,X4)
    | para(X1,X2,X1,X2) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_22,negated_conjecture,
    circle(esk27_0,esk21_0,esk25_0,esk26_0),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

fof(c_0_23,plain,
    ! [X33,X34,X35,X36] :
      ( para(X35,X36,X33,X34)
      | ~ para(X33,X34,X35,X36) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD5])])]) ).

cnf(c_0_24,plain,
    ( ~ para(X1,X2,X3,X4)
    | para(X1,X2,X4,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_25,negated_conjecture,
    para(esk21_0,esk27_0,esk21_0,esk27_0),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_26,negated_conjecture,
    circle(esk24_0,esk21_0,esk22_0,esk23_0),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_27,plain,
    ( ~ para(X1,X2,X3,X4)
    | para(X3,X4,X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

cnf(c_0_28,negated_conjecture,
    para(esk21_0,esk27_0,esk27_0,esk21_0),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_29,negated_conjecture,
    para(esk21_0,esk24_0,esk21_0,esk24_0),
    inference(spm,[status(thm)],[c_0_21,c_0_26]) ).

fof(c_0_30,plain,
    ! [X383,X384,X385] :
      ( coll(X383,X384,X385)
      | ~ para(X383,X384,X383,X385) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD66])])]) ).

cnf(c_0_31,negated_conjecture,
    para(esk27_0,esk21_0,esk21_0,esk27_0),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_32,negated_conjecture,
    para(esk21_0,esk24_0,esk24_0,esk21_0),
    inference(spm,[status(thm)],[c_0_24,c_0_29]) ).

fof(c_0_33,plain,
    ! [X22,X23,X24] :
      ( coll(X23,X22,X24)
      | ~ coll(X22,X23,X24) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD2])])]) ).

cnf(c_0_34,plain,
    ( ~ para(X1,X2,X1,X3)
    | coll(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

cnf(c_0_35,negated_conjecture,
    para(esk27_0,esk21_0,esk27_0,esk21_0),
    inference(spm,[status(thm)],[c_0_24,c_0_31]) ).

cnf(c_0_36,negated_conjecture,
    para(esk24_0,esk21_0,esk21_0,esk24_0),
    inference(spm,[status(thm)],[c_0_27,c_0_32]) ).

fof(c_0_37,plain,
    ! [X19,X20,X21] :
      ( coll(X19,X21,X20)
      | ~ coll(X19,X20,X21) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD1])])]) ).

cnf(c_0_38,plain,
    ( ~ coll(X1,X2,X3)
    | coll(X2,X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_33]) ).

cnf(c_0_39,negated_conjecture,
    coll(esk27_0,esk21_0,esk21_0),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_40,negated_conjecture,
    para(esk24_0,esk21_0,esk24_0,esk21_0),
    inference(spm,[status(thm)],[c_0_24,c_0_36]) ).

fof(c_0_41,plain,
    ! [X25,X26,X27,X28] :
      ( coll(X27,X28,X25)
      | ~ coll(X25,X26,X28)
      | ~ coll(X25,X26,X27) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ruleD3])])]) ).

cnf(c_0_42,plain,
    ( ~ coll(X1,X2,X3)
    | coll(X1,X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_37]) ).

cnf(c_0_43,negated_conjecture,
    coll(esk21_0,esk27_0,esk21_0),
    inference(spm,[status(thm)],[c_0_38,c_0_39]) ).

cnf(c_0_44,negated_conjecture,
    coll(esk24_0,esk21_0,esk21_0),
    inference(spm,[status(thm)],[c_0_34,c_0_40]) ).

cnf(c_0_45,plain,
    ( ~ coll(X1,X2,X4)
    | ~ coll(X1,X2,X3)
    | coll(X3,X4,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_41]) ).

cnf(c_0_46,negated_conjecture,
    coll(esk21_0,esk21_0,esk27_0),
    inference(spm,[status(thm)],[c_0_42,c_0_43]) ).

cnf(c_0_47,negated_conjecture,
    coll(esk21_0,esk24_0,esk21_0),
    inference(spm,[status(thm)],[c_0_38,c_0_44]) ).

cnf(c_0_48,negated_conjecture,
    ( ~ coll(esk21_0,esk21_0,X1)
    | coll(X1,esk27_0,esk21_0) ),
    inference(spm,[status(thm)],[c_0_45,c_0_46]) ).

cnf(c_0_49,negated_conjecture,
    coll(esk21_0,esk21_0,esk24_0),
    inference(spm,[status(thm)],[c_0_42,c_0_47]) ).

cnf(c_0_50,negated_conjecture,
    coll(esk24_0,esk27_0,esk21_0),
    inference(spm,[status(thm)],[c_0_48,c_0_49]) ).

cnf(c_0_51,negated_conjecture,
    coll(esk24_0,esk21_0,esk27_0),
    inference(spm,[status(thm)],[c_0_42,c_0_50]) ).

cnf(c_0_52,negated_conjecture,
    coll(esk21_0,esk24_0,esk27_0),
    inference(spm,[status(thm)],[c_0_38,c_0_51]) ).

cnf(c_0_53,negated_conjecture,
    ~ coll(esk21_0,esk27_0,esk24_0),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_54,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_52]),c_0_53]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO603+1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37  % Computer : n011.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sun Sep 20 17:42:10 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41  Running first-order theorem proving
% 0.10/0.41  Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.19/0.52  % Version: 3.5.1
% 0.19/0.52  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.52  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.52  % Starting new_bool_3 with 300s (1) cores
% 0.19/0.52  % Starting new_bool_1 with 300s (1) cores
% 0.19/0.52  % Starting sh5l with 300s (1) cores
% 0.19/0.52  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 4029298 completed with status 0
% 0.19/0.52  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.19/0.52  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.52  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.52  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/0.52  % No SInE strategy applied
% 0.19/0.52  % Search class: FGUSF-FFLS33-SFFFFFNN
% 0.19/0.52  % partial match(1): FGUSF-FFLS32-SFFFFFNN
% 0.19/0.52  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.52  % Starting SubtermCWHack with 136s (1) cores
% 0.19/0.52  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.19/0.52  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.19/0.52  % Starting new_bool_3 with 136s (1) cores
% 0.19/0.52  % Starting new_bool_1 with 136s (1) cores
% 0.19/0.52  % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 4029306 completed with status 0
% 0.19/0.52  % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.19/0.52  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.52  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.52  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/0.52  % No SInE strategy applied
% 0.19/0.52  % Search class: FGUSF-FFLS33-SFFFFFNN
% 0.19/0.52  % partial match(1): FGUSF-FFLS32-SFFFFFNN
% 0.19/0.52  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.52  % Starting SubtermCWHack with 136s (1) cores
% 0.19/0.52  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.19/0.52  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.19/0.52  % Preprocessing time       : 0.003 s
% 0.19/0.52  % Presaturation interreduction done
% 0.19/0.52  
% 0.19/0.52  % Proof found!
% 0.19/0.52  % SZS status Theorem
% 0.19/0.52  % SZS output start CNFRefutation
% See solution above
% 0.19/0.52  % Parsed axioms                        : 95
% 0.19/0.52  % Removed by relevancy pruning/SinE    : 0
% 0.19/0.52  % Initial clauses                      : 119
% 0.19/0.52  % Removed in clause preprocessing      : 0
% 0.19/0.52  % Initial clauses in saturation        : 119
% 0.19/0.52  % Processed clauses                    : 870
% 0.19/0.52  % ...of these trivial                  : 53
% 0.19/0.52  % ...subsumed                          : 23
% 0.19/0.52  % ...remaining for further processing  : 794
% 0.19/0.52  % Other redundant clauses eliminated   : 0
% 0.19/0.52  % Clauses deleted for lack of memory   : 0
% 0.19/0.52  % Backward-subsumed                    : 0
% 0.19/0.52  % Backward-rewritten                   : 23
% 0.19/0.52  % Generated clauses                    : 3509
% 0.19/0.52  % ...of the previous two non-redundant : 2217
% 0.19/0.52  % ...aggressively subsumed             : 0
% 0.19/0.52  % Contextual simplify-reflections      : 0
% 0.19/0.52  % Paramodulations                      : 3509
% 0.19/0.52  % Factorizations                       : 0
% 0.19/0.52  % NegExts                              : 0
% 0.19/0.52  % Equation resolutions                 : 0
% 0.19/0.52  % Disequality decompositions           : 0
% 0.19/0.52  % Total rewrite steps                  : 1385
% 0.19/0.52  % ...of those cached                   : 1039
% 0.19/0.52  % Propositional unsat checks           : 0
% 0.19/0.52  %    Propositional check models        : 0
% 0.19/0.52  %    Propositional check unsatisfiable : 0
% 0.19/0.52  %    Propositional clauses             : 0
% 0.19/0.52  %    Propositional clauses after purity: 0
% 0.19/0.52  %    Propositional unsat core size     : 0
% 0.19/0.52  %    Propositional preprocessing time  : 0.000
% 0.19/0.52  %    Propositional encoding time       : 0.000
% 0.19/0.52  %    Propositional solver time         : 0.000
% 0.19/0.52  %    Success case prop preproc time    : 0.000
% 0.19/0.52  %    Success case prop encoding time   : 0.000
% 0.19/0.52  %    Success case prop solver time     : 0.000
% 0.19/0.52  % Current number of processed clauses  : 653
% 0.19/0.52  %    Positive orientable unit clauses  : 353
% 0.19/0.52  %    Positive unorientable unit clauses: 0
% 0.19/0.52  %    Negative unit clauses             : 1
% 0.19/0.52  %    Non-unit-clauses                  : 299
% 0.19/0.52  % Current number of unprocessed clauses: 1584
% 0.19/0.52  % ...number of literals in the above   : 5134
% 0.19/0.52  % Current number of archived formulas  : 0
% 0.19/0.52  % Current number of archived clauses   : 141
% 0.19/0.52  % Clause-clause subsumption calls (NU) : 11494
% 0.19/0.52  % Rec. Clause-clause subsumption calls : 9501
% 0.19/0.52  % Non-unit clause-clause subsumptions  : 23
% 0.19/0.52  % Unit Clause-clause subsumption calls : 9669
% 0.19/0.52  % Rewrite failures with RHS unbound    : 0
% 0.19/0.52  % BW rewrite match attempts            : 1014
% 0.19/0.52  % BW rewrite match successes           : 2
% 0.19/0.52  % Condensation attempts                : 0
% 0.19/0.52  % Condensation successes               : 0
% 0.19/0.52  % Termbank termtop insertions          : 49848
% 0.19/0.52  % Search garbage collected termcells   : 2799
% 0.19/0.52  
% 0.19/0.52  % -------------------------------------------------
% 0.19/0.52  % User time                : 0.080 s
% 0.19/0.52  % System time              : 0.005 s
% 0.19/0.52  % Total time               : 0.085 s
% 0.19/0.52  % Maximum resident set size: 4304 pages
% 0.19/0.52  
% 0.19/0.52  % -------------------------------------------------
% 0.19/0.52  % User time                : 0.326 s
% 0.19/0.52  % System time              : 0.037 s
% 0.19/0.52  % Total time               : 0.363 s
% 0.19/0.52  % Maximum resident set size: 4864 pages
% 0.19/0.52  % E exiting
%------------------------------------------------------------------------------