%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRA002+3 : TPTP v9.3.1. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n007.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:31:50 PM UTC 2026
% Result : Theorem 0.10s 0.45s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 43 ( 11 unt; 0 def)
% Number of atoms : 154 ( 25 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 172 ( 61 ~; 69 |; 25 &)
% ( 2 <=>; 14 =>; 1 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 2 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-4 aty)
% Number of variables : 116 ( 18 sgn 66 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(maximal_path_length,conjecture,
( complete
=> ! [X4,X2,X3] :
( shortest_path(X2,X3,X4)
=> less_or_equal(minus(length_of(X4),n1),number_of_in(triangles,graph)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',maximal_path_length) ).
fof(shortest_path_defn,axiom,
! [X2,X3,X10] :
( shortest_path(X2,X3,X10)
<=> ( ! [X4] :
( path(X2,X3,X4)
=> less_or_equal(length_of(X10),length_of(X4)) )
& X2 != X3
& path(X2,X3,X10) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRA001+0.ax',shortest_path_defn) ).
fof(sequential_is_triangle,lemma,
( complete
=> ! [X2,X3,X7,X8,X4] :
( ( sequential(X7,X8)
& precedes(X7,X8,X4)
& shortest_path(X2,X3,X4) )
=> ? [X9] : triangle(X7,X8,X9) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sequential_is_triangle) ).
fof(precedes_defn,axiom,
! [X4,X2,X3] :
( path(X2,X3,X4)
=> ! [X7,X8] :
( precedes(X7,X8,X4)
<= ( ( ? [X9] :
( precedes(X9,X8,X4)
& sequential(X7,X9) )
| sequential(X7,X8) )
& on_path(X8,X4)
& on_path(X7,X4) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRA001+0.ax',precedes_defn) ).
fof(sequential_pairs_and_triangles,axiom,
! [X4,X2,X3] :
( ( ! [X7,X8] :
( ( sequential(X7,X8)
& on_path(X8,X4)
& on_path(X7,X4) )
=> ? [X9] : triangle(X7,X8,X9) )
& path(X2,X3,X4) )
=> number_of_in(sequential_pairs,X4) = number_of_in(triangles,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sequential_pairs_and_triangles) ).
fof(path_length_sequential_pairs,axiom,
! [X2,X3,X4] :
( path(X2,X3,X4)
=> number_of_in(sequential_pairs,X4) = minus(length_of(X4),n1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',path_length_sequential_pairs) ).
fof(graph_has_them_all,axiom,
! [X11,X12] : less_or_equal(number_of_in(X11,X12),number_of_in(X11,graph)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',graph_has_them_all) ).
fof(c_0_7,negated_conjecture,
~ ( complete
=> ! [X4,X2,X3] :
( shortest_path(X2,X3,X4)
=> less_or_equal(minus(length_of(X4),n1),number_of_in(triangles,graph)) ) ),
inference(assume_negation,[status(cth)],[maximal_path_length]) ).
fof(c_0_8,plain,
! [X2,X3,X10] :
( shortest_path(X2,X3,X10)
<=> ( ! [X4] :
( path(X2,X3,X4)
=> less_or_equal(length_of(X10),length_of(X4)) )
& X2 != X3
& path(X2,X3,X10) ) ),
inference(fof_simplification,[status(thm)],[shortest_path_defn]) ).
fof(c_0_9,lemma,
! [X41,X42,X43,X44,X45] :
( triangle(X43,X44,esk7_4(X41,X42,X43,X44))
| ~ sequential(X43,X44)
| ~ precedes(X43,X44,X45)
| ~ shortest_path(X41,X42,X45)
| ~ complete ),
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)],[sequential_is_triangle])])])])])]) ).
fof(c_0_10,negated_conjecture,
( ~ less_or_equal(minus(length_of(esk1_0),n1),number_of_in(triangles,graph))
& shortest_path(esk2_0,esk3_0,esk1_0)
& complete ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
fof(c_0_11,plain,
! [X4,X2,X3] :
( path(X2,X3,X4)
=> ! [X7,X8] :
( ( ( ? [X9] :
( precedes(X9,X8,X4)
& sequential(X7,X9) )
| sequential(X7,X8) )
& on_path(X8,X4)
& on_path(X7,X4) )
=> precedes(X7,X8,X4) ) ),
inference(fof_simplification,[status(thm)],[precedes_defn]) ).
fof(c_0_12,plain,
! [X16,X17,X18,X19,X20,X21,X22] :
( ( shortest_path(X20,X21,X22)
| X20 = X21
| ~ path(X20,X21,X22)
| ~ less_or_equal(length_of(X22),length_of(esk4_3(X20,X21,X22))) )
& ( shortest_path(X20,X21,X22)
| X20 = X21
| ~ path(X20,X21,X22)
| path(X20,X21,esk4_3(X20,X21,X22)) )
& ( ~ shortest_path(X16,X17,X18)
| less_or_equal(length_of(X18),length_of(X19))
| ~ path(X16,X17,X19) )
& ( ~ shortest_path(X16,X17,X18)
| X16 != X17 )
& ( ~ shortest_path(X16,X17,X18)
| path(X16,X17,X18) ) ),
inference(distribute,[status(thm)],[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_8])])])])])])]) ).
cnf(c_0_13,lemma,
( ~ sequential(X4,X5)
| ~ precedes(X4,X5,X3)
| ~ shortest_path(X1,X2,X3)
| ~ complete
| triangle(X4,X5,esk7_4(X1,X2,X4,X5)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
complete,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,plain,
! [X55,X56,X57,X58,X59,X60] :
( ( ~ path(X56,X57,X55)
| precedes(X58,X59,X55)
| ~ on_path(X59,X55)
| ~ on_path(X58,X55)
| ~ precedes(X60,X59,X55)
| ~ sequential(X58,X60) )
& ( ~ path(X56,X57,X55)
| precedes(X58,X59,X55)
| ~ on_path(X59,X55)
| ~ on_path(X58,X55)
| ~ sequential(X58,X59) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])]) ).
cnf(c_0_16,plain,
( ~ shortest_path(X1,X2,X3)
| path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
shortest_path(esk2_0,esk3_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_18,plain,
! [X26,X27,X28,X31] :
( ( number_of_in(sequential_pairs,X26) = number_of_in(triangles,X26)
| ~ path(X27,X28,X26)
| ~ triangle(esk5_1(X26),esk6_1(X26),X31) )
& ( number_of_in(sequential_pairs,X26) = number_of_in(triangles,X26)
| ~ path(X27,X28,X26)
| sequential(esk5_1(X26),esk6_1(X26)) )
& ( number_of_in(sequential_pairs,X26) = number_of_in(triangles,X26)
| ~ path(X27,X28,X26)
| on_path(esk6_1(X26),X26) )
& ( number_of_in(sequential_pairs,X26) = number_of_in(triangles,X26)
| ~ path(X27,X28,X26)
| on_path(esk5_1(X26),X26) ) ),
inference(distribute,[status(thm)],[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)],[sequential_pairs_and_triangles])])])])])])]) ).
cnf(c_0_19,lemma,
( ~ sequential(X1,X2)
| ~ precedes(X1,X2,X5)
| ~ shortest_path(X3,X4,X5)
| triangle(X1,X2,esk7_4(X3,X4,X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).
cnf(c_0_20,plain,
( ~ path(X4,X5,X3)
| ~ on_path(X2,X3)
| ~ on_path(X1,X3)
| ~ sequential(X1,X2)
| precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
path(esk2_0,esk3_0,esk1_0),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
( ~ path(X2,X3,X1)
| number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1)
| on_path(esk6_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
( ~ path(X3,X4,X1)
| ~ triangle(esk5_1(X1),esk6_1(X1),X2)
| number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,negated_conjecture,
( ~ sequential(X1,X2)
| ~ precedes(X1,X2,esk1_0)
| triangle(X1,X2,esk7_4(esk2_0,esk3_0,X1,X2)) ),
inference(spm,[status(thm)],[c_0_19,c_0_17]) ).
cnf(c_0_25,plain,
( ~ path(X2,X3,X1)
| number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1)
| sequential(esk5_1(X1),esk6_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,negated_conjecture,
( ~ on_path(X1,esk1_0)
| ~ on_path(X2,esk1_0)
| ~ sequential(X1,X2)
| precedes(X1,X2,esk1_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,negated_conjecture,
( on_path(esk6_1(esk1_0),esk1_0)
| number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_28,plain,
( ~ path(X2,X3,X1)
| number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1)
| on_path(esk5_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_29,plain,
! [X32,X33,X34] :
( number_of_in(sequential_pairs,X34) = minus(length_of(X34),n1)
| ~ path(X32,X33,X34) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[path_length_sequential_pairs])])]) ).
cnf(c_0_30,negated_conjecture,
( ~ path(X2,X3,X1)
| ~ precedes(esk5_1(X1),esk6_1(X1),esk1_0)
| number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_31,negated_conjecture,
( ~ on_path(X1,esk1_0)
| ~ sequential(X1,esk6_1(esk1_0))
| precedes(X1,esk6_1(esk1_0),esk1_0)
| number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
( on_path(esk5_1(esk1_0),esk1_0)
| number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_21]) ).
cnf(c_0_33,negated_conjecture,
( sequential(esk5_1(esk1_0),esk6_1(esk1_0))
| number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0) ),
inference(spm,[status(thm)],[c_0_25,c_0_21]) ).
cnf(c_0_34,plain,
( ~ path(X1,X2,X3)
| number_of_in(sequential_pairs,X3) = minus(length_of(X3),n1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_35,plain,
! [X24,X25] : less_or_equal(number_of_in(X24,X25),number_of_in(X24,graph)),
inference(variable_rename,[status(thm)],[graph_has_them_all]) ).
cnf(c_0_36,negated_conjecture,
( ~ path(X1,X2,esk1_0)
| number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_33]) ).
cnf(c_0_37,negated_conjecture,
~ less_or_equal(minus(length_of(esk1_0),n1),number_of_in(triangles,graph)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_38,negated_conjecture,
minus(length_of(esk1_0),n1) = number_of_in(sequential_pairs,esk1_0),
inference(spm,[status(thm)],[c_0_34,c_0_21]) ).
cnf(c_0_39,plain,
less_or_equal(number_of_in(X1,X2),number_of_in(X1,graph)),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_40,negated_conjecture,
number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0),
inference(spm,[status(thm)],[c_0_36,c_0_21]) ).
cnf(c_0_41,negated_conjecture,
~ less_or_equal(number_of_in(sequential_pairs,esk1_0),number_of_in(triangles,graph)),
inference(rw,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRA002+3 : TPTP v9.3.1. Bugfixed v3.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n007.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 20 18:15:20 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 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.10/0.45 % Version: 3.5.1
% 0.10/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.45 % Starting sh5l with 300s (1) cores
% 0.10/0.45 % new_bool_3 with pid 3294426 completed with status 0
% 0.10/0.45 % Result found by new_bool_3
% 0.10/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.45 % Search class: FGHSF-FFMF31-SFFFFFNN
% 0.10/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.45 % SubtermCWHack with pid 3294434 completed with status 0
% 0.10/0.45 % Result found by SubtermCWHack
% 0.10/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.45 % Search class: FGHSF-FFMF31-SFFFFFNN
% 0.10/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.45 % Preprocessing time : 0.002 s
% 0.10/0.45
% 0.10/0.45 % Proof found!
% 0.10/0.45 % SZS status Theorem
% 0.10/0.45 % SZS output start CNFRefutation
% See solution above
% 0.10/0.45 % Parsed axioms : 19
% 0.10/0.45 % Removed by relevancy pruning/SinE : 5
% 0.10/0.45 % Initial clauses : 45
% 0.10/0.45 % Removed in clause preprocessing : 1
% 0.10/0.45 % Initial clauses in saturation : 44
% 0.10/0.45 % Processed clauses : 123
% 0.10/0.45 % ...of these trivial : 0
% 0.10/0.45 % ...subsumed : 19
% 0.10/0.45 % ...remaining for further processing : 104
% 0.10/0.45 % Other redundant clauses eliminated : 4
% 0.10/0.45 % Clauses deleted for lack of memory : 0
% 0.10/0.45 % Backward-subsumed : 2
% 0.10/0.45 % Backward-rewritten : 20
% 0.10/0.45 % Generated clauses : 157
% 0.10/0.45 % ...of the previous two non-redundant : 137
% 0.10/0.45 % ...aggressively subsumed : 0
% 0.10/0.45 % Contextual simplify-reflections : 17
% 0.10/0.45 % Paramodulations : 151
% 0.10/0.45 % Factorizations : 0
% 0.10/0.45 % NegExts : 0
% 0.10/0.45 % Equation resolutions : 6
% 0.10/0.45 % Disequality decompositions : 0
% 0.10/0.45 % Total rewrite steps : 28
% 0.10/0.45 % ...of those cached : 23
% 0.10/0.45 % Propositional unsat checks : 0
% 0.10/0.45 % Propositional check models : 0
% 0.10/0.45 % Propositional check unsatisfiable : 0
% 0.10/0.45 % Propositional clauses : 0
% 0.10/0.45 % Propositional clauses after purity: 0
% 0.10/0.45 % Propositional unsat core size : 0
% 0.10/0.45 % Propositional preprocessing time : 0.000
% 0.10/0.45 % Propositional encoding time : 0.000
% 0.10/0.45 % Propositional solver time : 0.000
% 0.10/0.45 % Success case prop preproc time : 0.000
% 0.10/0.45 % Success case prop encoding time : 0.000
% 0.10/0.45 % Success case prop solver time : 0.000
% 0.10/0.45 % Current number of processed clauses : 80
% 0.10/0.45 % Positive orientable unit clauses : 6
% 0.10/0.45 % Positive unorientable unit clauses: 0
% 0.10/0.45 % Negative unit clauses : 3
% 0.10/0.45 % Non-unit-clauses : 71
% 0.10/0.45 % Current number of unprocessed clauses: 58
% 0.10/0.45 % ...number of literals in the above : 320
% 0.10/0.45 % Current number of archived formulas : 0
% 0.10/0.45 % Current number of archived clauses : 22
% 0.10/0.45 % Clause-clause subsumption calls (NU) : 1591
% 0.10/0.45 % Rec. Clause-clause subsumption calls : 890
% 0.10/0.45 % Non-unit clause-clause subsumptions : 36
% 0.10/0.45 % Unit Clause-clause subsumption calls : 21
% 0.10/0.45 % Rewrite failures with RHS unbound : 0
% 0.10/0.45 % BW rewrite match attempts : 2
% 0.10/0.45 % BW rewrite match successes : 2
% 0.10/0.45 % Condensation attempts : 0
% 0.10/0.45 % Condensation successes : 0
% 0.10/0.45 % Termbank termtop insertions : 6600
% 0.10/0.45 % Search garbage collected termcells : 984
% 0.10/0.45
% 0.10/0.45 % -------------------------------------------------
% 0.10/0.45 % User time : 0.019 s
% 0.10/0.45 % System time : 0.002 s
% 0.10/0.45 % Total time : 0.020 s
% 0.10/0.45 % Maximum resident set size: 3628 pages
% 0.10/0.45
% 0.10/0.45 % -------------------------------------------------
% 0.10/0.45 % User time : 0.021 s
% 0.10/0.45 % System time : 0.007 s
% 0.10/0.45 % Total time : 0.027 s
% 0.10/0.45 % Maximum resident set size: 4608 pages
% 0.10/0.45 % E exiting
%------------------------------------------------------------------------------