TSTP Solution File: GRP753-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP753-1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:12 EDT 2024
% Result : Unsatisfiable 12.08s 2.53s
% Output : CNFRefutation 12.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 7
% Syntax : Number of clauses : 71 ( 71 unt; 0 nHn; 4 RR)
% Number of literals : 71 ( 70 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 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 : 194 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(f06,axiom,
mult(mult(X1,X2),X3) = mult(mult(X1,X3),mult(X2,ld(X3,X3))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f06) ).
cnf(f03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).
cnf(f04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).
cnf(f05,axiom,
mult(X1,mult(X2,X3)) = mult(mult(rd(X1,X1),X2),mult(X1,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
cnf(f01,axiom,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).
cnf(f02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).
cnf(goals,negated_conjecture,
mult(mult(a,mult(a,a)),mult(b,c)) != mult(mult(a,b),mult(mult(a,a),c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(c_0_7,axiom,
mult(mult(X1,X2),X3) = mult(mult(X1,X3),mult(X2,ld(X3,X3))),
f06 ).
cnf(c_0_8,axiom,
mult(rd(X1,X2),X2) = X1,
f03 ).
cnf(c_0_9,axiom,
rd(mult(X1,X2),X2) = X1,
f04 ).
cnf(c_0_10,plain,
mult(mult(rd(X1,X2),X3),X2) = mult(X1,mult(X3,ld(X2,X2))),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,plain,
rd(mult(X1,mult(X2,ld(X3,X3))),X3) = mult(rd(X1,X3),X2),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,axiom,
mult(X1,mult(X2,X3)) = mult(mult(rd(X1,X1),X2),mult(X1,X3)),
f05 ).
cnf(c_0_13,plain,
mult(rd(rd(X1,mult(X2,ld(X3,X3))),X3),X2) = rd(X1,X3),
inference(spm,[status(thm)],[c_0_11,c_0_8]) ).
cnf(c_0_14,plain,
rd(mult(X1,mult(X2,X3)),mult(X1,X3)) = mult(rd(X1,X1),X2),
inference(spm,[status(thm)],[c_0_9,c_0_12]) ).
cnf(c_0_15,plain,
mult(rd(mult(rd(X1,X1),X2),X3),X1) = mult(rd(X1,X3),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_11]) ).
cnf(c_0_16,axiom,
mult(X1,ld(X1,X2)) = X2,
f01 ).
cnf(c_0_17,plain,
mult(rd(X1,X2),ld(rd(X1,X1),X3)) = mult(rd(X3,X2),X1),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,plain,
rd(X1,ld(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_9,c_0_16]) ).
cnf(c_0_19,plain,
mult(rd(X1,ld(X2,X3)),X3) = mult(X2,ld(rd(X3,X3),X1)),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,axiom,
ld(X1,mult(X1,X2)) = X2,
f02 ).
cnf(c_0_21,plain,
mult(X1,ld(rd(X2,X2),mult(X3,ld(X1,X2)))) = mult(X3,X2),
inference(spm,[status(thm)],[c_0_19,c_0_9]) ).
cnf(c_0_22,plain,
ld(rd(X1,X1),mult(X2,ld(X3,X1))) = ld(X3,mult(X2,X1)),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,plain,
ld(mult(X1,X2),mult(mult(X1,X3),X2)) = mult(X3,ld(X2,X2)),
inference(spm,[status(thm)],[c_0_20,c_0_7]) ).
cnf(c_0_24,plain,
mult(rd(X1,X1),ld(X2,mult(X3,X1))) = mult(X3,ld(X2,X1)),
inference(spm,[status(thm)],[c_0_16,c_0_22]) ).
cnf(c_0_25,plain,
mult(ld(X1,X2),ld(X3,X3)) = ld(mult(X1,X3),mult(X2,X3)),
inference(spm,[status(thm)],[c_0_23,c_0_16]) ).
cnf(c_0_26,plain,
mult(X1,ld(mult(X2,X1),mult(mult(X3,X1),X1))) = mult(mult(X3,ld(X2,X1)),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_24]),c_0_25]) ).
cnf(c_0_27,plain,
ld(mult(X1,X2),mult(mult(X3,X2),X2)) = ld(X2,mult(mult(X3,ld(X1,X2)),X2)),
inference(spm,[status(thm)],[c_0_20,c_0_26]) ).
cnf(c_0_28,plain,
mult(mult(X1,X2),ld(mult(X3,X2),mult(X4,X2))) = mult(mult(X1,ld(X3,X4)),X2),
inference(spm,[status(thm)],[c_0_7,c_0_25]) ).
cnf(c_0_29,plain,
mult(mult(X1,X2),ld(X2,mult(mult(X3,ld(X1,X2)),X2))) = mult(mult(X3,X2),X2),
inference(spm,[status(thm)],[c_0_16,c_0_27]) ).
cnf(c_0_30,plain,
mult(mult(X1,ld(rd(X2,X3),X4)),X3) = mult(mult(X1,X3),ld(X2,mult(X4,X3))),
inference(spm,[status(thm)],[c_0_28,c_0_8]) ).
cnf(c_0_31,plain,
mult(mult(rd(X1,X1),X2),X3) = mult(X1,mult(X2,ld(X1,X3))),
inference(spm,[status(thm)],[c_0_12,c_0_16]) ).
cnf(c_0_32,plain,
mult(X1,ld(X2,mult(mult(X3,X2),ld(X1,mult(X2,X2))))) = mult(mult(X3,X2),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_8]) ).
cnf(c_0_33,plain,
mult(X1,mult(X2,ld(X1,ld(mult(rd(X1,X1),X2),X3)))) = X3,
inference(spm,[status(thm)],[c_0_16,c_0_31]) ).
cnf(c_0_34,plain,
mult(X1,ld(X2,mult(X3,ld(X1,mult(X2,X2))))) = mult(X3,X2),
inference(spm,[status(thm)],[c_0_32,c_0_8]) ).
cnf(c_0_35,plain,
ld(rd(X1,X2),X1) = X2,
inference(spm,[status(thm)],[c_0_20,c_0_8]) ).
cnf(c_0_36,plain,
mult(X1,ld(X2,ld(mult(rd(X2,X2),X1),X3))) = ld(X2,X3),
inference(spm,[status(thm)],[c_0_20,c_0_33]) ).
cnf(c_0_37,plain,
mult(rd(X1,ld(X2,mult(rd(X1,X1),X3))),X3) = mult(X2,X1),
inference(spm,[status(thm)],[c_0_15,c_0_18]) ).
cnf(c_0_38,plain,
mult(rd(mult(X1,X1),X2),ld(X1,mult(X3,X2))) = mult(X3,X1),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
mult(X1,ld(X2,mult(X3,ld(X1,X1)))) = mult(X3,ld(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_23]),c_0_31]),c_0_20]) ).
cnf(c_0_40,plain,
rd(X1,ld(X2,mult(rd(X1,X1),X3))) = rd(mult(X2,X1),X3),
inference(spm,[status(thm)],[c_0_9,c_0_37]) ).
cnf(c_0_41,plain,
rd(mult(X1,X2),ld(X2,mult(X1,X3))) = rd(mult(X2,X2),X3),
inference(spm,[status(thm)],[c_0_9,c_0_38]) ).
cnf(c_0_42,plain,
mult(rd(X1,X1),rd(X2,X3)) = rd(mult(X1,X2),mult(X1,X3)),
inference(spm,[status(thm)],[c_0_14,c_0_8]) ).
cnf(c_0_43,plain,
ld(X1,mult(X2,ld(X3,mult(X1,X1)))) = ld(X3,mult(X2,X1)),
inference(spm,[status(thm)],[c_0_20,c_0_34]) ).
cnf(c_0_44,plain,
mult(X1,ld(rd(mult(X1,ld(X2,X2)),X3),X2)) = mult(X2,X3),
inference(spm,[status(thm)],[c_0_39,c_0_35]) ).
cnf(c_0_45,plain,
rd(mult(rd(X1,X1),X2),ld(X3,X1)) = rd(mult(X3,X2),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_22]),c_0_40]) ).
cnf(c_0_46,plain,
mult(rd(mult(X1,X1),X2),X3) = mult(rd(mult(X1,X3),X2),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_41]),c_0_40]) ).
cnf(c_0_47,plain,
mult(rd(mult(X1,X2),mult(X1,X3)),X4) = mult(X1,mult(rd(X2,X3),ld(X1,X4))),
inference(spm,[status(thm)],[c_0_31,c_0_42]) ).
cnf(c_0_48,plain,
rd(mult(X1,X2),ld(X3,mult(X1,X1))) = rd(mult(X3,X2),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_43]),c_0_40]) ).
cnf(c_0_49,plain,
ld(rd(mult(X1,ld(X2,X2)),X3),X2) = ld(X1,mult(X2,X3)),
inference(spm,[status(thm)],[c_0_20,c_0_44]) ).
cnf(c_0_50,plain,
mult(rd(X1,X2),rd(X3,X2)) = rd(mult(X1,X3),mult(X2,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_48]),c_0_11]) ).
cnf(c_0_51,plain,
rd(mult(X1,ld(X2,X2)),X3) = rd(X2,ld(X1,mult(X2,X3))),
inference(spm,[status(thm)],[c_0_18,c_0_49]) ).
cnf(c_0_52,plain,
rd(mult(X1,mult(X2,X3)),mult(X3,X3)) = mult(rd(X1,X3),X2),
inference(spm,[status(thm)],[c_0_50,c_0_9]) ).
cnf(c_0_53,plain,
mult(rd(X1,ld(X2,mult(X1,X3))),X3) = mult(X2,ld(X1,X1)),
inference(spm,[status(thm)],[c_0_8,c_0_51]) ).
cnf(c_0_54,plain,
mult(mult(rd(X1,X2),X3),mult(X2,X2)) = mult(X1,mult(X3,X2)),
inference(spm,[status(thm)],[c_0_8,c_0_52]) ).
cnf(c_0_55,plain,
mult(rd(X1,ld(X2,X3)),ld(X1,X3)) = mult(X2,ld(X1,X1)),
inference(spm,[status(thm)],[c_0_53,c_0_16]) ).
cnf(c_0_56,plain,
mult(mult(X1,X1),mult(X2,X3)) = mult(mult(X1,X2),mult(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_46]),c_0_54]) ).
cnf(c_0_57,plain,
mult(rd(X1,X2),ld(X1,mult(X3,X2))) = mult(X3,ld(X1,X1)),
inference(spm,[status(thm)],[c_0_55,c_0_20]) ).
cnf(c_0_58,plain,
mult(mult(X1,X2),mult(X1,ld(X2,X3))) = mult(mult(X1,X1),X3),
inference(spm,[status(thm)],[c_0_56,c_0_16]) ).
cnf(c_0_59,plain,
mult(X1,ld(X2,mult(X3,X1))) = mult(X3,ld(X2,mult(X1,X1))),
inference(spm,[status(thm)],[c_0_16,c_0_43]) ).
cnf(c_0_60,plain,
mult(X1,ld(X2,mult(X3,ld(X1,X2)))) = mult(X3,ld(X2,X2)),
inference(spm,[status(thm)],[c_0_57,c_0_18]) ).
cnf(c_0_61,plain,
mult(rd(mult(X1,X1),X2),ld(X1,X3)) = mult(rd(X3,X2),X1),
inference(spm,[status(thm)],[c_0_38,c_0_8]) ).
cnf(c_0_62,plain,
mult(mult(X1,X2),mult(X3,ld(X2,mult(X1,X1)))) = mult(mult(X1,X1),mult(X3,X1)),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_63,plain,
mult(rd(X1,ld(X2,X3)),ld(X3,X3)) = mult(X2,ld(X3,X1)),
inference(spm,[status(thm)],[c_0_60,c_0_8]) ).
cnf(c_0_64,plain,
mult(rd(X1,ld(X2,mult(X3,X3))),X3) = mult(X2,ld(X3,X1)),
inference(spm,[status(thm)],[c_0_61,c_0_18]) ).
cnf(c_0_65,plain,
mult(mult(X1,X1),mult(X2,ld(X1,X3))) = mult(mult(X1,X2),X3),
inference(spm,[status(thm)],[c_0_56,c_0_16]) ).
cnf(c_0_66,negated_conjecture,
mult(mult(a,mult(a,a)),mult(b,c)) != mult(mult(a,b),mult(mult(a,a),c)),
inference(fof_simplification,[status(thm)],[goals]) ).
cnf(c_0_67,plain,
mult(mult(X1,mult(X1,X1)),mult(X2,ld(mult(X1,X1),X3))) = mult(mult(X1,X2),X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64]),c_0_65]) ).
cnf(c_0_68,negated_conjecture,
mult(mult(a,mult(a,a)),mult(b,c)) != mult(mult(a,b),mult(mult(a,a),c)),
c_0_66 ).
cnf(c_0_69,plain,
mult(mult(X1,mult(X1,X1)),mult(X2,X3)) = mult(mult(X1,X2),mult(mult(X1,X1),X3)),
inference(spm,[status(thm)],[c_0_67,c_0_20]) ).
cnf(c_0_70,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_69])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP753-1 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n022.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 06:10:07 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/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
% 12.08/2.53 # Version: 3.1.0
% 12.08/2.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 12.08/2.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.08/2.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 12.08/2.53 # Starting new_bool_3 with 300s (1) cores
% 12.08/2.53 # Starting new_bool_1 with 300s (1) cores
% 12.08/2.53 # Starting sh5l with 300s (1) cores
% 12.08/2.53 # new_bool_3 with pid 8034 completed with status 8
% 12.08/2.53 # new_bool_1 with pid 8035 completed with status 8
% 12.08/2.53 # sh5l with pid 8036 completed with status 0
% 12.08/2.53 # Result found by sh5l
% 12.08/2.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 12.08/2.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.08/2.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 12.08/2.53 # Starting new_bool_3 with 300s (1) cores
% 12.08/2.53 # Starting new_bool_1 with 300s (1) cores
% 12.08/2.53 # Starting sh5l with 300s (1) cores
% 12.08/2.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 12.08/2.53 # Search class: FUUPM-FFSF22-MFFFFFNN
% 12.08/2.53 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 12.08/2.53 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 82s (1) cores
% 12.08/2.53 # G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with pid 8043 completed with status 0
% 12.08/2.53 # Result found by G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 12.08/2.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 12.08/2.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.08/2.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 12.08/2.53 # Starting new_bool_3 with 300s (1) cores
% 12.08/2.53 # Starting new_bool_1 with 300s (1) cores
% 12.08/2.53 # Starting sh5l with 300s (1) cores
% 12.08/2.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 12.08/2.53 # Search class: FUUPM-FFSF22-MFFFFFNN
% 12.08/2.53 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 12.08/2.53 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 82s (1) cores
% 12.08/2.53 # Preprocessing time : 0.001 s
% 12.08/2.53 # Presaturation interreduction done
% 12.08/2.53
% 12.08/2.53 # Proof found!
% 12.08/2.53 # SZS status Unsatisfiable
% 12.08/2.53 # SZS output start CNFRefutation
% See solution above
% 12.08/2.53 # Parsed axioms : 7
% 12.08/2.53 # Removed by relevancy pruning/SinE : 0
% 12.08/2.53 # Initial clauses : 7
% 12.08/2.53 # Removed in clause preprocessing : 0
% 12.08/2.53 # Initial clauses in saturation : 7
% 12.08/2.53 # Processed clauses : 869
% 12.08/2.53 # ...of these trivial : 254
% 12.08/2.53 # ...subsumed : 193
% 12.08/2.53 # ...remaining for further processing : 422
% 12.08/2.53 # Other redundant clauses eliminated : 0
% 12.08/2.53 # Clauses deleted for lack of memory : 0
% 12.08/2.53 # Backward-subsumed : 1
% 12.08/2.53 # Backward-rewritten : 67
% 12.08/2.53 # Generated clauses : 137255
% 12.08/2.53 # ...of the previous two non-redundant : 130506
% 12.08/2.53 # ...aggressively subsumed : 0
% 12.08/2.53 # Contextual simplify-reflections : 0
% 12.08/2.53 # Paramodulations : 137255
% 12.08/2.53 # Factorizations : 0
% 12.08/2.53 # NegExts : 0
% 12.08/2.53 # Equation resolutions : 0
% 12.08/2.53 # Disequality decompositions : 0
% 12.08/2.53 # Total rewrite steps : 117648
% 12.08/2.53 # ...of those cached : 86656
% 12.08/2.53 # Propositional unsat checks : 0
% 12.08/2.53 # Propositional check models : 0
% 12.08/2.53 # Propositional check unsatisfiable : 0
% 12.08/2.53 # Propositional clauses : 0
% 12.08/2.53 # Propositional clauses after purity: 0
% 12.08/2.53 # Propositional unsat core size : 0
% 12.08/2.53 # Propositional preprocessing time : 0.000
% 12.08/2.53 # Propositional encoding time : 0.000
% 12.08/2.53 # Propositional solver time : 0.000
% 12.08/2.53 # Success case prop preproc time : 0.000
% 12.08/2.53 # Success case prop encoding time : 0.000
% 12.08/2.53 # Success case prop solver time : 0.000
% 12.08/2.53 # Current number of processed clauses : 347
% 12.08/2.53 # Positive orientable unit clauses : 327
% 12.08/2.53 # Positive unorientable unit clauses: 20
% 12.08/2.53 # Negative unit clauses : 0
% 12.08/2.53 # Non-unit-clauses : 0
% 12.08/2.53 # Current number of unprocessed clauses: 129482
% 12.08/2.53 # ...number of literals in the above : 129482
% 12.08/2.53 # Current number of archived formulas : 0
% 12.08/2.53 # Current number of archived clauses : 75
% 12.08/2.53 # Clause-clause subsumption calls (NU) : 0
% 12.08/2.53 # Rec. Clause-clause subsumption calls : 0
% 12.08/2.53 # Non-unit clause-clause subsumptions : 0
% 12.08/2.53 # Unit Clause-clause subsumption calls : 480
% 12.08/2.53 # Rewrite failures with RHS unbound : 1
% 12.08/2.53 # BW rewrite match attempts : 2209
% 12.08/2.53 # BW rewrite match successes : 127
% 12.08/2.53 # Condensation attempts : 0
% 12.08/2.53 # Condensation successes : 0
% 12.08/2.53 # Termbank termtop insertions : 3062144
% 12.08/2.53 # Search garbage collected termcells : 2
% 12.08/2.53
% 12.08/2.53 # -------------------------------------------------
% 12.08/2.53 # User time : 1.933 s
% 12.08/2.53 # System time : 0.086 s
% 12.08/2.53 # Total time : 2.019 s
% 12.08/2.53 # Maximum resident set size: 1612 pages
% 12.08/2.53
% 12.08/2.53 # -------------------------------------------------
% 12.08/2.53 # User time : 1.963 s
% 12.08/2.53 # System time : 0.110 s
% 12.08/2.53 # Total time : 2.073 s
% 12.08/2.53 # Maximum resident set size: 1684 pages
% 12.08/2.53 % E---3.1 exiting
% 12.08/2.53 % E exiting
%------------------------------------------------------------------------------