TSTP Solution File: SWW365+1 by E-SAT---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.2.0
% Problem : SWW365+1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d SAT
% Computer : n007.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:19 EDT 2024
% Result : Theorem 24.56s 5.12s
% Output : CNFRefutation 24.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of formulae : 38 ( 25 unt; 0 def)
% Number of atoms : 63 ( 18 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 47 ( 22 ~; 16 |; 5 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 5 con; 0-3 aty)
% Number of variables : 90 ( 15 sgn 49 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(fact_Collect__empty__eq,axiom,
! [X42,X10] :
( hAPP(c_Set_OCollect(X10),X42) = c_Orderings_Obot__class_Obot(tc_fun(X10,tc_HOL_Obool))
<=> ! [X3] : ~ hBOOL(hAPP(X42,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.rxDo4Vsv4t/E---3.1_30564.p',fact_Collect__empty__eq) ).
fof(fact_Collect__mem__eq,axiom,
! [X12,X10] : hAPP(c_Set_OCollect(X10),hAPP(hAPP(c_COMBC(X10,tc_fun(X10,tc_HOL_Obool),tc_HOL_Obool),c_member(X10)),X12)) = X12,
file('/export/starexec/sandbox/tmp/tmp.rxDo4Vsv4t/E---3.1_30564.p',fact_Collect__mem__eq) ).
fof(fact_Collect__def,axiom,
! [X42,X10] : hAPP(c_Set_OCollect(X10),X42) = X42,
file('/export/starexec/sandbox/tmp/tmp.rxDo4Vsv4t/E---3.1_30564.p',fact_Collect__def) ).
fof(conj_7,conjecture,
hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(t_a,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(t_a),hAPP(v_mgt__call,v_pn)),c_Orderings_Obot__class_Obot(tc_fun(t_a,tc_HOL_Obool)))),v_G)),
file('/export/starexec/sandbox/tmp/tmp.rxDo4Vsv4t/E---3.1_30564.p',conj_7) ).
fof(help_c__COMBC__1,axiom,
! [X29,X41,X42,X10,X18,X8] : hAPP(hAPP(hAPP(c_COMBC(X8,X18,X10),X42),X41),X29) = hAPP(hAPP(X42,X29),X41),
file('/export/starexec/sandbox/tmp/tmp.rxDo4Vsv4t/E---3.1_30564.p',help_c__COMBC__1) ).
fof(fact_insert__subset,axiom,
! [X15,X12,X11,X10] :
( hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X10,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(X10),X11),X12)),X15))
<=> ( hBOOL(hAPP(hAPP(c_member(X10),X11),X15))
& hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X10,tc_HOL_Obool)),X12),X15)) ) ),
file('/export/starexec/sandbox/tmp/tmp.rxDo4Vsv4t/E---3.1_30564.p',fact_insert__subset) ).
fof(fact_empty__subsetI,axiom,
! [X12,X10] : hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X10,tc_HOL_Obool)),c_Orderings_Obot__class_Obot(tc_fun(X10,tc_HOL_Obool))),X12)),
file('/export/starexec/sandbox/tmp/tmp.rxDo4Vsv4t/E---3.1_30564.p',fact_empty__subsetI) ).
fof(fact_mem__def,axiom,
! [X12,X11,X10] :
( hBOOL(hAPP(hAPP(c_member(X10),X11),X12))
<=> hBOOL(hAPP(X12,X11)) ),
file('/export/starexec/sandbox/tmp/tmp.rxDo4Vsv4t/E---3.1_30564.p',fact_mem__def) ).
fof(conj_6,hypothesis,
hBOOL(hAPP(hAPP(c_member(t_a),hAPP(v_mgt__call,v_pn)),v_G)),
file('/export/starexec/sandbox/tmp/tmp.rxDo4Vsv4t/E---3.1_30564.p',conj_6) ).
fof(c_0_9,plain,
! [X42,X10] :
( hAPP(c_Set_OCollect(X10),X42) = c_Orderings_Obot__class_Obot(tc_fun(X10,tc_HOL_Obool))
<=> ! [X3] : ~ hBOOL(hAPP(X42,X3)) ),
inference(fof_simplification,[status(thm)],[fact_Collect__empty__eq]) ).
fof(c_0_10,plain,
! [X3568,X3569] : hAPP(c_Set_OCollect(X3569),hAPP(hAPP(c_COMBC(X3569,tc_fun(X3569,tc_HOL_Obool),tc_HOL_Obool),c_member(X3569)),X3568)) = X3568,
inference(variable_rename,[status(thm)],[fact_Collect__mem__eq]) ).
fof(c_0_11,plain,
! [X3570,X3571] : hAPP(c_Set_OCollect(X3571),X3570) = X3570,
inference(variable_rename,[status(thm)],[fact_Collect__def]) ).
fof(c_0_12,negated_conjecture,
~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(t_a,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(t_a),hAPP(v_mgt__call,v_pn)),c_Orderings_Obot__class_Obot(tc_fun(t_a,tc_HOL_Obool)))),v_G)),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_7])]) ).
fof(c_0_13,plain,
! [X3572,X3573,X3574,X3575,X3577] :
( ( hAPP(c_Set_OCollect(X3573),X3572) != c_Orderings_Obot__class_Obot(tc_fun(X3573,tc_HOL_Obool))
| ~ hBOOL(hAPP(X3572,X3574)) )
& ( hBOOL(hAPP(X3575,esk130_1(X3575)))
| hAPP(c_Set_OCollect(X3577),X3575) = c_Orderings_Obot__class_Obot(tc_fun(X3577,tc_HOL_Obool)) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])])]) ).
fof(c_0_14,plain,
! [X3500,X3501,X3502,X3503,X3504,X3505] : hAPP(hAPP(hAPP(c_COMBC(X3505,X3504,X3503),X3502),X3501),X3500) = hAPP(hAPP(X3502,X3500),X3501),
inference(variable_rename,[status(thm)],[help_c__COMBC__1]) ).
cnf(c_0_15,plain,
hAPP(c_Set_OCollect(X1),hAPP(hAPP(c_COMBC(X1,tc_fun(X1,tc_HOL_Obool),tc_HOL_Obool),c_member(X1)),X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
hAPP(c_Set_OCollect(X1),X2) = X2,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_17,negated_conjecture,
~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(t_a,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(t_a),hAPP(v_mgt__call,v_pn)),c_Orderings_Obot__class_Obot(tc_fun(t_a,tc_HOL_Obool)))),v_G)),
inference(fof_nnf,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( hBOOL(hAPP(X1,esk130_1(X1)))
| hAPP(c_Set_OCollect(X2),X1) = c_Orderings_Obot__class_Obot(tc_fun(X2,tc_HOL_Obool)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( hAPP(c_Set_OCollect(X1),X2) != c_Orderings_Obot__class_Obot(tc_fun(X1,tc_HOL_Obool))
| ~ hBOOL(hAPP(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_20,plain,
! [X473,X474,X475,X476] :
( ( hBOOL(hAPP(hAPP(c_member(X476),X475),X473))
| ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X476,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(X476),X475),X474)),X473)) )
& ( hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X476,tc_HOL_Obool)),X474),X473))
| ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X476,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(X476),X475),X474)),X473)) )
& ( ~ hBOOL(hAPP(hAPP(c_member(X476),X475),X473))
| ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X476,tc_HOL_Obool)),X474),X473))
| hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X476,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(X476),X475),X474)),X473)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_insert__subset])])])]) ).
cnf(c_0_21,plain,
hAPP(hAPP(hAPP(c_COMBC(X1,X2,X3),X4),X5),X6) = hAPP(hAPP(X4,X6),X5),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
hAPP(hAPP(c_COMBC(X1,tc_fun(X1,tc_HOL_Obool),tc_HOL_Obool),c_member(X1)),X2) = X2,
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_23,plain,
! [X344,X345] : hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X345,tc_HOL_Obool)),c_Orderings_Obot__class_Obot(tc_fun(X345,tc_HOL_Obool))),X344)),
inference(variable_rename,[status(thm)],[fact_empty__subsetI]) ).
fof(c_0_24,plain,
! [X1400,X1401,X1402] :
( ( ~ hBOOL(hAPP(hAPP(c_member(X1402),X1401),X1400))
| hBOOL(hAPP(X1400,X1401)) )
& ( ~ hBOOL(hAPP(X1400,X1401))
| hBOOL(hAPP(hAPP(c_member(X1402),X1401),X1400)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_mem__def])])]) ).
cnf(c_0_25,negated_conjecture,
~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(t_a,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(t_a),hAPP(v_mgt__call,v_pn)),c_Orderings_Obot__class_Obot(tc_fun(t_a,tc_HOL_Obool)))),v_G)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,plain,
( X1 = c_Orderings_Obot__class_Obot(tc_fun(X2,tc_HOL_Obool))
| hBOOL(hAPP(X1,esk130_1(X1))) ),
inference(rw,[status(thm)],[c_0_18,c_0_16]) ).
cnf(c_0_27,plain,
~ hBOOL(hAPP(c_Orderings_Obot__class_Obot(tc_fun(X1,tc_HOL_Obool)),X2)),
inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_16])]) ).
cnf(c_0_28,plain,
( hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X1,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(X1),X2),X4)),X3))
| ~ hBOOL(hAPP(hAPP(c_member(X1),X2),X3))
| ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X1,tc_HOL_Obool)),X4),X3)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_29,plain,
hAPP(hAPP(c_member(X1),X2),X3) = hAPP(X3,X2),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_30,plain,
hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X1,tc_HOL_Obool)),c_Orderings_Obot__class_Obot(tc_fun(X1,tc_HOL_Obool))),X2)),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_31,plain,
( hBOOL(hAPP(X3,X2))
| ~ hBOOL(hAPP(hAPP(c_member(X1),X2),X3)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_32,hypothesis,
hBOOL(hAPP(hAPP(c_member(t_a),hAPP(v_mgt__call,v_pn)),v_G)),
inference(split_conjunct,[status(thm)],[conj_6]) ).
cnf(c_0_33,negated_conjecture,
~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(t_a,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(t_a),hAPP(v_mgt__call,v_pn)),c_Orderings_Obot__class_Obot(tc_fun(X1,tc_HOL_Obool)))),v_G)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_34,plain,
( hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X1,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(X1),X2),X3)),X4))
| ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X1,tc_HOL_Obool)),X3),X4))
| ~ hBOOL(hAPP(X4,X2)) ),
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,plain,
hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X1,tc_HOL_Obool)),c_Orderings_Obot__class_Obot(tc_fun(X2,tc_HOL_Obool))),X3)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_26]),c_0_27]) ).
cnf(c_0_36,hypothesis,
hBOOL(hAPP(v_G,hAPP(v_mgt__call,v_pn))),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.15 % Problem : SWW365+1 : TPTP v8.2.0. Released v5.2.0.
% 0.08/0.15 % Command : run_E %s %d SAT
% 0.13/0.36 % Computer : n007.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 : Wed Jun 19 06:53:09 EDT 2024
% 0.13/0.36 % CPUTime :
% 1.07/1.28 Running first-order model finding
% 1.07/1.28 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.rxDo4Vsv4t/E---3.1_30564.p
% 24.56/5.12 # Version: 3.2.0
% 24.56/5.12 # Preprocessing class: FMLMSMSMSSSNFFN.
% 24.56/5.12 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 24.56/5.12 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 24.56/5.12 # Starting new_bool_3 with 300s (1) cores
% 24.56/5.12 # Starting new_bool_1 with 300s (1) cores
% 24.56/5.12 # Starting sh5l with 300s (1) cores
% 24.56/5.12 # new_bool_1 with pid 30643 completed with status 0
% 24.56/5.12 # Result found by new_bool_1
% 24.56/5.12 # Preprocessing class: FMLMSMSMSSSNFFN.
% 24.56/5.12 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 24.56/5.12 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 24.56/5.12 # Starting new_bool_3 with 300s (1) cores
% 24.56/5.12 # Starting new_bool_1 with 300s (1) cores
% 24.56/5.12 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 24.56/5.12 # Search class: FGHSM-SMLM33-DFFFFFNN
% 24.56/5.12 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 24.56/5.12 # Starting SAT001_MinMin_p005000_rr with 163s (1) cores
% 24.56/5.12 # SAT001_MinMin_p005000_rr with pid 30646 completed with status 0
% 24.56/5.12 # Result found by SAT001_MinMin_p005000_rr
% 24.56/5.12 # Preprocessing class: FMLMSMSMSSSNFFN.
% 24.56/5.12 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 24.56/5.12 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 24.56/5.12 # Starting new_bool_3 with 300s (1) cores
% 24.56/5.12 # Starting new_bool_1 with 300s (1) cores
% 24.56/5.12 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 24.56/5.12 # Search class: FGHSM-SMLM33-DFFFFFNN
% 24.56/5.12 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 24.56/5.12 # Starting SAT001_MinMin_p005000_rr with 163s (1) cores
% 24.56/5.12 # Preprocessing time : 0.043 s
% 24.56/5.12 # Presaturation interreduction done
% 24.56/5.12
% 24.56/5.12 # Proof found!
% 24.56/5.12 # SZS status Theorem
% 24.56/5.12 # SZS output start CNFRefutation
% See solution above
% 24.56/5.12 # Parsed axioms : 5231
% 24.56/5.12 # Removed by relevancy pruning/SinE : 3441
% 24.56/5.12 # Initial clauses : 2716
% 24.56/5.12 # Removed in clause preprocessing : 70
% 24.56/5.12 # Initial clauses in saturation : 2646
% 24.56/5.12 # Processed clauses : 10456
% 24.56/5.12 # ...of these trivial : 296
% 24.56/5.12 # ...subsumed : 4981
% 24.56/5.12 # ...remaining for further processing : 5179
% 24.56/5.12 # Other redundant clauses eliminated : 3247
% 24.56/5.12 # Clauses deleted for lack of memory : 0
% 24.56/5.12 # Backward-subsumed : 259
% 24.56/5.12 # Backward-rewritten : 213
% 24.56/5.12 # Generated clauses : 179202
% 24.56/5.12 # ...of the previous two non-redundant : 169743
% 24.56/5.12 # ...aggressively subsumed : 0
% 24.56/5.12 # Contextual simplify-reflections : 28
% 24.56/5.12 # Paramodulations : 175900
% 24.56/5.12 # Factorizations : 22
% 24.56/5.12 # NegExts : 0
% 24.56/5.12 # Equation resolutions : 3301
% 24.56/5.12 # Disequality decompositions : 0
% 24.56/5.12 # Total rewrite steps : 22452
% 24.56/5.12 # ...of those cached : 16421
% 24.56/5.12 # Propositional unsat checks : 1
% 24.56/5.12 # Propositional check models : 0
% 24.56/5.12 # Propositional check unsatisfiable : 0
% 24.56/5.12 # Propositional clauses : 0
% 24.56/5.12 # Propositional clauses after purity: 0
% 24.56/5.12 # Propositional unsat core size : 0
% 24.56/5.12 # Propositional preprocessing time : 0.000
% 24.56/5.12 # Propositional encoding time : 0.249
% 24.56/5.12 # Propositional solver time : 0.091
% 24.56/5.12 # Success case prop preproc time : 0.000
% 24.56/5.12 # Success case prop encoding time : 0.000
% 24.56/5.12 # Success case prop solver time : 0.000
% 24.56/5.12 # Current number of processed clauses : 2521
% 24.56/5.12 # Positive orientable unit clauses : 577
% 24.56/5.12 # Positive unorientable unit clauses: 47
% 24.56/5.12 # Negative unit clauses : 270
% 24.56/5.12 # Non-unit-clauses : 1627
% 24.56/5.12 # Current number of unprocessed clauses: 144668
% 24.56/5.12 # ...number of literals in the above : 382619
% 24.56/5.12 # Current number of archived formulas : 0
% 24.56/5.12 # Current number of archived clauses : 2452
% 24.56/5.12 # Clause-clause subsumption calls (NU) : 606593
% 24.56/5.12 # Rec. Clause-clause subsumption calls : 355088
% 24.56/5.12 # Non-unit clause-clause subsumptions : 3994
% 24.56/5.12 # Unit Clause-clause subsumption calls : 28674
% 24.56/5.12 # Rewrite failures with RHS unbound : 182
% 24.56/5.12 # BW rewrite match attempts : 11968
% 24.56/5.12 # BW rewrite match successes : 667
% 24.56/5.12 # Condensation attempts : 0
% 24.56/5.12 # Condensation successes : 0
% 24.56/5.12 # Termbank termtop insertions : 5216481
% 24.56/5.12 # Search garbage collected termcells : 68348
% 24.56/5.12
% 24.56/5.12 # -------------------------------------------------
% 24.56/5.12 # User time : 3.464 s
% 24.56/5.12 # System time : 0.145 s
% 24.56/5.12 # Total time : 3.609 s
% 24.56/5.12 # Maximum resident set size: 17264 pages
% 24.56/5.12
% 24.56/5.12 # -------------------------------------------------
% 24.56/5.12 # User time : 3.597 s
% 24.56/5.12 # System time : 0.155 s
% 24.56/5.12 # Total time : 3.751 s
% 24.56/5.12 # Maximum resident set size: 9480 pages
% 24.56/5.12 % E---3.1 exiting
% 24.56/5.12 % E exiting
%------------------------------------------------------------------------------