TSTP Solution File: GRP683+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GRP683+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n006.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 : 600s
% DateTime : Sat Jul 16 09:03:18 EDT 2022
% Result : Theorem 0.22s 1.40s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 8
% Syntax : Number of formulae : 75 ( 68 unt; 0 def)
% Number of atoms : 82 ( 81 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 19 ( 12 ~; 5 |; 2 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 152 ( 0 sgn 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f02,axiom,
! [X1] : rd(mult(X1,X1),X1) = X1,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',f02) ).
fof(f04,axiom,
! [X2,X1] : mult(rd(X1,X2),X2) = rd(mult(X1,X2),X2),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',f04) ).
fof(f01,axiom,
! [X1] : ld(X1,mult(X1,X1)) = X1,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',f01) ).
fof(f03,axiom,
! [X2,X1] : mult(X1,ld(X1,X2)) = ld(X1,mult(X1,X2)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',f03) ).
fof(f07,axiom,
! [X2,X1] : ld(X1,mult(X1,ld(X2,X2))) = rd(mult(rd(X1,X1),X2),X2),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',f07) ).
fof(f05,axiom,
! [X3,X4,X2,X1] : ld(ld(X1,X2),mult(ld(X1,X2),mult(X4,X3))) = mult(ld(X1,mult(X1,X4)),X3),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',f05) ).
fof(f06,axiom,
! [X3,X4,X2,X1] : rd(mult(mult(X1,X2),rd(X4,X3)),rd(X4,X3)) = mult(X1,rd(mult(X2,X3),X3)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',f06) ).
fof(goals,conjecture,
! [X5,X6,X7] :
( mult(X5,ld(X6,mult(X6,X7))) = mult(X5,X7)
& mult(rd(mult(X5,X6),X6),X7) = mult(X5,X7) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',goals) ).
fof(c_0_8,plain,
! [X2] : rd(mult(X2,X2),X2) = X2,
inference(variable_rename,[status(thm)],[f02]) ).
fof(c_0_9,plain,
! [X3,X4] : mult(rd(X4,X3),X3) = rd(mult(X4,X3),X3),
inference(variable_rename,[status(thm)],[f04]) ).
fof(c_0_10,plain,
! [X2] : ld(X2,mult(X2,X2)) = X2,
inference(variable_rename,[status(thm)],[f01]) ).
fof(c_0_11,plain,
! [X3,X4] : mult(X4,ld(X4,X3)) = ld(X4,mult(X4,X3)),
inference(variable_rename,[status(thm)],[f03]) ).
cnf(c_0_12,plain,
rd(mult(X1,X1),X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
mult(rd(X1,X2),X2) = rd(mult(X1,X2),X2),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_14,plain,
! [X3,X4] : ld(X4,mult(X4,ld(X3,X3))) = rd(mult(rd(X4,X4),X3),X3),
inference(variable_rename,[status(thm)],[f07]) ).
cnf(c_0_15,plain,
ld(X1,mult(X1,X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
mult(X1,ld(X1,X2)) = ld(X1,mult(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_17,plain,
! [X5,X6,X7,X8] : ld(ld(X8,X7),mult(ld(X8,X7),mult(X6,X5))) = mult(ld(X8,mult(X8,X6)),X5),
inference(variable_rename,[status(thm)],[f05]) ).
cnf(c_0_18,plain,
mult(rd(X1,X1),X1) = X1,
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
ld(X1,mult(X1,ld(X2,X2))) = rd(mult(rd(X1,X1),X2),X2),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
mult(X1,ld(X1,X1)) = X1,
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
ld(ld(X1,X2),mult(ld(X1,X2),mult(X3,X4))) = mult(ld(X1,mult(X1,X3)),X4),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_22,plain,
! [X5,X6,X7,X8] : rd(mult(mult(X8,X7),rd(X6,X5)),rd(X6,X5)) = mult(X8,rd(mult(X7,X5),X5)),
inference(variable_rename,[status(thm)],[f06]) ).
cnf(c_0_23,plain,
mult(rd(rd(X1,X1),X1),X1) = rd(X1,X1),
inference(spm,[status(thm)],[c_0_13,c_0_18]) ).
cnf(c_0_24,plain,
mult(rd(rd(X1,X1),X2),X2) = mult(X1,ld(X1,ld(X2,X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_16]),c_0_13]) ).
cnf(c_0_25,plain,
mult(X1,ld(X1,ld(X1,X1))) = ld(X1,X1),
inference(spm,[status(thm)],[c_0_16,c_0_20]) ).
cnf(c_0_26,plain,
mult(ld(X1,X2),ld(ld(X1,X2),mult(X3,X4))) = mult(mult(X1,ld(X1,X3)),X4),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_16]),c_0_16]) ).
cnf(c_0_27,plain,
rd(mult(mult(X1,X2),rd(X3,X4)),rd(X3,X4)) = mult(X1,rd(mult(X2,X4),X4)),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
rd(X1,X1) = ld(X1,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_29,plain,
mult(mult(X1,ld(X1,X2)),ld(mult(X1,ld(X1,X2)),mult(X3,X4))) = mult(mult(X1,ld(X1,X3)),X4),
inference(spm,[status(thm)],[c_0_26,c_0_16]) ).
cnf(c_0_30,plain,
mult(rd(mult(X1,X2),rd(X3,X4)),rd(X3,X4)) = mult(X1,mult(rd(X2,X4),X4)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_13]),c_0_13]) ).
cnf(c_0_31,plain,
mult(rd(ld(X1,X1),X2),X2) = mult(X1,ld(X1,ld(X2,X2))),
inference(rw,[status(thm)],[c_0_24,c_0_28]) ).
cnf(c_0_32,plain,
mult(X1,ld(X1,mult(X2,X3))) = mult(mult(X1,ld(X1,X2)),X3),
inference(spm,[status(thm)],[c_0_29,c_0_20]) ).
cnf(c_0_33,plain,
mult(rd(X1,rd(X2,X3)),rd(X2,X3)) = mult(X1,mult(X1,ld(X1,ld(X3,X3)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_20]),c_0_31]) ).
cnf(c_0_34,plain,
mult(X1,mult(X1,ld(X1,X2))) = mult(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_16]),c_0_20]) ).
cnf(c_0_35,plain,
mult(ld(X1,X1),X1) = X1,
inference(rw,[status(thm)],[c_0_18,c_0_28]) ).
cnf(c_0_36,plain,
mult(rd(X1,rd(X2,X3)),rd(X2,X3)) = mult(X1,ld(X3,X3)),
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,plain,
mult(mult(X1,ld(X1,ld(X2,X2))),X2) = mult(X1,ld(X1,X2)),
inference(spm,[status(thm)],[c_0_32,c_0_35]) ).
cnf(c_0_38,plain,
mult(X1,ld(X1,ld(ld(X1,X1),ld(X1,X1)))) = ld(X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_28]),c_0_35]) ).
cnf(c_0_39,plain,
mult(rd(X1,ld(X1,X1)),ld(X1,X1)) = rd(X1,ld(X1,X1)),
inference(spm,[status(thm)],[c_0_13,c_0_20]) ).
cnf(c_0_40,plain,
mult(rd(X1,ld(X2,X2)),ld(X2,X2)) = mult(X1,ld(X2,X2)),
inference(spm,[status(thm)],[c_0_36,c_0_28]) ).
cnf(c_0_41,plain,
mult(ld(X1,X1),ld(X1,X1)) = ld(X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_25]) ).
cnf(c_0_42,plain,
rd(X1,ld(X1,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40]),c_0_20]) ).
cnf(c_0_43,plain,
ld(ld(X1,X1),ld(X1,X1)) = ld(X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_41]),c_0_20]) ).
cnf(c_0_44,plain,
mult(ld(X1,X2),ld(ld(X1,X2),ld(ld(X1,X2),mult(X3,X4)))) = ld(ld(X1,X2),mult(mult(X1,ld(X1,X3)),X4)),
inference(spm,[status(thm)],[c_0_16,c_0_26]) ).
cnf(c_0_45,plain,
mult(mult(X1,ld(X1,X2)),ld(X2,X2)) = mult(X1,ld(X1,X2)),
inference(spm,[status(thm)],[c_0_32,c_0_20]) ).
cnf(c_0_46,plain,
mult(rd(X1,X2),X2) = mult(X1,ld(X2,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_42]),c_0_43]) ).
cnf(c_0_47,plain,
mult(ld(X1,X2),ld(ld(X1,X2),ld(ld(X1,X2),X3))) = ld(ld(X1,X2),mult(X1,ld(X1,X3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_20]),c_0_45]) ).
fof(c_0_48,negated_conjecture,
~ ! [X5,X6,X7] :
( mult(X5,ld(X6,mult(X6,X7))) = mult(X5,X7)
& mult(rd(mult(X5,X6),X6),X7) = mult(X5,X7) ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_49,plain,
mult(mult(X1,X2),ld(X3,X3)) = mult(X1,mult(X2,ld(X3,X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_33]),c_0_34]),c_0_46]) ).
cnf(c_0_50,plain,
mult(ld(X1,X2),ld(ld(X1,X2),X3)) = mult(X1,ld(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_47]),c_0_26]),c_0_20]) ).
cnf(c_0_51,plain,
rd(mult(X1,X2),X2) = mult(X1,ld(X2,X2)),
inference(rw,[status(thm)],[c_0_13,c_0_46]) ).
fof(c_0_52,negated_conjecture,
( mult(esk1_0,ld(esk2_0,mult(esk2_0,esk3_0))) != mult(esk1_0,esk3_0)
| mult(rd(mult(esk4_0,esk5_0),esk5_0),esk6_0) != mult(esk4_0,esk6_0) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_48])])])]) ).
cnf(c_0_53,plain,
mult(X1,mult(ld(X1,X2),ld(X2,X2))) = mult(X1,ld(X1,X2)),
inference(rw,[status(thm)],[c_0_45,c_0_49]) ).
cnf(c_0_54,plain,
mult(X1,ld(X1,ld(X1,X2))) = ld(X1,X2),
inference(spm,[status(thm)],[c_0_20,c_0_50]) ).
cnf(c_0_55,plain,
mult(ld(X1,X1),ld(X2,X2)) = mult(X1,ld(X1,ld(X2,X2))),
inference(rw,[status(thm)],[c_0_31,c_0_46]) ).
cnf(c_0_56,plain,
mult(mult(X1,ld(X2,X2)),X2) = mult(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_51]),c_0_49]),c_0_20]) ).
cnf(c_0_57,negated_conjecture,
( mult(rd(mult(esk4_0,esk5_0),esk5_0),esk6_0) != mult(esk4_0,esk6_0)
| mult(esk1_0,ld(esk2_0,mult(esk2_0,esk3_0))) != mult(esk1_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_58,plain,
mult(ld(X1,X2),ld(X2,X2)) = ld(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_53]),c_0_16]),c_0_54]),c_0_32]),c_0_54]) ).
cnf(c_0_59,plain,
mult(ld(X1,X1),X2) = mult(X1,ld(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_55]),c_0_56]) ).
cnf(c_0_60,negated_conjecture,
( mult(esk1_0,mult(esk2_0,ld(esk2_0,esk3_0))) != mult(esk1_0,esk3_0)
| mult(mult(rd(esk4_0,esk5_0),esk5_0),esk6_0) != mult(esk4_0,esk6_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_16]),c_0_13]) ).
cnf(c_0_61,plain,
ld(ld(X1,X2),ld(X1,X2)) = mult(X1,ld(X1,ld(X2,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_58]),c_0_50]) ).
cnf(c_0_62,plain,
mult(ld(X1,X1),ld(X1,X2)) = ld(X1,X2),
inference(rw,[status(thm)],[c_0_54,c_0_59]) ).
cnf(c_0_63,negated_conjecture,
( mult(esk1_0,mult(esk2_0,ld(esk2_0,esk3_0))) != mult(esk1_0,esk3_0)
| mult(mult(esk4_0,ld(esk5_0,esk5_0)),esk6_0) != mult(esk4_0,esk6_0) ),
inference(rw,[status(thm)],[c_0_60,c_0_46]) ).
cnf(c_0_64,plain,
mult(X1,mult(ld(X1,X1),X2)) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_34,c_0_59]) ).
cnf(c_0_65,plain,
mult(mult(X1,ld(X1,ld(X2,X2))),X3) = mult(X1,ld(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_59]),c_0_61]) ).
cnf(c_0_66,plain,
ld(ld(X1,X1),X2) = mult(X1,ld(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_43]),c_0_50]) ).
cnf(c_0_67,plain,
mult(ld(X1,X1),mult(X1,X2)) = mult(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_16]),c_0_34]) ).
cnf(c_0_68,plain,
mult(X1,mult(mult(X1,ld(X1,X2)),X3)) = mult(X1,mult(X2,X3)),
inference(spm,[status(thm)],[c_0_34,c_0_32]) ).
cnf(c_0_69,negated_conjecture,
( mult(esk1_0,mult(ld(esk2_0,esk2_0),esk3_0)) != mult(esk1_0,esk3_0)
| mult(mult(esk4_0,ld(esk5_0,esk5_0)),esk6_0) != mult(esk4_0,esk6_0) ),
inference(rw,[status(thm)],[c_0_63,c_0_59]) ).
cnf(c_0_70,plain,
mult(X1,mult(ld(X2,X2),X3)) = mult(X1,X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66]),c_0_67]),c_0_68]),c_0_66]),c_0_34]) ).
cnf(c_0_71,plain,
mult(mult(X1,mult(X2,ld(X3,X3))),X3) = mult(mult(X1,X2),X3),
inference(spm,[status(thm)],[c_0_56,c_0_49]) ).
cnf(c_0_72,negated_conjecture,
mult(mult(esk4_0,ld(esk5_0,esk5_0)),esk6_0) != mult(esk4_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_70])]) ).
cnf(c_0_73,plain,
mult(mult(X1,ld(X2,X2)),X3) = mult(X1,X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_70]),c_0_56]) ).
cnf(c_0_74,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_73])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP683+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n006.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 13 07:33:27 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.22/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.40 # Preprocessing time : 0.014 s
% 0.22/1.40
% 0.22/1.40 # Proof found!
% 0.22/1.40 # SZS status Theorem
% 0.22/1.40 # SZS output start CNFRefutation
% See solution above
% 0.22/1.40 # Proof object total steps : 75
% 0.22/1.40 # Proof object clause steps : 58
% 0.22/1.40 # Proof object formula steps : 17
% 0.22/1.40 # Proof object conjectures : 9
% 0.22/1.40 # Proof object clause conjectures : 6
% 0.22/1.40 # Proof object formula conjectures : 3
% 0.22/1.40 # Proof object initial clauses used : 8
% 0.22/1.40 # Proof object initial formulas used : 8
% 0.22/1.40 # Proof object generating inferences : 30
% 0.22/1.40 # Proof object simplifying inferences : 56
% 0.22/1.40 # Training examples: 0 positive, 0 negative
% 0.22/1.40 # Parsed axioms : 8
% 0.22/1.40 # Removed by relevancy pruning/SinE : 0
% 0.22/1.40 # Initial clauses : 8
% 0.22/1.40 # Removed in clause preprocessing : 0
% 0.22/1.40 # Initial clauses in saturation : 8
% 0.22/1.40 # Processed clauses : 162
% 0.22/1.40 # ...of these trivial : 34
% 0.22/1.40 # ...subsumed : 22
% 0.22/1.40 # ...remaining for further processing : 106
% 0.22/1.40 # Other redundant clauses eliminated : 0
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 1
% 0.22/1.40 # Backward-rewritten : 56
% 0.22/1.40 # Generated clauses : 3336
% 0.22/1.40 # ...of the previous two non-trivial : 2510
% 0.22/1.40 # Contextual simplify-reflections : 0
% 0.22/1.40 # Paramodulations : 3336
% 0.22/1.40 # Factorizations : 0
% 0.22/1.40 # Equation resolutions : 0
% 0.22/1.40 # Current number of processed clauses : 49
% 0.22/1.40 # Positive orientable unit clauses : 44
% 0.22/1.40 # Positive unorientable unit clauses: 5
% 0.22/1.40 # Negative unit clauses : 0
% 0.22/1.40 # Non-unit-clauses : 0
% 0.22/1.40 # Current number of unprocessed clauses: 1475
% 0.22/1.40 # ...number of literals in the above : 1475
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 57
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 0
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 0
% 0.22/1.40 # Non-unit clause-clause subsumptions : 0
% 0.22/1.40 # Unit Clause-clause subsumption calls : 30
% 0.22/1.40 # Rewrite failures with RHS unbound : 21
% 0.22/1.40 # BW rewrite match attempts : 304
% 0.22/1.40 # BW rewrite match successes : 94
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 51525
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.087 s
% 0.22/1.40 # System time : 0.003 s
% 0.22/1.40 # Total time : 0.090 s
% 0.22/1.40 # Maximum resident set size: 5144 pages
%------------------------------------------------------------------------------