TSTP Solution File: SET062^7 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET062^7 : TPTP v8.2.0. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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 : 300s
% DateTime : Tue May 21 02:52:51 EDT 2024
% Result : Theorem 0.42s 0.52s
% Output : CNFRefutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 26
% Syntax : Number of formulae : 54 ( 25 unt; 15 typ; 0 def)
% Number of atoms : 121 ( 17 equ; 0 cnn)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 349 ( 53 ~; 43 |; 4 &; 241 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 70 ( 70 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 14 usr; 4 con; 0-3 aty)
% Number of variables : 77 ( 45 ^ 32 !; 0 ?; 77 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
mu: $tType ).
thf(decl_24,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_25,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_30,type,
mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_31,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_33,type,
mequiv: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_36,type,
exists_in_world: mu > $i > $o ).
thf(decl_37,type,
mforall_ind: ( mu > $i > $o ) > $i > $o ).
thf(decl_50,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_58,type,
member: mu > mu > $i > $o ).
thf(decl_59,type,
subset: mu > mu > $i > $o ).
thf(decl_68,type,
empty_set: mu ).
thf(decl_70,type,
esk2_3: $i > mu > mu > mu ).
thf(decl_73,type,
esk5_0: $i ).
thf(decl_74,type,
esk6_0: mu ).
thf(mand,axiom,
( mand
= ( ^ [X4: $i > $o,X5: $i > $o] : ( mnot @ ( mor @ ( mnot @ X4 ) @ ( mnot @ X5 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax',mand) ).
thf(mnot,axiom,
( mnot
= ( ^ [X4: $i > $o,X3: $i] :
~ ( X4 @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X4: $i > $o,X5: $i > $o,X3: $i] :
( ( X4 @ X3 )
| ( X5 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax',mor) ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X4: $i > $o,X5: $i > $o] : ( mor @ ( mnot @ X4 ) @ X5 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax',mimplies) ).
thf(mequiv,axiom,
( mequiv
= ( ^ [X4: $i > $o,X5: $i > $o] : ( mand @ ( mimplies @ X4 @ X5 ) @ ( mimplies @ X5 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax',mequiv) ).
thf(mforall_ind,axiom,
( mforall_ind
= ( ^ [X11: mu > $i > $o,X3: $i] :
! [X12: mu] :
( ( exists_in_world @ X12 @ X3 )
=> ( X11 @ X12 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax',mforall_ind) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X4: $i > $o] :
! [X3: $i] : ( X4 @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax',mvalid) ).
thf(subset,axiom,
( mvalid
@ ( mforall_ind
@ ^ [X28: mu] :
( mforall_ind
@ ^ [X29: mu] :
( mequiv @ ( subset @ X28 @ X29 )
@ ( mforall_ind
@ ^ [X31: mu] : ( mimplies @ ( member @ X31 @ X28 ) @ ( member @ X31 @ X29 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset) ).
thf(thI15,conjecture,
( mvalid
@ ( mforall_ind
@ ^ [X28: mu] : ( subset @ empty_set @ X28 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI15) ).
thf(empty_set,axiom,
( mvalid
@ ( mforall_ind
@ ^ [X35: mu] : ( mnot @ ( member @ X35 @ empty_set ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',empty_set) ).
thf(existence_of_empty_set_ax,axiom,
! [X7: $i] : ( exists_in_world @ empty_set @ X7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_of_empty_set_ax) ).
thf(c_0_11,plain,
( mand
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( Z0 @ Z2 )
| ~ ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand]) ).
thf(c_0_12,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_13,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_14,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_15,plain,
( mequiv
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) )
| ~ ( ~ ( Z1 @ Z2 )
| ( Z0 @ Z2 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[mequiv]) ).
thf(c_0_16,plain,
( mand
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( Z0 @ Z2 )
| ~ ( Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
thf(c_0_17,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_14,c_0_12]),c_0_13]) ).
thf(c_0_18,plain,
( mequiv
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) )
| ~ ( ~ ( Z1 @ Z2 )
| ( Z0 @ Z2 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
thf(c_0_19,plain,
( mforall_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
! [X12: mu] :
( ( exists_in_world @ X12 @ Z1 )
=> ( Z0 @ X12 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[mforall_ind]) ).
thf(c_0_20,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_21,plain,
! [X157: $i,X156: mu] :
( ( exists_in_world @ X156 @ X157 )
=> ! [X155: mu] :
( ( exists_in_world @ X155 @ X157 )
=> ~ ( ~ ( ~ ( subset @ X156 @ X155 @ X157 )
| ! [X154: mu] :
( ( exists_in_world @ X154 @ X157 )
=> ( ~ ( member @ X154 @ X156 @ X157 )
| ( member @ X154 @ X155 @ X157 ) ) ) )
| ~ ( ~ ! [X154: mu] :
( ( exists_in_world @ X154 @ X157 )
=> ( ~ ( member @ X154 @ X156 @ X157 )
| ( member @ X154 @ X155 @ X157 ) ) )
| ( subset @ X156 @ X155 @ X157 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[subset]),c_0_17]),c_0_18]),c_0_19]),c_0_20])]) ).
thf(c_0_22,negated_conjecture,
~ ! [X194: $i,X193: mu] :
( ( exists_in_world @ X193 @ X194 )
=> ( subset @ empty_set @ X193 @ X194 ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[thI15])]),c_0_19]),c_0_20]) ).
thf(c_0_23,plain,
! [X302: $i,X303: mu,X304: mu,X305: mu] :
( ( ~ ( subset @ X303 @ X304 @ X302 )
| ~ ( exists_in_world @ X305 @ X302 )
| ~ ( member @ X305 @ X303 @ X302 )
| ( member @ X305 @ X304 @ X302 )
| ~ ( exists_in_world @ X304 @ X302 )
| ~ ( exists_in_world @ X303 @ X302 ) )
& ( ( exists_in_world @ ( esk2_3 @ X302 @ X303 @ X304 ) @ X302 )
| ( subset @ X303 @ X304 @ X302 )
| ~ ( exists_in_world @ X304 @ X302 )
| ~ ( exists_in_world @ X303 @ X302 ) )
& ( ( member @ ( esk2_3 @ X302 @ X303 @ X304 ) @ X303 @ X302 )
| ( subset @ X303 @ X304 @ X302 )
| ~ ( exists_in_world @ X304 @ X302 )
| ~ ( exists_in_world @ X303 @ X302 ) )
& ( ~ ( member @ ( esk2_3 @ X302 @ X303 @ X304 ) @ X304 @ X302 )
| ( subset @ X303 @ X304 @ X302 )
| ~ ( exists_in_world @ X304 @ X302 )
| ~ ( exists_in_world @ X303 @ X302 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])])])])]) ).
thf(c_0_24,negated_conjecture,
( ( exists_in_world @ esk6_0 @ esk5_0 )
& ~ ( subset @ empty_set @ esk6_0 @ esk5_0 ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])])]) ).
thf(c_0_25,plain,
! [X173: $i,X172: mu] :
( ( exists_in_world @ X172 @ X173 )
=> ~ ( member @ X172 @ empty_set @ X173 ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[empty_set]),c_0_12]),c_0_19]),c_0_20])]) ).
thf(c_0_26,plain,
! [X12: mu,X10: mu,X3: $i] :
( ( member @ ( esk2_3 @ X3 @ X10 @ X12 ) @ X10 @ X3 )
| ( subset @ X10 @ X12 @ X3 )
| ~ ( exists_in_world @ X12 @ X3 )
| ~ ( exists_in_world @ X10 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_27,negated_conjecture,
exists_in_world @ esk6_0 @ esk5_0,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_28,plain,
! [X224: $i] : ( exists_in_world @ empty_set @ X224 ),
inference(variable_rename,[status(thm)],[existence_of_empty_set_ax]) ).
thf(c_0_29,plain,
! [X12: mu,X10: mu,X3: $i] :
( ( exists_in_world @ ( esk2_3 @ X3 @ X10 @ X12 ) @ X3 )
| ( subset @ X10 @ X12 @ X3 )
| ~ ( exists_in_world @ X12 @ X3 )
| ~ ( exists_in_world @ X10 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_30,plain,
! [X321: $i,X322: mu] :
( ~ ( exists_in_world @ X322 @ X321 )
| ~ ( member @ X322 @ empty_set @ X321 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])]) ).
thf(c_0_31,negated_conjecture,
! [X10: mu] :
( ( member @ ( esk2_3 @ esk5_0 @ X10 @ esk6_0 ) @ X10 @ esk5_0 )
| ( subset @ X10 @ esk6_0 @ esk5_0 )
| ~ ( exists_in_world @ X10 @ esk5_0 ) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
thf(c_0_32,plain,
! [X3: $i] : ( exists_in_world @ empty_set @ X3 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_33,negated_conjecture,
~ ( subset @ empty_set @ esk6_0 @ esk5_0 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_34,negated_conjecture,
! [X10: mu] :
( ( exists_in_world @ ( esk2_3 @ esk5_0 @ X10 @ esk6_0 ) @ esk5_0 )
| ( subset @ X10 @ esk6_0 @ esk5_0 )
| ~ ( exists_in_world @ X10 @ esk5_0 ) ),
inference(spm,[status(thm)],[c_0_29,c_0_27]) ).
thf(c_0_35,plain,
! [X10: mu,X3: $i] :
( ~ ( exists_in_world @ X10 @ X3 )
| ~ ( member @ X10 @ empty_set @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
thf(c_0_36,negated_conjecture,
member @ ( esk2_3 @ esk5_0 @ empty_set @ esk6_0 ) @ empty_set @ esk5_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
thf(c_0_37,negated_conjecture,
exists_in_world @ ( esk2_3 @ esk5_0 @ empty_set @ esk6_0 ) @ esk5_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_32]),c_0_33]) ).
thf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET062^7 : TPTP v8.2.0. Released v5.5.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.36 % Computer : n026.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Mon May 20 12:29:38 EDT 2024
% 0.13/0.36 % CPUTime :
% 0.23/0.48 Running higher-order theorem proving
% 0.23/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.42/0.52 # Version: 3.1.0-ho
% 0.42/0.52 # Preprocessing class: HSLSSMSSMLLNHSN.
% 0.42/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.42/0.52 # Starting almost_fo_3 with 1500s (5) cores
% 0.42/0.52 # Starting sh10 with 300s (1) cores
% 0.42/0.52 # Starting new_ho_16 with 300s (1) cores
% 0.42/0.52 # Starting post_as_ho11 with 300s (1) cores
% 0.42/0.52 # new_ho_16 with pid 28013 completed with status 8
% 0.42/0.52 # almost_fo_3 with pid 28011 completed with status 0
% 0.42/0.52 # Result found by almost_fo_3
% 0.42/0.52 # Preprocessing class: HSLSSMSSMLLNHSN.
% 0.42/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.42/0.52 # Starting almost_fo_3 with 1500s (5) cores
% 0.42/0.52 # No SInE strategy applied
% 0.42/0.52 # Search class: HGHNM-FFMF31-SHSSMFNN
% 0.42/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.42/0.52 # Starting new_ho_10 with 811s (1) cores
% 0.42/0.52 # Starting almost_fo_3 with 151s (1) cores
% 0.42/0.52 # Starting full_lambda_9 with 136s (1) cores
% 0.42/0.52 # Starting new_ho_14 with 136s (1) cores
% 0.42/0.52 # Starting pre_casc_4 with 136s (1) cores
% 0.42/0.52 # almost_fo_3 with pid 28022 completed with status 0
% 0.42/0.52 # Result found by almost_fo_3
% 0.42/0.52 # Preprocessing class: HSLSSMSSMLLNHSN.
% 0.42/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.42/0.52 # Starting almost_fo_3 with 1500s (5) cores
% 0.42/0.52 # No SInE strategy applied
% 0.42/0.52 # Search class: HGHNM-FFMF31-SHSSMFNN
% 0.42/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.42/0.52 # Starting new_ho_10 with 811s (1) cores
% 0.42/0.52 # Starting almost_fo_3 with 151s (1) cores
% 0.42/0.52 # Preprocessing time : 0.003 s
% 0.42/0.52 # Presaturation interreduction done
% 0.42/0.52
% 0.42/0.52 # Proof found!
% 0.42/0.52 # SZS status Theorem
% 0.42/0.52 # SZS output start CNFRefutation
% See solution above
% 0.42/0.52 # Parsed axioms : 126
% 0.42/0.52 # Removed by relevancy pruning/SinE : 0
% 0.42/0.52 # Initial clauses : 116
% 0.42/0.52 # Removed in clause preprocessing : 48
% 0.42/0.52 # Initial clauses in saturation : 68
% 0.42/0.52 # Processed clauses : 115
% 0.42/0.52 # ...of these trivial : 0
% 0.42/0.52 # ...subsumed : 1
% 0.42/0.52 # ...remaining for further processing : 114
% 0.42/0.52 # Other redundant clauses eliminated : 0
% 0.42/0.52 # Clauses deleted for lack of memory : 0
% 0.42/0.52 # Backward-subsumed : 0
% 0.42/0.52 # Backward-rewritten : 0
% 0.42/0.52 # Generated clauses : 67
% 0.42/0.52 # ...of the previous two non-redundant : 60
% 0.42/0.52 # ...aggressively subsumed : 0
% 0.42/0.52 # Contextual simplify-reflections : 0
% 0.42/0.52 # Paramodulations : 67
% 0.42/0.52 # Factorizations : 0
% 0.42/0.52 # NegExts : 0
% 0.42/0.52 # Equation resolutions : 0
% 0.42/0.52 # Disequality decompositions : 0
% 0.42/0.52 # Total rewrite steps : 15
% 0.42/0.52 # ...of those cached : 9
% 0.42/0.52 # Propositional unsat checks : 0
% 0.42/0.52 # Propositional check models : 0
% 0.42/0.52 # Propositional check unsatisfiable : 0
% 0.42/0.52 # Propositional clauses : 0
% 0.42/0.52 # Propositional clauses after purity: 0
% 0.42/0.52 # Propositional unsat core size : 0
% 0.42/0.52 # Propositional preprocessing time : 0.000
% 0.42/0.52 # Propositional encoding time : 0.000
% 0.42/0.52 # Propositional solver time : 0.000
% 0.42/0.52 # Success case prop preproc time : 0.000
% 0.42/0.52 # Success case prop encoding time : 0.000
% 0.42/0.52 # Success case prop solver time : 0.000
% 0.42/0.52 # Current number of processed clauses : 46
% 0.42/0.52 # Positive orientable unit clauses : 14
% 0.42/0.52 # Positive unorientable unit clauses: 0
% 0.42/0.52 # Negative unit clauses : 3
% 0.42/0.52 # Non-unit-clauses : 29
% 0.42/0.52 # Current number of unprocessed clauses: 81
% 0.42/0.52 # ...number of literals in the above : 300
% 0.42/0.52 # Current number of archived formulas : 0
% 0.42/0.52 # Current number of archived clauses : 68
% 0.42/0.52 # Clause-clause subsumption calls (NU) : 1884
% 0.42/0.52 # Rec. Clause-clause subsumption calls : 302
% 0.42/0.52 # Non-unit clause-clause subsumptions : 1
% 0.42/0.52 # Unit Clause-clause subsumption calls : 5
% 0.42/0.52 # Rewrite failures with RHS unbound : 0
% 0.42/0.52 # BW rewrite match attempts : 0
% 0.42/0.52 # BW rewrite match successes : 0
% 0.42/0.52 # Condensation attempts : 0
% 0.42/0.52 # Condensation successes : 0
% 0.42/0.52 # Termbank termtop insertions : 19622
% 0.42/0.52 # Search garbage collected termcells : 8197
% 0.42/0.52
% 0.42/0.52 # -------------------------------------------------
% 0.42/0.52 # User time : 0.025 s
% 0.42/0.52 # System time : 0.003 s
% 0.42/0.52 # Total time : 0.028 s
% 0.42/0.52 # Maximum resident set size: 3252 pages
% 0.42/0.52
% 0.42/0.52 # -------------------------------------------------
% 0.42/0.52 # User time : 0.071 s
% 0.42/0.52 # System time : 0.033 s
% 0.42/0.52 # Total time : 0.104 s
% 0.42/0.52 # Maximum resident set size: 1876 pages
% 0.42/0.52 % E---3.1 exiting
% 0.42/0.52 % E exiting
%------------------------------------------------------------------------------