TSTP Solution File: GRP504-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP504-1 : TPTP v8.2.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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 May 20 20:49:27 EDT 2024
% Result : Unsatisfiable 0.21s 0.60s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 38
% Number of leaves : 3
% Syntax : Number of clauses : 57 ( 57 unt; 0 nHn; 4 RR)
% Number of literals : 57 ( 56 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 198 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
double_divide(double_divide(X1,inverse(double_divide(X2,X3))),double_divide(inverse(X2),inverse(double_divide(X4,double_divide(X1,X4))))) = X3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(multiply,axiom,
multiply(X1,X2) = inverse(double_divide(X2,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(prove_these_axioms_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_3) ).
cnf(c_0_3,axiom,
double_divide(double_divide(X1,inverse(double_divide(X2,X3))),double_divide(inverse(X2),inverse(double_divide(X4,double_divide(X1,X4))))) = X3,
single_axiom ).
cnf(c_0_4,axiom,
multiply(X1,X2) = inverse(double_divide(X2,X1)),
multiply ).
cnf(c_0_5,plain,
double_divide(double_divide(X1,multiply(X2,X3)),double_divide(inverse(X3),multiply(double_divide(X1,X4),X4))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_3,c_0_4]),c_0_4]) ).
cnf(c_0_6,plain,
multiply(double_divide(inverse(X1),multiply(double_divide(X2,X3),X3)),double_divide(X2,multiply(X4,X1))) = inverse(X4),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,plain,
multiply(double_divide(multiply(multiply(X1,X2),X3),multiply(double_divide(X4,X5),X5)),double_divide(X4,inverse(X1))) = multiply(multiply(double_divide(X3,X6),X6),inverse(X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_6]),c_0_4]),c_0_4]) ).
cnf(c_0_8,plain,
multiply(multiply(double_divide(X1,X2),X2),inverse(X3)) = multiply(multiply(double_divide(X1,X4),X4),inverse(X3)),
inference(spm,[status(thm)],[c_0_7,c_0_7]) ).
cnf(c_0_9,plain,
multiply(double_divide(multiply(X1,X2),multiply(double_divide(X3,X4),X4)),double_divide(X3,multiply(X5,double_divide(X2,X1)))) = inverse(X5),
inference(spm,[status(thm)],[c_0_6,c_0_4]) ).
cnf(c_0_10,plain,
multiply(double_divide(X1,X2),X2) = multiply(double_divide(X1,X3),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_8]),c_0_5]) ).
cnf(c_0_11,plain,
multiply(double_divide(multiply(X1,X2),multiply(double_divide(X3,X4),X4)),double_divide(X3,multiply(double_divide(X5,X6),X6))) = multiply(double_divide(X2,X1),X5),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_4]) ).
cnf(c_0_12,plain,
double_divide(double_divide(X1,multiply(X2,double_divide(X3,X4))),double_divide(multiply(X4,X3),multiply(double_divide(X1,X5),X5))) = X2,
inference(spm,[status(thm)],[c_0_5,c_0_4]) ).
cnf(c_0_13,plain,
multiply(double_divide(X1,double_divide(X2,X1)),X3) = multiply(double_divide(X4,double_divide(X2,X4)),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_10]),c_0_11]) ).
cnf(c_0_14,plain,
double_divide(X1,double_divide(X2,X1)) = double_divide(X3,double_divide(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_12]) ).
cnf(c_0_15,plain,
multiply(double_divide(X1,double_divide(X2,X1)),double_divide(X2,X3)) = multiply(double_divide(X3,X4),X4),
inference(spm,[status(thm)],[c_0_10,c_0_14]) ).
cnf(c_0_16,plain,
multiply(double_divide(X1,multiply(double_divide(X2,X3),X3)),X4) = multiply(multiply(double_divide(X1,X5),X5),multiply(X2,X4)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_15]),c_0_4]),c_0_11]),c_0_4]) ).
cnf(c_0_17,plain,
multiply(multiply(double_divide(inverse(X1),a3),a3),multiply(X2,double_divide(X2,multiply(X3,X1)))) = inverse(X3),
inference(rw,[status(thm)],[c_0_6,c_0_16]) ).
cnf(c_0_18,plain,
multiply(multiply(double_divide(inverse(X1),X2),X2),multiply(X3,double_divide(X3,multiply(X4,X1)))) = inverse(X4),
inference(spm,[status(thm)],[c_0_17,c_0_10]) ).
cnf(c_0_19,plain,
multiply(multiply(double_divide(multiply(X1,X2),a3),a3),multiply(X3,double_divide(X3,multiply(double_divide(X4,X5),X5)))) = multiply(double_divide(X2,X1),X4),
inference(rw,[status(thm)],[c_0_11,c_0_16]) ).
cnf(c_0_20,plain,
multiply(multiply(double_divide(inverse(X1),X2),X2),multiply(X3,double_divide(X3,multiply(double_divide(X4,X5),X5)))) = multiply(X1,X4),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_10]),c_0_4]) ).
cnf(c_0_21,plain,
multiply(multiply(double_divide(multiply(X1,X2),a3),a3),multiply(X3,double_divide(X3,multiply(X4,double_divide(X2,X1))))) = inverse(X4),
inference(rw,[status(thm)],[c_0_9,c_0_16]) ).
cnf(c_0_22,plain,
multiply(multiply(double_divide(multiply(X1,double_divide(X1,multiply(X2,X3))),a3),a3),multiply(inverse(X3),X4)) = multiply(X2,X4),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_18]),c_0_20]),c_0_16]) ).
cnf(c_0_23,plain,
multiply(X1,double_divide(inverse(X2),multiply(X3,double_divide(double_divide(X4,multiply(X1,X2)),X4)))) = inverse(X3),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,plain,
multiply(multiply(double_divide(multiply(X1,double_divide(X1,multiply(inverse(X2),X2))),X3),X3),inverse(X4)) = inverse(X4),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_23]),c_0_4]) ).
cnf(c_0_25,plain,
multiply(multiply(double_divide(multiply(X1,double_divide(X1,multiply(inverse(X2),X2))),X3),X3),multiply(X4,X5)) = multiply(X4,X5),
inference(spm,[status(thm)],[c_0_24,c_0_4]) ).
cnf(c_0_26,plain,
multiply(double_divide(double_divide(inverse(X1),multiply(X2,double_divide(double_divide(X3,multiply(X4,X1)),X3))),X4),X5) = multiply(X2,X5),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_23]),c_0_20]) ).
cnf(c_0_27,plain,
multiply(X1,double_divide(X1,multiply(X2,double_divide(double_divide(X3,multiply(inverse(X4),X4)),X3)))) = inverse(X2),
inference(spm,[status(thm)],[c_0_21,c_0_25]) ).
cnf(c_0_28,plain,
double_divide(double_divide(inverse(X1),multiply(X2,double_divide(double_divide(X3,multiply(X4,X1)),X3))),X4) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_26]),c_0_12]) ).
cnf(c_0_29,plain,
multiply(X1,double_divide(X1,multiply(X2,multiply(X3,double_divide(X3,multiply(inverse(X4),X4)))))) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_4]) ).
cnf(c_0_30,plain,
multiply(X1,double_divide(X1,inverse(inverse(X2)))) = inverse(multiply(double_divide(inverse(X2),X3),X3)),
inference(spm,[status(thm)],[c_0_29,c_0_18]) ).
cnf(c_0_31,plain,
multiply(X1,double_divide(X1,inverse(inverse(X2)))) = multiply(X3,double_divide(X3,inverse(inverse(X2)))),
inference(spm,[status(thm)],[c_0_30,c_0_30]) ).
cnf(c_0_32,plain,
multiply(X1,double_divide(inverse(X2),multiply(X3,double_divide(X3,inverse(inverse(X4)))))) = multiply(multiply(X1,X2),inverse(inverse(X4))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_31]),c_0_4]) ).
cnf(c_0_33,plain,
multiply(multiply(inverse(X1),X1),inverse(inverse(X2))) = multiply(multiply(inverse(X3),X3),inverse(inverse(X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_32]),c_0_4]) ).
cnf(c_0_34,plain,
multiply(inverse(X1),X1) = multiply(inverse(X2),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_33]),c_0_5]) ).
cnf(c_0_35,plain,
multiply(double_divide(double_divide(X1,multiply(X2,X3)),X1),X4) = multiply(X2,double_divide(inverse(X3),multiply(double_divide(X4,a3),a3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_15]),c_0_15]),c_0_4]) ).
cnf(c_0_36,plain,
multiply(inverse(X1),X1) = multiply(multiply(X2,X3),double_divide(X3,X2)),
inference(spm,[status(thm)],[c_0_34,c_0_4]) ).
cnf(c_0_37,plain,
multiply(double_divide(double_divide(X1,multiply(X2,X3)),X4),X4) = multiply(X2,double_divide(inverse(X3),multiply(double_divide(X1,a3),a3))),
inference(spm,[status(thm)],[c_0_10,c_0_35]) ).
cnf(c_0_38,plain,
multiply(X1,double_divide(X1,inverse(multiply(X2,X3)))) = multiply(X4,double_divide(X4,inverse(multiply(X2,X3)))),
inference(spm,[status(thm)],[c_0_31,c_0_4]) ).
cnf(c_0_39,plain,
multiply(inverse(X1),X1) = multiply(multiply(inverse(X2),X2),double_divide(X3,inverse(X3))),
inference(spm,[status(thm)],[c_0_36,c_0_34]) ).
cnf(c_0_40,plain,
multiply(X1,double_divide(multiply(X2,double_divide(X2,multiply(X3,X4))),multiply(double_divide(inverse(X4),a3),a3))) = multiply(X1,X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_28]),c_0_37]),c_0_4]) ).
cnf(c_0_41,plain,
multiply(inverse(X1),X1) = multiply(X2,double_divide(X2,inverse(multiply(inverse(X3),X3)))),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,plain,
multiply(X1,double_divide(multiply(X2,double_divide(X2,multiply(inverse(X3),X3))),multiply(double_divide(X4,a3),a3))) = multiply(X1,X4),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_28]),c_0_4]) ).
cnf(c_0_43,plain,
multiply(X1,multiply(inverse(multiply(inverse(X2),X2)),X3)) = multiply(X1,X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_4]),c_0_42]) ).
cnf(c_0_44,plain,
multiply(X1,double_divide(multiply(X2,double_divide(X2,multiply(inverse(X3),X3))),multiply(X4,X1))) = inverse(X4),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_28]),c_0_4]) ).
cnf(c_0_45,plain,
multiply(double_divide(X1,multiply(inverse(multiply(inverse(X2),X2)),X3)),X3) = multiply(double_divide(X1,a3),a3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_43]),c_0_15]) ).
cnf(c_0_46,plain,
multiply(multiply(inverse(multiply(inverse(X1),X1)),X2),X3) = multiply(X2,X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_42]),c_0_4]) ).
cnf(c_0_47,plain,
multiply(inverse(multiply(inverse(X1),X1)),X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_46]),c_0_28]) ).
cnf(c_0_48,plain,
double_divide(inverse(X1),multiply(X2,double_divide(double_divide(X3,X1),X3))) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_47]),c_0_47]) ).
cnf(c_0_49,plain,
multiply(X1,double_divide(X1,inverse(X2))) = multiply(X3,double_divide(X3,inverse(X2))),
inference(spm,[status(thm)],[c_0_38,c_0_47]) ).
cnf(c_0_50,plain,
double_divide(inverse(X1),multiply(X2,double_divide(X2,inverse(X3)))) = multiply(X1,inverse(X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_4]) ).
cnf(c_0_51,plain,
multiply(multiply(X1,X2),inverse(X3)) = multiply(X1,multiply(X2,inverse(X3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_50]),c_0_4]) ).
cnf(c_0_52,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
inference(fof_simplification,[status(thm)],[prove_these_axioms_3]) ).
cnf(c_0_53,plain,
multiply(multiply(X1,X2),multiply(X3,X4)) = multiply(X1,multiply(X2,multiply(X3,X4))),
inference(spm,[status(thm)],[c_0_51,c_0_4]) ).
cnf(c_0_54,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
c_0_52 ).
cnf(c_0_55,plain,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
inference(spm,[status(thm)],[c_0_53,c_0_47]) ).
cnf(c_0_56,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP504-1 : TPTP v8.2.0. Released v2.6.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n012.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 04:34:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 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.21/0.60 # Version: 3.1.0
% 0.21/0.60 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.60 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.60 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.60 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.60 # Starting sh5l with 300s (1) cores
% 0.21/0.60 # new_bool_3 with pid 25707 completed with status 0
% 0.21/0.60 # Result found by new_bool_3
% 0.21/0.60 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.60 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.60 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.60 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.60 # Search class: FUUPS-FFSF21-MFFFFFNN
% 0.21/0.60 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.60 # Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 0.21/0.60 # U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 25711 completed with status 0
% 0.21/0.60 # Result found by U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.60 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.60 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.60 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.60 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.60 # Search class: FUUPS-FFSF21-MFFFFFNN
% 0.21/0.60 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.60 # Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 0.21/0.60 # Preprocessing time : 0.001 s
% 0.21/0.60 # Presaturation interreduction done
% 0.21/0.60
% 0.21/0.60 # Proof found!
% 0.21/0.60 # SZS status Unsatisfiable
% 0.21/0.60 # SZS output start CNFRefutation
% See solution above
% 0.21/0.60 # Parsed axioms : 3
% 0.21/0.60 # Removed by relevancy pruning/SinE : 0
% 0.21/0.60 # Initial clauses : 3
% 0.21/0.60 # Removed in clause preprocessing : 0
% 0.21/0.60 # Initial clauses in saturation : 3
% 0.21/0.60 # Processed clauses : 602
% 0.21/0.60 # ...of these trivial : 87
% 0.21/0.60 # ...subsumed : 381
% 0.21/0.60 # ...remaining for further processing : 134
% 0.21/0.60 # Other redundant clauses eliminated : 0
% 0.21/0.60 # Clauses deleted for lack of memory : 0
% 0.21/0.60 # Backward-subsumed : 8
% 0.21/0.60 # Backward-rewritten : 68
% 0.21/0.60 # Generated clauses : 11575
% 0.21/0.60 # ...of the previous two non-redundant : 10736
% 0.21/0.60 # ...aggressively subsumed : 0
% 0.21/0.60 # Contextual simplify-reflections : 0
% 0.21/0.60 # Paramodulations : 11575
% 0.21/0.60 # Factorizations : 0
% 0.21/0.60 # NegExts : 0
% 0.21/0.60 # Equation resolutions : 0
% 0.21/0.60 # Disequality decompositions : 0
% 0.21/0.60 # Total rewrite steps : 5974
% 0.21/0.60 # ...of those cached : 3690
% 0.21/0.60 # Propositional unsat checks : 0
% 0.21/0.60 # Propositional check models : 0
% 0.21/0.60 # Propositional check unsatisfiable : 0
% 0.21/0.60 # Propositional clauses : 0
% 0.21/0.60 # Propositional clauses after purity: 0
% 0.21/0.60 # Propositional unsat core size : 0
% 0.21/0.60 # Propositional preprocessing time : 0.000
% 0.21/0.60 # Propositional encoding time : 0.000
% 0.21/0.60 # Propositional solver time : 0.000
% 0.21/0.60 # Success case prop preproc time : 0.000
% 0.21/0.60 # Success case prop encoding time : 0.000
% 0.21/0.60 # Success case prop solver time : 0.000
% 0.21/0.60 # Current number of processed clauses : 55
% 0.21/0.60 # Positive orientable unit clauses : 45
% 0.21/0.60 # Positive unorientable unit clauses: 10
% 0.21/0.60 # Negative unit clauses : 0
% 0.21/0.60 # Non-unit-clauses : 0
% 0.21/0.60 # Current number of unprocessed clauses: 9818
% 0.21/0.60 # ...number of literals in the above : 9818
% 0.21/0.60 # Current number of archived formulas : 0
% 0.21/0.60 # Current number of archived clauses : 79
% 0.21/0.60 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.60 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.60 # Non-unit clause-clause subsumptions : 0
% 0.21/0.60 # Unit Clause-clause subsumption calls : 248
% 0.21/0.60 # Rewrite failures with RHS unbound : 0
% 0.21/0.60 # BW rewrite match attempts : 386
% 0.21/0.60 # BW rewrite match successes : 137
% 0.21/0.60 # Condensation attempts : 0
% 0.21/0.60 # Condensation successes : 0
% 0.21/0.60 # Termbank termtop insertions : 181891
% 0.21/0.60 # Search garbage collected termcells : 2
% 0.21/0.60
% 0.21/0.60 # -------------------------------------------------
% 0.21/0.60 # User time : 0.109 s
% 0.21/0.60 # System time : 0.008 s
% 0.21/0.60 # Total time : 0.117 s
% 0.21/0.60 # Maximum resident set size: 1620 pages
% 0.21/0.60
% 0.21/0.60 # -------------------------------------------------
% 0.21/0.60 # User time : 0.110 s
% 0.21/0.60 # System time : 0.010 s
% 0.21/0.60 # Total time : 0.120 s
% 0.21/0.60 # Maximum resident set size: 1684 pages
% 0.21/0.60 % E---3.1 exiting
% 0.21/0.60 % E exiting
%------------------------------------------------------------------------------