TSTP Solution File: SET926^7 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET926^7 : TPTP v8.2.0. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% 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 : 300s
% DateTime : Tue May 21 02:56:34 EDT 2024
% Result : Theorem 0.17s 0.47s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 27
% Syntax : Number of formulae : 51 ( 23 unt; 17 typ; 0 def)
% Number of atoms : 114 ( 17 equ; 0 cnn)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 371 ( 52 ~; 37 |; 5 &; 269 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 70 ( 70 >; 0 *; 0 +; 0 <<)
% Number of symbols : 18 ( 16 usr; 5 con; 0-3 aty)
% Number of variables : 71 ( 46 ^ 25 !; 0 ?; 71 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
mu: $tType ).
thf(decl_22,type,
qmltpeq: mu > mu > $i > $o ).
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_57,type,
in: mu > mu > $i > $o ).
thf(decl_59,type,
empty_set: mu ).
thf(decl_60,type,
singleton: mu > mu ).
thf(decl_61,type,
set_difference: mu > mu > mu ).
thf(decl_65,type,
esk4_0: $i ).
thf(decl_66,type,
esk5_0: mu ).
thf(decl_67,type,
esk6_0: mu ).
thf(mand,axiom,
( mand
= ( ^ [X4: $i > $o,X5: $i > $o] : ( mnot @ ( mor @ ( mnot @ X4 ) @ ( mnot @ X5 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax',mand) ).
thf(mnot,axiom,
( mnot
= ( ^ [X4: $i > $o,X3: $i] :
~ ( X4 @ X3 ) ) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/LCL015^0.ax',mor) ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X4: $i > $o,X5: $i > $o] : ( mor @ ( mnot @ X4 ) @ X5 ) ) ),
file('/export/starexec/sandbox/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/sandbox/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/sandbox/benchmark/Axioms/LCL015^0.ax',mforall_ind) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X4: $i > $o] :
! [X3: $i] : ( X4 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax',mvalid) ).
thf(t69_zfmisc_1,conjecture,
( mvalid
@ ( mforall_ind
@ ^ [X28: mu] :
( mforall_ind
@ ^ [X29: mu] : ( mor @ ( qmltpeq @ ( set_difference @ ( singleton @ X28 ) @ X29 ) @ empty_set ) @ ( qmltpeq @ ( set_difference @ ( singleton @ X28 ) @ X29 ) @ ( singleton @ X28 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t69_zfmisc_1) ).
thf(l34_zfmisc_1,axiom,
( mvalid
@ ( mforall_ind
@ ^ [X28: mu] :
( mforall_ind
@ ^ [X29: mu] : ( mequiv @ ( qmltpeq @ ( set_difference @ ( singleton @ X28 ) @ X29 ) @ ( singleton @ X28 ) ) @ ( mnot @ ( in @ X28 @ X29 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l34_zfmisc_1) ).
thf(l36_zfmisc_1,axiom,
( mvalid
@ ( mforall_ind
@ ^ [X28: mu] :
( mforall_ind
@ ^ [X29: mu] : ( mequiv @ ( qmltpeq @ ( set_difference @ ( singleton @ X28 ) @ X29 ) @ empty_set ) @ ( in @ X28 @ X29 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l36_zfmisc_1) ).
thf(c_0_10,plain,
( mand
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( Z0 @ Z2 )
| ~ ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand]) ).
thf(c_0_11,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_12,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_13,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_14,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_15,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_10,c_0_11]),c_0_12]) ).
thf(c_0_16,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_13,c_0_11]),c_0_12]) ).
thf(c_0_17,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_18,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_19,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_14,c_0_15]),c_0_16]) ).
thf(c_0_20,negated_conjecture,
~ ! [X97: $i,X96: mu] :
( ( exists_in_world @ X96 @ X97 )
=> ! [X95: mu] :
( ( exists_in_world @ X95 @ X97 )
=> ( ( qmltpeq @ ( set_difference @ ( singleton @ X96 ) @ X95 ) @ empty_set @ X97 )
| ( qmltpeq @ ( set_difference @ ( singleton @ X96 ) @ X95 ) @ ( singleton @ X96 ) @ X97 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t69_zfmisc_1])]),c_0_12]),c_0_17]),c_0_18]) ).
thf(c_0_21,plain,
! [X87: $i,X86: mu] :
( ( exists_in_world @ X86 @ X87 )
=> ! [X85: mu] :
( ( exists_in_world @ X85 @ X87 )
=> ~ ( ~ ( ~ ( qmltpeq @ ( set_difference @ ( singleton @ X86 ) @ X85 ) @ ( singleton @ X86 ) @ X87 )
| ~ ( in @ X86 @ X85 @ X87 ) )
| ~ ( ( in @ X86 @ X85 @ X87 )
| ( qmltpeq @ ( set_difference @ ( singleton @ X86 ) @ X85 ) @ ( singleton @ X86 ) @ X87 ) ) ) ) ),
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)],[l34_zfmisc_1]),c_0_11]),c_0_19]),c_0_17]),c_0_18])]) ).
thf(c_0_22,plain,
! [X90: $i,X89: mu] :
( ( exists_in_world @ X89 @ X90 )
=> ! [X88: mu] :
( ( exists_in_world @ X88 @ X90 )
=> ~ ( ~ ( ~ ( qmltpeq @ ( set_difference @ ( singleton @ X89 ) @ X88 ) @ empty_set @ X90 )
| ( in @ X89 @ X88 @ X90 ) )
| ~ ( ~ ( in @ X89 @ X88 @ X90 )
| ( qmltpeq @ ( set_difference @ ( singleton @ X89 ) @ X88 ) @ empty_set @ X90 ) ) ) ) ),
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)],[l36_zfmisc_1]),c_0_19]),c_0_17]),c_0_18])]) ).
thf(c_0_23,negated_conjecture,
( ( exists_in_world @ esk5_0 @ esk4_0 )
& ( exists_in_world @ esk6_0 @ esk4_0 )
& ~ ( qmltpeq @ ( set_difference @ ( singleton @ esk5_0 ) @ esk6_0 ) @ empty_set @ esk4_0 )
& ~ ( qmltpeq @ ( set_difference @ ( singleton @ esk5_0 ) @ esk6_0 ) @ ( singleton @ esk5_0 ) @ esk4_0 ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])]) ).
thf(c_0_24,plain,
! [X148: $i,X149: mu,X150: mu] :
( ( ~ ( qmltpeq @ ( set_difference @ ( singleton @ X149 ) @ X150 ) @ ( singleton @ X149 ) @ X148 )
| ~ ( in @ X149 @ X150 @ X148 )
| ~ ( exists_in_world @ X150 @ X148 )
| ~ ( exists_in_world @ X149 @ X148 ) )
& ( ( in @ X149 @ X150 @ X148 )
| ( qmltpeq @ ( set_difference @ ( singleton @ X149 ) @ X150 ) @ ( singleton @ X149 ) @ X148 )
| ~ ( exists_in_world @ X150 @ X148 )
| ~ ( exists_in_world @ X149 @ X148 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])])])]) ).
thf(c_0_25,plain,
! [X151: $i,X152: mu,X153: mu] :
( ( ~ ( qmltpeq @ ( set_difference @ ( singleton @ X152 ) @ X153 ) @ empty_set @ X151 )
| ( in @ X152 @ X153 @ X151 )
| ~ ( exists_in_world @ X153 @ X151 )
| ~ ( exists_in_world @ X152 @ X151 ) )
& ( ~ ( in @ X152 @ X153 @ X151 )
| ( qmltpeq @ ( set_difference @ ( singleton @ X152 ) @ X153 ) @ empty_set @ X151 )
| ~ ( exists_in_world @ X153 @ X151 )
| ~ ( exists_in_world @ X152 @ X151 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])])])]) ).
thf(c_0_26,negated_conjecture,
~ ( qmltpeq @ ( set_difference @ ( singleton @ esk5_0 ) @ esk6_0 ) @ ( singleton @ esk5_0 ) @ esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_27,plain,
! [X12: mu,X10: mu,X3: $i] :
( ( in @ X10 @ X12 @ X3 )
| ( qmltpeq @ ( set_difference @ ( singleton @ X10 ) @ X12 ) @ ( singleton @ X10 ) @ X3 )
| ~ ( exists_in_world @ X12 @ X3 )
| ~ ( exists_in_world @ X10 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_28,negated_conjecture,
exists_in_world @ esk6_0 @ esk4_0,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_29,negated_conjecture,
exists_in_world @ esk5_0 @ esk4_0,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_30,negated_conjecture,
~ ( qmltpeq @ ( set_difference @ ( singleton @ esk5_0 ) @ esk6_0 ) @ empty_set @ esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_31,plain,
! [X12: mu,X10: mu,X3: $i] :
( ( qmltpeq @ ( set_difference @ ( singleton @ X10 ) @ X12 ) @ empty_set @ X3 )
| ~ ( in @ X10 @ X12 @ X3 )
| ~ ( exists_in_world @ X12 @ X3 )
| ~ ( exists_in_world @ X10 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
thf(c_0_32,negated_conjecture,
in @ esk5_0 @ esk6_0 @ esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29])]) ).
thf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_28]),c_0_29])]),c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET926^7 : TPTP v8.2.0. Released v5.5.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n015.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon May 20 13:29:38 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running higher-order theorem proving
% 0.17/0.44 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.17/0.47 # Version: 3.1.0-ho
% 0.17/0.47 # Preprocessing class: HSMSSMSSMLLNHSN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.17/0.47 # Starting post_as_ho3 with 300s (1) cores
% 0.17/0.47 # Starting new_ho_12 with 300s (1) cores
% 0.17/0.47 # Starting new_bool_2 with 300s (1) cores
% 0.17/0.47 # post_as_ho3 with pid 27241 completed with status 0
% 0.17/0.47 # Result found by post_as_ho3
% 0.17/0.47 # Preprocessing class: HSMSSMSSMLLNHSN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.17/0.47 # Starting post_as_ho3 with 300s (1) cores
% 0.17/0.47 # No SInE strategy applied
% 0.17/0.47 # Search class: HGHNM-FFMF21-SHSSMFNN
% 0.17/0.47 # partial match(1): HGHNM-FFMF31-SHSSMFNN
% 0.17/0.47 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.47 # Starting new_ho_10 with 163s (1) cores
% 0.17/0.47 # new_ho_10 with pid 27246 completed with status 0
% 0.17/0.47 # Result found by new_ho_10
% 0.17/0.47 # Preprocessing class: HSMSSMSSMLLNHSN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.17/0.47 # Starting post_as_ho3 with 300s (1) cores
% 0.17/0.47 # No SInE strategy applied
% 0.17/0.47 # Search class: HGHNM-FFMF21-SHSSMFNN
% 0.17/0.47 # partial match(1): HGHNM-FFMF31-SHSSMFNN
% 0.17/0.47 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.47 # Starting new_ho_10 with 163s (1) cores
% 0.17/0.47 # Preprocessing time : 0.004 s
% 0.17/0.47 # Presaturation interreduction done
% 0.17/0.47
% 0.17/0.47 # Proof found!
% 0.17/0.47 # SZS status Theorem
% 0.17/0.47 # SZS output start CNFRefutation
% See solution above
% 0.17/0.47 # Parsed axioms : 96
% 0.17/0.47 # Removed by relevancy pruning/SinE : 0
% 0.17/0.47 # Initial clauses : 71
% 0.17/0.47 # Removed in clause preprocessing : 41
% 0.17/0.47 # Initial clauses in saturation : 30
% 0.17/0.47 # Processed clauses : 59
% 0.17/0.47 # ...of these trivial : 0
% 0.17/0.47 # ...subsumed : 0
% 0.17/0.47 # ...remaining for further processing : 58
% 0.17/0.47 # Other redundant clauses eliminated : 0
% 0.17/0.47 # Clauses deleted for lack of memory : 0
% 0.17/0.47 # Backward-subsumed : 0
% 0.17/0.47 # Backward-rewritten : 0
% 0.17/0.47 # Generated clauses : 22
% 0.17/0.47 # ...of the previous two non-redundant : 15
% 0.17/0.47 # ...aggressively subsumed : 0
% 0.17/0.47 # Contextual simplify-reflections : 0
% 0.17/0.47 # Paramodulations : 22
% 0.17/0.47 # Factorizations : 0
% 0.17/0.47 # NegExts : 0
% 0.17/0.47 # Equation resolutions : 0
% 0.17/0.47 # Disequality decompositions : 0
% 0.17/0.47 # Total rewrite steps : 32
% 0.17/0.47 # ...of those cached : 18
% 0.17/0.47 # Propositional unsat checks : 0
% 0.17/0.47 # Propositional check models : 0
% 0.17/0.47 # Propositional check unsatisfiable : 0
% 0.17/0.47 # Propositional clauses : 0
% 0.17/0.47 # Propositional clauses after purity: 0
% 0.17/0.47 # Propositional unsat core size : 0
% 0.17/0.47 # Propositional preprocessing time : 0.000
% 0.17/0.47 # Propositional encoding time : 0.000
% 0.17/0.47 # Propositional solver time : 0.000
% 0.17/0.47 # Success case prop preproc time : 0.000
% 0.17/0.47 # Success case prop encoding time : 0.000
% 0.17/0.47 # Success case prop solver time : 0.000
% 0.17/0.47 # Current number of processed clauses : 28
% 0.17/0.47 # Positive orientable unit clauses : 12
% 0.17/0.47 # Positive unorientable unit clauses: 0
% 0.17/0.47 # Negative unit clauses : 3
% 0.17/0.47 # Non-unit-clauses : 13
% 0.17/0.47 # Current number of unprocessed clauses: 16
% 0.17/0.47 # ...number of literals in the above : 78
% 0.17/0.47 # Current number of archived formulas : 0
% 0.17/0.47 # Current number of archived clauses : 30
% 0.17/0.47 # Clause-clause subsumption calls (NU) : 145
% 0.17/0.47 # Rec. Clause-clause subsumption calls : 56
% 0.17/0.47 # Non-unit clause-clause subsumptions : 0
% 0.17/0.47 # Unit Clause-clause subsumption calls : 4
% 0.17/0.47 # Rewrite failures with RHS unbound : 0
% 0.17/0.47 # BW rewrite match attempts : 0
% 0.17/0.47 # BW rewrite match successes : 0
% 0.17/0.47 # Condensation attempts : 59
% 0.17/0.47 # Condensation successes : 0
% 0.17/0.47 # Termbank termtop insertions : 8480
% 0.17/0.47 # Search garbage collected termcells : 2996
% 0.17/0.47
% 0.17/0.47 # -------------------------------------------------
% 0.17/0.47 # User time : 0.009 s
% 0.17/0.47 # System time : 0.007 s
% 0.17/0.47 # Total time : 0.016 s
% 0.17/0.47 # Maximum resident set size: 2376 pages
% 0.17/0.47
% 0.17/0.47 # -------------------------------------------------
% 0.17/0.47 # User time : 0.011 s
% 0.17/0.47 # System time : 0.009 s
% 0.17/0.47 # Total time : 0.020 s
% 0.17/0.47 # Maximum resident set size: 1828 pages
% 0.17/0.47 % E---3.1 exiting
% 0.17/0.47 % E exiting
%------------------------------------------------------------------------------