TSTP Solution File: SEU975^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU975^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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 03:30:59 EDT 2024
% Result : Theorem 0.18s 0.48s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of formulae : 32 ( 7 unt; 12 typ; 0 def)
% Number of atoms : 90 ( 56 equ; 0 cnn)
% Maximal formula atoms : 25 ( 4 avg)
% Number of connectives : 544 ( 50 ~; 44 |; 41 &; 387 @)
% ( 4 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 36 ( 9 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 24 ( 24 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 11 usr; 4 con; 0-2 aty)
% Number of variables : 57 ( 0 ^ 53 !; 4 ?; 57 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_22,type,
cR: a > a ).
thf(decl_23,type,
cP: a > a > a ).
thf(decl_24,type,
cL: a > a ).
thf(decl_25,type,
cZ: a ).
thf(decl_26,type,
esk1_1: ( a > $o ) > a ).
thf(decl_27,type,
esk2_1: ( a > $o ) > a ).
thf(decl_28,type,
esk3_0: a ).
thf(decl_29,type,
esk4_0: a ).
thf(decl_30,type,
epred1_0: a > $o ).
thf(decl_31,type,
esk5_1: ( a > $o ) > a ).
thf(decl_32,type,
esk6_1: ( a > $o ) > a ).
thf(cPU_LEM2B_pme,conjecture,
( ( ( ( cL @ cZ )
= cZ )
& ( ( cR @ cZ )
= cZ )
& ! [X1: a,X2: a] :
( ( cL @ ( cP @ X1 @ X2 ) )
= X1 )
& ! [X1: a,X2: a] :
( ( cR @ ( cP @ X1 @ X2 ) )
= X2 )
& ! [X3: a] :
( ( X3 != cZ )
<=> ( X3
= ( cP @ ( cL @ X3 ) @ ( cR @ X3 ) ) ) )
& ! [X4: a > $o] :
( ! [X3: a,X5: a] :
( ( X4 @ ( cP @ X3 @ X5 ) )
=> ( ( ( X3 = cZ )
<=> ( X5 = cZ ) )
& ( X4 @ ( cP @ ( cL @ X3 ) @ ( cL @ X5 ) ) )
& ( X4 @ ( cP @ ( cR @ X3 ) @ ( cR @ X5 ) ) ) ) )
=> ! [X3: a,X5: a] :
( ( X4 @ ( cP @ X3 @ X5 ) )
=> ( X3 = X5 ) ) ) )
=> ! [X1: a,X2: a] :
( ? [X4: a > $o] :
( ( X4 @ ( cP @ X1 @ X2 ) )
& ! [X3: a,X5: a] :
( ( X4 @ ( cP @ X3 @ X5 ) )
=> ( ( ( X5 = cZ )
=> ( X3 = cZ ) )
& ( X4 @ ( cP @ ( cL @ X3 ) @ ( cL @ X5 ) ) )
& ( X4 @ ( cP @ ( cR @ X3 ) @ ( cR @ X5 ) ) ) ) ) )
=> ? [X4: a > $o] :
( ( X4 @ ( cP @ ( cL @ X1 ) @ ( cL @ X2 ) ) )
& ! [X3: a,X5: a] :
( ( X4 @ ( cP @ X3 @ X5 ) )
=> ( ( ( X5 = cZ )
=> ( X3 = cZ ) )
& ( X4 @ ( cP @ ( cL @ X3 ) @ ( cL @ X5 ) ) )
& ( X4 @ ( cP @ ( cR @ X3 ) @ ( cR @ X5 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cPU_LEM2B_pme) ).
thf(c_0_1,negated_conjecture,
~ ( ( ( ( cL @ cZ )
= cZ )
& ( ( cR @ cZ )
= cZ )
& ! [X1: a,X2: a] :
( ( cL @ ( cP @ X1 @ X2 ) )
= X1 )
& ! [X1: a,X2: a] :
( ( cR @ ( cP @ X1 @ X2 ) )
= X2 )
& ! [X3: a] :
( ( X3 != cZ )
<=> ( X3
= ( cP @ ( cL @ X3 ) @ ( cR @ X3 ) ) ) )
& ! [X4: a > $o] :
( ! [X3: a,X5: a] :
( ( X4 @ ( cP @ X3 @ X5 ) )
=> ( ( ( X3 = cZ )
<=> ( X5 = cZ ) )
& ( X4 @ ( cP @ ( cL @ X3 ) @ ( cL @ X5 ) ) )
& ( X4 @ ( cP @ ( cR @ X3 ) @ ( cR @ X5 ) ) ) ) )
=> ! [X3: a,X5: a] :
( ( X4 @ ( cP @ X3 @ X5 ) )
=> ( X3 = X5 ) ) ) )
=> ! [X1: a,X2: a] :
( ? [X4: a > $o] :
( ( X4 @ ( cP @ X1 @ X2 ) )
& ! [X3: a,X5: a] :
( ( X4 @ ( cP @ X3 @ X5 ) )
=> ( ( ( X5 = cZ )
=> ( X3 = cZ ) )
& ( X4 @ ( cP @ ( cL @ X3 ) @ ( cL @ X5 ) ) )
& ( X4 @ ( cP @ ( cR @ X3 ) @ ( cR @ X5 ) ) ) ) ) )
=> ? [X4: a > $o] :
( ( X4 @ ( cP @ ( cL @ X1 ) @ ( cL @ X2 ) ) )
& ! [X3: a,X5: a] :
( ( X4 @ ( cP @ X3 @ X5 ) )
=> ( ( ( X5 = cZ )
=> ( X3 = cZ ) )
& ( X4 @ ( cP @ ( cL @ X3 ) @ ( cL @ X5 ) ) )
& ( X4 @ ( cP @ ( cR @ X3 ) @ ( cR @ X5 ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cPU_LEM2B_pme])]) ).
thf(c_0_2,negated_conjecture,
! [X24: a,X25: a,X26: a,X27: a,X28: a,X29: a > $o,X32: a,X33: a,X37: a,X38: a,X39: a > $o] :
( ( ( cL @ cZ )
= cZ )
& ( ( cR @ cZ )
= cZ )
& ( ( cL @ ( cP @ X24 @ X25 ) )
= X24 )
& ( ( cR @ ( cP @ X26 @ X27 ) )
= X27 )
& ( ( X28 = cZ )
| ( X28
= ( cP @ ( cL @ X28 ) @ ( cR @ X28 ) ) ) )
& ( ( X28
!= ( cP @ ( cL @ X28 ) @ ( cR @ X28 ) ) )
| ( X28 != cZ ) )
& ( ( X29 @ ( cP @ ( esk1_1 @ X29 ) @ ( esk2_1 @ X29 ) ) )
| ~ ( X29 @ ( cP @ X32 @ X33 ) )
| ( X32 = X33 ) )
& ( ( ( esk1_1 @ X29 )
!= cZ )
| ( ( esk2_1 @ X29 )
!= cZ )
| ~ ( X29 @ ( cP @ ( cL @ ( esk1_1 @ X29 ) ) @ ( cL @ ( esk2_1 @ X29 ) ) ) )
| ~ ( X29 @ ( cP @ ( cR @ ( esk1_1 @ X29 ) ) @ ( cR @ ( esk2_1 @ X29 ) ) ) )
| ~ ( X29 @ ( cP @ X32 @ X33 ) )
| ( X32 = X33 ) )
& ( ( ( esk1_1 @ X29 )
= cZ )
| ( ( esk2_1 @ X29 )
= cZ )
| ~ ( X29 @ ( cP @ ( cL @ ( esk1_1 @ X29 ) ) @ ( cL @ ( esk2_1 @ X29 ) ) ) )
| ~ ( X29 @ ( cP @ ( cR @ ( esk1_1 @ X29 ) ) @ ( cR @ ( esk2_1 @ X29 ) ) ) )
| ~ ( X29 @ ( cP @ X32 @ X33 ) )
| ( X32 = X33 ) )
& ( epred1_0 @ ( cP @ esk3_0 @ esk4_0 ) )
& ( ( X38 != cZ )
| ( X37 = cZ )
| ~ ( epred1_0 @ ( cP @ X37 @ X38 ) ) )
& ( ( epred1_0 @ ( cP @ ( cL @ X37 ) @ ( cL @ X38 ) ) )
| ~ ( epred1_0 @ ( cP @ X37 @ X38 ) ) )
& ( ( epred1_0 @ ( cP @ ( cR @ X37 ) @ ( cR @ X38 ) ) )
| ~ ( epred1_0 @ ( cP @ X37 @ X38 ) ) )
& ( ( X39 @ ( cP @ ( esk5_1 @ X39 ) @ ( esk6_1 @ X39 ) ) )
| ~ ( X39 @ ( cP @ ( cL @ esk3_0 ) @ ( cL @ esk4_0 ) ) ) )
& ( ( ( esk6_1 @ X39 )
= cZ )
| ~ ( X39 @ ( cP @ ( cL @ ( esk5_1 @ X39 ) ) @ ( cL @ ( esk6_1 @ X39 ) ) ) )
| ~ ( X39 @ ( cP @ ( cR @ ( esk5_1 @ X39 ) ) @ ( cR @ ( esk6_1 @ X39 ) ) ) )
| ~ ( X39 @ ( cP @ ( cL @ esk3_0 ) @ ( cL @ esk4_0 ) ) ) )
& ( ( ( esk5_1 @ X39 )
!= cZ )
| ~ ( X39 @ ( cP @ ( cL @ ( esk5_1 @ X39 ) ) @ ( cL @ ( esk6_1 @ X39 ) ) ) )
| ~ ( X39 @ ( cP @ ( cR @ ( esk5_1 @ X39 ) ) @ ( cR @ ( esk6_1 @ X39 ) ) ) )
| ~ ( X39 @ ( cP @ ( cL @ esk3_0 ) @ ( cL @ esk4_0 ) ) ) ) ),
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_1])])])])])]) ).
thf(c_0_3,negated_conjecture,
! [X4: a > $o] :
( ( ( esk6_1 @ X4 )
= cZ )
| ~ ( X4 @ ( cP @ ( cL @ ( esk5_1 @ X4 ) ) @ ( cL @ ( esk6_1 @ X4 ) ) ) )
| ~ ( X4 @ ( cP @ ( cR @ ( esk5_1 @ X4 ) ) @ ( cR @ ( esk6_1 @ X4 ) ) ) )
| ~ ( X4 @ ( cP @ ( cL @ esk3_0 ) @ ( cL @ esk4_0 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X1: a,X2: a] :
( ( epred1_0 @ ( cP @ ( cR @ X1 ) @ ( cR @ X2 ) ) )
| ~ ( epred1_0 @ ( cP @ X1 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X4: a > $o] :
( ( X4 @ ( cP @ ( esk5_1 @ X4 ) @ ( esk6_1 @ X4 ) ) )
| ~ ( X4 @ ( cP @ ( cL @ esk3_0 ) @ ( cL @ esk4_0 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
( ( ( esk6_1 @ epred1_0 )
= cZ )
| ~ ( epred1_0 @ ( cP @ ( cL @ ( esk5_1 @ epred1_0 ) ) @ ( cL @ ( esk6_1 @ epred1_0 ) ) ) )
| ~ ( epred1_0 @ ( cP @ ( cL @ esk3_0 ) @ ( cL @ esk4_0 ) ) ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_5]) ).
thf(c_0_7,negated_conjecture,
! [X1: a,X2: a] :
( ( epred1_0 @ ( cP @ ( cL @ X1 ) @ ( cL @ X2 ) ) )
| ~ ( epred1_0 @ ( cP @ X1 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
! [X4: a > $o] :
( ( ( esk5_1 @ X4 )
!= cZ )
| ~ ( X4 @ ( cP @ ( cL @ ( esk5_1 @ X4 ) ) @ ( cL @ ( esk6_1 @ X4 ) ) ) )
| ~ ( X4 @ ( cP @ ( cR @ ( esk5_1 @ X4 ) ) @ ( cR @ ( esk6_1 @ X4 ) ) ) )
| ~ ( X4 @ ( cP @ ( cL @ esk3_0 ) @ ( cL @ esk4_0 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_9,negated_conjecture,
( ( ( esk6_1 @ epred1_0 )
= cZ )
| ~ ( epred1_0 @ ( cP @ ( cL @ esk3_0 ) @ ( cL @ esk4_0 ) ) ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_5]) ).
thf(c_0_10,negated_conjecture,
epred1_0 @ ( cP @ esk3_0 @ esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_11,negated_conjecture,
( ( ( esk5_1 @ epred1_0 )
!= cZ )
| ~ ( epred1_0 @ ( cP @ ( cL @ ( esk5_1 @ epred1_0 ) ) @ ( cL @ ( esk6_1 @ epred1_0 ) ) ) )
| ~ ( epred1_0 @ ( cP @ ( cL @ esk3_0 ) @ ( cL @ esk4_0 ) ) ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_4]),c_0_5]) ).
thf(c_0_12,negated_conjecture,
! [X2: a,X1: a] :
( ( X2 = cZ )
| ( X1 != cZ )
| ~ ( epred1_0 @ ( cP @ X2 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_13,negated_conjecture,
( ( esk6_1 @ epred1_0 )
= cZ ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_7]),c_0_10])]) ).
thf(c_0_14,negated_conjecture,
( ( ( esk5_1 @ epred1_0 )
!= cZ )
| ~ ( epred1_0 @ ( cP @ ( cL @ esk3_0 ) @ ( cL @ esk4_0 ) ) ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_7]),c_0_5]) ).
thf(c_0_15,negated_conjecture,
! [X1: a] :
( ( X1 = cZ )
| ~ ( epred1_0 @ ( cP @ X1 @ cZ ) ) ),
inference(er,[status(thm)],[c_0_12]) ).
thf(c_0_16,negated_conjecture,
( ( epred1_0 @ ( cP @ ( esk5_1 @ epred1_0 ) @ cZ ) )
| ~ ( epred1_0 @ ( cP @ ( cL @ esk3_0 ) @ ( cL @ esk4_0 ) ) ) ),
inference(spm,[status(thm)],[c_0_5,c_0_13]) ).
thf(c_0_17,negated_conjecture,
( ( esk5_1 @ epred1_0 )
!= cZ ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_7]),c_0_10])]) ).
thf(c_0_18,negated_conjecture,
~ ( epred1_0 @ ( cP @ ( cL @ esk3_0 ) @ ( cL @ esk4_0 ) ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
thf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_7]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU975^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n005.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Sun May 19 15:51:37 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.18/0.46 Running higher-order theorem proving
% 0.18/0.46 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.18/0.48 # Version: 3.1.0-ho
% 0.18/0.48 # Preprocessing class: HSMSSMSSSSSNSSA.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting post_as_ho1 with 1500s (5) cores
% 0.18/0.48 # Starting post_as_ho12 with 300s (1) cores
% 0.18/0.48 # Starting new_ho_3 with 300s (1) cores
% 0.18/0.48 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.18/0.48 # post_as_ho1 with pid 25303 completed with status 0
% 0.18/0.48 # Result found by post_as_ho1
% 0.18/0.48 # Preprocessing class: HSMSSMSSSSSNSSA.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting post_as_ho1 with 1500s (5) cores
% 0.18/0.48 # No SInE strategy applied
% 0.18/0.48 # Search class: HGHSS-FFMS21-MSSFFSBN
% 0.18/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.48 # Starting new_ho_10 with 541s (1) cores
% 0.18/0.48 # Starting post_as_ho1 with 151s (1) cores
% 0.18/0.48 # Starting new_bool_1 with 203s (1) cores
% 0.18/0.48 # Starting new_bool_2 with 203s (1) cores
% 0.18/0.48 # Starting new_bool_9 with 203s (1) cores
% 0.18/0.48 # post_as_ho1 with pid 25309 completed with status 0
% 0.18/0.48 # Result found by post_as_ho1
% 0.18/0.48 # Preprocessing class: HSMSSMSSSSSNSSA.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting post_as_ho1 with 1500s (5) cores
% 0.18/0.48 # No SInE strategy applied
% 0.18/0.48 # Search class: HGHSS-FFMS21-MSSFFSBN
% 0.18/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.48 # Starting new_ho_10 with 541s (1) cores
% 0.18/0.48 # Starting post_as_ho1 with 151s (1) cores
% 0.18/0.48 # Preprocessing time : 0.001 s
% 0.18/0.48 # Presaturation interreduction done
% 0.18/0.48
% 0.18/0.48 # Proof found!
% 0.18/0.48 # SZS status Theorem
% 0.18/0.48 # SZS output start CNFRefutation
% See solution above
% 0.18/0.48 # Parsed axioms : 6
% 0.18/0.48 # Removed by relevancy pruning/SinE : 0
% 0.18/0.48 # Initial clauses : 21
% 0.18/0.48 # Removed in clause preprocessing : 5
% 0.18/0.48 # Initial clauses in saturation : 16
% 0.18/0.48 # Processed clauses : 52
% 0.18/0.48 # ...of these trivial : 0
% 0.18/0.48 # ...subsumed : 3
% 0.18/0.48 # ...remaining for further processing : 49
% 0.18/0.48 # Other redundant clauses eliminated : 2
% 0.18/0.48 # Clauses deleted for lack of memory : 0
% 0.18/0.48 # Backward-subsumed : 6
% 0.18/0.48 # Backward-rewritten : 1
% 0.18/0.48 # Generated clauses : 54
% 0.18/0.48 # ...of the previous two non-redundant : 50
% 0.18/0.48 # ...aggressively subsumed : 0
% 0.18/0.48 # Contextual simplify-reflections : 7
% 0.18/0.48 # Paramodulations : 52
% 0.18/0.48 # Factorizations : 0
% 0.18/0.48 # NegExts : 0
% 0.18/0.48 # Equation resolutions : 2
% 0.18/0.48 # Disequality decompositions : 0
% 0.18/0.48 # Total rewrite steps : 14
% 0.18/0.48 # ...of those cached : 8
% 0.18/0.48 # Propositional unsat checks : 0
% 0.18/0.48 # Propositional check models : 0
% 0.18/0.48 # Propositional check unsatisfiable : 0
% 0.18/0.48 # Propositional clauses : 0
% 0.18/0.48 # Propositional clauses after purity: 0
% 0.18/0.48 # Propositional unsat core size : 0
% 0.18/0.48 # Propositional preprocessing time : 0.000
% 0.18/0.48 # Propositional encoding time : 0.000
% 0.18/0.48 # Propositional solver time : 0.000
% 0.18/0.48 # Success case prop preproc time : 0.000
% 0.18/0.48 # Success case prop encoding time : 0.000
% 0.18/0.48 # Success case prop solver time : 0.000
% 0.18/0.48 # Current number of processed clauses : 24
% 0.18/0.48 # Positive orientable unit clauses : 6
% 0.18/0.48 # Positive unorientable unit clauses: 0
% 0.18/0.48 # Negative unit clauses : 3
% 0.18/0.48 # Non-unit-clauses : 15
% 0.18/0.48 # Current number of unprocessed clauses: 30
% 0.18/0.48 # ...number of literals in the above : 102
% 0.18/0.48 # Current number of archived formulas : 0
% 0.18/0.48 # Current number of archived clauses : 23
% 0.18/0.48 # Clause-clause subsumption calls (NU) : 103
% 0.18/0.48 # Rec. Clause-clause subsumption calls : 49
% 0.18/0.48 # Non-unit clause-clause subsumptions : 11
% 0.18/0.48 # Unit Clause-clause subsumption calls : 15
% 0.18/0.48 # Rewrite failures with RHS unbound : 0
% 0.18/0.48 # BW rewrite match attempts : 1
% 0.18/0.48 # BW rewrite match successes : 1
% 0.18/0.48 # Condensation attempts : 0
% 0.18/0.48 # Condensation successes : 0
% 0.18/0.48 # Termbank termtop insertions : 3298
% 0.18/0.48 # Search garbage collected termcells : 626
% 0.18/0.48
% 0.18/0.48 # -------------------------------------------------
% 0.18/0.48 # User time : 0.006 s
% 0.18/0.48 # System time : 0.003 s
% 0.18/0.48 # Total time : 0.009 s
% 0.18/0.48 # Maximum resident set size: 1904 pages
% 0.18/0.48
% 0.18/0.48 # -------------------------------------------------
% 0.18/0.48 # User time : 0.029 s
% 0.18/0.48 # System time : 0.007 s
% 0.18/0.48 # Total time : 0.036 s
% 0.18/0.48 # Maximum resident set size: 1724 pages
% 0.18/0.48 % E---3.1 exiting
% 0.18/0.48 % E exiting
%------------------------------------------------------------------------------