TSTP Solution File: GRA003+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GRA003+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n032.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 : 600s
% DateTime : Sat Jul 16 07:16:07 EDT 2022
% Result : Theorem 0.18s 1.36s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 43 ( 12 unt; 0 def)
% Number of atoms : 199 ( 47 equ)
% Maximal formula atoms : 25 ( 4 avg)
% Number of connectives : 253 ( 97 ~; 93 |; 52 &)
% ( 1 <=>; 8 =>; 0 <=; 2 <~>)
% Maximal formula depth : 16 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-3 aty)
% Number of variables : 105 ( 23 sgn 58 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(vertices_and_edges,conjecture,
! [X2,X3,X7,X8,X4] :
( ( shortest_path(X2,X3,X4)
& precedes(X7,X8,X4) )
=> ( vertex(X2)
& vertex(X3)
& X2 != X3
& edge(X7)
& edge(X8)
& X7 != X8
& path(X2,X3,X4) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',vertices_and_edges) ).
fof(shortest_path_defn,axiom,
! [X2,X3,X10] :
( shortest_path(X2,X3,X10)
<=> ( path(X2,X3,X10)
& X2 != X3
& ! [X4] :
( path(X2,X3,X4)
=> less_or_equal(length_of(X10),length_of(X4)) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',shortest_path_defn) ).
fof(precedes_properties,axiom,
! [X4,X2,X3] :
( path(X2,X3,X4)
=> ! [X7,X8] :
( precedes(X7,X8,X4)
=> ( on_path(X7,X4)
& on_path(X8,X4)
& ( sequential(X7,X8)
<~> ? [X9] :
( sequential(X7,X9)
& precedes(X9,X8,X4) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',precedes_properties) ).
fof(path_properties,axiom,
! [X2,X3,X4] :
( path(X2,X3,X4)
=> ( vertex(X2)
& vertex(X3)
& ? [X1] :
( edge(X1)
& X2 = tail_of(X1)
& ( ( X3 = head_of(X1)
& X4 = path_cons(X1,empty) )
<~> ? [X5] :
( path(head_of(X1),X3,X5)
& X4 = path_cons(X1,X5) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',path_properties) ).
fof(on_path_properties,axiom,
! [X2,X3,X4,X1] :
( ( path(X2,X3,X4)
& on_path(X1,X4) )
=> ( edge(X1)
& in_path(head_of(X1),X4)
& in_path(tail_of(X1),X4) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',on_path_properties) ).
fof(shortest_path_properties,axiom,
! [X2,X3,X7,X8,X4] :
( ( shortest_path(X2,X3,X4)
& precedes(X7,X8,X4) )
=> ( ~ ? [X9] :
( tail_of(X9) = tail_of(X7)
& head_of(X9) = head_of(X8) )
& ~ precedes(X8,X7,X4) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',shortest_path_properties) ).
fof(c_0_6,negated_conjecture,
~ ! [X2,X3,X7,X8,X4] :
( ( shortest_path(X2,X3,X4)
& precedes(X7,X8,X4) )
=> ( vertex(X2)
& vertex(X3)
& X2 != X3
& edge(X7)
& edge(X8)
& X7 != X8
& path(X2,X3,X4) ) ),
inference(assume_negation,[status(cth)],[vertices_and_edges]) ).
fof(c_0_7,plain,
! [X11,X12,X13,X14,X11,X12,X13] :
( ( path(X11,X12,X13)
| ~ shortest_path(X11,X12,X13) )
& ( X11 != X12
| ~ shortest_path(X11,X12,X13) )
& ( ~ path(X11,X12,X14)
| less_or_equal(length_of(X13),length_of(X14))
| ~ shortest_path(X11,X12,X13) )
& ( path(X11,X12,esk6_3(X11,X12,X13))
| ~ path(X11,X12,X13)
| X11 = X12
| shortest_path(X11,X12,X13) )
& ( ~ less_or_equal(length_of(X13),length_of(esk6_3(X11,X12,X13)))
| ~ path(X11,X12,X13)
| X11 = X12
| shortest_path(X11,X12,X13) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[shortest_path_defn])])])])])])]) ).
fof(c_0_8,negated_conjecture,
( shortest_path(esk9_0,esk10_0,esk13_0)
& precedes(esk11_0,esk12_0,esk13_0)
& ( ~ vertex(esk9_0)
| ~ vertex(esk10_0)
| esk9_0 = esk10_0
| ~ edge(esk11_0)
| ~ edge(esk12_0)
| esk11_0 = esk12_0
| ~ path(esk9_0,esk10_0,esk13_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_9,plain,
! [X10,X11,X12,X13,X14,X15] :
( ( on_path(X13,X10)
| ~ precedes(X13,X14,X10)
| ~ path(X11,X12,X10) )
& ( on_path(X14,X10)
| ~ precedes(X13,X14,X10)
| ~ path(X11,X12,X10) )
& ( ~ sequential(X13,X14)
| ~ sequential(X13,X15)
| ~ precedes(X15,X14,X10)
| ~ precedes(X13,X14,X10)
| ~ path(X11,X12,X10) )
& ( sequential(X13,esk5_3(X10,X13,X14))
| sequential(X13,X14)
| ~ precedes(X13,X14,X10)
| ~ path(X11,X12,X10) )
& ( precedes(esk5_3(X10,X13,X14),X14,X10)
| sequential(X13,X14)
| ~ precedes(X13,X14,X10)
| ~ path(X11,X12,X10) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[precedes_properties])])])])])])])]) ).
fof(c_0_10,plain,
! [X6,X7,X8,X10] :
( ( vertex(X6)
| ~ path(X6,X7,X8) )
& ( vertex(X7)
| ~ path(X6,X7,X8) )
& ( edge(esk2_3(X6,X7,X8))
| ~ path(X6,X7,X8) )
& ( X6 = tail_of(esk2_3(X6,X7,X8))
| ~ path(X6,X7,X8) )
& ( X7 != head_of(esk2_3(X6,X7,X8))
| X8 != path_cons(esk2_3(X6,X7,X8),empty)
| ~ path(head_of(esk2_3(X6,X7,X8)),X7,X10)
| X8 != path_cons(esk2_3(X6,X7,X8),X10)
| ~ path(X6,X7,X8) )
& ( path(head_of(esk2_3(X6,X7,X8)),X7,esk3_3(X6,X7,X8))
| X7 = head_of(esk2_3(X6,X7,X8))
| ~ path(X6,X7,X8) )
& ( X8 = path_cons(esk2_3(X6,X7,X8),esk3_3(X6,X7,X8))
| X7 = head_of(esk2_3(X6,X7,X8))
| ~ path(X6,X7,X8) )
& ( path(head_of(esk2_3(X6,X7,X8)),X7,esk3_3(X6,X7,X8))
| X8 = path_cons(esk2_3(X6,X7,X8),empty)
| ~ path(X6,X7,X8) )
& ( X8 = path_cons(esk2_3(X6,X7,X8),esk3_3(X6,X7,X8))
| X8 = path_cons(esk2_3(X6,X7,X8),empty)
| ~ path(X6,X7,X8) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[path_properties])])])])])])])]) ).
cnf(c_0_11,plain,
( path(X1,X2,X3)
| ~ shortest_path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
shortest_path(esk9_0,esk10_0,esk13_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,plain,
! [X5,X6,X7,X8] :
( ( edge(X8)
| ~ path(X5,X6,X7)
| ~ on_path(X8,X7) )
& ( in_path(head_of(X8),X7)
| ~ path(X5,X6,X7)
| ~ on_path(X8,X7) )
& ( in_path(tail_of(X8),X7)
| ~ path(X5,X6,X7)
| ~ on_path(X8,X7) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[on_path_properties])])]) ).
cnf(c_0_14,plain,
( on_path(X5,X3)
| ~ path(X1,X2,X3)
| ~ precedes(X4,X5,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
precedes(esk11_0,esk12_0,esk13_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_16,plain,
! [X10,X11,X12,X13,X14,X15] :
( ( tail_of(X15) != tail_of(X12)
| head_of(X15) != head_of(X13)
| ~ shortest_path(X10,X11,X14)
| ~ precedes(X12,X13,X14) )
& ( ~ precedes(X13,X12,X14)
| ~ shortest_path(X10,X11,X14)
| ~ precedes(X12,X13,X14) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[shortest_path_properties])])])])])])]) ).
cnf(c_0_17,negated_conjecture,
( esk11_0 = esk12_0
| esk9_0 = esk10_0
| ~ path(esk9_0,esk10_0,esk13_0)
| ~ edge(esk12_0)
| ~ edge(esk11_0)
| ~ vertex(esk10_0)
| ~ vertex(esk9_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,plain,
( vertex(X1)
| ~ path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,plain,
( vertex(X2)
| ~ path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_20,negated_conjecture,
path(esk9_0,esk10_0,esk13_0),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_21,plain,
( edge(X1)
| ~ on_path(X1,X2)
| ~ path(X3,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,negated_conjecture,
( on_path(esk12_0,esk13_0)
| ~ path(X1,X2,esk13_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_23,plain,
( on_path(X4,X3)
| ~ path(X1,X2,X3)
| ~ precedes(X4,X5,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_24,plain,
( ~ precedes(X1,X2,X3)
| ~ shortest_path(X4,X5,X3)
| head_of(X6) != head_of(X2)
| tail_of(X6) != tail_of(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,negated_conjecture,
( esk11_0 = esk12_0
| esk10_0 = esk9_0
| ~ path(esk9_0,esk10_0,esk13_0)
| ~ vertex(esk10_0)
| ~ edge(esk11_0)
| ~ edge(esk12_0) ),
inference(csr,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_26,negated_conjecture,
vertex(esk10_0),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,negated_conjecture,
( edge(X1)
| ~ on_path(X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_28,negated_conjecture,
on_path(esk12_0,esk13_0),
inference(spm,[status(thm)],[c_0_22,c_0_20]) ).
cnf(c_0_29,negated_conjecture,
( on_path(esk11_0,esk13_0)
| ~ path(X1,X2,esk13_0) ),
inference(spm,[status(thm)],[c_0_23,c_0_15]) ).
cnf(c_0_30,negated_conjecture,
( head_of(X1) != head_of(X2)
| tail_of(X3) != tail_of(X2)
| ~ precedes(X3,X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_24,c_0_12]) ).
cnf(c_0_31,negated_conjecture,
( esk10_0 = esk9_0
| esk11_0 = esk12_0
| ~ edge(esk11_0)
| ~ edge(esk12_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_20])]),c_0_26])]) ).
cnf(c_0_32,negated_conjecture,
edge(esk12_0),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
on_path(esk11_0,esk13_0),
inference(spm,[status(thm)],[c_0_29,c_0_20]) ).
cnf(c_0_34,negated_conjecture,
( head_of(esk12_0) != head_of(X1)
| tail_of(esk11_0) != tail_of(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_15]) ).
cnf(c_0_35,negated_conjecture,
( esk11_0 = esk12_0
| esk10_0 = esk9_0
| ~ edge(esk11_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]) ).
cnf(c_0_36,negated_conjecture,
edge(esk11_0),
inference(spm,[status(thm)],[c_0_27,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
head_of(esk11_0) != head_of(esk12_0),
inference(er,[status(thm)],[c_0_34]) ).
cnf(c_0_38,negated_conjecture,
( esk10_0 = esk9_0
| esk11_0 = esk12_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]) ).
cnf(c_0_39,plain,
( ~ shortest_path(X1,X2,X3)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_40,negated_conjecture,
esk10_0 = esk9_0,
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,plain,
~ shortest_path(X1,X1,X2),
inference(er,[status(thm)],[c_0_39]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_40]),c_0_41]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : GRA003+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.10/0.10 % Command : run_ET %s %d
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.29 % CPULimit : 300
% 0.14/0.29 % WCLimit : 600
% 0.14/0.29 % DateTime : Tue May 31 02:26:13 EDT 2022
% 0.14/0.29 % CPUTime :
% 0.18/1.36 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.18/1.36 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.18/1.36 # Preprocessing time : 0.009 s
% 0.18/1.36
% 0.18/1.36 # Failure: Out of unprocessed clauses!
% 0.18/1.36 # OLD status GaveUp
% 0.18/1.36 # Parsed axioms : 18
% 0.18/1.36 # Removed by relevancy pruning/SinE : 11
% 0.18/1.36 # Initial clauses : 20
% 0.18/1.36 # Removed in clause preprocessing : 0
% 0.18/1.36 # Initial clauses in saturation : 20
% 0.18/1.36 # Processed clauses : 29
% 0.18/1.36 # ...of these trivial : 0
% 0.18/1.36 # ...subsumed : 0
% 0.18/1.36 # ...remaining for further processing : 29
% 0.18/1.36 # Other redundant clauses eliminated : 1
% 0.18/1.36 # Clauses deleted for lack of memory : 0
% 0.18/1.36 # Backward-subsumed : 0
% 0.18/1.36 # Backward-rewritten : 0
% 0.18/1.36 # Generated clauses : 9
% 0.18/1.36 # ...of the previous two non-trivial : 9
% 0.18/1.36 # Contextual simplify-reflections : 1
% 0.18/1.36 # Paramodulations : 7
% 0.18/1.36 # Factorizations : 0
% 0.18/1.36 # Equation resolutions : 2
% 0.18/1.36 # Current number of processed clauses : 28
% 0.18/1.36 # Positive orientable unit clauses : 2
% 0.18/1.36 # Positive unorientable unit clauses: 0
% 0.18/1.36 # Negative unit clauses : 3
% 0.18/1.36 # Non-unit-clauses : 23
% 0.18/1.36 # Current number of unprocessed clauses: 0
% 0.18/1.36 # ...number of literals in the above : 0
% 0.18/1.36 # Current number of archived formulas : 0
% 0.18/1.36 # Current number of archived clauses : 0
% 0.18/1.36 # Clause-clause subsumption calls (NU) : 66
% 0.18/1.36 # Rec. Clause-clause subsumption calls : 16
% 0.18/1.36 # Non-unit clause-clause subsumptions : 1
% 0.18/1.36 # Unit Clause-clause subsumption calls : 9
% 0.18/1.36 # Rewrite failures with RHS unbound : 0
% 0.18/1.36 # BW rewrite match attempts : 0
% 0.18/1.36 # BW rewrite match successes : 0
% 0.18/1.36 # Condensation attempts : 0
% 0.18/1.36 # Condensation successes : 0
% 0.18/1.36 # Termbank termtop insertions : 1889
% 0.18/1.36
% 0.18/1.36 # -------------------------------------------------
% 0.18/1.36 # User time : 0.008 s
% 0.18/1.36 # System time : 0.002 s
% 0.18/1.36 # Total time : 0.010 s
% 0.18/1.36 # Maximum resident set size: 2720 pages
% 0.18/1.36 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.18/1.36 # Preprocessing time : 0.013 s
% 0.18/1.36
% 0.18/1.36 # Proof found!
% 0.18/1.36 # SZS status Theorem
% 0.18/1.36 # SZS output start CNFRefutation
% See solution above
% 0.18/1.36 # Proof object total steps : 43
% 0.18/1.36 # Proof object clause steps : 30
% 0.18/1.36 # Proof object formula steps : 13
% 0.18/1.36 # Proof object conjectures : 24
% 0.18/1.36 # Proof object clause conjectures : 21
% 0.18/1.36 # Proof object formula conjectures : 3
% 0.18/1.36 # Proof object initial clauses used : 11
% 0.18/1.36 # Proof object initial formulas used : 6
% 0.18/1.36 # Proof object generating inferences : 13
% 0.18/1.36 # Proof object simplifying inferences : 12
% 0.18/1.36 # Training examples: 0 positive, 0 negative
% 0.18/1.36 # Parsed axioms : 18
% 0.18/1.36 # Removed by relevancy pruning/SinE : 0
% 0.18/1.36 # Initial clauses : 62
% 0.18/1.36 # Removed in clause preprocessing : 1
% 0.18/1.36 # Initial clauses in saturation : 61
% 0.18/1.36 # Processed clauses : 97
% 0.18/1.36 # ...of these trivial : 0
% 0.18/1.36 # ...subsumed : 4
% 0.18/1.36 # ...remaining for further processing : 93
% 0.18/1.36 # Other redundant clauses eliminated : 2
% 0.18/1.36 # Clauses deleted for lack of memory : 0
% 0.18/1.36 # Backward-subsumed : 0
% 0.18/1.36 # Backward-rewritten : 9
% 0.18/1.36 # Generated clauses : 131
% 0.18/1.36 # ...of the previous two non-trivial : 121
% 0.18/1.36 # Contextual simplify-reflections : 9
% 0.18/1.36 # Paramodulations : 127
% 0.18/1.36 # Factorizations : 0
% 0.18/1.36 # Equation resolutions : 4
% 0.18/1.36 # Current number of processed clauses : 82
% 0.18/1.36 # Positive orientable unit clauses : 10
% 0.18/1.36 # Positive unorientable unit clauses: 0
% 0.18/1.36 # Negative unit clauses : 4
% 0.18/1.36 # Non-unit-clauses : 68
% 0.18/1.36 # Current number of unprocessed clauses: 76
% 0.18/1.36 # ...number of literals in the above : 353
% 0.18/1.36 # Current number of archived formulas : 0
% 0.18/1.36 # Current number of archived clauses : 9
% 0.18/1.36 # Clause-clause subsumption calls (NU) : 834
% 0.18/1.36 # Rec. Clause-clause subsumption calls : 401
% 0.18/1.36 # Non-unit clause-clause subsumptions : 12
% 0.18/1.36 # Unit Clause-clause subsumption calls : 292
% 0.18/1.36 # Rewrite failures with RHS unbound : 0
% 0.18/1.36 # BW rewrite match attempts : 6
% 0.18/1.36 # BW rewrite match successes : 6
% 0.18/1.36 # Condensation attempts : 0
% 0.18/1.36 # Condensation successes : 0
% 0.18/1.36 # Termbank termtop insertions : 6017
% 0.18/1.36
% 0.18/1.36 # -------------------------------------------------
% 0.18/1.36 # User time : 0.015 s
% 0.18/1.36 # System time : 0.002 s
% 0.18/1.36 # Total time : 0.017 s
% 0.18/1.36 # Maximum resident set size: 3276 pages
%------------------------------------------------------------------------------