TSTP Solution File: GRP014-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP014-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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:43:28 EDT 2023
% Result : Unsatisfiable 0.78s 0.66s
% Output : CNFRefutation 0.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 37
% Number of leaves : 2
% Syntax : Number of clauses : 56 ( 56 unt; 0 nHn; 3 RR)
% Number of literals : 56 ( 55 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 17 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 143 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(group_axiom,axiom,
multiply(X1,inverse(multiply(multiply(inverse(multiply(inverse(X2),multiply(inverse(X1),X3))),X4),inverse(multiply(X2,X4))))) = X3,
file('/export/starexec/sandbox/tmp/tmp.V2g5jxmhuj/E---3.1_3818.p',group_axiom) ).
cnf(prove_associativity,negated_conjecture,
multiply(a,multiply(b,c)) != multiply(multiply(a,b),c),
file('/export/starexec/sandbox/tmp/tmp.V2g5jxmhuj/E---3.1_3818.p',prove_associativity) ).
cnf(c_0_2,axiom,
multiply(X1,inverse(multiply(multiply(inverse(multiply(inverse(X2),multiply(inverse(X1),X3))),X4),inverse(multiply(X2,X4))))) = X3,
group_axiom ).
cnf(c_0_3,plain,
multiply(X1,inverse(multiply(multiply(inverse(multiply(inverse(X2),X3)),X4),inverse(multiply(X2,X4))))) = inverse(multiply(multiply(inverse(multiply(inverse(X5),multiply(inverse(inverse(X1)),X3))),X6),inverse(multiply(X5,X6)))),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
multiply(inverse(X1),multiply(X1,inverse(multiply(multiply(inverse(multiply(inverse(X2),X3)),X4),inverse(multiply(X2,X4)))))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_5,plain,
multiply(inverse(X1),multiply(X1,multiply(X2,inverse(multiply(multiply(inverse(multiply(inverse(X3),X4)),X5),inverse(multiply(X3,X5))))))) = multiply(inverse(inverse(X2)),X4),
inference(spm,[status(thm)],[c_0_4,c_0_3]) ).
cnf(c_0_6,plain,
multiply(inverse(X1),multiply(X1,X2)) = multiply(inverse(inverse(X3)),multiply(inverse(X3),X2)),
inference(spm,[status(thm)],[c_0_5,c_0_2]) ).
cnf(c_0_7,plain,
multiply(inverse(X1),multiply(X1,X2)) = multiply(inverse(X3),multiply(X3,X2)),
inference(spm,[status(thm)],[c_0_6,c_0_6]) ).
cnf(c_0_8,plain,
multiply(X1,inverse(multiply(multiply(inverse(multiply(inverse(X2),multiply(X2,X3))),X4),inverse(multiply(inverse(X1),X4))))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_7]) ).
cnf(c_0_9,plain,
multiply(X1,inverse(multiply(multiply(inverse(multiply(inverse(X2),multiply(X2,X3))),multiply(X1,X4)),inverse(multiply(inverse(X5),multiply(X5,X4)))))) = X3,
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_10,plain,
multiply(inverse(X1),multiply(X1,inverse(multiply(multiply(inverse(multiply(inverse(X2),multiply(X2,X3))),X4),inverse(multiply(X5,X4)))))) = multiply(X5,X3),
inference(spm,[status(thm)],[c_0_4,c_0_7]) ).
cnf(c_0_11,plain,
multiply(multiply(inverse(X1),multiply(X1,X2)),inverse(multiply(X3,inverse(X3)))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_4]),c_0_4]) ).
cnf(c_0_12,plain,
multiply(X1,inverse(multiply(X2,inverse(multiply(X3,inverse(multiply(multiply(inverse(multiply(inverse(X4),multiply(inverse(inverse(multiply(inverse(X3),multiply(inverse(X1),X5)))),X2))),X6),inverse(multiply(X4,X6))))))))) = X5,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_13,plain,
multiply(inverse(multiply(inverse(X1),multiply(X1,X2))),X2) = multiply(inverse(multiply(inverse(X3),multiply(X3,X4))),X4),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
multiply(X1,inverse(multiply(multiply(inverse(multiply(inverse(X2),X3)),X4),inverse(multiply(X2,X4))))) = inverse(multiply(X5,inverse(multiply(X6,multiply(multiply(inverse(X6),multiply(inverse(inverse(X1)),X3)),inverse(multiply(multiply(inverse(multiply(inverse(a),X5)),a),inverse(multiply(a,a))))))))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_12]),c_0_3]) ).
cnf(c_0_15,plain,
multiply(inverse(inverse(X1)),multiply(inverse(multiply(inverse(X2),multiply(X2,X3))),X3)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_13]),c_0_4]) ).
cnf(c_0_16,plain,
multiply(X1,inverse(multiply(X2,inverse(multiply(X3,multiply(multiply(inverse(X3),X4),inverse(multiply(multiply(inverse(multiply(inverse(a),X2)),a),inverse(multiply(a,a)))))))))) = multiply(X1,inverse(multiply(multiply(inverse(multiply(inverse(a),X4)),a),inverse(multiply(a,a))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_12]),c_0_3]),c_0_3]),c_0_14]) ).
cnf(c_0_17,plain,
inverse(multiply(multiply(inverse(multiply(inverse(X1),multiply(inverse(X2),multiply(X2,X3)))),X4),inverse(multiply(X1,X4)))) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_7]),c_0_2]) ).
cnf(c_0_18,plain,
multiply(inverse(inverse(X1)),multiply(inverse(X2),inverse(multiply(multiply(inverse(multiply(inverse(a),X2)),a),inverse(multiply(a,a)))))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_4]),c_0_16]) ).
cnf(c_0_19,plain,
inverse(multiply(multiply(inverse(X1),multiply(X1,X2)),inverse(multiply(X3,multiply(multiply(inverse(X3),multiply(inverse(X4),multiply(X4,X5))),X2))))) = X5,
inference(spm,[status(thm)],[c_0_17,c_0_7]) ).
cnf(c_0_20,plain,
multiply(X1,inverse(multiply(X2,inverse(X2)))) = inverse(multiply(multiply(inverse(multiply(inverse(a),X1)),a),inverse(multiply(a,a)))),
inference(spm,[status(thm)],[c_0_11,c_0_18]) ).
cnf(c_0_21,plain,
inverse(multiply(a,inverse(a))) = inverse(multiply(X1,inverse(X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_20]),c_0_19]) ).
cnf(c_0_22,plain,
multiply(a,inverse(a)) = multiply(X1,inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_21]),c_0_15]) ).
cnf(c_0_23,plain,
multiply(X1,multiply(multiply(inverse(X1),X2),inverse(multiply(X3,inverse(X3))))) = X2,
inference(spm,[status(thm)],[c_0_2,c_0_20]) ).
cnf(c_0_24,plain,
multiply(X1,inverse(X1)) = multiply(X2,inverse(X2)),
inference(spm,[status(thm)],[c_0_22,c_0_22]) ).
cnf(c_0_25,plain,
multiply(X1,multiply(X2,inverse(X2))) = inverse(inverse(X1)),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,plain,
multiply(inverse(X1),multiply(X1,inverse(X2))) = inverse(inverse(inverse(X2))),
inference(spm,[status(thm)],[c_0_7,c_0_25]) ).
cnf(c_0_27,plain,
multiply(inverse(inverse(X1)),multiply(inverse(X2),multiply(X2,X3))) = multiply(inverse(X4),multiply(X4,multiply(X1,X3))),
inference(spm,[status(thm)],[c_0_7,c_0_7]) ).
cnf(c_0_28,plain,
multiply(inverse(X1),multiply(X1,X2)) = inverse(inverse(X2)),
inference(spm,[status(thm)],[c_0_26,c_0_17]) ).
cnf(c_0_29,plain,
inverse(multiply(multiply(inverse(multiply(inverse(X1),multiply(X1,multiply(X2,X3)))),X4),inverse(multiply(inverse(X2),X4)))) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_27]),c_0_2]) ).
cnf(c_0_30,plain,
multiply(inverse(inverse(X1)),inverse(multiply(X2,inverse(X2)))) = X1,
inference(rw,[status(thm)],[c_0_11,c_0_28]) ).
cnf(c_0_31,plain,
inverse(multiply(inverse(multiply(inverse(X1),X2)),inverse(X1))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_28]),c_0_30]) ).
cnf(c_0_32,plain,
inverse(multiply(inverse(multiply(X1,X2)),X1)) = X2,
inference(spm,[status(thm)],[c_0_31,c_0_31]) ).
cnf(c_0_33,plain,
inverse(multiply(inverse(multiply(X1,inverse(X1))),X2)) = inverse(X2),
inference(spm,[status(thm)],[c_0_32,c_0_24]) ).
cnf(c_0_34,plain,
multiply(inverse(multiply(X1,inverse(X1))),X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_33]),c_0_18]) ).
cnf(c_0_35,plain,
multiply(X1,inverse(inverse(multiply(inverse(X1),X2)))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_34]),c_0_30]),c_0_2]) ).
cnf(c_0_36,plain,
multiply(multiply(X1,inverse(X1)),X2) = inverse(inverse(X2)),
inference(spm,[status(thm)],[c_0_28,c_0_34]) ).
cnf(c_0_37,plain,
multiply(multiply(X1,X2),inverse(X2)) = X1,
inference(spm,[status(thm)],[c_0_35,c_0_32]) ).
cnf(c_0_38,plain,
inverse(inverse(inverse(inverse(X1)))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_35]),c_0_34]) ).
cnf(c_0_39,plain,
inverse(inverse(inverse(X1))) = inverse(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_37]),c_0_28]) ).
cnf(c_0_40,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_41,plain,
inverse(multiply(multiply(inverse(X1),X2),inverse(multiply(X3,X2)))) = multiply(X3,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_26]),c_0_28]),c_0_40]),c_0_40]) ).
cnf(c_0_42,plain,
multiply(X1,inverse(multiply(a,inverse(a)))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_40]),c_0_20]),c_0_28]),c_0_39]) ).
cnf(c_0_43,plain,
inverse(multiply(inverse(X1),inverse(a))) = multiply(a,X1),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_44,plain,
multiply(inverse(X1),inverse(a)) = inverse(multiply(a,X1)),
inference(spm,[status(thm)],[c_0_40,c_0_43]) ).
cnf(c_0_45,plain,
inverse(multiply(X1,inverse(multiply(X2,X1)))) = X2,
inference(spm,[status(thm)],[c_0_32,c_0_32]) ).
cnf(c_0_46,plain,
inverse(multiply(a,inverse(X1))) = multiply(X1,inverse(a)),
inference(spm,[status(thm)],[c_0_44,c_0_40]) ).
cnf(c_0_47,plain,
multiply(inverse(X1),X1) = multiply(a,inverse(a)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_44]),c_0_40]),c_0_45]),c_0_28]),c_0_40]) ).
cnf(c_0_48,plain,
inverse(multiply(X1,inverse(a))) = multiply(a,inverse(X1)),
inference(spm,[status(thm)],[c_0_40,c_0_46]) ).
cnf(c_0_49,plain,
inverse(multiply(inverse(X1),X2)) = multiply(inverse(X2),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_47]),c_0_42]) ).
cnf(c_0_50,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[c_0_28,c_0_40]) ).
cnf(c_0_51,plain,
multiply(multiply(X1,inverse(a)),multiply(a,X2)) = multiply(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_48]),c_0_44]),c_0_49]),c_0_46]) ).
cnf(c_0_52,plain,
multiply(multiply(a,inverse(X1)),multiply(X1,X2)) = multiply(a,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_48]) ).
cnf(c_0_53,negated_conjecture,
multiply(a,multiply(b,c)) != multiply(multiply(a,b),c),
prove_associativity ).
cnf(c_0_54,plain,
multiply(multiply(a,X1),X2) = multiply(a,multiply(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_50]),c_0_40]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_54])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP014-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n015.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 : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Oct 3 02:57:46 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order model finding
% 0.19/0.46 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.V2g5jxmhuj/E---3.1_3818.p
% 0.78/0.66 # Version: 3.1pre001
% 0.78/0.66 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.78/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.78/0.66 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.78/0.66 # Starting new_bool_3 with 300s (1) cores
% 0.78/0.66 # Starting new_bool_1 with 300s (1) cores
% 0.78/0.66 # Starting sh5l with 300s (1) cores
% 0.78/0.66 # new_bool_1 with pid 3898 completed with status 8
% 0.78/0.66 # new_bool_3 with pid 3897 completed with status 8
% 0.78/0.66 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3896 completed with status 0
% 0.78/0.66 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.78/0.66 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.78/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.78/0.66 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.78/0.66 # No SInE strategy applied
% 0.78/0.66 # Search class: FUUPF-FFSF21-DFFFFFNN
% 0.78/0.66 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.78/0.66 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.78/0.66 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.78/0.66 # Starting new_bool_3 with 136s (1) cores
% 0.78/0.66 # Starting new_bool_1 with 136s (1) cores
% 0.78/0.66 # Starting sh5l with 136s (1) cores
% 0.78/0.66 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3900 completed with status 0
% 0.78/0.66 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.78/0.66 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.78/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.78/0.66 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.78/0.66 # No SInE strategy applied
% 0.78/0.66 # Search class: FUUPF-FFSF21-DFFFFFNN
% 0.78/0.66 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.78/0.66 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.78/0.66 # Preprocessing time : 0.001 s
% 0.78/0.66 # Presaturation interreduction done
% 0.78/0.66
% 0.78/0.66 # Proof found!
% 0.78/0.66 # SZS status Unsatisfiable
% 0.78/0.66 # SZS output start CNFRefutation
% See solution above
% 0.78/0.66 # Parsed axioms : 2
% 0.78/0.66 # Removed by relevancy pruning/SinE : 0
% 0.78/0.66 # Initial clauses : 2
% 0.78/0.66 # Removed in clause preprocessing : 0
% 0.78/0.66 # Initial clauses in saturation : 2
% 0.78/0.66 # Processed clauses : 299
% 0.78/0.66 # ...of these trivial : 105
% 0.78/0.66 # ...subsumed : 89
% 0.78/0.66 # ...remaining for further processing : 105
% 0.78/0.66 # Other redundant clauses eliminated : 0
% 0.78/0.66 # Clauses deleted for lack of memory : 0
% 0.78/0.66 # Backward-subsumed : 2
% 0.78/0.66 # Backward-rewritten : 75
% 0.78/0.66 # Generated clauses : 10194
% 0.78/0.66 # ...of the previous two non-redundant : 9165
% 0.78/0.66 # ...aggressively subsumed : 0
% 0.78/0.66 # Contextual simplify-reflections : 0
% 0.78/0.66 # Paramodulations : 10194
% 0.78/0.66 # Factorizations : 0
% 0.78/0.66 # NegExts : 0
% 0.78/0.66 # Equation resolutions : 0
% 0.78/0.66 # Total rewrite steps : 9945
% 0.78/0.66 # Propositional unsat checks : 0
% 0.78/0.66 # Propositional check models : 0
% 0.78/0.66 # Propositional check unsatisfiable : 0
% 0.78/0.66 # Propositional clauses : 0
% 0.78/0.66 # Propositional clauses after purity: 0
% 0.78/0.66 # Propositional unsat core size : 0
% 0.78/0.66 # Propositional preprocessing time : 0.000
% 0.78/0.66 # Propositional encoding time : 0.000
% 0.78/0.66 # Propositional solver time : 0.000
% 0.78/0.66 # Success case prop preproc time : 0.000
% 0.78/0.66 # Success case prop encoding time : 0.000
% 0.78/0.66 # Success case prop solver time : 0.000
% 0.78/0.66 # Current number of processed clauses : 26
% 0.78/0.66 # Positive orientable unit clauses : 25
% 0.78/0.66 # Positive unorientable unit clauses: 1
% 0.78/0.66 # Negative unit clauses : 0
% 0.78/0.66 # Non-unit-clauses : 0
% 0.78/0.66 # Current number of unprocessed clauses: 8643
% 0.78/0.66 # ...number of literals in the above : 8643
% 0.78/0.66 # Current number of archived formulas : 0
% 0.78/0.66 # Current number of archived clauses : 79
% 0.78/0.66 # Clause-clause subsumption calls (NU) : 0
% 0.78/0.66 # Rec. Clause-clause subsumption calls : 0
% 0.78/0.66 # Non-unit clause-clause subsumptions : 0
% 0.78/0.66 # Unit Clause-clause subsumption calls : 120
% 0.78/0.66 # Rewrite failures with RHS unbound : 0
% 0.78/0.66 # BW rewrite match attempts : 648
% 0.78/0.66 # BW rewrite match successes : 97
% 0.78/0.66 # Condensation attempts : 0
% 0.78/0.66 # Condensation successes : 0
% 0.78/0.66 # Termbank termtop insertions : 289559
% 0.78/0.66
% 0.78/0.66 # -------------------------------------------------
% 0.78/0.66 # User time : 0.175 s
% 0.78/0.66 # System time : 0.011 s
% 0.78/0.66 # Total time : 0.186 s
% 0.78/0.66 # Maximum resident set size: 1504 pages
% 0.78/0.66
% 0.78/0.66 # -------------------------------------------------
% 0.78/0.66 # User time : 0.923 s
% 0.78/0.66 # System time : 0.046 s
% 0.78/0.66 # Total time : 0.969 s
% 0.78/0.66 # Maximum resident set size: 1676 pages
% 0.78/0.66 % E---3.1 exiting
%------------------------------------------------------------------------------