TSTP Solution File: SWW385+1 by E-SAT---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.2.0
% Problem : SWW385+1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d SAT
% Computer : n016.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 : Mon Jun 24 18:14:24 EDT 2024
% Result : Theorem 4.09s 2.08s
% Output : CNFRefutation 4.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 34 ( 17 unt; 0 def)
% Number of atoms : 59 ( 18 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 48 ( 23 ~; 14 |; 2 &)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-3 aty)
% Number of functors : 19 ( 19 usr; 10 con; 0-3 aty)
% Number of variables : 42 ( 1 sgn 27 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj_3,conjecture,
! [X3] :
( hBOOL(hAPP(hAPP(c_member(tc_Com_Opname),X3),c_Map_Odom(tc_Com_Opname,tc_Com_Ocom,c_Com_Obody)))
=> c_Hoare__Mirabelle_Ohoare__derivs(tc_Com_Ostate,c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)),hAPP(c_Hoare__Mirabelle_OMGT,hAPP(c_Com_Ocom_OBODY,X3))),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_HOL_Obool)))) ),
file('/export/starexec/sandbox/tmp/tmp.ZgShKE3brU/E---3.1_23815.p',conj_3) ).
fof(fact_singleton__conv2,axiom,
! [X6,X5] : hAPP(c_Set_OCollect(X5),hAPP(c_fequal,X6)) = hAPP(hAPP(c_Set_Oinsert(X5),X6),c_Orderings_Obot__class_Obot(tc_fun(X5,tc_HOL_Obool))),
file('/export/starexec/sandbox/tmp/tmp.ZgShKE3brU/E---3.1_23815.p',fact_singleton__conv2) ).
fof(fact_Collect__def,axiom,
! [X20,X5] : hAPP(c_Set_OCollect(X5),X20) = X20,
file('/export/starexec/sandbox/tmp/tmp.ZgShKE3brU/E---3.1_23815.p',fact_Collect__def) ).
fof(fact_MGF,axiom,
! [X7] :
( c_Hoare__Mirabelle_Ostate__not__singleton
=> ( c_Com_OWT__bodies
=> ( hBOOL(hAPP(c_Com_OWT,X7))
=> c_Hoare__Mirabelle_Ohoare__derivs(tc_Com_Ostate,c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)),hAPP(c_Hoare__Mirabelle_OMGT,X7)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_HOL_Obool)))) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ZgShKE3brU/E---3.1_23815.p',fact_MGF) ).
fof(fact_domIff,axiom,
! [X94,X16,X6,X5] :
( hBOOL(hAPP(hAPP(c_member(X5),X6),c_Map_Odom(X5,X16,X94)))
<=> hAPP(X94,X6) != c_Option_Ooption_ONone(X16) ),
file('/export/starexec/sandbox/tmp/tmp.ZgShKE3brU/E---3.1_23815.p',fact_domIff) ).
fof(conj_0,hypothesis,
c_Hoare__Mirabelle_Ostate__not__singleton,
file('/export/starexec/sandbox/tmp/tmp.ZgShKE3brU/E---3.1_23815.p',conj_0) ).
fof(conj_1,hypothesis,
c_Com_OWT__bodies,
file('/export/starexec/sandbox/tmp/tmp.ZgShKE3brU/E---3.1_23815.p',conj_1) ).
fof(fact_WT_OBody,axiom,
! [X37] :
( hAPP(c_Com_Obody,X37) != c_Option_Ooption_ONone(tc_Com_Ocom)
=> hBOOL(hAPP(c_Com_OWT,hAPP(c_Com_Ocom_OBODY,X37))) ),
file('/export/starexec/sandbox/tmp/tmp.ZgShKE3brU/E---3.1_23815.p',fact_WT_OBody) ).
fof(c_0_8,negated_conjecture,
~ ! [X3] :
( hBOOL(hAPP(hAPP(c_member(tc_Com_Opname),X3),c_Map_Odom(tc_Com_Opname,tc_Com_Ocom,c_Com_Obody)))
=> c_Hoare__Mirabelle_Ohoare__derivs(tc_Com_Ostate,c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)),hAPP(c_Hoare__Mirabelle_OMGT,hAPP(c_Com_Ocom_OBODY,X3))),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_HOL_Obool)))) ),
inference(assume_negation,[status(cth)],[conj_3]) ).
fof(c_0_9,plain,
! [X1184,X1185] : hAPP(c_Set_OCollect(X1185),hAPP(c_fequal,X1184)) = hAPP(hAPP(c_Set_Oinsert(X1185),X1184),c_Orderings_Obot__class_Obot(tc_fun(X1185,tc_HOL_Obool))),
inference(variable_rename,[status(thm)],[fact_singleton__conv2]) ).
fof(c_0_10,plain,
! [X3549,X3550] : hAPP(c_Set_OCollect(X3550),X3549) = X3549,
inference(variable_rename,[status(thm)],[fact_Collect__def]) ).
fof(c_0_11,plain,
! [X328] :
( ~ c_Hoare__Mirabelle_Ostate__not__singleton
| ~ c_Com_OWT__bodies
| ~ hBOOL(hAPP(c_Com_OWT,X328))
| c_Hoare__Mirabelle_Ohoare__derivs(tc_Com_Ostate,c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)),hAPP(c_Hoare__Mirabelle_OMGT,X328)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_HOL_Obool)))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_MGF])])]) ).
fof(c_0_12,plain,
! [X94,X16,X6,X5] :
( hBOOL(hAPP(hAPP(c_member(X5),X6),c_Map_Odom(X5,X16,X94)))
<=> hAPP(X94,X6) != c_Option_Ooption_ONone(X16) ),
inference(fof_simplification,[status(thm)],[fact_domIff]) ).
fof(c_0_13,negated_conjecture,
( hBOOL(hAPP(hAPP(c_member(tc_Com_Opname),esk1_0),c_Map_Odom(tc_Com_Opname,tc_Com_Ocom,c_Com_Obody)))
& ~ c_Hoare__Mirabelle_Ohoare__derivs(tc_Com_Ostate,c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)),hAPP(c_Hoare__Mirabelle_OMGT,hAPP(c_Com_Ocom_OBODY,esk1_0))),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_HOL_Obool)))) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
cnf(c_0_14,plain,
hAPP(c_Set_OCollect(X1),hAPP(c_fequal,X2)) = hAPP(hAPP(c_Set_Oinsert(X1),X2),c_Orderings_Obot__class_Obot(tc_fun(X1,tc_HOL_Obool))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
hAPP(c_Set_OCollect(X1),X2) = X2,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( c_Hoare__Mirabelle_Ohoare__derivs(tc_Com_Ostate,c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)),hAPP(c_Hoare__Mirabelle_OMGT,X1)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_HOL_Obool))))
| ~ c_Hoare__Mirabelle_Ostate__not__singleton
| ~ c_Com_OWT__bodies
| ~ hBOOL(hAPP(c_Com_OWT,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,hypothesis,
c_Hoare__Mirabelle_Ostate__not__singleton,
inference(split_conjunct,[status(thm)],[conj_0]) ).
cnf(c_0_18,hypothesis,
c_Com_OWT__bodies,
inference(split_conjunct,[status(thm)],[conj_1]) ).
fof(c_0_19,plain,
! [X750,X751,X752,X753] :
( ( ~ hBOOL(hAPP(hAPP(c_member(X753),X752),c_Map_Odom(X753,X751,X750)))
| hAPP(X750,X752) != c_Option_Ooption_ONone(X751) )
& ( hAPP(X750,X752) = c_Option_Ooption_ONone(X751)
| hBOOL(hAPP(hAPP(c_member(X753),X752),c_Map_Odom(X753,X751,X750))) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
fof(c_0_20,plain,
! [X37] :
( hAPP(c_Com_Obody,X37) != c_Option_Ooption_ONone(tc_Com_Ocom)
=> hBOOL(hAPP(c_Com_OWT,hAPP(c_Com_Ocom_OBODY,X37))) ),
inference(fof_simplification,[status(thm)],[fact_WT_OBody]) ).
cnf(c_0_21,negated_conjecture,
~ c_Hoare__Mirabelle_Ohoare__derivs(tc_Com_Ostate,c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)),hAPP(c_Hoare__Mirabelle_OMGT,hAPP(c_Com_Ocom_OBODY,esk1_0))),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_HOL_Obool)))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,plain,
hAPP(hAPP(c_Set_Oinsert(X1),X2),c_Orderings_Obot__class_Obot(tc_fun(X1,tc_HOL_Obool))) = hAPP(c_fequal,X2),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_23,plain,
( c_Hoare__Mirabelle_Ohoare__derivs(tc_Com_Ostate,c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)),hAPP(c_Hoare__Mirabelle_OMGT,X1)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_HOL_Obool))))
| ~ hBOOL(hAPP(c_Com_OWT,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_24,plain,
( ~ hBOOL(hAPP(hAPP(c_member(X1),X2),c_Map_Odom(X1,X3,X4)))
| hAPP(X4,X2) != c_Option_Ooption_ONone(X3) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,negated_conjecture,
hBOOL(hAPP(hAPP(c_member(tc_Com_Opname),esk1_0),c_Map_Odom(tc_Com_Opname,tc_Com_Ocom,c_Com_Obody))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_26,plain,
! [X343] :
( hAPP(c_Com_Obody,X343) = c_Option_Ooption_ONone(tc_Com_Ocom)
| hBOOL(hAPP(c_Com_OWT,hAPP(c_Com_Ocom_OBODY,X343))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])]) ).
cnf(c_0_27,negated_conjecture,
~ c_Hoare__Mirabelle_Ohoare__derivs(tc_Com_Ostate,c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_HOL_Obool)),hAPP(c_fequal,hAPP(c_Hoare__Mirabelle_OMGT,hAPP(c_Com_Ocom_OBODY,esk1_0)))),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
( c_Hoare__Mirabelle_Ohoare__derivs(tc_Com_Ostate,c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_HOL_Obool)),hAPP(c_fequal,hAPP(c_Hoare__Mirabelle_OMGT,X1)))
| ~ hBOOL(hAPP(c_Com_OWT,X1)) ),
inference(rw,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_29,negated_conjecture,
c_Option_Ooption_ONone(tc_Com_Ocom) != hAPP(c_Com_Obody,esk1_0),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
( hAPP(c_Com_Obody,X1) = c_Option_Ooption_ONone(tc_Com_Ocom)
| hBOOL(hAPP(c_Com_OWT,hAPP(c_Com_Ocom_OBODY,X1))) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,negated_conjecture,
~ hBOOL(hAPP(c_Com_OWT,hAPP(c_Com_Ocom_OBODY,esk1_0))),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
( hBOOL(hAPP(c_Com_OWT,hAPP(c_Com_Ocom_OBODY,X1)))
| hAPP(c_Com_Obody,X1) != hAPP(c_Com_Obody,esk1_0) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_31,c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWW385+1 : TPTP v8.2.0. Released v5.2.0.
% 0.04/0.12 % Command : run_E %s %d SAT
% 0.12/0.33 % Computer : n016.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Jun 19 07:15:09 EDT 2024
% 0.12/0.33 % CPUTime :
% 1.03/1.22 Running first-order model finding
% 1.03/1.22 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.ZgShKE3brU/E---3.1_23815.p
% 4.09/2.08 # Version: 3.2.0
% 4.09/2.08 # Preprocessing class: FMLMSLSMSSSNFFN.
% 4.09/2.08 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.09/2.08 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 4.09/2.08 # Starting new_bool_3 with 300s (1) cores
% 4.09/2.08 # Starting new_bool_1 with 300s (1) cores
% 4.09/2.08 # Starting sh5l with 300s (1) cores
% 4.09/2.08 # new_bool_3 with pid 23893 completed with status 0
% 4.09/2.08 # Result found by new_bool_3
% 4.09/2.08 # Preprocessing class: FMLMSLSMSSSNFFN.
% 4.09/2.08 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.09/2.08 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 4.09/2.08 # Starting new_bool_3 with 300s (1) cores
% 4.09/2.08 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.09/2.08 # Search class: FGHSM-SMLM33-DFFFFFNN
% 4.09/2.08 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 4.09/2.08 # Starting SAT001_MinMin_p005000_rr with 163s (1) cores
% 4.09/2.08 # SAT001_MinMin_p005000_rr with pid 23897 completed with status 0
% 4.09/2.08 # Result found by SAT001_MinMin_p005000_rr
% 4.09/2.08 # Preprocessing class: FMLMSLSMSSSNFFN.
% 4.09/2.08 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.09/2.08 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 4.09/2.08 # Starting new_bool_3 with 300s (1) cores
% 4.09/2.08 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.09/2.08 # Search class: FGHSM-SMLM33-DFFFFFNN
% 4.09/2.08 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 4.09/2.08 # Starting SAT001_MinMin_p005000_rr with 163s (1) cores
% 4.09/2.08 # Preprocessing time : 0.045 s
% 4.09/2.08 # Presaturation interreduction done
% 4.09/2.08
% 4.09/2.08 # Proof found!
% 4.09/2.08 # SZS status Theorem
% 4.09/2.08 # SZS output start CNFRefutation
% See solution above
% 4.09/2.09 # Parsed axioms : 5243
% 4.09/2.09 # Removed by relevancy pruning/SinE : 3163
% 4.09/2.09 # Initial clauses : 3036
% 4.09/2.09 # Removed in clause preprocessing : 90
% 4.09/2.09 # Initial clauses in saturation : 2946
% 4.09/2.09 # Processed clauses : 3422
% 4.09/2.09 # ...of these trivial : 126
% 4.09/2.09 # ...subsumed : 524
% 4.09/2.09 # ...remaining for further processing : 2772
% 4.09/2.09 # Other redundant clauses eliminated : 271
% 4.09/2.09 # Clauses deleted for lack of memory : 0
% 4.09/2.09 # Backward-subsumed : 9
% 4.09/2.09 # Backward-rewritten : 80
% 4.09/2.09 # Generated clauses : 444
% 4.09/2.09 # ...of the previous two non-redundant : 316
% 4.09/2.09 # ...aggressively subsumed : 0
% 4.09/2.09 # Contextual simplify-reflections : 17
% 4.09/2.09 # Paramodulations : 188
% 4.09/2.09 # Factorizations : 0
% 4.09/2.09 # NegExts : 0
% 4.09/2.09 # Equation resolutions : 291
% 4.09/2.09 # Disequality decompositions : 0
% 4.09/2.09 # Total rewrite steps : 2711
% 4.09/2.09 # ...of those cached : 2051
% 4.09/2.09 # Propositional unsat checks : 0
% 4.09/2.09 # Propositional check models : 0
% 4.09/2.09 # Propositional check unsatisfiable : 0
% 4.09/2.09 # Propositional clauses : 0
% 4.09/2.09 # Propositional clauses after purity: 0
% 4.09/2.09 # Propositional unsat core size : 0
% 4.09/2.09 # Propositional preprocessing time : 0.000
% 4.09/2.09 # Propositional encoding time : 0.000
% 4.09/2.09 # Propositional solver time : 0.000
% 4.09/2.09 # Success case prop preproc time : 0.000
% 4.09/2.09 # Success case prop encoding time : 0.000
% 4.09/2.09 # Success case prop solver time : 0.000
% 4.09/2.09 # Current number of processed clauses : 274
% 4.09/2.09 # Positive orientable unit clauses : 120
% 4.09/2.09 # Positive unorientable unit clauses: 0
% 4.09/2.09 # Negative unit clauses : 61
% 4.09/2.09 # Non-unit-clauses : 93
% 4.09/2.09 # Current number of unprocessed clauses: 1996
% 4.09/2.09 # ...number of literals in the above : 4520
% 4.09/2.09 # Current number of archived formulas : 0
% 4.09/2.09 # Current number of archived clauses : 2265
% 4.09/2.09 # Clause-clause subsumption calls (NU) : 371318
% 4.09/2.09 # Rec. Clause-clause subsumption calls : 214671
% 4.09/2.09 # Non-unit clause-clause subsumptions : 459
% 4.09/2.09 # Unit Clause-clause subsumption calls : 4857
% 4.09/2.09 # Rewrite failures with RHS unbound : 40
% 4.09/2.09 # BW rewrite match attempts : 7871
% 4.09/2.09 # BW rewrite match successes : 247
% 4.09/2.09 # Condensation attempts : 0
% 4.09/2.09 # Condensation successes : 0
% 4.09/2.09 # Termbank termtop insertions : 513602
% 4.09/2.09 # Search garbage collected termcells : 68830
% 4.09/2.09
% 4.09/2.09 # -------------------------------------------------
% 4.09/2.09 # User time : 0.680 s
% 4.09/2.09 # System time : 0.047 s
% 4.09/2.09 # Total time : 0.727 s
% 4.09/2.09 # Maximum resident set size: 18440 pages
% 4.09/2.09
% 4.09/2.09 # -------------------------------------------------
% 4.09/2.09 # User time : 0.795 s
% 4.09/2.09 # System time : 0.051 s
% 4.09/2.09 # Total time : 0.846 s
% 4.09/2.09 # Maximum resident set size: 9552 pages
% 4.09/2.09 % E---3.1 exiting
% 4.09/2.09 % E exiting
%------------------------------------------------------------------------------