TSTP Solution File: COM013+4 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : COM013+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n015.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 : Fri Jul 15 01:14:03 EDT 2022
% Result : Theorem 0.26s 1.44s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 34 ( 4 unt; 0 def)
% Number of atoms : 257 ( 15 equ)
% Maximal formula atoms : 50 ( 7 avg)
% Number of connectives : 355 ( 132 ~; 149 |; 58 &)
% ( 1 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 80 ( 2 sgn 35 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
! [X1] :
( aElement0(X1)
=> ( ! [X2] :
( aElement0(X2)
=> ( iLess0(X2,X1)
=> ? [X3] :
( aElement0(X3)
& ( X2 = X3
| ( ( aReductOfIn0(X3,X2,xR)
| ? [X4] :
( aElement0(X4)
& aReductOfIn0(X4,X2,xR)
& sdtmndtplgtdt0(X4,xR,X3) ) )
& sdtmndtplgtdt0(X2,xR,X3) ) )
& sdtmndtasgtdt0(X2,xR,X3)
& ~ ? [X4] : aReductOfIn0(X4,X3,xR)
& aNormalFormOfIn0(X3,X2,xR) ) ) )
=> ? [X2] :
( ( aElement0(X2)
& ( X1 = X2
| aReductOfIn0(X2,X1,xR)
| ? [X3] :
( aElement0(X3)
& aReductOfIn0(X3,X1,xR)
& sdtmndtplgtdt0(X3,xR,X2) )
| sdtmndtplgtdt0(X1,xR,X2)
| sdtmndtasgtdt0(X1,xR,X2) )
& ~ ? [X3] : aReductOfIn0(X3,X2,xR) )
| aNormalFormOfIn0(X2,X1,xR) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(m__587,hypothesis,
( aRewritingSystem0(xR)
& ! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> ( ( aReductOfIn0(X2,X1,xR)
| ? [X3] :
( aElement0(X3)
& aReductOfIn0(X3,X1,xR)
& sdtmndtplgtdt0(X3,xR,X2) )
| sdtmndtplgtdt0(X1,xR,X2) )
=> iLess0(X2,X1) ) )
& isTerminating0(xR) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__587) ).
fof(mTCTrans,axiom,
! [X1,X2,X3,X4] :
( ( aElement0(X1)
& aRewritingSystem0(X2)
& aElement0(X3)
& aElement0(X4) )
=> ( ( sdtmndtplgtdt0(X1,X2,X3)
& sdtmndtplgtdt0(X3,X2,X4) )
=> sdtmndtplgtdt0(X1,X2,X4) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mTCTrans) ).
fof(mTCDef,axiom,
! [X1,X2,X3] :
( ( aElement0(X1)
& aRewritingSystem0(X2)
& aElement0(X3) )
=> ( sdtmndtplgtdt0(X1,X2,X3)
<=> ( aReductOfIn0(X3,X1,X2)
| ? [X4] :
( aElement0(X4)
& aReductOfIn0(X4,X1,X2)
& sdtmndtplgtdt0(X4,X2,X3) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mTCDef) ).
fof(mReduct,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aRewritingSystem0(X2) )
=> ! [X3] :
( aReductOfIn0(X3,X1,X2)
=> aElement0(X3) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mReduct) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( aElement0(X1)
=> ( ! [X2] :
( aElement0(X2)
=> ( iLess0(X2,X1)
=> ? [X3] :
( aElement0(X3)
& ( X2 = X3
| ( ( aReductOfIn0(X3,X2,xR)
| ? [X4] :
( aElement0(X4)
& aReductOfIn0(X4,X2,xR)
& sdtmndtplgtdt0(X4,xR,X3) ) )
& sdtmndtplgtdt0(X2,xR,X3) ) )
& sdtmndtasgtdt0(X2,xR,X3)
& ~ ? [X4] : aReductOfIn0(X4,X3,xR)
& aNormalFormOfIn0(X3,X2,xR) ) ) )
=> ? [X2] :
( ( aElement0(X2)
& ( X1 = X2
| aReductOfIn0(X2,X1,xR)
| ? [X3] :
( aElement0(X3)
& aReductOfIn0(X3,X1,xR)
& sdtmndtplgtdt0(X3,xR,X2) )
| sdtmndtplgtdt0(X1,xR,X2)
| sdtmndtasgtdt0(X1,xR,X2) )
& ~ ? [X3] : aReductOfIn0(X3,X2,xR) )
| aNormalFormOfIn0(X2,X1,xR) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,negated_conjecture,
! [X6,X9,X10,X11,X10] :
( aElement0(esk1_0)
& ( aElement0(esk2_1(X6))
| ~ iLess0(X6,esk1_0)
| ~ aElement0(X6) )
& ( aElement0(esk3_1(X6))
| aReductOfIn0(esk2_1(X6),X6,xR)
| X6 = esk2_1(X6)
| ~ iLess0(X6,esk1_0)
| ~ aElement0(X6) )
& ( aReductOfIn0(esk3_1(X6),X6,xR)
| aReductOfIn0(esk2_1(X6),X6,xR)
| X6 = esk2_1(X6)
| ~ iLess0(X6,esk1_0)
| ~ aElement0(X6) )
& ( sdtmndtplgtdt0(esk3_1(X6),xR,esk2_1(X6))
| aReductOfIn0(esk2_1(X6),X6,xR)
| X6 = esk2_1(X6)
| ~ iLess0(X6,esk1_0)
| ~ aElement0(X6) )
& ( sdtmndtplgtdt0(X6,xR,esk2_1(X6))
| X6 = esk2_1(X6)
| ~ iLess0(X6,esk1_0)
| ~ aElement0(X6) )
& ( sdtmndtasgtdt0(X6,xR,esk2_1(X6))
| ~ iLess0(X6,esk1_0)
| ~ aElement0(X6) )
& ( ~ aReductOfIn0(X9,esk2_1(X6),xR)
| ~ iLess0(X6,esk1_0)
| ~ aElement0(X6) )
& ( aNormalFormOfIn0(esk2_1(X6),X6,xR)
| ~ iLess0(X6,esk1_0)
| ~ aElement0(X6) )
& ( esk1_0 != X10
| ~ aElement0(X10)
| aReductOfIn0(esk4_1(X10),X10,xR) )
& ( ~ aReductOfIn0(X10,esk1_0,xR)
| ~ aElement0(X10)
| aReductOfIn0(esk4_1(X10),X10,xR) )
& ( ~ aElement0(X11)
| ~ aReductOfIn0(X11,esk1_0,xR)
| ~ sdtmndtplgtdt0(X11,xR,X10)
| ~ aElement0(X10)
| aReductOfIn0(esk4_1(X10),X10,xR) )
& ( ~ sdtmndtplgtdt0(esk1_0,xR,X10)
| ~ aElement0(X10)
| aReductOfIn0(esk4_1(X10),X10,xR) )
& ( ~ sdtmndtasgtdt0(esk1_0,xR,X10)
| ~ aElement0(X10)
| aReductOfIn0(esk4_1(X10),X10,xR) )
& ~ aNormalFormOfIn0(X10,esk1_0,xR) ),
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)],[c_0_5])])])])])])]) ).
fof(c_0_7,hypothesis,
! [X4,X5,X6] :
( aRewritingSystem0(xR)
& ( ~ aReductOfIn0(X5,X4,xR)
| iLess0(X5,X4)
| ~ aElement0(X4)
| ~ aElement0(X5) )
& ( ~ aElement0(X6)
| ~ aReductOfIn0(X6,X4,xR)
| ~ sdtmndtplgtdt0(X6,xR,X5)
| iLess0(X5,X4)
| ~ aElement0(X4)
| ~ aElement0(X5) )
& ( ~ sdtmndtplgtdt0(X4,xR,X5)
| iLess0(X5,X4)
| ~ aElement0(X4)
| ~ aElement0(X5) )
& isTerminating0(xR) ),
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)],[m__587])])])])])]) ).
cnf(c_0_8,negated_conjecture,
( ~ aElement0(X1)
| ~ iLess0(X1,esk1_0)
| ~ aReductOfIn0(X2,esk2_1(X1),xR) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
( aReductOfIn0(esk4_1(X1),X1,xR)
| ~ aElement0(X1)
| ~ sdtmndtplgtdt0(esk1_0,xR,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( aElement0(esk2_1(X1))
| ~ aElement0(X1)
| ~ iLess0(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_11,plain,
! [X5,X6,X7,X8] :
( ~ aElement0(X5)
| ~ aRewritingSystem0(X6)
| ~ aElement0(X7)
| ~ aElement0(X8)
| ~ sdtmndtplgtdt0(X5,X6,X7)
| ~ sdtmndtplgtdt0(X7,X6,X8)
| sdtmndtplgtdt0(X5,X6,X8) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mTCTrans])]) ).
cnf(c_0_12,negated_conjecture,
( X1 = esk2_1(X1)
| sdtmndtplgtdt0(X1,xR,esk2_1(X1))
| ~ aElement0(X1)
| ~ iLess0(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,hypothesis,
( iLess0(X1,X2)
| ~ aElement0(X1)
| ~ aElement0(X2)
| ~ aReductOfIn0(X1,X2,xR) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,negated_conjecture,
aElement0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,negated_conjecture,
( ~ sdtmndtplgtdt0(esk1_0,xR,esk2_1(X1))
| ~ iLess0(X1,esk1_0)
| ~ aElement0(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_16,plain,
( sdtmndtplgtdt0(X1,X2,X3)
| ~ sdtmndtplgtdt0(X4,X2,X3)
| ~ sdtmndtplgtdt0(X1,X2,X4)
| ~ aElement0(X3)
| ~ aElement0(X4)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
( esk2_1(X1) = X1
| sdtmndtplgtdt0(X1,xR,esk2_1(X1))
| ~ aReductOfIn0(X1,esk1_0,xR)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_18,hypothesis,
aRewritingSystem0(xR),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_19,negated_conjecture,
( aElement0(esk2_1(X1))
| ~ aReductOfIn0(X1,esk1_0,xR)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_13]),c_0_14])]) ).
cnf(c_0_20,hypothesis,
( ~ sdtmndtplgtdt0(esk1_0,xR,esk2_1(X1))
| ~ aReductOfIn0(X1,esk1_0,xR)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_13]),c_0_14])]) ).
cnf(c_0_21,negated_conjecture,
( esk2_1(X1) = X1
| sdtmndtplgtdt0(X2,xR,esk2_1(X1))
| ~ sdtmndtplgtdt0(X2,xR,X1)
| ~ aReductOfIn0(X1,esk1_0,xR)
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),c_0_19]) ).
fof(c_0_22,plain,
! [X5,X6,X7,X9] :
( ( aElement0(esk7_3(X5,X6,X7))
| aReductOfIn0(X7,X5,X6)
| ~ sdtmndtplgtdt0(X5,X6,X7)
| ~ aElement0(X5)
| ~ aRewritingSystem0(X6)
| ~ aElement0(X7) )
& ( aReductOfIn0(esk7_3(X5,X6,X7),X5,X6)
| aReductOfIn0(X7,X5,X6)
| ~ sdtmndtplgtdt0(X5,X6,X7)
| ~ aElement0(X5)
| ~ aRewritingSystem0(X6)
| ~ aElement0(X7) )
& ( sdtmndtplgtdt0(esk7_3(X5,X6,X7),X6,X7)
| aReductOfIn0(X7,X5,X6)
| ~ sdtmndtplgtdt0(X5,X6,X7)
| ~ aElement0(X5)
| ~ aRewritingSystem0(X6)
| ~ aElement0(X7) )
& ( ~ aReductOfIn0(X7,X5,X6)
| sdtmndtplgtdt0(X5,X6,X7)
| ~ aElement0(X5)
| ~ aRewritingSystem0(X6)
| ~ aElement0(X7) )
& ( ~ aElement0(X9)
| ~ aReductOfIn0(X9,X5,X6)
| ~ sdtmndtplgtdt0(X9,X6,X7)
| sdtmndtplgtdt0(X5,X6,X7)
| ~ aElement0(X5)
| ~ aRewritingSystem0(X6)
| ~ aElement0(X7) ) ),
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)],[mTCDef])])])])])])]) ).
fof(c_0_23,plain,
! [X4,X5,X6] :
( ~ aElement0(X4)
| ~ aRewritingSystem0(X5)
| ~ aReductOfIn0(X6,X4,X5)
| aElement0(X6) ),
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)],[mReduct])])])])]) ).
cnf(c_0_24,hypothesis,
( esk2_1(X1) = X1
| ~ sdtmndtplgtdt0(esk1_0,xR,X1)
| ~ aReductOfIn0(X1,esk1_0,xR)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_14])]) ).
cnf(c_0_25,plain,
( sdtmndtplgtdt0(X3,X2,X1)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X3)
| ~ aReductOfIn0(X1,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_26,plain,
( aElement0(X1)
| ~ aReductOfIn0(X1,X2,X3)
| ~ aRewritingSystem0(X3)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_27,hypothesis,
( ~ sdtmndtplgtdt0(esk1_0,xR,X1)
| ~ aReductOfIn0(X1,esk1_0,xR)
| ~ aElement0(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_24]) ).
cnf(c_0_28,plain,
( sdtmndtplgtdt0(X1,X2,X3)
| ~ aReductOfIn0(X3,X1,X2)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X1) ),
inference(csr,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,hypothesis,
( ~ aReductOfIn0(X1,esk1_0,xR)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_18]),c_0_14])]) ).
cnf(c_0_30,negated_conjecture,
( aReductOfIn0(esk4_1(X1),X1,xR)
| ~ aElement0(X1)
| esk1_0 != X1 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_31,negated_conjecture,
~ aElement0(esk4_1(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_14])]) ).
cnf(c_0_32,negated_conjecture,
( aElement0(esk4_1(X1))
| esk1_0 != X1
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_30]),c_0_18])]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : COM013+4 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.14 % Command : run_ET %s %d
% 0.14/0.36 % Computer : n015.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Thu Jun 16 17:16:41 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.26/1.44 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.26/1.44 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.26/1.44 # Preprocessing time : 0.019 s
% 0.26/1.44
% 0.26/1.44 # Proof found!
% 0.26/1.44 # SZS status Theorem
% 0.26/1.44 # SZS output start CNFRefutation
% See solution above
% 0.26/1.44 # Proof object total steps : 34
% 0.26/1.44 # Proof object clause steps : 23
% 0.26/1.44 # Proof object formula steps : 11
% 0.26/1.44 # Proof object conjectures : 16
% 0.26/1.44 # Proof object clause conjectures : 13
% 0.26/1.44 # Proof object formula conjectures : 3
% 0.26/1.44 # Proof object initial clauses used : 11
% 0.26/1.44 # Proof object initial formulas used : 5
% 0.26/1.44 # Proof object generating inferences : 11
% 0.26/1.44 # Proof object simplifying inferences : 22
% 0.26/1.44 # Training examples: 0 positive, 0 negative
% 0.26/1.44 # Parsed axioms : 15
% 0.26/1.44 # Removed by relevancy pruning/SinE : 2
% 0.26/1.44 # Initial clauses : 44
% 0.26/1.44 # Removed in clause preprocessing : 4
% 0.26/1.44 # Initial clauses in saturation : 40
% 0.26/1.44 # Processed clauses : 145
% 0.26/1.44 # ...of these trivial : 1
% 0.26/1.44 # ...subsumed : 43
% 0.26/1.44 # ...remaining for further processing : 101
% 0.26/1.44 # Other redundant clauses eliminated : 1
% 0.26/1.44 # Clauses deleted for lack of memory : 0
% 0.26/1.44 # Backward-subsumed : 20
% 0.26/1.44 # Backward-rewritten : 0
% 0.26/1.44 # Generated clauses : 220
% 0.26/1.44 # ...of the previous two non-trivial : 205
% 0.26/1.44 # Contextual simplify-reflections : 51
% 0.26/1.44 # Paramodulations : 219
% 0.26/1.44 # Factorizations : 0
% 0.26/1.44 # Equation resolutions : 1
% 0.26/1.44 # Current number of processed clauses : 80
% 0.26/1.44 # Positive orientable unit clauses : 3
% 0.26/1.44 # Positive unorientable unit clauses: 0
% 0.26/1.44 # Negative unit clauses : 5
% 0.26/1.44 # Non-unit-clauses : 72
% 0.26/1.44 # Current number of unprocessed clauses: 53
% 0.26/1.44 # ...number of literals in the above : 331
% 0.26/1.44 # Current number of archived formulas : 0
% 0.26/1.44 # Current number of archived clauses : 20
% 0.26/1.44 # Clause-clause subsumption calls (NU) : 1591
% 0.26/1.44 # Rec. Clause-clause subsumption calls : 650
% 0.26/1.44 # Non-unit clause-clause subsumptions : 99
% 0.26/1.44 # Unit Clause-clause subsumption calls : 48
% 0.26/1.44 # Rewrite failures with RHS unbound : 0
% 0.26/1.44 # BW rewrite match attempts : 0
% 0.26/1.44 # BW rewrite match successes : 0
% 0.26/1.44 # Condensation attempts : 0
% 0.26/1.44 # Condensation successes : 0
% 0.26/1.44 # Termbank termtop insertions : 8075
% 0.26/1.44
% 0.26/1.44 # -------------------------------------------------
% 0.26/1.44 # User time : 0.039 s
% 0.26/1.44 # System time : 0.003 s
% 0.26/1.44 # Total time : 0.042 s
% 0.26/1.44 # Maximum resident set size: 3328 pages
%------------------------------------------------------------------------------