TSTP Solution File: SET099+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET099+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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 : Tue Jul 19 00:09:27 EDT 2022
% Result : Theorem 13.73s 3.11s
% Output : CNFRefutation 13.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 10
% Syntax : Number of formulae : 81 ( 19 unt; 0 def)
% Number of atoms : 210 ( 62 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 211 ( 82 ~; 95 |; 23 &)
% ( 5 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 148 ( 14 sgn 45 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(corollary_2_to_number_of_elements_in_class,conjecture,
! [X1] :
( ! [X3,X4] :
( ( member(X3,X1)
& member(X4,intersection(complement(singleton(X3)),X1)) )
=> X3 = X4 )
=> ( X1 = null_class
| ? [X2] : singleton(X2) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',corollary_2_to_number_of_elements_in_class) ).
fof(intersection,axiom,
! [X1,X2,X5] :
( member(X5,intersection(X1,X2))
<=> ( member(X5,X1)
& member(X5,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',intersection) ).
fof(regularity,axiom,
! [X1] :
( X1 != null_class
=> ? [X3] :
( member(X3,universal_class)
& member(X3,X1)
& disjoint(X3,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',regularity) ).
fof(singleton_set_defn,axiom,
! [X1] : singleton(X1) = unordered_pair(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',singleton_set_defn) ).
fof(complement,axiom,
! [X1,X5] :
( member(X5,complement(X1))
<=> ( member(X5,universal_class)
& ~ member(X5,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',complement) ).
fof(unordered_pair_defn,axiom,
! [X3,X1,X2] :
( member(X3,unordered_pair(X1,X2))
<=> ( member(X3,universal_class)
& ( X3 = X1
| X3 = X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',unordered_pair_defn) ).
fof(subclass_defn,axiom,
! [X1,X2] :
( subclass(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',subclass_defn) ).
fof(class_elements_are_sets,axiom,
! [X1] : subclass(X1,universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',class_elements_are_sets) ).
fof(null_class_defn,axiom,
! [X1] : ~ member(X1,null_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',null_class_defn) ).
fof(extensionality,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subclass(X1,X2)
& subclass(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',extensionality) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ! [X3,X4] :
( ( member(X3,X1)
& member(X4,intersection(complement(singleton(X3)),X1)) )
=> X3 = X4 )
=> ( X1 = null_class
| ? [X2] : singleton(X2) = X1 ) ),
inference(assume_negation,[status(cth)],[corollary_2_to_number_of_elements_in_class]) ).
fof(c_0_11,plain,
! [X38,X39,X40] :
( ( member(X40,X38)
| ~ member(X40,intersection(X38,X39)) )
& ( member(X40,X39)
| ~ member(X40,intersection(X38,X39)) )
& ( ~ member(X40,X38)
| ~ member(X40,X39)
| member(X40,intersection(X38,X39)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intersection])])]) ).
fof(c_0_12,plain,
! [X101] :
( ( member(esk6_1(X101),universal_class)
| X101 = null_class )
& ( member(esk6_1(X101),X101)
| X101 = null_class )
& ( disjoint(esk6_1(X101),X101)
| X101 = null_class ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[regularity])])])]) ).
fof(c_0_13,negated_conjecture,
! [X108,X109,X110] :
( ( ~ member(X108,esk8_0)
| ~ member(X109,intersection(complement(singleton(X108)),esk8_0))
| X108 = X109 )
& esk8_0 != null_class
& singleton(X110) != esk8_0 ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
fof(c_0_14,plain,
! [X24] : singleton(X24) = unordered_pair(X24,X24),
inference(variable_rename,[status(thm)],[singleton_set_defn]) ).
fof(c_0_15,plain,
! [X41,X42] :
( ( member(X42,universal_class)
| ~ member(X42,complement(X41)) )
& ( ~ member(X42,X41)
| ~ member(X42,complement(X41)) )
& ( ~ member(X42,universal_class)
| member(X42,X41)
| member(X42,complement(X41)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[complement])])])]) ).
cnf(c_0_16,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( member(esk6_1(X1),X1)
| X1 = null_class ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
( X1 = X2
| ~ member(X1,esk8_0)
| ~ member(X2,intersection(complement(singleton(X1)),esk8_0)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
singleton(X1) = unordered_pair(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
( intersection(X1,X2) = null_class
| member(esk6_1(intersection(X1,X2)),X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,negated_conjecture,
( X1 = X2
| ~ member(X1,esk8_0)
| ~ member(X2,intersection(complement(unordered_pair(X1,X1)),esk8_0)) ),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_23,plain,
! [X19,X20,X21] :
( ( member(X19,universal_class)
| ~ member(X19,unordered_pair(X20,X21)) )
& ( X19 = X20
| X19 = X21
| ~ member(X19,unordered_pair(X20,X21)) )
& ( X19 != X20
| ~ member(X19,universal_class)
| member(X19,unordered_pair(X20,X21)) )
& ( X19 != X21
| ~ member(X19,universal_class)
| member(X19,unordered_pair(X20,X21)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[unordered_pair_defn])])]) ).
fof(c_0_24,plain,
! [X10,X11,X12,X13,X14] :
( ( ~ subclass(X10,X11)
| ~ member(X12,X10)
| member(X12,X11) )
& ( member(esk1_2(X13,X14),X13)
| subclass(X13,X14) )
& ( ~ member(esk1_2(X13,X14),X14)
| subclass(X13,X14) ) ),
inference(distribute,[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)],[subclass_defn])])])])])]) ).
fof(c_0_25,plain,
! [X16] : subclass(X16,universal_class),
inference(variable_rename,[status(thm)],[class_elements_are_sets]) ).
cnf(c_0_26,plain,
( intersection(complement(X1),X2) = null_class
| ~ member(esk6_1(intersection(complement(X1),X2)),X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,negated_conjecture,
( esk6_1(intersection(complement(unordered_pair(X1,X1)),esk8_0)) = X1
| intersection(complement(unordered_pair(X1,X1)),esk8_0) = null_class
| ~ member(X1,esk8_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_17]) ).
cnf(c_0_28,plain,
( member(X1,unordered_pair(X3,X2))
| X1 != X2
| ~ member(X1,universal_class) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,plain,
subclass(X1,universal_class),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,negated_conjecture,
( intersection(complement(unordered_pair(X1,X1)),esk8_0) = null_class
| ~ member(X1,unordered_pair(X1,X1))
| ~ member(X1,esk8_0) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
inference(er,[status(thm)],[c_0_28]) ).
cnf(c_0_33,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
fof(c_0_34,plain,
! [X46] : ~ member(X46,null_class),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[null_class_defn])]) ).
cnf(c_0_35,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_36,negated_conjecture,
( intersection(complement(unordered_pair(X1,X1)),esk8_0) = null_class
| ~ member(X1,esk8_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_37,plain,
~ member(X1,null_class),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_38,negated_conjecture,
( ~ member(X1,complement(unordered_pair(X2,X2)))
| ~ member(X1,esk8_0)
| ~ member(X2,esk8_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).
cnf(c_0_39,plain,
( member(X1,X2)
| member(X1,complement(X2))
| ~ member(X1,universal_class) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_40,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_41,negated_conjecture,
( member(X1,unordered_pair(X2,X2))
| ~ member(X1,esk8_0)
| ~ member(X2,esk8_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_33]) ).
cnf(c_0_42,plain,
( subclass(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_43,negated_conjecture,
( X1 = X2
| ~ member(X1,esk8_0)
| ~ member(X2,esk8_0) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,negated_conjecture,
esk8_0 != null_class,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_45,plain,
( subclass(X1,intersection(X2,X3))
| ~ member(esk1_2(X1,intersection(X2,X3)),X3)
| ~ member(esk1_2(X1,intersection(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_42,c_0_35]) ).
cnf(c_0_46,plain,
( member(esk1_2(X1,X2),X1)
| subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_47,negated_conjecture,
( esk6_1(esk8_0) = X1
| ~ member(X1,esk8_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_17]),c_0_44]) ).
cnf(c_0_48,plain,
( member(X1,X2)
| ~ member(X1,intersection(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_49,plain,
( subclass(X1,intersection(X2,X1))
| ~ member(esk1_2(X1,intersection(X2,X1)),X2) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,negated_conjecture,
( esk1_2(esk8_0,X1) = esk6_1(esk8_0)
| subclass(esk8_0,X1) ),
inference(spm,[status(thm)],[c_0_47,c_0_46]) ).
cnf(c_0_51,plain,
( intersection(X1,X2) = null_class
| member(esk6_1(intersection(X1,X2)),X2) ),
inference(spm,[status(thm)],[c_0_48,c_0_17]) ).
cnf(c_0_52,negated_conjecture,
( esk6_1(intersection(esk8_0,X1)) = esk6_1(esk8_0)
| intersection(esk8_0,X1) = null_class ),
inference(spm,[status(thm)],[c_0_47,c_0_21]) ).
fof(c_0_53,plain,
! [X17,X18] :
( ( subclass(X17,X18)
| X17 != X18 )
& ( subclass(X18,X17)
| X17 != X18 )
& ( ~ subclass(X17,X18)
| ~ subclass(X18,X17)
| X17 = X18 ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[extensionality])])]) ).
cnf(c_0_54,negated_conjecture,
( subclass(esk8_0,intersection(X1,esk8_0))
| ~ member(esk6_1(esk8_0),X1) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_55,negated_conjecture,
( intersection(esk8_0,X1) = null_class
| member(esk6_1(esk8_0),X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_56,plain,
( member(esk1_2(intersection(X1,X2),X3),X2)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_48,c_0_46]) ).
cnf(c_0_57,plain,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_58,negated_conjecture,
( intersection(esk8_0,X1) = null_class
| subclass(esk8_0,intersection(X1,esk8_0)) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_59,plain,
subclass(intersection(X1,X2),X2),
inference(spm,[status(thm)],[c_0_42,c_0_56]) ).
cnf(c_0_60,plain,
( member(esk1_2(intersection(X1,X2),X3),X1)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_16,c_0_46]) ).
cnf(c_0_61,negated_conjecture,
( intersection(esk8_0,X1) = null_class
| member(esk6_1(esk8_0),esk8_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_52]) ).
cnf(c_0_62,negated_conjecture,
( intersection(esk8_0,X1) = null_class
| intersection(X1,esk8_0) = esk8_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59])]) ).
cnf(c_0_63,plain,
subclass(X1,intersection(X1,X1)),
inference(spm,[status(thm)],[c_0_49,c_0_46]) ).
cnf(c_0_64,plain,
subclass(intersection(X1,X2),X1),
inference(spm,[status(thm)],[c_0_42,c_0_60]) ).
cnf(c_0_65,negated_conjecture,
( member(esk6_1(esk8_0),esk8_0)
| ~ member(X1,esk8_0)
| ~ member(X1,X2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_61]),c_0_37]) ).
cnf(c_0_66,negated_conjecture,
( intersection(X1,esk8_0) = esk8_0
| ~ member(X2,esk8_0)
| ~ member(X2,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_62]),c_0_37]) ).
cnf(c_0_67,plain,
intersection(X1,X1) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_63]),c_0_64])]) ).
cnf(c_0_68,negated_conjecture,
( member(esk6_1(esk8_0),esk8_0)
| ~ member(esk6_1(esk8_0),X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_17]),c_0_44]) ).
cnf(c_0_69,plain,
( member(esk6_1(X1),universal_class)
| X1 = null_class ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_70,plain,
( esk1_2(unordered_pair(X1,X2),X3) = X1
| esk1_2(unordered_pair(X1,X2),X3) = X2
| subclass(unordered_pair(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_40,c_0_46]) ).
cnf(c_0_71,negated_conjecture,
( intersection(X1,esk8_0) = esk8_0
| ~ member(esk6_1(esk8_0),X1) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_55]),c_0_67]),c_0_44]) ).
cnf(c_0_72,negated_conjecture,
member(esk6_1(esk8_0),esk8_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_44]) ).
cnf(c_0_73,negated_conjecture,
singleton(X1) != esk8_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_74,plain,
( esk1_2(unordered_pair(X1,X1),X2) = X1
| subclass(unordered_pair(X1,X1),X2) ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_70])]) ).
cnf(c_0_75,plain,
( intersection(X1,X2) = X1
| ~ subclass(X1,intersection(X1,X2)) ),
inference(spm,[status(thm)],[c_0_57,c_0_64]) ).
cnf(c_0_76,negated_conjecture,
( intersection(unordered_pair(X1,X1),esk8_0) = esk8_0
| ~ member(X1,esk8_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_41]),c_0_72])]) ).
cnf(c_0_77,negated_conjecture,
unordered_pair(X1,X1) != esk8_0,
inference(rw,[status(thm)],[c_0_73,c_0_19]) ).
cnf(c_0_78,plain,
( subclass(unordered_pair(X1,X1),X2)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_42,c_0_74]) ).
cnf(c_0_79,negated_conjecture,
~ member(X1,esk8_0),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_77]),c_0_78]) ).
cnf(c_0_80,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_72,c_0_79]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET099+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n013.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jul 10 16:15:16 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.44 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 13.73/3.11 # ENIGMATIC: Solved by autoschedule:
% 13.73/3.11 # No SInE strategy applied
% 13.73/3.11 # Trying AutoSched0 for 150 seconds
% 13.73/3.11 # AutoSched0-Mode selected heuristic G_E___042_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 13.73/3.11 # and selection function SelectMaxLComplexAvoidPosPred.
% 13.73/3.11 #
% 13.73/3.11 # Preprocessing time : 0.029 s
% 13.73/3.11 # Presaturation interreduction done
% 13.73/3.11
% 13.73/3.11 # Proof found!
% 13.73/3.11 # SZS status Theorem
% 13.73/3.11 # SZS output start CNFRefutation
% See solution above
% 13.73/3.11 # Training examples: 0 positive, 0 negative
% 13.73/3.11
% 13.73/3.11 # -------------------------------------------------
% 13.73/3.11 # User time : 0.829 s
% 13.73/3.11 # System time : 0.031 s
% 13.73/3.11 # Total time : 0.860 s
% 13.73/3.11 # Maximum resident set size: 7116 pages
% 13.73/3.11
%------------------------------------------------------------------------------