TSTP Solution File: GEO199+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GEO199+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:32:03 EDT 2023
% Result : Theorem 0.14s 0.41s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 10
% Syntax : Number of formulae : 58 ( 15 unt; 0 def)
% Number of atoms : 148 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 130 ( 40 ~; 68 |; 11 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 98 ( 5 sgn; 56 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2,X3] :
( ( convergent_lines(X1,X2)
& convergent_lines(X3,X2)
& convergent_lines(X1,X3)
& ~ apart_point_and_line(intersection_point(X1,X2),X3) )
=> ~ apart_point_and_line(intersection_point(X2,X1),X3) ),
file('/export/starexec/sandbox2/tmp/tmp.bfYaPKUvtO/E---3.1_20359.p',con) ).
fof(ax6,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( convergent_lines(X1,X3)
| convergent_lines(X2,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.bfYaPKUvtO/E---3.1_20359.p',ax6) ).
fof(apart3,axiom,
! [X1] : ~ convergent_lines(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.bfYaPKUvtO/E---3.1_20359.p',apart3) ).
fof(ceq3,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( distinct_lines(X2,X3)
| convergent_lines(X1,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.bfYaPKUvtO/E---3.1_20359.p',ceq3) ).
fof(apart2,axiom,
! [X1] : ~ distinct_lines(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.bfYaPKUvtO/E---3.1_20359.p',apart2) ).
fof(apart5,axiom,
! [X1,X2,X3] :
( distinct_lines(X1,X2)
=> ( distinct_lines(X1,X3)
| distinct_lines(X2,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.bfYaPKUvtO/E---3.1_20359.p',apart5) ).
fof(cu1,axiom,
! [X1,X2,X4,X5] :
( ( distinct_points(X1,X2)
& distinct_lines(X4,X5) )
=> ( apart_point_and_line(X1,X4)
| apart_point_and_line(X1,X5)
| apart_point_and_line(X2,X4)
| apart_point_and_line(X2,X5) ) ),
file('/export/starexec/sandbox2/tmp/tmp.bfYaPKUvtO/E---3.1_20359.p',cu1) ).
fof(ceq1,axiom,
! [X1,X2,X3] :
( apart_point_and_line(X1,X2)
=> ( distinct_points(X1,X3)
| apart_point_and_line(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.bfYaPKUvtO/E---3.1_20359.p',ceq1) ).
fof(ci3,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.bfYaPKUvtO/E---3.1_20359.p',ci3) ).
fof(ci4,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/tmp.bfYaPKUvtO/E---3.1_20359.p',ci4) ).
fof(c_0_10,negated_conjecture,
~ ! [X1,X2,X3] :
( ( convergent_lines(X1,X2)
& convergent_lines(X3,X2)
& convergent_lines(X1,X3)
& ~ apart_point_and_line(intersection_point(X1,X2),X3) )
=> ~ apart_point_and_line(intersection_point(X2,X1),X3) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).
fof(c_0_11,plain,
! [X17,X18,X19] :
( ~ convergent_lines(X17,X18)
| convergent_lines(X17,X19)
| convergent_lines(X18,X19) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax6])]) ).
fof(c_0_12,negated_conjecture,
( convergent_lines(esk1_0,esk2_0)
& convergent_lines(esk3_0,esk2_0)
& convergent_lines(esk1_0,esk3_0)
& ~ apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)
& apart_point_and_line(intersection_point(esk2_0,esk1_0),esk3_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
fof(c_0_13,plain,
! [X1] : ~ convergent_lines(X1,X1),
inference(fof_simplification,[status(thm)],[apart3]) ).
cnf(c_0_14,plain,
( convergent_lines(X1,X3)
| convergent_lines(X2,X3)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X16] : ~ convergent_lines(X16,X16),
inference(variable_rename,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
( convergent_lines(esk1_0,X1)
| convergent_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
~ convergent_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,negated_conjecture,
( convergent_lines(esk2_0,X1)
| convergent_lines(esk1_0,X2)
| convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
( convergent_lines(X1,esk1_0)
| convergent_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_21,plain,
! [X20,X21,X22] :
( ~ convergent_lines(X20,X21)
| distinct_lines(X21,X22)
| convergent_lines(X20,X22) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq3])]) ).
cnf(c_0_22,negated_conjecture,
( convergent_lines(X1,esk1_0)
| convergent_lines(esk2_0,X2)
| convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_20]) ).
cnf(c_0_23,plain,
( distinct_lines(X2,X3)
| convergent_lines(X1,X3)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_24,negated_conjecture,
( convergent_lines(X1,esk2_0)
| convergent_lines(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_22]) ).
fof(c_0_25,plain,
! [X1] : ~ distinct_lines(X1,X1),
inference(fof_simplification,[status(thm)],[apart2]) ).
fof(c_0_26,plain,
! [X32,X33,X34] :
( ~ distinct_lines(X32,X33)
| distinct_lines(X32,X34)
| distinct_lines(X33,X34) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart5])]) ).
cnf(c_0_27,negated_conjecture,
( convergent_lines(X1,esk2_0)
| convergent_lines(X1,X2)
| distinct_lines(esk1_0,X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
fof(c_0_28,plain,
! [X31] : ~ distinct_lines(X31,X31),
inference(variable_rename,[status(thm)],[c_0_25]) ).
cnf(c_0_29,plain,
( distinct_lines(X1,X3)
| distinct_lines(X2,X3)
| ~ distinct_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( convergent_lines(X1,esk2_0)
| distinct_lines(esk1_0,esk2_0) ),
inference(ef,[status(thm)],[c_0_27]) ).
cnf(c_0_31,plain,
~ distinct_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_32,negated_conjecture,
( convergent_lines(X1,esk2_0)
| distinct_lines(esk1_0,X2)
| distinct_lines(esk2_0,X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
( convergent_lines(X1,esk2_0)
| distinct_lines(esk2_0,esk1_0) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_34,negated_conjecture,
( convergent_lines(X1,X2)
| distinct_lines(esk2_0,esk1_0)
| distinct_lines(esk2_0,X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_33]) ).
fof(c_0_35,plain,
! [X27,X28,X29,X30] :
( ~ distinct_points(X27,X28)
| ~ distinct_lines(X29,X30)
| apart_point_and_line(X27,X29)
| apart_point_and_line(X27,X30)
| apart_point_and_line(X28,X29)
| apart_point_and_line(X28,X30) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cu1])]) ).
cnf(c_0_36,negated_conjecture,
( distinct_lines(esk2_0,esk1_0)
| distinct_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_34]) ).
fof(c_0_37,plain,
! [X9,X10,X11] :
( ~ apart_point_and_line(X9,X10)
| distinct_points(X9,X11)
| apart_point_and_line(X11,X10) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq1])]) ).
cnf(c_0_38,plain,
( apart_point_and_line(X1,X3)
| apart_point_and_line(X1,X4)
| apart_point_and_line(X2,X3)
| apart_point_and_line(X2,X4)
| ~ distinct_points(X1,X2)
| ~ distinct_lines(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_39,negated_conjecture,
distinct_lines(esk2_0,esk1_0),
inference(ef,[status(thm)],[c_0_36]) ).
cnf(c_0_40,plain,
( distinct_points(X1,X3)
| apart_point_and_line(X3,X2)
| ~ apart_point_and_line(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_41,negated_conjecture,
apart_point_and_line(intersection_point(esk2_0,esk1_0),esk3_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_42,plain,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
inference(fof_simplification,[status(thm)],[ci3]) ).
cnf(c_0_43,negated_conjecture,
( apart_point_and_line(X1,esk2_0)
| apart_point_and_line(X1,esk1_0)
| apart_point_and_line(X2,esk2_0)
| apart_point_and_line(X2,esk1_0)
| ~ distinct_points(X1,X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,negated_conjecture,
( apart_point_and_line(X1,esk3_0)
| distinct_points(intersection_point(esk2_0,esk1_0),X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
fof(c_0_45,plain,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
inference(fof_simplification,[status(thm)],[ci4]) ).
fof(c_0_46,plain,
! [X12,X13] :
( ~ convergent_lines(X12,X13)
| ~ apart_point_and_line(intersection_point(X12,X13),X12) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_42])]) ).
cnf(c_0_47,negated_conjecture,
~ apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_48,negated_conjecture,
( apart_point_and_line(intersection_point(esk2_0,esk1_0),esk1_0)
| apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0)
| apart_point_and_line(X1,esk3_0)
| apart_point_and_line(X1,esk1_0)
| apart_point_and_line(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
fof(c_0_49,plain,
! [X14,X15] :
( ~ convergent_lines(X14,X15)
| ~ apart_point_and_line(intersection_point(X14,X15),X15) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_45])]) ).
cnf(c_0_50,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_51,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)
| apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0)
| apart_point_and_line(intersection_point(esk2_0,esk1_0),esk1_0) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_52,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_53,negated_conjecture,
( apart_point_and_line(intersection_point(esk2_0,esk1_0),esk1_0)
| apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_15])]) ).
cnf(c_0_54,negated_conjecture,
( apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0)
| apart_point_and_line(intersection_point(esk2_0,esk1_0),esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_15])]) ).
cnf(c_0_55,negated_conjecture,
convergent_lines(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_56,negated_conjecture,
apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_54]),c_0_55])]) ).
cnf(c_0_57,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_56]),c_0_55])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : GEO199+1 : TPTP v8.1.2. Released v3.3.0.
% 0.08/0.10 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n031.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 2400
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Tue Oct 3 07:01:44 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.14/0.39 Running first-order theorem proving
% 0.14/0.39 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/tmp/tmp.bfYaPKUvtO/E---3.1_20359.p
% 0.14/0.41 # Version: 3.1pre001
% 0.14/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 # Starting sh5l with 300s (1) cores
% 0.14/0.41 # new_bool_3 with pid 20438 completed with status 0
% 0.14/0.41 # Result found by new_bool_3
% 0.14/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.41 # Search class: FGHNF-FFSS22-SFFFFFNN
% 0.14/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.14/0.41 # SAT001_MinMin_p005000_rr_RG with pid 20443 completed with status 0
% 0.14/0.41 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.14/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.41 # Search class: FGHNF-FFSS22-SFFFFFNN
% 0.14/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.14/0.41 # Preprocessing time : 0.001 s
% 0.14/0.41 # Presaturation interreduction done
% 0.14/0.41
% 0.14/0.41 # Proof found!
% 0.14/0.41 # SZS status Theorem
% 0.14/0.41 # SZS output start CNFRefutation
% See solution above
% 0.14/0.41 # Parsed axioms : 15
% 0.14/0.41 # Removed by relevancy pruning/SinE : 2
% 0.14/0.41 # Initial clauses : 17
% 0.14/0.41 # Removed in clause preprocessing : 0
% 0.14/0.41 # Initial clauses in saturation : 17
% 0.14/0.41 # Processed clauses : 261
% 0.14/0.41 # ...of these trivial : 0
% 0.14/0.41 # ...subsumed : 104
% 0.14/0.41 # ...remaining for further processing : 157
% 0.14/0.41 # Other redundant clauses eliminated : 0
% 0.14/0.41 # Clauses deleted for lack of memory : 0
% 0.14/0.41 # Backward-subsumed : 13
% 0.14/0.41 # Backward-rewritten : 1
% 0.14/0.41 # Generated clauses : 690
% 0.14/0.41 # ...of the previous two non-redundant : 556
% 0.14/0.41 # ...aggressively subsumed : 0
% 0.14/0.41 # Contextual simplify-reflections : 0
% 0.14/0.41 # Paramodulations : 584
% 0.14/0.41 # Factorizations : 106
% 0.14/0.41 # NegExts : 0
% 0.14/0.41 # Equation resolutions : 0
% 0.14/0.41 # Total rewrite steps : 143
% 0.14/0.41 # Propositional unsat checks : 0
% 0.14/0.41 # Propositional check models : 0
% 0.14/0.41 # Propositional check unsatisfiable : 0
% 0.14/0.41 # Propositional clauses : 0
% 0.14/0.41 # Propositional clauses after purity: 0
% 0.14/0.41 # Propositional unsat core size : 0
% 0.14/0.41 # Propositional preprocessing time : 0.000
% 0.14/0.41 # Propositional encoding time : 0.000
% 0.14/0.41 # Propositional solver time : 0.000
% 0.14/0.41 # Success case prop preproc time : 0.000
% 0.14/0.41 # Success case prop encoding time : 0.000
% 0.14/0.41 # Success case prop solver time : 0.000
% 0.14/0.41 # Current number of processed clauses : 126
% 0.14/0.41 # Positive orientable unit clauses : 13
% 0.14/0.41 # Positive unorientable unit clauses: 0
% 0.14/0.41 # Negative unit clauses : 4
% 0.14/0.41 # Non-unit-clauses : 109
% 0.14/0.41 # Current number of unprocessed clauses: 319
% 0.14/0.41 # ...number of literals in the above : 1552
% 0.14/0.41 # Current number of archived formulas : 0
% 0.14/0.41 # Current number of archived clauses : 31
% 0.14/0.41 # Clause-clause subsumption calls (NU) : 1617
% 0.14/0.41 # Rec. Clause-clause subsumption calls : 809
% 0.14/0.41 # Non-unit clause-clause subsumptions : 113
% 0.14/0.41 # Unit Clause-clause subsumption calls : 52
% 0.14/0.41 # Rewrite failures with RHS unbound : 0
% 0.14/0.41 # BW rewrite match attempts : 2
% 0.14/0.41 # BW rewrite match successes : 2
% 0.14/0.41 # Condensation attempts : 0
% 0.14/0.41 # Condensation successes : 0
% 0.14/0.41 # Termbank termtop insertions : 8071
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.017 s
% 0.14/0.41 # System time : 0.000 s
% 0.14/0.41 # Total time : 0.017 s
% 0.14/0.41 # Maximum resident set size: 1776 pages
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.019 s
% 0.14/0.41 # System time : 0.001 s
% 0.14/0.41 # Total time : 0.020 s
% 0.14/0.41 # Maximum resident set size: 1688 pages
% 0.14/0.41 % E---3.1 exiting
% 0.14/0.42 % E---3.1 exiting
%------------------------------------------------------------------------------