TSTP Solution File: SWC384+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC384+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 04:26:13 EDT 2024
% Result : Theorem 0.22s 0.55s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 50 ( 19 unt; 0 def)
% Number of atoms : 220 ( 67 equ)
% Maximal formula atoms : 45 ( 4 avg)
% Number of connectives : 264 ( 94 ~; 99 |; 42 &)
% ( 4 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 8 con; 0-2 aty)
% Number of variables : 59 ( 0 sgn 37 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ( ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ssList(X7)
=> ( cons(X5,nil) != X3
| app(app(X6,X3),X7) != X4
| ? [X8] :
( ssItem(X8)
& memberP(X6,X8)
& lt(X5,X8) )
| ? [X9] :
( ssItem(X9)
& memberP(X7,X9)
& lt(X9,X5) ) ) ) ) )
& ( nil != X4
| nil != X3 ) )
| ( singletonP(X1)
& segmentP(X2,X1) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax18) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax4,axiom,
! [X1] :
( ssList(X1)
=> ( singletonP(X1)
<=> ? [X2] :
( ssItem(X2)
& cons(X2,nil) = X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax4) ).
fof(ax7,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ( ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ssList(X7)
=> ( cons(X5,nil) != X3
| app(app(X6,X3),X7) != X4
| ? [X8] :
( ssItem(X8)
& memberP(X6,X8)
& lt(X5,X8) )
| ? [X9] :
( ssItem(X9)
& memberP(X7,X9)
& lt(X9,X5) ) ) ) ) )
& ( nil != X4
| nil != X3 ) )
| ( singletonP(X1)
& segmentP(X2,X1) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_7,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
inference(fof_simplification,[status(thm)],[ax18]) ).
fof(c_0_8,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
fof(c_0_9,negated_conjecture,
! [X17,X18] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& neq(esk2_0,nil)
& ( nil = esk4_0
| ssItem(esk5_0) )
& ( nil = esk3_0
| ssItem(esk5_0) )
& ( nil = esk4_0
| ssList(esk6_0) )
& ( nil = esk3_0
| ssList(esk6_0) )
& ( nil = esk4_0
| ssList(esk7_0) )
& ( nil = esk3_0
| ssList(esk7_0) )
& ( nil = esk4_0
| cons(esk5_0,nil) = esk3_0 )
& ( nil = esk3_0
| cons(esk5_0,nil) = esk3_0 )
& ( nil = esk4_0
| app(app(esk6_0,esk3_0),esk7_0) = esk4_0 )
& ( nil = esk3_0
| app(app(esk6_0,esk3_0),esk7_0) = esk4_0 )
& ( nil = esk4_0
| ~ ssItem(X17)
| ~ memberP(esk6_0,X17)
| ~ lt(esk5_0,X17) )
& ( nil = esk3_0
| ~ ssItem(X17)
| ~ memberP(esk6_0,X17)
| ~ lt(esk5_0,X17) )
& ( nil = esk4_0
| ~ ssItem(X18)
| ~ memberP(esk7_0,X18)
| ~ lt(X18,esk5_0) )
& ( nil = esk3_0
| ~ ssItem(X18)
| ~ memberP(esk7_0,X18)
| ~ lt(X18,esk5_0) )
& ( ~ singletonP(esk1_0)
| ~ segmentP(esk2_0,esk1_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_6])])])])])]) ).
fof(c_0_10,plain,
! [X95,X96] :
( ~ ssList(X95)
| ~ ssItem(X96)
| cons(X96,X95) != X95 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
fof(c_0_11,plain,
! [X103,X104] :
( ( ~ neq(X103,X104)
| X103 != X104
| ~ ssList(X104)
| ~ ssList(X103) )
& ( X103 = X104
| neq(X103,X104)
| ~ ssList(X104)
| ~ ssList(X103) ) ),
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_8])])])])]) ).
cnf(c_0_12,negated_conjecture,
neq(esk2_0,nil),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
( nil = esk4_0
| cons(esk5_0,nil) = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_17,negated_conjecture,
( nil = esk4_0
| ssItem(esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,plain,
( ~ neq(X1,X2)
| X1 != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,negated_conjecture,
neq(esk4_0,nil),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_20,negated_conjecture,
( esk4_0 = nil
| esk3_0 != nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),c_0_17]) ).
fof(c_0_21,plain,
! [X37,X39] :
( ( ssItem(esk10_1(X37))
| ~ singletonP(X37)
| ~ ssList(X37) )
& ( cons(esk10_1(X37),nil) = X37
| ~ singletonP(X37)
| ~ ssList(X37) )
& ( ~ ssItem(X39)
| cons(X39,nil) != X37
| singletonP(X37)
| ~ ssList(X37) ) ),
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)],[ax4])])])])])]) ).
cnf(c_0_22,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_18]) ).
cnf(c_0_23,negated_conjecture,
( neq(nil,nil)
| esk3_0 != nil ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
( singletonP(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_25,negated_conjecture,
( nil = esk3_0
| cons(esk5_0,nil) = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_26,negated_conjecture,
esk3_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_16])]) ).
cnf(c_0_27,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_28,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_29,negated_conjecture,
( nil = esk3_0
| ssItem(esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_30,plain,
! [X19,X20,X23,X24] :
( ( ssList(esk8_2(X19,X20))
| ~ segmentP(X19,X20)
| ~ ssList(X20)
| ~ ssList(X19) )
& ( ssList(esk9_2(X19,X20))
| ~ segmentP(X19,X20)
| ~ ssList(X20)
| ~ ssList(X19) )
& ( app(app(esk8_2(X19,X20),X20),esk9_2(X19,X20)) = X19
| ~ segmentP(X19,X20)
| ~ ssList(X20)
| ~ ssList(X19) )
& ( ~ ssList(X23)
| ~ ssList(X24)
| app(app(X23,X20),X24) != X19
| segmentP(X19,X20)
| ~ ssList(X20)
| ~ ssList(X19) ) ),
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)],[ax7])])])])])]) ).
cnf(c_0_31,negated_conjecture,
( ~ singletonP(esk1_0)
| ~ segmentP(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_32,plain,
( singletonP(cons(X1,nil))
| ~ ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_24]) ).
cnf(c_0_33,negated_conjecture,
cons(esk5_0,nil) = esk3_0,
inference(sr,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_34,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,negated_conjecture,
ssItem(esk5_0),
inference(sr,[status(thm)],[c_0_29,c_0_26]) ).
cnf(c_0_36,plain,
( segmentP(X4,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,X3),X2) != X4
| ~ ssList(X3)
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_37,negated_conjecture,
( nil = esk3_0
| app(app(esk6_0,esk3_0),esk7_0) = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_38,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_39,negated_conjecture,
( nil = esk3_0
| ssList(esk7_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_40,negated_conjecture,
( nil = esk3_0
| ssList(esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_41,negated_conjecture,
( ~ segmentP(esk4_0,esk3_0)
| ~ singletonP(esk3_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_28]),c_0_13]),c_0_28]) ).
cnf(c_0_42,negated_conjecture,
singletonP(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_35])]) ).
cnf(c_0_43,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_36]) ).
cnf(c_0_44,negated_conjecture,
app(app(esk6_0,esk3_0),esk7_0) = esk4_0,
inference(sr,[status(thm)],[c_0_37,c_0_26]) ).
cnf(c_0_45,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_38,c_0_13]) ).
cnf(c_0_46,negated_conjecture,
ssList(esk7_0),
inference(sr,[status(thm)],[c_0_39,c_0_26]) ).
cnf(c_0_47,negated_conjecture,
ssList(esk6_0),
inference(sr,[status(thm)],[c_0_40,c_0_26]) ).
cnf(c_0_48,negated_conjecture,
~ segmentP(esk4_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42])]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_34]),c_0_46]),c_0_47])]),c_0_48]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWC384+1 : TPTP v8.2.0. Released v2.4.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n002.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sun May 19 03:35:53 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.51 Running first-order theorem proving
% 0.22/0.51 Running: /export/starexec/sandbox2/solver/bin/eprover --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.22/0.55 # Version: 3.1.0
% 0.22/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.55 # Starting sh5l with 300s (1) cores
% 0.22/0.55 # new_bool_3 with pid 9166 completed with status 0
% 0.22/0.55 # Result found by new_bool_3
% 0.22/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.55 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.22/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.22/0.55 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 9169 completed with status 0
% 0.22/0.55 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.55 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.22/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.22/0.55 # Preprocessing time : 0.002 s
% 0.22/0.55 # Presaturation interreduction done
% 0.22/0.55
% 0.22/0.55 # Proof found!
% 0.22/0.55 # SZS status Theorem
% 0.22/0.55 # SZS output start CNFRefutation
% See solution above
% 0.22/0.55 # Parsed axioms : 96
% 0.22/0.55 # Removed by relevancy pruning/SinE : 55
% 0.22/0.55 # Initial clauses : 86
% 0.22/0.55 # Removed in clause preprocessing : 0
% 0.22/0.55 # Initial clauses in saturation : 86
% 0.22/0.55 # Processed clauses : 217
% 0.22/0.55 # ...of these trivial : 2
% 0.22/0.55 # ...subsumed : 13
% 0.22/0.55 # ...remaining for further processing : 202
% 0.22/0.55 # Other redundant clauses eliminated : 20
% 0.22/0.55 # Clauses deleted for lack of memory : 0
% 0.22/0.55 # Backward-subsumed : 12
% 0.22/0.55 # Backward-rewritten : 1
% 0.22/0.55 # Generated clauses : 299
% 0.22/0.55 # ...of the previous two non-redundant : 251
% 0.22/0.55 # ...aggressively subsumed : 0
% 0.22/0.55 # Contextual simplify-reflections : 1
% 0.22/0.55 # Paramodulations : 270
% 0.22/0.55 # Factorizations : 0
% 0.22/0.55 # NegExts : 0
% 0.22/0.55 # Equation resolutions : 24
% 0.22/0.55 # Disequality decompositions : 0
% 0.22/0.55 # Total rewrite steps : 201
% 0.22/0.55 # ...of those cached : 186
% 0.22/0.55 # Propositional unsat checks : 0
% 0.22/0.55 # Propositional check models : 0
% 0.22/0.55 # Propositional check unsatisfiable : 0
% 0.22/0.55 # Propositional clauses : 0
% 0.22/0.55 # Propositional clauses after purity: 0
% 0.22/0.55 # Propositional unsat core size : 0
% 0.22/0.55 # Propositional preprocessing time : 0.000
% 0.22/0.55 # Propositional encoding time : 0.000
% 0.22/0.55 # Propositional solver time : 0.000
% 0.22/0.55 # Success case prop preproc time : 0.000
% 0.22/0.55 # Success case prop encoding time : 0.000
% 0.22/0.55 # Success case prop solver time : 0.000
% 0.22/0.55 # Current number of processed clauses : 92
% 0.22/0.55 # Positive orientable unit clauses : 26
% 0.22/0.55 # Positive unorientable unit clauses: 0
% 0.22/0.55 # Negative unit clauses : 6
% 0.22/0.55 # Non-unit-clauses : 60
% 0.22/0.55 # Current number of unprocessed clauses: 182
% 0.22/0.55 # ...number of literals in the above : 821
% 0.22/0.55 # Current number of archived formulas : 0
% 0.22/0.55 # Current number of archived clauses : 101
% 0.22/0.55 # Clause-clause subsumption calls (NU) : 2356
% 0.22/0.55 # Rec. Clause-clause subsumption calls : 519
% 0.22/0.55 # Non-unit clause-clause subsumptions : 8
% 0.22/0.55 # Unit Clause-clause subsumption calls : 88
% 0.22/0.55 # Rewrite failures with RHS unbound : 0
% 0.22/0.55 # BW rewrite match attempts : 6
% 0.22/0.55 # BW rewrite match successes : 6
% 0.22/0.55 # Condensation attempts : 0
% 0.22/0.55 # Condensation successes : 0
% 0.22/0.55 # Termbank termtop insertions : 12151
% 0.22/0.55 # Search garbage collected termcells : 2168
% 0.22/0.55
% 0.22/0.55 # -------------------------------------------------
% 0.22/0.55 # User time : 0.023 s
% 0.22/0.55 # System time : 0.002 s
% 0.22/0.55 # Total time : 0.025 s
% 0.22/0.55 # Maximum resident set size: 2056 pages
% 0.22/0.55
% 0.22/0.55 # -------------------------------------------------
% 0.22/0.55 # User time : 0.027 s
% 0.22/0.55 # System time : 0.004 s
% 0.22/0.55 # Total time : 0.031 s
% 0.22/0.55 # Maximum resident set size: 1824 pages
% 0.22/0.55 % E---3.1 exiting
% 0.22/0.55 % E exiting
%------------------------------------------------------------------------------