TSTP Solution File: SEU291+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU291+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n007.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 09:18:40 EDT 2022
% Result : Theorem 0.26s 1.46s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 64 ( 15 unt; 0 def)
% Number of atoms : 193 ( 67 equ)
% Maximal formula atoms : 26 ( 3 avg)
% Number of connectives : 210 ( 81 ~; 88 |; 23 &)
% ( 4 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-3 aty)
% Number of variables : 113 ( 5 sgn 53 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t9_funct_2,conjecture,
! [X1,X2,X3,X4] :
( ( function(X4)
& quasi_total(X4,X1,X2)
& relation_of2_as_subset(X4,X1,X2) )
=> ( subset(X2,X3)
=> ( ( X2 = empty_set
& X1 != empty_set )
| ( function(X4)
& quasi_total(X4,X1,X3)
& relation_of2_as_subset(X4,X1,X3) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t9_funct_2) ).
fof(t16_relset_1,axiom,
! [X1,X2,X3,X4] :
( relation_of2_as_subset(X4,X3,X1)
=> ( subset(X1,X2)
=> relation_of2_as_subset(X4,X3,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t16_relset_1) ).
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t6_boole) ).
fof(rc1_xboole_0,axiom,
? [X1] : empty(X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',rc1_xboole_0) ).
fof(t3_xboole_1,axiom,
! [X1] :
( subset(X1,empty_set)
=> X1 = empty_set ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t3_xboole_1) ).
fof(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t3_subset) ).
fof(dt_k4_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2(X3,X1,X2)
=> element(relation_dom_as_subset(X1,X2,X3),powerset(X1)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k4_relset_1) ).
fof(d1_funct_2,axiom,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
=> ( ( ( X2 = empty_set
=> X1 = empty_set )
=> ( quasi_total(X3,X1,X2)
<=> X1 = relation_dom_as_subset(X1,X2,X3) ) )
& ( X2 = empty_set
=> ( X1 = empty_set
| ( quasi_total(X3,X1,X2)
<=> X3 = empty_set ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1_funct_2) ).
fof(redefinition_k4_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2(X3,X1,X2)
=> relation_dom_as_subset(X1,X2,X3) = relation_dom(X3) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',redefinition_k4_relset_1) ).
fof(redefinition_m2_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
<=> relation_of2(X3,X1,X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',redefinition_m2_relset_1) ).
fof(c_0_10,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ( function(X4)
& quasi_total(X4,X1,X2)
& relation_of2_as_subset(X4,X1,X2) )
=> ( subset(X2,X3)
=> ( ( X2 = empty_set
& X1 != empty_set )
| ( function(X4)
& quasi_total(X4,X1,X3)
& relation_of2_as_subset(X4,X1,X3) ) ) ) ),
inference(assume_negation,[status(cth)],[t9_funct_2]) ).
fof(c_0_11,plain,
! [X5,X6,X7,X8] :
( ~ relation_of2_as_subset(X8,X7,X5)
| ~ subset(X5,X6)
| relation_of2_as_subset(X8,X7,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t16_relset_1])]) ).
fof(c_0_12,negated_conjecture,
( function(esk4_0)
& quasi_total(esk4_0,esk1_0,esk2_0)
& relation_of2_as_subset(esk4_0,esk1_0,esk2_0)
& subset(esk2_0,esk3_0)
& ( esk2_0 != empty_set
| esk1_0 = empty_set )
& ( ~ function(esk4_0)
| ~ quasi_total(esk4_0,esk1_0,esk3_0)
| ~ relation_of2_as_subset(esk4_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,
! [X2] :
( ~ empty(X2)
| X2 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])]) ).
fof(c_0_14,plain,
empty(esk13_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_xboole_0])]) ).
cnf(c_0_15,plain,
( relation_of2_as_subset(X1,X2,X3)
| ~ subset(X4,X3)
| ~ relation_of2_as_subset(X1,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
relation_of2_as_subset(esk4_0,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_17,plain,
! [X2] :
( ~ subset(X2,empty_set)
| X2 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_xboole_1])]) ).
cnf(c_0_18,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
empty(esk13_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_20,plain,
! [X3,X4,X3,X4] :
( ( ~ element(X3,powerset(X4))
| subset(X3,X4) )
& ( ~ subset(X3,X4)
| element(X3,powerset(X4)) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])])]) ).
fof(c_0_21,plain,
! [X4,X5,X6] :
( ~ relation_of2(X6,X4,X5)
| element(relation_dom_as_subset(X4,X5,X6),powerset(X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k4_relset_1])]) ).
fof(c_0_22,plain,
! [X4,X5,X6] :
( ( ~ quasi_total(X6,X4,X5)
| X4 = relation_dom_as_subset(X4,X5,X6)
| X5 = empty_set
| ~ relation_of2_as_subset(X6,X4,X5) )
& ( X4 != relation_dom_as_subset(X4,X5,X6)
| quasi_total(X6,X4,X5)
| X5 = empty_set
| ~ relation_of2_as_subset(X6,X4,X5) )
& ( ~ quasi_total(X6,X4,X5)
| X4 = relation_dom_as_subset(X4,X5,X6)
| X4 != empty_set
| ~ relation_of2_as_subset(X6,X4,X5) )
& ( X4 != relation_dom_as_subset(X4,X5,X6)
| quasi_total(X6,X4,X5)
| X4 != empty_set
| ~ relation_of2_as_subset(X6,X4,X5) )
& ( ~ quasi_total(X6,X4,X5)
| X6 = empty_set
| X4 = empty_set
| X5 != empty_set
| ~ relation_of2_as_subset(X6,X4,X5) )
& ( X6 != empty_set
| quasi_total(X6,X4,X5)
| X4 = empty_set
| X5 != empty_set
| ~ relation_of2_as_subset(X6,X4,X5) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_funct_2])])]) ).
cnf(c_0_23,negated_conjecture,
( ~ relation_of2_as_subset(esk4_0,esk1_0,esk3_0)
| ~ quasi_total(esk4_0,esk1_0,esk3_0)
| ~ function(esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_24,negated_conjecture,
function(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_25,negated_conjecture,
( relation_of2_as_subset(esk4_0,esk1_0,X1)
| ~ subset(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_26,negated_conjecture,
subset(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_27,plain,
( X1 = empty_set
| ~ subset(X1,empty_set) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_28,plain,
empty_set = esk13_0,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_29,plain,
( subset(X1,X2)
| ~ element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_30,plain,
( element(relation_dom_as_subset(X1,X2,X3),powerset(X1))
| ~ relation_of2(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_31,plain,
! [X4,X5,X6] :
( ~ relation_of2(X6,X4,X5)
| relation_dom_as_subset(X4,X5,X6) = relation_dom(X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k4_relset_1])]) ).
cnf(c_0_32,plain,
( X3 = empty_set
| X2 = relation_dom_as_subset(X2,X3,X1)
| ~ relation_of2_as_subset(X1,X2,X3)
| ~ quasi_total(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_33,plain,
! [X4,X5,X6,X4,X5,X6] :
( ( ~ relation_of2_as_subset(X6,X4,X5)
| relation_of2(X6,X4,X5) )
& ( ~ relation_of2(X6,X4,X5)
| relation_of2_as_subset(X6,X4,X5) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_m2_relset_1])])])]) ).
cnf(c_0_34,negated_conjecture,
( ~ quasi_total(esk4_0,esk1_0,esk3_0)
| ~ relation_of2_as_subset(esk4_0,esk1_0,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
cnf(c_0_35,negated_conjecture,
relation_of2_as_subset(esk4_0,esk1_0,esk3_0),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_36,negated_conjecture,
( esk1_0 = empty_set
| esk2_0 != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_37,plain,
( quasi_total(X1,X2,X3)
| ~ relation_of2_as_subset(X1,X2,X3)
| X2 != empty_set
| X2 != relation_dom_as_subset(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_38,plain,
( X1 = esk13_0
| ~ subset(X1,esk13_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_28]) ).
cnf(c_0_39,plain,
( subset(relation_dom_as_subset(X1,X2,X3),X1)
| ~ relation_of2(X3,X1,X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_40,plain,
( X3 = empty_set
| quasi_total(X1,X2,X3)
| ~ relation_of2_as_subset(X1,X2,X3)
| X2 != relation_dom_as_subset(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_41,plain,
( relation_dom_as_subset(X1,X2,X3) = relation_dom(X3)
| ~ relation_of2(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_42,plain,
( relation_dom_as_subset(X1,X2,X3) = X1
| X2 = esk13_0
| ~ quasi_total(X3,X1,X2)
| ~ relation_of2_as_subset(X3,X1,X2) ),
inference(rw,[status(thm)],[c_0_32,c_0_28]) ).
cnf(c_0_43,plain,
( relation_of2_as_subset(X1,X2,X3)
| ~ relation_of2(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_44,negated_conjecture,
~ quasi_total(esk4_0,esk1_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]) ).
cnf(c_0_45,negated_conjecture,
( esk1_0 = esk13_0
| esk2_0 != esk13_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_28]),c_0_28]) ).
cnf(c_0_46,plain,
( quasi_total(X1,X2,X3)
| relation_dom_as_subset(X2,X3,X1) != X2
| X2 != esk13_0
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(rw,[status(thm)],[c_0_37,c_0_28]) ).
cnf(c_0_47,plain,
( relation_dom_as_subset(esk13_0,X1,X2) = esk13_0
| ~ relation_of2(X2,esk13_0,X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_48,plain,
( relation_of2(X1,X2,X3)
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_49,plain,
( X1 = esk13_0
| quasi_total(X2,X3,X1)
| relation_dom_as_subset(X3,X1,X2) != X3
| ~ relation_of2_as_subset(X2,X3,X1) ),
inference(rw,[status(thm)],[c_0_40,c_0_28]) ).
cnf(c_0_50,plain,
( X1 = relation_dom(X2)
| X3 = esk13_0
| ~ relation_of2(X2,X1,X3)
| ~ quasi_total(X2,X1,X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_51,negated_conjecture,
( esk2_0 != esk13_0
| ~ quasi_total(esk4_0,esk13_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_52,plain,
( quasi_total(X1,esk13_0,X2)
| ~ relation_of2_as_subset(X1,esk13_0,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).
cnf(c_0_53,negated_conjecture,
( relation_of2_as_subset(esk4_0,esk13_0,esk3_0)
| esk2_0 != esk13_0 ),
inference(spm,[status(thm)],[c_0_35,c_0_45]) ).
cnf(c_0_54,plain,
( X1 = esk13_0
| quasi_total(X2,X3,X1)
| relation_dom(X2) != X3
| ~ relation_of2_as_subset(X2,X3,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_41]),c_0_48]) ).
cnf(c_0_55,plain,
( X1 = relation_dom(X2)
| X3 = esk13_0
| ~ quasi_total(X2,X1,X3)
| ~ relation_of2_as_subset(X2,X1,X3) ),
inference(spm,[status(thm)],[c_0_50,c_0_48]) ).
cnf(c_0_56,negated_conjecture,
quasi_total(esk4_0,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_57,negated_conjecture,
esk2_0 != esk13_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]) ).
cnf(c_0_58,plain,
( X1 = esk13_0
| quasi_total(X2,relation_dom(X2),X1)
| ~ relation_of2_as_subset(X2,relation_dom(X2),X1) ),
inference(er,[status(thm)],[c_0_54]) ).
cnf(c_0_59,negated_conjecture,
relation_dom(esk4_0) = esk1_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_16])]),c_0_57]) ).
cnf(c_0_60,negated_conjecture,
( X1 = esk13_0
| quasi_total(esk4_0,esk1_0,X1)
| ~ relation_of2_as_subset(esk4_0,esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_61,negated_conjecture,
esk3_0 = esk13_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_60]),c_0_35])]) ).
cnf(c_0_62,negated_conjecture,
subset(esk2_0,esk13_0),
inference(rw,[status(thm)],[c_0_26,c_0_61]) ).
cnf(c_0_63,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_62]),c_0_57]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : SEU291+1 : TPTP v8.1.0. Released v3.3.0.
% 0.13/0.15 % Command : run_ET %s %d
% 0.14/0.37 % Computer : n007.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 600
% 0.14/0.37 % DateTime : Sun Jun 19 12:57:14 EDT 2022
% 0.14/0.37 % CPUTime :
% 0.26/1.46 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.26/1.46 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.26/1.46 # Preprocessing time : 0.018 s
% 0.26/1.46
% 0.26/1.46 # Proof found!
% 0.26/1.46 # SZS status Theorem
% 0.26/1.46 # SZS output start CNFRefutation
% See solution above
% 0.26/1.46 # Proof object total steps : 64
% 0.26/1.46 # Proof object clause steps : 43
% 0.26/1.46 # Proof object formula steps : 21
% 0.26/1.46 # Proof object conjectures : 22
% 0.26/1.46 # Proof object clause conjectures : 19
% 0.26/1.46 # Proof object formula conjectures : 3
% 0.26/1.46 # Proof object initial clauses used : 18
% 0.26/1.46 # Proof object initial formulas used : 10
% 0.26/1.46 # Proof object generating inferences : 17
% 0.26/1.46 # Proof object simplifying inferences : 22
% 0.26/1.46 # Training examples: 0 positive, 0 negative
% 0.26/1.46 # Parsed axioms : 52
% 0.26/1.46 # Removed by relevancy pruning/SinE : 21
% 0.26/1.46 # Initial clauses : 57
% 0.26/1.46 # Removed in clause preprocessing : 0
% 0.26/1.46 # Initial clauses in saturation : 57
% 0.26/1.46 # Processed clauses : 2018
% 0.26/1.46 # ...of these trivial : 24
% 0.26/1.46 # ...subsumed : 1258
% 0.26/1.46 # ...remaining for further processing : 736
% 0.26/1.46 # Other redundant clauses eliminated : 59
% 0.26/1.46 # Clauses deleted for lack of memory : 0
% 0.26/1.46 # Backward-subsumed : 73
% 0.26/1.46 # Backward-rewritten : 134
% 0.26/1.46 # Generated clauses : 9013
% 0.26/1.46 # ...of the previous two non-trivial : 6399
% 0.26/1.46 # Contextual simplify-reflections : 834
% 0.26/1.46 # Paramodulations : 8944
% 0.26/1.46 # Factorizations : 0
% 0.26/1.46 # Equation resolutions : 69
% 0.26/1.46 # Current number of processed clauses : 529
% 0.26/1.46 # Positive orientable unit clauses : 136
% 0.26/1.46 # Positive unorientable unit clauses: 0
% 0.26/1.46 # Negative unit clauses : 7
% 0.26/1.46 # Non-unit-clauses : 386
% 0.26/1.46 # Current number of unprocessed clauses: 3514
% 0.26/1.46 # ...number of literals in the above : 11821
% 0.26/1.46 # Current number of archived formulas : 0
% 0.26/1.46 # Current number of archived clauses : 207
% 0.26/1.46 # Clause-clause subsumption calls (NU) : 82839
% 0.26/1.46 # Rec. Clause-clause subsumption calls : 56062
% 0.26/1.46 # Non-unit clause-clause subsumptions : 1959
% 0.26/1.46 # Unit Clause-clause subsumption calls : 2089
% 0.26/1.46 # Rewrite failures with RHS unbound : 0
% 0.26/1.46 # BW rewrite match attempts : 1273
% 0.26/1.46 # BW rewrite match successes : 19
% 0.26/1.46 # Condensation attempts : 0
% 0.26/1.46 # Condensation successes : 0
% 0.26/1.46 # Termbank termtop insertions : 101544
% 0.26/1.46
% 0.26/1.46 # -------------------------------------------------
% 0.26/1.46 # User time : 0.223 s
% 0.26/1.46 # System time : 0.006 s
% 0.26/1.46 # Total time : 0.229 s
% 0.26/1.46 # Maximum resident set size: 8052 pages
%------------------------------------------------------------------------------