TSTP Solution File: GRP039-6 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP039-6 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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:51:36 EDT 2024
% Result : Unsatisfiable 1.22s 0.63s
% Output : CNFRefutation 1.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 18
% Syntax : Number of clauses : 77 ( 28 unt; 5 nHn; 64 RR)
% Number of literals : 167 ( 0 equ; 85 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 141 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(well_defined,axiom,
( equalish(X3,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',well_defined) ).
cnf(product_substitution3,axiom,
( product(X3,X4,X2)
| ~ equalish(X1,X2)
| ~ product(X3,X4,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_substitution3) ).
cnf(product_right_cancellation,axiom,
( equalish(X4,X2)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_right_cancellation) ).
cnf(closure_of_product,axiom,
( subgroup_member(X3)
| ~ subgroup_member(X1)
| ~ subgroup_member(X2)
| ~ product(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',closure_of_product) ).
cnf(prove_d_is_in_subgroup,negated_conjecture,
~ subgroup_member(d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_d_is_in_subgroup) ).
cnf(b_times_a_inverse_is_c,negated_conjecture,
product(b,inverse(a),c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_times_a_inverse_is_c) ).
cnf(left_inverse,axiom,
product(inverse(X1),X1,identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_inverse) ).
cnf(b_is_in_subgroup,negated_conjecture,
subgroup_member(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_is_in_subgroup) ).
cnf(closure_of_inverse,axiom,
( subgroup_member(inverse(X1))
| ~ subgroup_member(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',closure_of_inverse) ).
cnf(a_times_c_is_d,negated_conjecture,
product(a,c,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_times_c_is_d) ).
cnf(associativity2,axiom,
( product(X3,X4,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X1,X5,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity2) ).
cnf(right_inverse,axiom,
product(X1,inverse(X1),identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_inverse) ).
cnf(property_of_O2,axiom,
( product(X1,element_in_O2(X1,X2),X2)
| subgroup_member(X2)
| subgroup_member(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',property_of_O2) ).
cnf(subgroup_member_substitution,axiom,
( subgroup_member(X2)
| ~ equalish(X1,X2)
| ~ subgroup_member(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subgroup_member_substitution) ).
cnf(left_identity,axiom,
product(identity,X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_identity) ).
cnf(associativity1,axiom,
( product(X1,X5,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X3,X4,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity1) ).
cnf(right_identity,axiom,
product(X1,identity,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_identity) ).
cnf(an_element_in_O2,axiom,
( subgroup_member(element_in_O2(X1,X2))
| subgroup_member(X2)
| subgroup_member(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',an_element_in_O2) ).
cnf(c_0_18,plain,
( equalish(X3,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
inference(fof_simplification,[status(thm)],[well_defined]) ).
cnf(c_0_19,plain,
( product(X3,X4,X2)
| ~ equalish(X1,X2)
| ~ product(X3,X4,X1) ),
inference(fof_simplification,[status(thm)],[product_substitution3]) ).
cnf(c_0_20,plain,
( equalish(X4,X2)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
inference(fof_simplification,[status(thm)],[product_right_cancellation]) ).
cnf(c_0_21,plain,
( subgroup_member(X3)
| ~ subgroup_member(X1)
| ~ subgroup_member(X2)
| ~ product(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[closure_of_product]) ).
cnf(c_0_22,negated_conjecture,
~ subgroup_member(d),
inference(fof_simplification,[status(thm)],[prove_d_is_in_subgroup]) ).
cnf(c_0_23,plain,
( equalish(X3,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
c_0_18 ).
cnf(c_0_24,negated_conjecture,
product(b,inverse(a),c),
b_times_a_inverse_is_c ).
cnf(c_0_25,plain,
( product(X3,X4,X2)
| ~ equalish(X1,X2)
| ~ product(X3,X4,X1) ),
c_0_19 ).
cnf(c_0_26,plain,
( equalish(X4,X2)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
c_0_20 ).
cnf(c_0_27,axiom,
product(inverse(X1),X1,identity),
left_inverse ).
cnf(c_0_28,plain,
( subgroup_member(X3)
| ~ subgroup_member(X1)
| ~ subgroup_member(X2)
| ~ product(X1,X2,X3) ),
c_0_21 ).
cnf(c_0_29,negated_conjecture,
subgroup_member(b),
b_is_in_subgroup ).
cnf(c_0_30,plain,
( subgroup_member(inverse(X1))
| ~ subgroup_member(X1) ),
inference(fof_simplification,[status(thm)],[closure_of_inverse]) ).
cnf(c_0_31,negated_conjecture,
product(a,c,d),
a_times_c_is_d ).
cnf(c_0_32,negated_conjecture,
~ subgroup_member(d),
c_0_22 ).
cnf(c_0_33,plain,
( product(X3,X4,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X1,X5,X6) ),
inference(fof_simplification,[status(thm)],[associativity2]) ).
cnf(c_0_34,negated_conjecture,
( equalish(X1,c)
| ~ product(b,inverse(a),X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_35,negated_conjecture,
( product(b,inverse(a),X1)
| ~ equalish(c,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_36,plain,
( equalish(X1,X2)
| ~ product(inverse(X1),X2,identity) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_37,axiom,
product(X1,inverse(X1),identity),
right_inverse ).
cnf(c_0_38,axiom,
( product(X1,element_in_O2(X1,X2),X2)
| subgroup_member(X2)
| subgroup_member(X1) ),
property_of_O2 ).
cnf(c_0_39,negated_conjecture,
( subgroup_member(c)
| ~ subgroup_member(inverse(a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_24]),c_0_29])]) ).
cnf(c_0_40,plain,
( subgroup_member(inverse(X1))
| ~ subgroup_member(X1) ),
c_0_30 ).
cnf(c_0_41,negated_conjecture,
( ~ subgroup_member(c)
| ~ subgroup_member(a) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_31]),c_0_32]) ).
cnf(c_0_42,plain,
( product(X3,X4,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X1,X5,X6) ),
c_0_33 ).
cnf(c_0_43,plain,
( subgroup_member(X2)
| ~ equalish(X1,X2)
| ~ subgroup_member(X1) ),
inference(fof_simplification,[status(thm)],[subgroup_member_substitution]) ).
cnf(c_0_44,axiom,
product(identity,X1,X1),
left_identity ).
cnf(c_0_45,negated_conjecture,
( equalish(X1,c)
| ~ equalish(c,X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_46,plain,
equalish(X1,inverse(inverse(X1))),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_47,plain,
( subgroup_member(X1)
| subgroup_member(X2)
| equalish(element_in_O2(X1,X2),X3)
| ~ product(X1,X3,X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_38]) ).
cnf(c_0_48,negated_conjecture,
~ subgroup_member(a),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_49,plain,
( product(X1,X5,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X3,X4,X6) ),
inference(fof_simplification,[status(thm)],[associativity1]) ).
cnf(c_0_50,plain,
( product(X1,X2,X3)
| ~ product(X4,inverse(X2),X1)
| ~ product(X4,identity,X3) ),
inference(spm,[status(thm)],[c_0_42,c_0_27]) ).
cnf(c_0_51,plain,
( subgroup_member(X2)
| ~ equalish(X1,X2)
| ~ subgroup_member(X1) ),
c_0_43 ).
cnf(c_0_52,plain,
( equalish(inverse(X1),X2)
| ~ product(X1,X2,identity) ),
inference(spm,[status(thm)],[c_0_26,c_0_37]) ).
cnf(c_0_53,plain,
( equalish(X1,X2)
| ~ product(identity,X2,X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_44]) ).
cnf(c_0_54,plain,
( product(identity,X1,X2)
| ~ equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_44]) ).
cnf(c_0_55,negated_conjecture,
equalish(inverse(inverse(c)),c),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_56,negated_conjecture,
equalish(element_in_O2(a,d),c),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_31]),c_0_48]),c_0_32]) ).
cnf(c_0_57,plain,
( product(X1,X5,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X3,X4,X6) ),
c_0_49 ).
cnf(c_0_58,negated_conjecture,
( product(X1,a,X2)
| ~ product(b,identity,X2)
| ~ equalish(c,X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_35]) ).
cnf(c_0_59,axiom,
product(X1,identity,X1),
right_identity ).
cnf(c_0_60,plain,
( subgroup_member(X1)
| ~ product(X2,X1,identity)
| ~ subgroup_member(inverse(X2)) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_61,plain,
( subgroup_member(X1)
| ~ product(identity,X1,X2)
| ~ subgroup_member(X2) ),
inference(spm,[status(thm)],[c_0_51,c_0_53]) ).
cnf(c_0_62,negated_conjecture,
product(identity,inverse(inverse(c)),c),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_63,negated_conjecture,
( subgroup_member(c)
| ~ subgroup_member(element_in_O2(a,d)) ),
inference(spm,[status(thm)],[c_0_51,c_0_56]) ).
cnf(c_0_64,axiom,
( subgroup_member(element_in_O2(X1,X2))
| subgroup_member(X2)
| subgroup_member(X1) ),
an_element_in_O2 ).
cnf(c_0_65,plain,
( product(X1,X2,X3)
| ~ product(X1,X4,identity)
| ~ product(X4,X3,X2) ),
inference(spm,[status(thm)],[c_0_57,c_0_44]) ).
cnf(c_0_66,negated_conjecture,
( product(X1,a,b)
| ~ equalish(c,X1) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_67,plain,
( subgroup_member(X1)
| ~ subgroup_member(inverse(inverse(X1))) ),
inference(spm,[status(thm)],[c_0_60,c_0_27]) ).
cnf(c_0_68,negated_conjecture,
( subgroup_member(inverse(inverse(c)))
| ~ subgroup_member(c) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_69,negated_conjecture,
subgroup_member(c),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_32]),c_0_48]) ).
cnf(c_0_70,plain,
( product(X1,X2,X3)
| ~ product(inverse(X1),X3,X2) ),
inference(spm,[status(thm)],[c_0_65,c_0_37]) ).
cnf(c_0_71,negated_conjecture,
product(inverse(inverse(c)),a,b),
inference(spm,[status(thm)],[c_0_66,c_0_46]) ).
cnf(c_0_72,plain,
( subgroup_member(X1)
| ~ subgroup_member(inverse(X1)) ),
inference(spm,[status(thm)],[c_0_67,c_0_40]) ).
cnf(c_0_73,negated_conjecture,
subgroup_member(inverse(inverse(c))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_69])]) ).
cnf(c_0_74,negated_conjecture,
product(inverse(c),b,a),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_75,negated_conjecture,
subgroup_member(inverse(c)),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_76,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_74]),c_0_29]),c_0_75])]),c_0_48]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : GRP039-6 : TPTP v8.2.0. Released v1.0.0.
% 0.08/0.16 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n018.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Sun May 19 05:51:08 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.23/0.50 Running first-order model finding
% 0.23/0.50 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 1.22/0.63 # Version: 3.1.0
% 1.22/0.63 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.22/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.22/0.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.22/0.63 # Starting new_bool_3 with 300s (1) cores
% 1.22/0.63 # Starting new_bool_1 with 300s (1) cores
% 1.22/0.63 # Starting sh5l with 300s (1) cores
% 1.22/0.63 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 16079 completed with status 0
% 1.22/0.63 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.22/0.63 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.22/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.22/0.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.22/0.63 # No SInE strategy applied
% 1.22/0.63 # Search class: FGUNM-FFSS21-SFFFFFNN
% 1.22/0.63 # partial match(1): FGUSM-FFSS21-SFFFFFNN
% 1.22/0.63 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.22/0.63 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 811s (1) cores
% 1.22/0.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.22/0.63 # Starting new_bool_3 with 136s (1) cores
% 1.22/0.63 # Starting new_bool_1 with 136s (1) cores
% 1.22/0.63 # Starting sh5l with 136s (1) cores
% 1.22/0.63 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 16086 completed with status 0
% 1.22/0.63 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.22/0.63 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.22/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.22/0.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.22/0.63 # No SInE strategy applied
% 1.22/0.63 # Search class: FGUNM-FFSS21-SFFFFFNN
% 1.22/0.63 # partial match(1): FGUSM-FFSS21-SFFFFFNN
% 1.22/0.63 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.22/0.63 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 811s (1) cores
% 1.22/0.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.22/0.63 # Preprocessing time : 0.001 s
% 1.22/0.63 # Presaturation interreduction done
% 1.22/0.63
% 1.22/0.63 # Proof found!
% 1.22/0.63 # SZS status Unsatisfiable
% 1.22/0.63 # SZS output start CNFRefutation
% See solution above
% 1.22/0.63 # Parsed axioms : 22
% 1.22/0.63 # Removed by relevancy pruning/SinE : 0
% 1.22/0.63 # Initial clauses : 22
% 1.22/0.63 # Removed in clause preprocessing : 0
% 1.22/0.63 # Initial clauses in saturation : 22
% 1.22/0.63 # Processed clauses : 1646
% 1.22/0.63 # ...of these trivial : 32
% 1.22/0.63 # ...subsumed : 910
% 1.22/0.63 # ...remaining for further processing : 704
% 1.22/0.63 # Other redundant clauses eliminated : 0
% 1.22/0.63 # Clauses deleted for lack of memory : 0
% 1.22/0.63 # Backward-subsumed : 107
% 1.22/0.63 # Backward-rewritten : 22
% 1.22/0.63 # Generated clauses : 5797
% 1.22/0.63 # ...of the previous two non-redundant : 4715
% 1.22/0.63 # ...aggressively subsumed : 0
% 1.22/0.63 # Contextual simplify-reflections : 4
% 1.22/0.63 # Paramodulations : 5797
% 1.22/0.63 # Factorizations : 0
% 1.22/0.63 # NegExts : 0
% 1.22/0.63 # Equation resolutions : 0
% 1.22/0.63 # Disequality decompositions : 0
% 1.22/0.63 # Total rewrite steps : 1774
% 1.22/0.63 # ...of those cached : 1662
% 1.22/0.63 # Propositional unsat checks : 0
% 1.22/0.63 # Propositional check models : 0
% 1.22/0.63 # Propositional check unsatisfiable : 0
% 1.22/0.63 # Propositional clauses : 0
% 1.22/0.63 # Propositional clauses after purity: 0
% 1.22/0.63 # Propositional unsat core size : 0
% 1.22/0.63 # Propositional preprocessing time : 0.000
% 1.22/0.63 # Propositional encoding time : 0.000
% 1.22/0.63 # Propositional solver time : 0.000
% 1.22/0.63 # Success case prop preproc time : 0.000
% 1.22/0.63 # Success case prop encoding time : 0.000
% 1.22/0.63 # Success case prop solver time : 0.000
% 1.22/0.63 # Current number of processed clauses : 553
% 1.22/0.63 # Positive orientable unit clauses : 66
% 1.22/0.63 # Positive unorientable unit clauses: 0
% 1.22/0.63 # Negative unit clauses : 151
% 1.22/0.63 # Non-unit-clauses : 336
% 1.22/0.63 # Current number of unprocessed clauses: 2948
% 1.22/0.63 # ...number of literals in the above : 8487
% 1.22/0.63 # Current number of archived formulas : 0
% 1.22/0.63 # Current number of archived clauses : 151
% 1.22/0.63 # Clause-clause subsumption calls (NU) : 19332
% 1.22/0.63 # Rec. Clause-clause subsumption calls : 15300
% 1.22/0.63 # Non-unit clause-clause subsumptions : 214
% 1.22/0.63 # Unit Clause-clause subsumption calls : 33342
% 1.22/0.63 # Rewrite failures with RHS unbound : 0
% 1.22/0.63 # BW rewrite match attempts : 240
% 1.22/0.63 # BW rewrite match successes : 17
% 1.22/0.63 # Condensation attempts : 0
% 1.22/0.63 # Condensation successes : 0
% 1.22/0.63 # Termbank termtop insertions : 62913
% 1.22/0.63 # Search garbage collected termcells : 42
% 1.22/0.63
% 1.22/0.63 # -------------------------------------------------
% 1.22/0.63 # User time : 0.117 s
% 1.22/0.63 # System time : 0.003 s
% 1.22/0.63 # Total time : 0.120 s
% 1.22/0.63 # Maximum resident set size: 1684 pages
% 1.22/0.63
% 1.22/0.63 # -------------------------------------------------
% 1.22/0.63 # User time : 0.543 s
% 1.22/0.63 # System time : 0.010 s
% 1.22/0.63 # Total time : 0.553 s
% 1.22/0.63 # Maximum resident set size: 1700 pages
% 1.22/0.63 % E---3.1 exiting
%------------------------------------------------------------------------------