TSTP Solution File: GRP127-1.004 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP127-1.004 : TPTP v8.1.2. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:38:14 EDT 2023
% Result : Unsatisfiable 0.22s 0.52s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 17
% Syntax : Number of clauses : 70 ( 29 unt; 31 nHn; 68 RR)
% Number of literals : 177 ( 0 equ; 49 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 45 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(product_total_function1,axiom,
( product(X1,X2,e_1)
| product(X1,X2,e_2)
| product(X1,X2,e_3)
| product(X1,X2,e_4)
| ~ group_element(X1)
| ~ group_element(X2) ),
file('/export/starexec/sandbox/tmp/tmp.Y0wd7DZ0Or/E---3.1_9682.p',product_total_function1) ).
cnf(element_1,axiom,
group_element(e_1),
file('/export/starexec/sandbox/tmp/tmp.Y0wd7DZ0Or/E---3.1_9682.p',element_1) ).
cnf(product_left_cancellation,axiom,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.Y0wd7DZ0Or/E---3.1_9682.p',product_left_cancellation) ).
cnf(product_idempotence,axiom,
product(X1,X1,X1),
file('/export/starexec/sandbox/tmp/tmp.Y0wd7DZ0Or/E---3.1_9682.p',product_idempotence) ).
cnf(element_4,axiom,
group_element(e_4),
file('/export/starexec/sandbox/tmp/tmp.Y0wd7DZ0Or/E---3.1_9682.p',element_4) ).
cnf(product_right_cancellation,axiom,
( equalish(X2,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
file('/export/starexec/sandbox/tmp/tmp.Y0wd7DZ0Or/E---3.1_9682.p',product_right_cancellation) ).
cnf(e_4_is_not_e_1,axiom,
~ equalish(e_4,e_1),
file('/export/starexec/sandbox/tmp/tmp.Y0wd7DZ0Or/E---3.1_9682.p',e_4_is_not_e_1) ).
cnf(element_2,axiom,
group_element(e_2),
file('/export/starexec/sandbox/tmp/tmp.Y0wd7DZ0Or/E---3.1_9682.p',element_2) ).
cnf(element_3,axiom,
group_element(e_3),
file('/export/starexec/sandbox/tmp/tmp.Y0wd7DZ0Or/E---3.1_9682.p',element_3) ).
cnf(e_1_is_not_e_4,axiom,
~ equalish(e_1,e_4),
file('/export/starexec/sandbox/tmp/tmp.Y0wd7DZ0Or/E---3.1_9682.p',e_1_is_not_e_4) ).
cnf(e_3_is_not_e_1,axiom,
~ equalish(e_3,e_1),
file('/export/starexec/sandbox/tmp/tmp.Y0wd7DZ0Or/E---3.1_9682.p',e_3_is_not_e_1) ).
cnf(qg3,negated_conjecture,
( product(X4,X1,X2)
| ~ product(X1,X2,X3)
| ~ product(X3,X1,X4) ),
file('/export/starexec/sandbox/tmp/tmp.Y0wd7DZ0Or/E---3.1_9682.p',qg3) ).
cnf(e_2_is_not_e_1,axiom,
~ equalish(e_2,e_1),
file('/export/starexec/sandbox/tmp/tmp.Y0wd7DZ0Or/E---3.1_9682.p',e_2_is_not_e_1) ).
cnf(e_1_is_not_e_2,axiom,
~ equalish(e_1,e_2),
file('/export/starexec/sandbox/tmp/tmp.Y0wd7DZ0Or/E---3.1_9682.p',e_1_is_not_e_2) ).
cnf(e_3_is_not_e_4,axiom,
~ equalish(e_3,e_4),
file('/export/starexec/sandbox/tmp/tmp.Y0wd7DZ0Or/E---3.1_9682.p',e_3_is_not_e_4) ).
cnf(e_4_is_not_e_3,axiom,
~ equalish(e_4,e_3),
file('/export/starexec/sandbox/tmp/tmp.Y0wd7DZ0Or/E---3.1_9682.p',e_4_is_not_e_3) ).
cnf(e_1_is_not_e_3,axiom,
~ equalish(e_1,e_3),
file('/export/starexec/sandbox/tmp/tmp.Y0wd7DZ0Or/E---3.1_9682.p',e_1_is_not_e_3) ).
cnf(c_0_17,axiom,
( product(X1,X2,e_1)
| product(X1,X2,e_2)
| product(X1,X2,e_3)
| product(X1,X2,e_4)
| ~ group_element(X1)
| ~ group_element(X2) ),
product_total_function1 ).
cnf(c_0_18,axiom,
group_element(e_1),
element_1 ).
cnf(c_0_19,axiom,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
product_left_cancellation ).
cnf(c_0_20,axiom,
product(X1,X1,X1),
product_idempotence ).
cnf(c_0_21,plain,
( product(X1,e_1,e_4)
| product(X1,e_1,e_3)
| product(X1,e_1,e_2)
| product(X1,e_1,e_1)
| ~ group_element(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,axiom,
group_element(e_4),
element_4 ).
cnf(c_0_23,axiom,
( equalish(X2,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
product_right_cancellation ).
cnf(c_0_24,plain,
( equalish(X1,X2)
| ~ product(X1,X2,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
( product(e_4,e_1,e_1)
| product(e_4,e_1,e_2)
| product(e_4,e_1,e_3)
| product(e_4,e_1,e_4) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,axiom,
~ equalish(e_4,e_1),
e_4_is_not_e_1 ).
cnf(c_0_27,axiom,
group_element(e_2),
element_2 ).
cnf(c_0_28,axiom,
group_element(e_3),
element_3 ).
cnf(c_0_29,plain,
( equalish(X1,X2)
| ~ product(X2,X1,X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_20]) ).
cnf(c_0_30,plain,
( product(e_4,e_1,e_4)
| product(e_4,e_1,e_3)
| product(e_4,e_1,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_31,axiom,
~ equalish(e_1,e_4),
e_1_is_not_e_4 ).
cnf(c_0_32,plain,
( product(X1,e_2,e_4)
| product(X1,e_2,e_3)
| product(X1,e_2,e_2)
| product(X1,e_2,e_1)
| ~ group_element(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_27]) ).
cnf(c_0_33,plain,
( product(e_3,e_1,e_1)
| product(e_3,e_1,e_2)
| product(e_3,e_1,e_3)
| product(e_3,e_1,e_4) ),
inference(spm,[status(thm)],[c_0_21,c_0_28]) ).
cnf(c_0_34,axiom,
~ equalish(e_3,e_1),
e_3_is_not_e_1 ).
cnf(c_0_35,negated_conjecture,
( product(X4,X1,X2)
| ~ product(X1,X2,X3)
| ~ product(X3,X1,X4) ),
qg3 ).
cnf(c_0_36,plain,
( product(e_4,e_1,e_2)
| product(e_4,e_1,e_3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_37,plain,
( product(e_1,e_2,e_1)
| product(e_1,e_2,e_2)
| product(e_1,e_2,e_3)
| product(e_1,e_2,e_4) ),
inference(spm,[status(thm)],[c_0_32,c_0_18]) ).
cnf(c_0_38,axiom,
~ equalish(e_2,e_1),
e_2_is_not_e_1 ).
cnf(c_0_39,plain,
( product(X1,e_3,e_4)
| product(X1,e_3,e_3)
| product(X1,e_3,e_2)
| product(X1,e_3,e_1)
| ~ group_element(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_28]) ).
cnf(c_0_40,plain,
( product(e_3,e_1,e_4)
| product(e_3,e_1,e_3)
| product(e_3,e_1,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_33]),c_0_34]) ).
cnf(c_0_41,negated_conjecture,
( product(e_4,e_1,e_2)
| product(e_3,e_1,X1)
| ~ product(e_1,X1,e_4) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,plain,
( product(e_1,e_2,e_4)
| product(e_1,e_2,e_3)
| product(e_1,e_2,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_37]),c_0_38]) ).
cnf(c_0_43,plain,
( product(e_4,e_3,e_1)
| product(e_4,e_3,e_2)
| product(e_4,e_3,e_3)
| product(e_4,e_3,e_4) ),
inference(spm,[status(thm)],[c_0_39,c_0_22]) ).
cnf(c_0_44,plain,
( product(X1,e_4,e_4)
| product(X1,e_4,e_3)
| product(X1,e_4,e_2)
| product(X1,e_4,e_1)
| ~ group_element(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_22]) ).
cnf(c_0_45,negated_conjecture,
( product(e_3,e_1,e_2)
| product(e_3,e_1,e_3)
| product(e_4,e_1,X1)
| ~ product(e_1,X1,e_3) ),
inference(spm,[status(thm)],[c_0_35,c_0_40]) ).
cnf(c_0_46,negated_conjecture,
( product(e_1,e_2,e_2)
| product(e_1,e_2,e_3)
| product(e_3,e_1,e_2)
| product(e_4,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,negated_conjecture,
( product(e_4,e_3,e_4)
| product(e_4,e_3,e_3)
| product(e_4,e_3,e_2)
| product(e_1,e_3,X1)
| ~ product(e_3,X1,e_4) ),
inference(spm,[status(thm)],[c_0_35,c_0_43]) ).
cnf(c_0_48,plain,
( product(e_3,e_4,e_1)
| product(e_3,e_4,e_2)
| product(e_3,e_4,e_3)
| product(e_3,e_4,e_4) ),
inference(spm,[status(thm)],[c_0_44,c_0_28]) ).
cnf(c_0_49,negated_conjecture,
( product(e_1,e_2,e_2)
| product(e_4,e_1,e_2)
| product(e_3,e_1,e_3)
| product(e_3,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,axiom,
~ equalish(e_1,e_2),
e_1_is_not_e_2 ).
cnf(c_0_51,negated_conjecture,
( product(e_4,e_3,e_2)
| product(e_4,e_3,e_3)
| product(e_4,e_3,e_4)
| ~ product(e_3,e_1,e_4) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_47]),c_0_34]) ).
cnf(c_0_52,axiom,
~ equalish(e_3,e_4),
e_3_is_not_e_4 ).
cnf(c_0_53,negated_conjecture,
( product(e_3,e_4,e_4)
| product(e_3,e_4,e_3)
| product(e_3,e_4,e_2)
| product(e_1,e_4,X1)
| ~ product(e_4,X1,e_3) ),
inference(spm,[status(thm)],[c_0_35,c_0_48]) ).
cnf(c_0_54,negated_conjecture,
( product(e_3,e_1,e_2)
| product(e_3,e_1,e_3)
| product(e_4,e_1,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_49]),c_0_50]) ).
cnf(c_0_55,negated_conjecture,
( product(e_4,e_3,e_3)
| product(e_4,e_3,e_2)
| ~ product(e_3,e_1,e_4) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_51]),c_0_52]) ).
cnf(c_0_56,axiom,
~ equalish(e_4,e_3),
e_4_is_not_e_3 ).
cnf(c_0_57,negated_conjecture,
( product(e_3,e_4,e_2)
| product(e_3,e_4,e_3)
| product(e_3,e_4,e_4)
| ~ product(e_4,e_1,e_3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_53]),c_0_26]) ).
cnf(c_0_58,negated_conjecture,
( product(e_3,e_1,e_3)
| product(e_3,e_1,e_2)
| equalish(X1,e_1)
| ~ product(e_4,X1,e_2) ),
inference(spm,[status(thm)],[c_0_23,c_0_54]) ).
cnf(c_0_59,negated_conjecture,
( product(e_4,e_3,e_2)
| ~ product(e_3,e_1,e_4) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_55]),c_0_56]) ).
cnf(c_0_60,negated_conjecture,
( product(e_4,e_1,e_2)
| product(e_3,e_4,e_4)
| product(e_3,e_4,e_3)
| product(e_3,e_4,e_2) ),
inference(spm,[status(thm)],[c_0_57,c_0_36]) ).
cnf(c_0_61,negated_conjecture,
( product(e_3,e_1,e_2)
| product(e_3,e_1,e_3) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_34]),c_0_40]) ).
cnf(c_0_62,axiom,
~ equalish(e_1,e_3),
e_1_is_not_e_3 ).
cnf(c_0_63,negated_conjecture,
( product(e_3,e_4,e_2)
| product(e_3,e_4,e_3)
| product(e_3,e_4,e_4)
| equalish(X1,e_4)
| ~ product(X1,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_19,c_0_60]) ).
cnf(c_0_64,negated_conjecture,
product(e_3,e_1,e_2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_61]),c_0_62]) ).
cnf(c_0_65,negated_conjecture,
( product(e_3,e_4,e_4)
| product(e_3,e_4,e_3)
| product(e_3,e_4,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_52]) ).
cnf(c_0_66,negated_conjecture,
( product(e_3,e_4,e_2)
| product(e_3,e_4,e_3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_65]),c_0_52]) ).
cnf(c_0_67,negated_conjecture,
( equalish(X1,e_1)
| ~ product(e_3,X1,e_2) ),
inference(spm,[status(thm)],[c_0_23,c_0_64]) ).
cnf(c_0_68,negated_conjecture,
product(e_3,e_4,e_2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_66]),c_0_56]) ).
cnf(c_0_69,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP127-1.004 : TPTP v8.1.2. Released v1.2.0.
% 0.00/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n025.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Oct 3 02:25:21 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.Y0wd7DZ0Or/E---3.1_9682.p
% 0.22/0.52 # Version: 3.1pre001
% 0.22/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.52 # Starting sh5l with 300s (1) cores
% 0.22/0.52 # sh5l with pid 9767 completed with status 0
% 0.22/0.52 # Result found by sh5l
% 0.22/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.52 # Starting sh5l with 300s (1) cores
% 0.22/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.52 # Search class: FGUNF-FFSS00-SFFFFFNN
% 0.22/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.52 # SAT001_MinMin_p005000_rr_RG with pid 9771 completed with status 0
% 0.22/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.22/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.52 # Starting sh5l with 300s (1) cores
% 0.22/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.52 # Search class: FGUNF-FFSS00-SFFFFFNN
% 0.22/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.52 # Preprocessing time : 0.001 s
% 0.22/0.52 # Presaturation interreduction done
% 0.22/0.52
% 0.22/0.52 # Proof found!
% 0.22/0.52 # SZS status Unsatisfiable
% 0.22/0.52 # SZS output start CNFRefutation
% See solution above
% 0.22/0.52 # Parsed axioms : 22
% 0.22/0.52 # Removed by relevancy pruning/SinE : 0
% 0.22/0.52 # Initial clauses : 22
% 0.22/0.52 # Removed in clause preprocessing : 0
% 0.22/0.52 # Initial clauses in saturation : 22
% 0.22/0.52 # Processed clauses : 229
% 0.22/0.52 # ...of these trivial : 0
% 0.22/0.52 # ...subsumed : 33
% 0.22/0.52 # ...remaining for further processing : 196
% 0.22/0.52 # Other redundant clauses eliminated : 0
% 0.22/0.52 # Clauses deleted for lack of memory : 0
% 0.22/0.52 # Backward-subsumed : 50
% 0.22/0.52 # Backward-rewritten : 11
% 0.22/0.52 # Generated clauses : 642
% 0.22/0.52 # ...of the previous two non-redundant : 505
% 0.22/0.52 # ...aggressively subsumed : 0
% 0.22/0.52 # Contextual simplify-reflections : 3
% 0.22/0.52 # Paramodulations : 642
% 0.22/0.52 # Factorizations : 0
% 0.22/0.52 # NegExts : 0
% 0.22/0.52 # Equation resolutions : 0
% 0.22/0.52 # Total rewrite steps : 150
% 0.22/0.52 # Propositional unsat checks : 0
% 0.22/0.52 # Propositional check models : 0
% 0.22/0.52 # Propositional check unsatisfiable : 0
% 0.22/0.52 # Propositional clauses : 0
% 0.22/0.52 # Propositional clauses after purity: 0
% 0.22/0.52 # Propositional unsat core size : 0
% 0.22/0.52 # Propositional preprocessing time : 0.000
% 0.22/0.52 # Propositional encoding time : 0.000
% 0.22/0.52 # Propositional solver time : 0.000
% 0.22/0.52 # Success case prop preproc time : 0.000
% 0.22/0.52 # Success case prop encoding time : 0.000
% 0.22/0.52 # Success case prop solver time : 0.000
% 0.22/0.52 # Current number of processed clauses : 113
% 0.22/0.52 # Positive orientable unit clauses : 8
% 0.22/0.52 # Positive unorientable unit clauses: 0
% 0.22/0.52 # Negative unit clauses : 12
% 0.22/0.52 # Non-unit-clauses : 93
% 0.22/0.52 # Current number of unprocessed clauses: 248
% 0.22/0.52 # ...number of literals in the above : 1310
% 0.22/0.52 # Current number of archived formulas : 0
% 0.22/0.52 # Current number of archived clauses : 83
% 0.22/0.52 # Clause-clause subsumption calls (NU) : 3724
% 0.22/0.52 # Rec. Clause-clause subsumption calls : 1625
% 0.22/0.52 # Non-unit clause-clause subsumptions : 84
% 0.22/0.52 # Unit Clause-clause subsumption calls : 137
% 0.22/0.52 # Rewrite failures with RHS unbound : 0
% 0.22/0.52 # BW rewrite match attempts : 21
% 0.22/0.52 # BW rewrite match successes : 2
% 0.22/0.52 # Condensation attempts : 0
% 0.22/0.52 # Condensation successes : 0
% 0.22/0.52 # Termbank termtop insertions : 10905
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.016 s
% 0.22/0.52 # System time : 0.005 s
% 0.22/0.52 # Total time : 0.021 s
% 0.22/0.52 # Maximum resident set size: 1640 pages
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.016 s
% 0.22/0.52 # System time : 0.009 s
% 0.22/0.52 # Total time : 0.024 s
% 0.22/0.52 # Maximum resident set size: 1684 pages
% 0.22/0.52 % E---3.1 exiting
% 0.22/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------