%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO210+3 : 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 : n017.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:27:47 PM UTC 2026
% Result : Theorem 0.09s 0.44s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 11
% Syntax : Number of formulae : 55 ( 21 unt; 0 def)
% Number of atoms : 126 ( 0 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 122 ( 51 ~; 46 |; 14 &)
% ( 4 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 91 ( 2 sgn 59 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(a5,axiom,
! [X1,X2] :
( orthogonal_lines(X1,X2)
<=> ~ unorthogonal_lines(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+6.ax',a5) ).
fof(con,conjecture,
! [X9,X6,X7] :
( ( orthogonal_lines(X6,X7)
& incident_point_and_line(X9,X6) )
=> equal_lines(X6,orthogonal_through_point(X7,X9)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(couo1,axiom,
! [X6,X7,X8] :
( ( ~ unorthogonal_lines(X6,X8)
& ~ unorthogonal_lines(X6,X7) )
=> ~ convergent_lines(X7,X8) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+4.ax',couo1) ).
fof(occu1,axiom,
! [X6,X7] :
( unorthogonal_lines(X6,X7)
| convergent_lines(X6,X7) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+3.ax',occu1) ).
fof(ax2,axiom,
! [X1,X2] :
( equal_lines(X1,X2)
<=> ~ distinct_lines(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+6.ax',ax2) ).
fof(ooc1,axiom,
! [X9,X6] : ~ unorthogonal_lines(orthogonal_through_point(X6,X9),X6),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+3.ax',ooc1) ).
fof(apart5,axiom,
! [X1,X2,X3] :
( distinct_lines(X1,X2)
=> ( distinct_lines(X2,X3)
| distinct_lines(X1,X3) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',apart5) ).
fof(oac1,axiom,
! [X6,X7,X8] :
( ( unorthogonal_lines(X6,X7)
& convergent_lines(X6,X7) )
=> ( ( unorthogonal_lines(X7,X8)
& convergent_lines(X7,X8) )
| ( unorthogonal_lines(X6,X8)
& convergent_lines(X6,X8) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+3.ax',oac1) ).
fof(p1,axiom,
! [X1,X2] :
( distinct_lines(X1,X2)
=> convergent_lines(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+1.ax',p1) ).
fof(apart2,axiom,
! [X1] : ~ distinct_lines(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',apart2) ).
fof(apart3,axiom,
! [X1] : ~ convergent_lines(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',apart3) ).
fof(c_0_11,plain,
! [X1,X2] :
( orthogonal_lines(X1,X2)
<=> ~ unorthogonal_lines(X1,X2) ),
inference(fof_simplification,[status(thm)],[a5]) ).
fof(c_0_12,negated_conjecture,
~ ! [X9,X6,X7] :
( ( orthogonal_lines(X6,X7)
& incident_point_and_line(X9,X6) )
=> equal_lines(X6,orthogonal_through_point(X7,X9)) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_13,plain,
! [X90,X91] :
( ( orthogonal_lines(X90,X91)
| unorthogonal_lines(X90,X91) )
& ( ~ unorthogonal_lines(X90,X91)
| ~ orthogonal_lines(X90,X91) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
fof(c_0_14,negated_conjecture,
( ~ equal_lines(esk2_0,orthogonal_through_point(esk3_0,esk1_0))
& orthogonal_lines(esk2_0,esk3_0)
& incident_point_and_line(esk1_0,esk2_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).
fof(c_0_15,plain,
! [X6,X7,X8] :
( ( ~ unorthogonal_lines(X6,X8)
& ~ unorthogonal_lines(X6,X7) )
=> ~ convergent_lines(X7,X8) ),
inference(fof_simplification,[status(thm)],[couo1]) ).
cnf(c_0_16,plain,
( ~ unorthogonal_lines(X1,X2)
| ~ orthogonal_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
orthogonal_lines(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_18,plain,
! [X53,X54] :
( unorthogonal_lines(X53,X54)
| convergent_lines(X53,X54) ),
inference(variable_rename,[status(thm)],[occu1]) ).
fof(c_0_19,plain,
! [X1,X2] :
( equal_lines(X1,X2)
<=> ~ distinct_lines(X1,X2) ),
inference(fof_simplification,[status(thm)],[ax2]) ).
fof(c_0_20,plain,
! [X9,X6] : ~ unorthogonal_lines(orthogonal_through_point(X6,X9),X6),
inference(fof_simplification,[status(thm)],[ooc1]) ).
fof(c_0_21,plain,
! [X71,X72,X73] :
( ~ convergent_lines(X72,X73)
| unorthogonal_lines(X71,X73)
| unorthogonal_lines(X71,X72) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])]) ).
cnf(c_0_22,negated_conjecture,
~ unorthogonal_lines(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,plain,
( unorthogonal_lines(X1,X2)
| convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_24,plain,
! [X84,X85] :
( ( equal_lines(X84,X85)
| distinct_lines(X84,X85) )
& ( ~ distinct_lines(X84,X85)
| ~ equal_lines(X84,X85) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])]) ).
fof(c_0_25,plain,
! [X58,X59] : ~ unorthogonal_lines(orthogonal_through_point(X59,X58),X59),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_20])]) ).
cnf(c_0_26,plain,
( ~ convergent_lines(X2,X3)
| unorthogonal_lines(X1,X3)
| unorthogonal_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,negated_conjecture,
convergent_lines(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_28,plain,
! [X17,X18,X19] :
( distinct_lines(X18,X19)
| distinct_lines(X17,X19)
| ~ distinct_lines(X17,X18) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart5])])]) ).
cnf(c_0_29,negated_conjecture,
~ equal_lines(esk2_0,orthogonal_through_point(esk3_0,esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_30,plain,
( equal_lines(X1,X2)
| distinct_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_31,plain,
! [X55,X56,X57] :
( ( ~ unorthogonal_lines(X55,X56)
| ~ convergent_lines(X55,X56)
| unorthogonal_lines(X55,X57)
| unorthogonal_lines(X56,X57) )
& ( ~ unorthogonal_lines(X55,X56)
| ~ convergent_lines(X55,X56)
| unorthogonal_lines(X55,X57)
| convergent_lines(X56,X57) )
& ( ~ unorthogonal_lines(X55,X56)
| ~ convergent_lines(X55,X56)
| convergent_lines(X55,X57)
| unorthogonal_lines(X56,X57) )
& ( ~ unorthogonal_lines(X55,X56)
| ~ convergent_lines(X55,X56)
| convergent_lines(X55,X57)
| convergent_lines(X56,X57) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oac1])])])]) ).
cnf(c_0_32,plain,
~ unorthogonal_lines(orthogonal_through_point(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_33,negated_conjecture,
( unorthogonal_lines(X1,esk3_0)
| unorthogonal_lines(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
fof(c_0_34,plain,
! [X44,X45] :
( convergent_lines(X44,X45)
| ~ distinct_lines(X44,X45) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p1])])]) ).
cnf(c_0_35,plain,
( ~ distinct_lines(X1,X2)
| distinct_lines(X2,X3)
| distinct_lines(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_36,negated_conjecture,
distinct_lines(esk2_0,orthogonal_through_point(esk3_0,esk1_0)),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
fof(c_0_37,plain,
! [X1] : ~ distinct_lines(X1,X1),
inference(fof_simplification,[status(thm)],[apart2]) ).
fof(c_0_38,plain,
! [X1] : ~ convergent_lines(X1,X1),
inference(fof_simplification,[status(thm)],[apart3]) ).
cnf(c_0_39,plain,
( ~ unorthogonal_lines(X3,X1)
| ~ convergent_lines(X3,X1)
| convergent_lines(X3,X2)
| unorthogonal_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_40,negated_conjecture,
unorthogonal_lines(orthogonal_through_point(esk3_0,X1),esk2_0),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_41,plain,
( ~ distinct_lines(X1,X2)
| convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_42,negated_conjecture,
( distinct_lines(esk2_0,X1)
| distinct_lines(orthogonal_through_point(esk3_0,esk1_0),X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
fof(c_0_43,plain,
! [X12] : ~ distinct_lines(X12,X12),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_37])]) ).
fof(c_0_44,plain,
! [X13] : ~ convergent_lines(X13,X13),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_38])]) ).
cnf(c_0_45,negated_conjecture,
( ~ convergent_lines(orthogonal_through_point(esk3_0,X2),esk2_0)
| convergent_lines(orthogonal_through_point(esk3_0,X2),X1)
| unorthogonal_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,negated_conjecture,
( distinct_lines(esk2_0,X1)
| convergent_lines(orthogonal_through_point(esk3_0,esk1_0),X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,plain,
~ distinct_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_48,plain,
~ convergent_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_49,negated_conjecture,
( convergent_lines(orthogonal_through_point(esk3_0,esk1_0),X1)
| unorthogonal_lines(esk2_0,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]) ).
cnf(c_0_50,plain,
( ~ unorthogonal_lines(X3,X1)
| ~ convergent_lines(X3,X1)
| unorthogonal_lines(X3,X2)
| unorthogonal_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_51,negated_conjecture,
unorthogonal_lines(esk2_0,orthogonal_through_point(esk3_0,esk1_0)),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_52,negated_conjecture,
convergent_lines(esk2_0,orthogonal_through_point(esk3_0,esk1_0)),
inference(spm,[status(thm)],[c_0_41,c_0_36]) ).
cnf(c_0_53,negated_conjecture,
( unorthogonal_lines(esk2_0,X1)
| unorthogonal_lines(orthogonal_through_point(esk3_0,esk1_0),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52])]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_53]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO210+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.37 % Computer : n017.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sun Sep 20 13:21:26 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 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.09/0.44 % Version: 3.5.1
% 0.09/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.44 % Starting sh5l with 300s (1) cores
% 0.09/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 5915 completed with status 0
% 0.09/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.09/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.44 % No SInE strategy applied
% 0.09/0.44 % Search class: FGHNF-FFMF22-SFFFFFNN
% 0.09/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.09/0.44 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.09/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.09/0.44 % Starting new_bool_1 with 136s (1) cores
% 0.09/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 5921 completed with status 0
% 0.09/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.09/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.44 % No SInE strategy applied
% 0.09/0.44 % Search class: FGHNF-FFMF22-SFFFFFNN
% 0.09/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.09/0.44 % Preprocessing time : 0.001 s
% 0.09/0.44 % Presaturation interreduction done
% 0.09/0.44
% 0.09/0.44 % Proof found!
% 0.09/0.44 % SZS status Theorem
% 0.09/0.44 % SZS output start CNFRefutation
% See solution above
% 0.09/0.44 % Parsed axioms : 36
% 0.09/0.44 % Removed by relevancy pruning/SinE : 0
% 0.09/0.44 % Initial clauses : 49
% 0.09/0.44 % Removed in clause preprocessing : 0
% 0.09/0.44 % Initial clauses in saturation : 49
% 0.09/0.44 % Processed clauses : 150
% 0.09/0.44 % ...of these trivial : 0
% 0.09/0.44 % ...subsumed : 20
% 0.09/0.44 % ...remaining for further processing : 130
% 0.09/0.44 % Other redundant clauses eliminated : 0
% 0.09/0.44 % Clauses deleted for lack of memory : 0
% 0.09/0.44 % Backward-subsumed : 0
% 0.09/0.44 % Backward-rewritten : 0
% 0.09/0.44 % Generated clauses : 225
% 0.09/0.44 % ...of the previous two non-redundant : 194
% 0.09/0.44 % ...aggressively subsumed : 0
% 0.09/0.44 % Contextual simplify-reflections : 0
% 0.09/0.44 % Paramodulations : 221
% 0.09/0.44 % Factorizations : 4
% 0.09/0.44 % NegExts : 0
% 0.09/0.44 % Equation resolutions : 0
% 0.09/0.44 % Disequality decompositions : 0
% 0.09/0.44 % Total rewrite steps : 25
% 0.09/0.44 % ...of those cached : 18
% 0.09/0.44 % Propositional unsat checks : 0
% 0.09/0.44 % Propositional check models : 0
% 0.09/0.44 % Propositional check unsatisfiable : 0
% 0.09/0.44 % Propositional clauses : 0
% 0.09/0.44 % Propositional clauses after purity: 0
% 0.09/0.44 % Propositional unsat core size : 0
% 0.09/0.44 % Propositional preprocessing time : 0.000
% 0.09/0.44 % Propositional encoding time : 0.000
% 0.09/0.44 % Propositional solver time : 0.000
% 0.09/0.44 % Success case prop preproc time : 0.000
% 0.09/0.44 % Success case prop encoding time : 0.000
% 0.09/0.44 % Success case prop solver time : 0.000
% 0.09/0.44 % Current number of processed clauses : 85
% 0.09/0.44 % Positive orientable unit clauses : 15
% 0.09/0.44 % Positive unorientable unit clauses: 0
% 0.09/0.44 % Negative unit clauses : 10
% 0.09/0.44 % Non-unit-clauses : 60
% 0.09/0.44 % Current number of unprocessed clauses: 132
% 0.09/0.44 % ...number of literals in the above : 497
% 0.09/0.44 % Current number of archived formulas : 0
% 0.09/0.44 % Current number of archived clauses : 45
% 0.09/0.44 % Clause-clause subsumption calls (NU) : 761
% 0.09/0.44 % Rec. Clause-clause subsumption calls : 462
% 0.09/0.44 % Non-unit clause-clause subsumptions : 14
% 0.09/0.44 % Unit Clause-clause subsumption calls : 75
% 0.09/0.44 % Rewrite failures with RHS unbound : 0
% 0.09/0.44 % BW rewrite match attempts : 2
% 0.09/0.44 % BW rewrite match successes : 0
% 0.09/0.44 % Condensation attempts : 0
% 0.09/0.44 % Condensation successes : 0
% 0.09/0.44 % Termbank termtop insertions : 6485
% 0.09/0.44 % Search garbage collected termcells : 498
% 0.09/0.44
% 0.09/0.44 % -------------------------------------------------
% 0.09/0.44 % User time : 0.009 s
% 0.09/0.44 % System time : 0.005 s
% 0.09/0.44 % Total time : 0.014 s
% 0.09/0.44 % Maximum resident set size: 3424 pages
% 0.09/0.44
% 0.09/0.44 % -------------------------------------------------
% 0.09/0.44 % User time : 0.029 s
% 0.09/0.44 % System time : 0.015 s
% 0.09/0.44 % Total time : 0.044 s
% 0.09/0.44 % Maximum resident set size: 4608 pages
% 0.09/0.44 % E exiting
%------------------------------------------------------------------------------