TSTP Solution File: GEO088-1 by E-SAT---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : GEO088-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n028.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  : 300s
% DateTime : Mon May 20 20:00:33 EDT 2024

% Result   : Unsatisfiable 47.37s 6.47s
% Output   : CNFRefutation 47.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   57 (  17 unt;  28 nHn;  48 RR)
%            Number of literals    :  145 (   0 equ;  63 neg)
%            Maximal clause size   :    7 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   82 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(part_of_defn_1,axiom,
    ( incident_c(X3,X2)
    | ~ part_of(X1,X2)
    | ~ incident_c(X3,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-0.ax',part_of_defn_1) ).

cnf(end_point_defn_15,axiom,
    ( part_of(ax0_sk3(X2,X1),X2)
    | end_point(X1,X2)
    | ~ incident_c(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-0.ax',end_point_defn_15) ).

cnf(theorem_2_10_70,negated_conjecture,
    ~ end_point(sk16,sk15),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',theorem_2_10_70) ).

cnf(part_of_defn_2,axiom,
    ( incident_c(ax0_sk1(X1,X2),X1)
    | part_of(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-0.ax',part_of_defn_2) ).

cnf(theorem_2_10_69,negated_conjecture,
    incident_c(sk16,sk15),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',theorem_2_10_69) ).

cnf(end_point_defn_16,axiom,
    ( part_of(ax0_sk4(X2,X1),X2)
    | end_point(X1,X2)
    | ~ incident_c(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-0.ax',end_point_defn_16) ).

cnf(end_point_defn_14,axiom,
    ( part_of(X3,X4)
    | part_of(X4,X3)
    | ~ end_point(X1,X2)
    | ~ part_of(X3,X2)
    | ~ part_of(X4,X2)
    | ~ incident_c(X1,X3)
    | ~ incident_c(X1,X4) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-0.ax',end_point_defn_14) ).

cnf(end_point_defn_17,axiom,
    ( incident_c(X1,ax0_sk3(X2,X1))
    | end_point(X1,X2)
    | ~ incident_c(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-0.ax',end_point_defn_17) ).

cnf(theorem_2_10_68,negated_conjecture,
    end_point(sk16,sk14),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',theorem_2_10_68) ).

cnf(part_of_defn_3,axiom,
    ( part_of(X1,X2)
    | ~ incident_c(ax0_sk1(X1,X2),X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-0.ax',part_of_defn_3) ).

cnf(theorem_2_10_67,negated_conjecture,
    part_of(sk15,sk14),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',theorem_2_10_67) ).

cnf(end_point_defn_18,axiom,
    ( incident_c(X1,ax0_sk4(X2,X1))
    | end_point(X1,X2)
    | ~ incident_c(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-0.ax',end_point_defn_18) ).

cnf(end_point_defn_20,axiom,
    ( end_point(X1,X2)
    | ~ incident_c(X1,X2)
    | ~ part_of(ax0_sk4(X2,X1),ax0_sk3(X2,X1)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-0.ax',end_point_defn_20) ).

cnf(end_point_defn_19,axiom,
    ( end_point(X1,X2)
    | ~ incident_c(X1,X2)
    | ~ part_of(ax0_sk3(X2,X1),ax0_sk4(X2,X1)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO004-0.ax',end_point_defn_19) ).

cnf(c_0_14,plain,
    ( incident_c(X3,X2)
    | ~ part_of(X1,X2)
    | ~ incident_c(X3,X1) ),
    inference(fof_simplification,[status(thm)],[part_of_defn_1]) ).

cnf(c_0_15,plain,
    ( part_of(ax0_sk3(X2,X1),X2)
    | end_point(X1,X2)
    | ~ incident_c(X1,X2) ),
    inference(fof_simplification,[status(thm)],[end_point_defn_15]) ).

cnf(c_0_16,negated_conjecture,
    ~ end_point(sk16,sk15),
    inference(fof_simplification,[status(thm)],[theorem_2_10_70]) ).

cnf(c_0_17,plain,
    ( incident_c(X3,X2)
    | ~ part_of(X1,X2)
    | ~ incident_c(X3,X1) ),
    c_0_14 ).

cnf(c_0_18,axiom,
    ( incident_c(ax0_sk1(X1,X2),X1)
    | part_of(X1,X2) ),
    part_of_defn_2 ).

cnf(c_0_19,plain,
    ( part_of(ax0_sk3(X2,X1),X2)
    | end_point(X1,X2)
    | ~ incident_c(X1,X2) ),
    c_0_15 ).

cnf(c_0_20,negated_conjecture,
    incident_c(sk16,sk15),
    theorem_2_10_69 ).

cnf(c_0_21,negated_conjecture,
    ~ end_point(sk16,sk15),
    c_0_16 ).

cnf(c_0_22,plain,
    ( part_of(ax0_sk4(X2,X1),X2)
    | end_point(X1,X2)
    | ~ incident_c(X1,X2) ),
    inference(fof_simplification,[status(thm)],[end_point_defn_16]) ).

cnf(c_0_23,plain,
    ( incident_c(ax0_sk1(X1,X2),X3)
    | part_of(X1,X2)
    | ~ part_of(X1,X3) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_24,negated_conjecture,
    part_of(ax0_sk3(sk15,sk16),sk15),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).

cnf(c_0_25,plain,
    ( part_of(ax0_sk4(X2,X1),X2)
    | end_point(X1,X2)
    | ~ incident_c(X1,X2) ),
    c_0_22 ).

cnf(c_0_26,plain,
    ( part_of(X3,X4)
    | part_of(X4,X3)
    | ~ end_point(X1,X2)
    | ~ part_of(X3,X2)
    | ~ part_of(X4,X2)
    | ~ incident_c(X1,X3)
    | ~ incident_c(X1,X4) ),
    inference(fof_simplification,[status(thm)],[end_point_defn_14]) ).

cnf(c_0_27,plain,
    ( incident_c(X1,ax0_sk3(X2,X1))
    | end_point(X1,X2)
    | ~ incident_c(X1,X2) ),
    inference(fof_simplification,[status(thm)],[end_point_defn_17]) ).

cnf(c_0_28,negated_conjecture,
    ( incident_c(ax0_sk1(ax0_sk3(sk15,sk16),X1),sk15)
    | part_of(ax0_sk3(sk15,sk16),X1) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_29,negated_conjecture,
    part_of(ax0_sk4(sk15,sk16),sk15),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_20]),c_0_21]) ).

cnf(c_0_30,plain,
    ( part_of(X3,X4)
    | part_of(X4,X3)
    | ~ end_point(X1,X2)
    | ~ part_of(X3,X2)
    | ~ part_of(X4,X2)
    | ~ incident_c(X1,X3)
    | ~ incident_c(X1,X4) ),
    c_0_26 ).

cnf(c_0_31,negated_conjecture,
    end_point(sk16,sk14),
    theorem_2_10_68 ).

cnf(c_0_32,plain,
    ( incident_c(X1,ax0_sk3(X2,X1))
    | end_point(X1,X2)
    | ~ incident_c(X1,X2) ),
    c_0_27 ).

cnf(c_0_33,plain,
    ( part_of(X1,X2)
    | ~ incident_c(ax0_sk1(X1,X2),X2) ),
    inference(fof_simplification,[status(thm)],[part_of_defn_3]) ).

cnf(c_0_34,negated_conjecture,
    ( incident_c(ax0_sk1(ax0_sk3(sk15,sk16),X1),X2)
    | part_of(ax0_sk3(sk15,sk16),X1)
    | ~ part_of(sk15,X2) ),
    inference(spm,[status(thm)],[c_0_17,c_0_28]) ).

cnf(c_0_35,negated_conjecture,
    part_of(sk15,sk14),
    theorem_2_10_67 ).

cnf(c_0_36,negated_conjecture,
    ( incident_c(ax0_sk1(ax0_sk4(sk15,sk16),X1),sk15)
    | part_of(ax0_sk4(sk15,sk16),X1) ),
    inference(spm,[status(thm)],[c_0_23,c_0_29]) ).

cnf(c_0_37,negated_conjecture,
    ( part_of(X1,X2)
    | part_of(X2,X1)
    | ~ incident_c(sk16,X1)
    | ~ incident_c(sk16,X2)
    | ~ part_of(X1,sk14)
    | ~ part_of(X2,sk14) ),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_38,negated_conjecture,
    incident_c(sk16,ax0_sk3(sk15,sk16)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_20]),c_0_21]) ).

cnf(c_0_39,plain,
    ( part_of(X1,X2)
    | ~ incident_c(ax0_sk1(X1,X2),X2) ),
    c_0_33 ).

cnf(c_0_40,negated_conjecture,
    ( incident_c(ax0_sk1(ax0_sk3(sk15,sk16),X1),sk14)
    | part_of(ax0_sk3(sk15,sk16),X1) ),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_41,plain,
    ( incident_c(X1,ax0_sk4(X2,X1))
    | end_point(X1,X2)
    | ~ incident_c(X1,X2) ),
    inference(fof_simplification,[status(thm)],[end_point_defn_18]) ).

cnf(c_0_42,negated_conjecture,
    ( incident_c(ax0_sk1(ax0_sk4(sk15,sk16),X1),X2)
    | part_of(ax0_sk4(sk15,sk16),X1)
    | ~ part_of(sk15,X2) ),
    inference(spm,[status(thm)],[c_0_17,c_0_36]) ).

cnf(c_0_43,negated_conjecture,
    ( part_of(X1,ax0_sk3(sk15,sk16))
    | part_of(ax0_sk3(sk15,sk16),X1)
    | ~ incident_c(sk16,X1)
    | ~ part_of(ax0_sk3(sk15,sk16),sk14)
    | ~ part_of(X1,sk14) ),
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_44,negated_conjecture,
    part_of(ax0_sk3(sk15,sk16),sk14),
    inference(spm,[status(thm)],[c_0_39,c_0_40]) ).

cnf(c_0_45,plain,
    ( incident_c(X1,ax0_sk4(X2,X1))
    | end_point(X1,X2)
    | ~ incident_c(X1,X2) ),
    c_0_41 ).

cnf(c_0_46,negated_conjecture,
    ( incident_c(ax0_sk1(ax0_sk4(sk15,sk16),X1),sk14)
    | part_of(ax0_sk4(sk15,sk16),X1) ),
    inference(spm,[status(thm)],[c_0_42,c_0_35]) ).

cnf(c_0_47,plain,
    ( end_point(X1,X2)
    | ~ incident_c(X1,X2)
    | ~ part_of(ax0_sk4(X2,X1),ax0_sk3(X2,X1)) ),
    inference(fof_simplification,[status(thm)],[end_point_defn_20]) ).

cnf(c_0_48,negated_conjecture,
    ( part_of(ax0_sk3(sk15,sk16),X1)
    | part_of(X1,ax0_sk3(sk15,sk16))
    | ~ incident_c(sk16,X1)
    | ~ part_of(X1,sk14) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]) ).

cnf(c_0_49,negated_conjecture,
    incident_c(sk16,ax0_sk4(sk15,sk16)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_20]),c_0_21]) ).

cnf(c_0_50,negated_conjecture,
    part_of(ax0_sk4(sk15,sk16),sk14),
    inference(spm,[status(thm)],[c_0_39,c_0_46]) ).

cnf(c_0_51,plain,
    ( end_point(X1,X2)
    | ~ incident_c(X1,X2)
    | ~ part_of(ax0_sk3(X2,X1),ax0_sk4(X2,X1)) ),
    inference(fof_simplification,[status(thm)],[end_point_defn_19]) ).

cnf(c_0_52,plain,
    ( end_point(X1,X2)
    | ~ incident_c(X1,X2)
    | ~ part_of(ax0_sk4(X2,X1),ax0_sk3(X2,X1)) ),
    c_0_47 ).

cnf(c_0_53,negated_conjecture,
    ( part_of(ax0_sk4(sk15,sk16),ax0_sk3(sk15,sk16))
    | part_of(ax0_sk3(sk15,sk16),ax0_sk4(sk15,sk16)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50])]) ).

cnf(c_0_54,plain,
    ( end_point(X1,X2)
    | ~ incident_c(X1,X2)
    | ~ part_of(ax0_sk3(X2,X1),ax0_sk4(X2,X1)) ),
    c_0_51 ).

cnf(c_0_55,negated_conjecture,
    part_of(ax0_sk3(sk15,sk16),ax0_sk4(sk15,sk16)),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_20])]),c_0_21]) ).

cnf(c_0_56,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_20])]),c_0_21]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem    : GEO088-1 : TPTP v8.2.0. Released v2.4.0.
% 0.04/0.13  % Command    : run_E %s %d THM
% 0.14/0.34  % Computer : n028.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Sun May 19 14:58:23 EDT 2024
% 0.14/0.34  % CPUTime    : 
% 0.20/0.47  Running first-order model finding
% 0.20/0.47  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 47.37/6.47  # Version: 3.1.0
% 47.37/6.47  # Preprocessing class: FSLSSMSSSSSNFFN.
% 47.37/6.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 47.37/6.47  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 47.37/6.47  # Starting new_bool_3 with 300s (1) cores
% 47.37/6.47  # Starting new_bool_1 with 300s (1) cores
% 47.37/6.47  # Starting sh5l with 300s (1) cores
% 47.37/6.47  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 23926 completed with status 0
% 47.37/6.47  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 47.37/6.47  # Preprocessing class: FSLSSMSSSSSNFFN.
% 47.37/6.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 47.37/6.47  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 47.37/6.47  # No SInE strategy applied
% 47.37/6.47  # Search class: FGHSF-FFMS31-SFFFFFNN
% 47.37/6.47  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 47.37/6.47  # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 737s (1) cores
% 47.37/6.47  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 47.37/6.47  # Starting new_bool_3 with 189s (1) cores
% 47.37/6.47  # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 47.37/6.47  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 47.37/6.47  # G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with pid 23937 completed with status 0
% 47.37/6.47  # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN
% 47.37/6.47  # Preprocessing class: FSLSSMSSSSSNFFN.
% 47.37/6.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 47.37/6.47  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 47.37/6.47  # No SInE strategy applied
% 47.37/6.47  # Search class: FGHSF-FFMS31-SFFFFFNN
% 47.37/6.47  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 47.37/6.47  # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 737s (1) cores
% 47.37/6.47  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 47.37/6.47  # Starting new_bool_3 with 189s (1) cores
% 47.37/6.47  # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 47.37/6.47  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 47.37/6.47  # Preprocessing time       : 0.002 s
% 47.37/6.47  
% 47.37/6.47  # Proof found!
% 47.37/6.47  # SZS status Unsatisfiable
% 47.37/6.47  # SZS output start CNFRefutation
% See solution above
% 47.37/6.47  # Parsed axioms                        : 52
% 47.37/6.47  # Removed by relevancy pruning/SinE    : 0
% 47.37/6.47  # Initial clauses                      : 52
% 47.37/6.47  # Removed in clause preprocessing      : 5
% 47.37/6.47  # Initial clauses in saturation        : 47
% 47.37/6.47  # Processed clauses                    : 8395
% 47.37/6.47  # ...of these trivial                  : 19
% 47.37/6.47  # ...subsumed                          : 4365
% 47.37/6.47  # ...remaining for further processing  : 4011
% 47.37/6.47  # Other redundant clauses eliminated   : 20
% 47.37/6.47  # Clauses deleted for lack of memory   : 0
% 47.37/6.47  # Backward-subsumed                    : 230
% 47.37/6.47  # Backward-rewritten                   : 9
% 47.37/6.47  # Generated clauses                    : 263871
% 47.37/6.47  # ...of the previous two non-redundant : 258557
% 47.37/6.47  # ...aggressively subsumed             : 0
% 47.37/6.47  # Contextual simplify-reflections      : 133
% 47.37/6.47  # Paramodulations                      : 262936
% 47.37/6.47  # Factorizations                       : 828
% 47.37/6.47  # NegExts                              : 0
% 47.37/6.47  # Equation resolutions                 : 107
% 47.37/6.47  # Disequality decompositions           : 0
% 47.37/6.47  # Total rewrite steps                  : 6343
% 47.37/6.47  # ...of those cached                   : 5837
% 47.37/6.47  # Propositional unsat checks           : 0
% 47.37/6.47  #    Propositional check models        : 0
% 47.37/6.47  #    Propositional check unsatisfiable : 0
% 47.37/6.47  #    Propositional clauses             : 0
% 47.37/6.47  #    Propositional clauses after purity: 0
% 47.37/6.47  #    Propositional unsat core size     : 0
% 47.37/6.47  #    Propositional preprocessing time  : 0.000
% 47.37/6.47  #    Propositional encoding time       : 0.000
% 47.37/6.47  #    Propositional solver time         : 0.000
% 47.37/6.47  #    Success case prop preproc time    : 0.000
% 47.37/6.47  #    Success case prop encoding time   : 0.000
% 47.37/6.47  #    Success case prop solver time     : 0.000
% 47.37/6.47  # Current number of processed clauses  : 3772
% 47.37/6.47  #    Positive orientable unit clauses  : 218
% 47.37/6.47  #    Positive unorientable unit clauses: 0
% 47.37/6.47  #    Negative unit clauses             : 5
% 47.37/6.47  #    Non-unit-clauses                  : 3549
% 47.37/6.47  # Current number of unprocessed clauses: 249624
% 47.37/6.47  # ...number of literals in the above   : 1560895
% 47.37/6.47  # Current number of archived formulas  : 0
% 47.37/6.47  # Current number of archived clauses   : 239
% 47.37/6.47  # Clause-clause subsumption calls (NU) : 1569320
% 47.37/6.47  # Rec. Clause-clause subsumption calls : 216312
% 47.37/6.47  # Non-unit clause-clause subsumptions  : 4708
% 47.37/6.47  # Unit Clause-clause subsumption calls : 18020
% 47.37/6.47  # Rewrite failures with RHS unbound    : 0
% 47.37/6.47  # BW rewrite match attempts            : 3968
% 47.37/6.47  # BW rewrite match successes           : 10
% 47.37/6.47  # Condensation attempts                : 0
% 47.37/6.47  # Condensation successes               : 0
% 47.37/6.47  # Termbank termtop insertions          : 8059956
% 47.37/6.47  # Search garbage collected termcells   : 128
% 47.37/6.47  
% 47.37/6.47  # -------------------------------------------------
% 47.37/6.47  # User time                : 5.647 s
% 47.37/6.47  # System time              : 0.193 s
% 47.37/6.47  # Total time               : 5.839 s
% 47.37/6.47  # Maximum resident set size: 1712 pages
% 47.37/6.47  
% 47.37/6.47  # -------------------------------------------------
% 47.37/6.47  # User time                : 28.582 s
% 47.37/6.47  # System time              : 0.810 s
% 47.37/6.47  # Total time               : 29.392 s
% 47.37/6.47  # Maximum resident set size: 1744 pages
% 47.37/6.47  % E---3.1 exiting
%------------------------------------------------------------------------------