
 OPTIM version 22983, Copyright (C) David J. Wales
 OPTIM comes with ABSOLUTELY NO WARRANTY; for details supply WARRANTY as an input keyword.
 This is free software, and you are welcome to redistribute it
 under certain conditions; provide keyword COPYRIGHT to see the details.

 getparams> input coordinates for AMBER9 system will be read from 
start
start               

          -------------------------------------------------------
          Amber 9  SANDER                              2006
          -------------------------------------------------------

| Run on 05/24/2012 at 12:00:00
  [-O]verwriting output

File Assignments:
|  MDIN: min.in                                                                
| MDOUT: min.out                                                               
|INPCRD: coords.inpcrd                                                         
|  PARM: coords.prmtop                                                         
|RESTRT: coords.rst                                                            
|  REFC: refc                                                                  
| MDVEL: mdvel                                                                 
|  MDEN: mden                                                                  
| MDCRD: coords.mdcrd                                                          
|MDINFO: mdinfo                                                                
|INPDIP: inpdip                                                                
|RSTDIP: rstdip                                                                


 Here is the input file:

Minimization                                                                   
&cntrl                                                                         
   imin=1, maxcyc=1, ncyc=1,                                                   
   igb=2, saltcon=0.2,                                                         
   ntpr=1, ntx=1, ntb=0,                                                       
   cut = 999.0                                                                 
 /                                                                             
	                                                                              

--------------------------------------------------------------------------------
   1.  RESOURCE   USE: 
--------------------------------------------------------------------------------

| Flags:                                                                        
| New format PARM file being parsed.
| Version =    1.000 Date = 12/07/08 Time = 15:32:39
 NATOM  =     107 NTYPES =      11 NBONH =      48 MBONA  =      59
 NTHETH =     105 MTHETA =      79 NPHIH =     235 MPHIA  =     150
 NHPARM =       0 NPARM  =       0 NNB   =     560 NRES   =       7
 NBONA  =      59 NTHETA =      79 NPHIA =     150 NUMBND =      18
 NUMANG =      35 NPTRA  =      25 NATYP =      14 NPHB   =       0
 IFBOX  =       0 NMXRS  =      22 IFCAP =       0 NEXTRA =       0
 NCOPY  =       0

 Implicit solvent radii are modified Bondi radii (mbondi)                                                   

|     Memory Use     Allocated
|     Real                7111
|     Hollerith            651
|     Integer            25418
|     Max Pairs              1
|     nblistReal             0
|     nblist Int             0
|       Total              157 kbytes
| Duplicated    0 dihedrals
| Duplicated    0 dihedrals

--------------------------------------------------------------------------------
   2.  CONTROL  DATA  FOR  THE  RUN
--------------------------------------------------------------------------------

                                                                                

General flags:
     imin    =       1, nmropt  =       0
     ifswitch=       0, fswitchbeta=  10.000
 mdread> no continuous cutoff will be used for non-bonded terms

Nature and format of input:
     ntx     =       1, irest   =       0, ntrx    =       1

Nature and format of output:
     ntxo    =       1, ntpr    =       1, ntrx    =       1, ntwr    =     500
     iwrap   =       0, ntwx    =       0, ntwv    =       0, ntwe    =       0
     ioutfm  =       0, ntwprt  =       0, idecomp =       0, rbornstat=      0

Potential function:
     ntf     =       1, ntb     =       0, igb     =       2, nsnb    =      25
     ipol    =       0, gbsa    =       0, iesp    =       0
     dielc   =   1.00000, cut     = 999.00000, intdiel =   1.00000
     saltcon =   0.20000, offset  =   0.09000, gbalpha=    0.80000
     gbbeta  =   0.00000, gbgamma =   2.90912, surften =   0.00500
     rdt     =   0.00000, rgbmax  =  25.00000
     alpb  =        0
     scnb    =   2.00000, scee    =   1.20000

Frozen or restrained atoms:
     ibelly  =       0, ntr     =       0

Energy minimization:
     maxcyc  =       1, ncyc    =       1, ntmin   =       1
     dx0     =   0.01000, drms    =   0.00010
|  INFO: Old style inpcrd file read


--------------------------------------------------------------------------------
   3.  ATOMIC COORDINATES AND VELOCITIES
--------------------------------------------------------------------------------

                                                                                
 begin time read from input coords =     0.000 ps

 Number of triangulated 3-point waters found:        0
 getparams> Number of atoms (or variables)  determined as    107
 keyword> Local permutational alignment: alignment threshold=        1.00000
 keyword> Local permutational alignment: alignment cutoff=           5.00000
 keyword> Number of groups of permutable atoms=    17
read argument: coords.prmtop 
Reading parm file (coords.prmtop)
title:
                                                                                
 fetchz> Hybrid EF/BFGS transition state search, maximum steps= 250
         maximum tangent space steps=   5 or  100 when overlap is better than     0.999900
 fetchz> Uphill mode is    0 for initial step and    0 after that
 fetchz> Steps for largest Hessian e/vector= 100, smallest e/vector=2000 convergence at       0.0020%

 fetchz>  321 Cartesian coordinates will be optimised for  107 AMBER atoms

 fetchz> Lowest   1 eigenvalues and eigenvectors will be calculated non-iteratively
 fetchz> Point group checked when RMS force <     0.00100000, highest symmetry axis tested for=  6
 fetchz> Initial distance and eigenvalue tolerances in symmetry determination=     0.00010000     0.00010000
 fetchz> Minimum number of optimization steps=     0
 keywords> Cutoff for identifying atoms in the same orbit=    0.2000000000    
 keywords> lpermdist neighbours, threshold, max sep=    10     1.000000000         3
 fetchz> Convergence criterion for LBFGS optimization: RMS force< 0.10000000E-05 maximum steps= 10000
 fetchz> Maximum energy rise in LBFGS minimization=    0.1000000000E-01
 fetchz> Number of updates in LBFGS=    10000
 fetchz> Number of updates in XLBFGS=   4
 fetchz> Number of updates in mind=   4
 fetchz> Initial guess for diagonal elements in LBFGS=     0.0100
 fetchz> Initial guess for diagonal elements in XLBFGS=    0.1000
 fetchz> Maximum step size in LBFGS energy minimization=     0.1000
 fetchz> Maximum step size in XLBFGS=    0.2000
 fetchz> Maximum step size in LBFGS neb image minimization=                 0.2000
 fetchz> Warnings will be issued if atoms become closer than 0.5 units
 fetchz> Coordinates for intermediate steps will not be dumped to file points


 KeyInt>> Using natural internal coordinates. # of coords =        315
 KeyInt>> Parameter file for internal coordinates is naturals-noH.par                                                                                    
 KeyInt>> KD, NNZ are         65      3594
 KeyInt>> Back transform convergence (for interpolation)     0.1000000000E-07
 KeyInt>> Back transform convergence criterion (except for interpolation)     0.1000000000E-03
 KeyInt>> Using internal coordinates for interpolation.
 KeyInt>> using simple internal interpolation.    Image points will not be evenly distributed in Cartesians
 KeyInt>> Permuting endpoint atoms to minimise torsion distance
 OPTIM> Using translational/rotational ev shift=     1000000.000    
 OPTIM> Initial energy=    -532.9691188     RMS force=    0.9803809450E-06
 OPTIM> Final energy  =    -528.8862887     RMS force=    0.8585410414E-06
 KeyConnect> Maximum cycles = 50, maximum images = 23
 KeyConnect> Maximum attempts per pair of minima = 3, with increment image density of 2.00
 KeyConnect> Image density = 0.30, iteration density = 35.00
 KeyNEB> Initial and final NEB force constants     10.00000000        10.00000000     factor=    1.010000000    
 KeyNEB> Number of images will vary depending on the separation of the endpoints
 KeyGrad> Overall rotation and translation will NOT be removed
 KeyGrad> Using doubly nudged elastic band gradient
 KeyOutput> Transition state candidates will be optimized
 KeyOutput> Concise printing during transition states optimization
 KeyOutput> Transition state candidates are maxima along NEB
 KeyMin> Maximal number of iterations will vary, depending on the number of images in the band
 KeyMin> RMS convergence criterion is set to 0.001
 KeyMin> L-BFGS minimization
 KeyLBFGS> Maximum step size per image =     0.2000000000    
 KeyLBFGS> 4 Hessian updates per iteration
 KeyLBFGS> Guess for inverse Hessian diagonal elements =     0.1000000000E-02
 KeyTau> Using Henkelman and Jonsson's improved tangent
 KeyDecide> Cost function in Dijkstra algorithm is D^3

 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 1 >>>>>>>>>>>>>>>>>>>>> 2 minima and 0 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      1 steps with      1 missing connections, weight=     6094.2    
 decide> The unconnected minima in the chain and their distances are:
     2       18.27     1 
 

 tryconnect> 175-iteration DNEB run for minima 1_S and 2_F using 5 images  (DNEB attempt #1)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant      1.812902854    
 Double-ended search iterations= 175 RMS= 1.8248 Dev= 1.03% S= 25.14 time= 1.81
 Following    1 images are candidates for TS:    3  
 Converged to TS (number of iterations):        118
 DNEB run yielded 1 true transition state(s) time=  11.51

 >>>>>  Path run for ts 1 ...
 Plus  side of path:                     670 steps. Energy=    -531.2983789       time=       1.70
 Minus side of path:                     639 steps. Energy=    -531.3040510       time=       1.58

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -531.2983789  2.7199         -528.5784725  2.7256         -531.3040510  16.493  10.164  15.454   6.924
        *NEW* (Placed in 3)                                     *NEW* (Placed in 4)
 Connection established between members of the U set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 2 >>>>>>>>>>>>>>>>>>>>> 4 minima and 1 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      1 steps with      1 missing connections, weight=     12188.    
 decide> The unconnected minima in the chain and their distances are:
     2       18.27     1 
 

 tryconnect> 805-iteration DNEB run for minima 1_S and 2_F using 23 images  (DNEB attempt #2)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant      7.106813301    
 Double-ended search iterations= 805 RMS= 0.3463 Dev= 6.72% S= 33.41 time= 37.39
 Following    2 images are candidates for TS:   10   13  
 Failed to converge to TS (number of iterations):        251
 Converged to TS (number of iterations):         49
 DNEB run yielded 1 true transition state(s) time=  39.18

 >>>>>  Path run for ts 2 ...
 Plus  side of path:                     619 steps. Energy=    -529.3535114       time=       1.53
 Minus side of path:                     719 steps. Energy=    -531.8641908       time=       1.82

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -529.3535114  2.2379         -527.1155801  4.7486         -531.8641908  17.276  13.967   3.060  34.964
        *NEW* (Placed in 5)                                     *NEW* (Placed in 6)
 Connection established between members of the U set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 3 >>>>>>>>>>>>>>>>>>>>> 6 minima and 2 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      3 steps with      2 missing connections, weight=     1961.8    
 decide> The unconnected minima in the chain and their distances are:
     2       10.23     5     6        9.63     1 
 

 tryconnect> 105-iteration DNEB run for minima 2_F and 5_U using 3 images  (DNEB attempt #1)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant      3.589423646    
 Double-ended search iterations= 105 RMS= 0.5099 Dev= 1.33% S= 16.09 time= 0.66
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         46
 DNEB run yielded 1 true transition state(s) time=   5.63

 >>>>>  Path run for ts 3 ...
 Plus  side of path:                     766 steps. Energy=    -530.5350581       time=       1.96
 Minus side of path:                     635 steps. Energy=    -529.3497099       time=       1.58

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -530.5350581  5.2731         -525.2619847  4.0877         -529.3497099  20.310  12.127   9.254  11.562
        *NEW* (Placed in 7)                                     *NEW* (Placed in 8)
 Connection established between members of the U set.

 tryconnect> 70-iteration DNEB run for minima 1_S and 6_U using 2 images  (DNEB attempt #1)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant      5.050679530    
 Double-ended search iterations= 70 RMS= 4.5546 Dev= 1.72% S= 10.35 time= 0.30
 Following    1 images are candidates for TS:    1  
 Converged to TS (number of iterations):         26
 DNEB run yielded 1 true transition state(s) time=   3.43

 >>>>>  Path run for ts 4 ...
 Plus  side of path:                     646 steps. Energy=    -531.9013419       time=       1.60
 Minus side of path:                     613 steps. Energy=    -532.9691188       time=       1.51

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -531.9013419  1.4697         -530.4316713  2.5374         -532.9691188  11.848   9.889  10.835   9.876
        *NEW* (Placed in 9)                                     Known (#1)
 Unconnected minimum 9 found its way to S set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 4 >>>>>>>>>>>>>>>>>>>>> 9 minima and 4 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      6 steps with      3 missing connections, weight=     521.49    
 decide> The unconnected minima in the chain and their distances are:
     2        7.39     7     8        4.29     5     6        3.38     9 
 

 tryconnect> 70-iteration DNEB run for minima 2_F and 7_U using 2 images  (DNEB attempt #1)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant      5.050679530    
 Double-ended search iterations= 70 RMS= 0.3447 Dev= 1.13% S= 8.84 time= 0.30
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         54
 DNEB run yielded 1 true transition state(s) time=   5.85

 >>>>>  Path run for ts 5 ...
 Plus  side of path:                     669 steps. Energy=    -528.7322258       time=       1.69
 Minus side of path:                     720 steps. Energy=    -529.3185444       time=       1.85

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -528.7322258  3.1497         -525.5825715  3.7360         -529.3185444  11.595   6.723  13.453   7.953
        *NEW* (Placed in 10)                                    *NEW* (Placed in 11)
 Connection established between members of the U set.

 tryconnect> 70-iteration DNEB run for minima 5_U and 8_U using 2 images  (DNEB attempt #1)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant      5.050679530    
 Double-ended search iterations= 70 RMS= 0.1369 Dev= 0.04% S= 4.44 time= 0.30
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         16
 DNEB run yielded 1 true transition state(s) time=   2.49

 >>>>>  Path run for ts 6 ...
 Plus  side of path:                     556 steps. Energy=    -529.3497099       time=       1.35
 Minus side of path:                     578 steps. Energy=    -529.3535114       time=       1.42

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -529.3497099 0.50853E-01     -529.2988571 0.54654E-01     -529.3535114   4.455   4.286  15.807   6.769
        Known (#8)                                              Known (#5)
 Connection established between members of the U set.

 tryconnect> 70-iteration DNEB run for minima 6_U and 9_S using 2 images  (DNEB attempt #1)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant      8.227024748    
 Double-ended search iterations= 70 RMS= 0.7623 Dev= 2.03% S= 4.11 time= 0.30
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         57
 DNEB run yielded 1 true transition state(s) time=   5.83

 >>>>>  Path run for ts 7 ...
 Plus  side of path:                     679 steps. Energy=    -534.6241129       time=       1.71
 Minus side of path:                     581 steps. Energy=    -531.9013419       time=       1.42

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -534.6241129  2.7478         -531.8763090 0.25033E-01     -531.9013419   6.764   6.024   9.828  10.888
        *NEW* (Placed in 12)                                    Known (#9)
 Unconnected minimum 12 found its way to S set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 5 >>>>>>>>>>>>>>>>>>>>> 12 minima and 7 ts are known >>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      8 steps with      3 missing connections, weight=     351.92    
 decide> The unconnected minima in the chain and their distances are:
     2        5.45    10    11        4.83     7     6        3.38     9 
 

 tryconnect> 70-iteration DNEB run for minima 2_F and 10_U using 2 images  (DNEB attempt #1)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant      5.050679530    
 Double-ended search iterations= 70 RMS= 0.1112 Dev= 0.13% S= 5.66 time= 0.30
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         70
 DNEB run yielded 1 true transition state(s) time=   7.36

 >>>>>  Path run for ts 8 ...
 Plus  side of path:                     618 steps. Energy=    -531.5047794       time=       1.53
 Minus side of path:                     603 steps. Energy=    -528.8862887       time=       1.49

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -531.5047794  2.7655         -528.7393240 0.14696         -528.8862887   7.080   4.648  18.586   5.757
        *NEW* (Placed in 13)                                    Known (#2)
 Unconnected minimum 13 found its way to F set.

 tryconnect> 70-iteration DNEB run for minima 7_U and 11_U using 2 images  (DNEB attempt #1)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant      5.050679530    
 Double-ended search iterations= 70 RMS= 0.0954 Dev= 0.22% S= 4.90 time= 0.30
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         24
 DNEB run yielded 1 true transition state(s) time=   3.18

 >>>>>  Path run for ts 9 ...
 Plus  side of path:                     557 steps. Energy=    -529.3185444       time=       1.37
 Minus side of path:                     609 steps. Energy=    -530.5350581       time=       1.56

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -529.3185444 0.26784E-01     -529.2917607  1.2433         -530.5350581   5.263   4.836  12.015   8.906
        Known (#11)                                             Known (#7)
 Connection established between members of the U set.

 tryconnect> 245-iteration DNEB run for minima 6_U and 9_S using 7 images  (DNEB attempt #2)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant      1.812902854    
 Double-ended search iterations= 245 RMS= 0.0361 Dev= 0.89% S= 4.86 time= 3.49
 Following    1 images are candidates for TS:    4  
 Converged to TS (number of iterations):         10
 DNEB run yielded 1 true transition state(s) time=   2.13

 >>>>>  Path run for ts 10 ...
 Plus  side of path:                     629 steps. Energy=    -531.9013419       time=       1.56
 Minus side of path:                     594 steps. Energy=    -531.8641908       time=       1.46

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -531.9013419  8.6203         -523.2810307  8.5832         -531.8641908   4.340   3.379  27.984   3.824
        Known (#9)                                              Known (#6)
 Unconnected minimum 6 found its way to S set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 6 >>>>>>>>>>>>>>>>>>>>> 13 minima and 10 ts are known >>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      8 steps with      1 missing connections, weight=     323.59    
 decide> The unconnected minima in the chain and their distances are:
     2        5.45    10 
 

 tryconnect> 420-iteration DNEB run for minima 2_F and 10_S using 12 images  (DNEB attempt #2)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant     0.1659964797    
 Double-ended search iterations= 420 RMS= 0.0085 Dev= 0.74% S= 5.90 time= 10.24
 Following    1 images are candidates for TS:   10  
 Converged to TS (number of iterations):         19
 DNEB run yielded 1 true transition state(s) time=   2.64

 >>>>>  Path run for ts 11 ...
 Plus  side of path:                     566 steps. Energy=    -528.7322258       time=       1.38
 Minus side of path:                     605 steps. Energy=    -528.8435333       time=       1.49

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -528.7322258 0.11468E-01     -528.7207576 0.12278         -528.8435333   4.643   4.534  11.916   8.980
        Known (#10)                                             *NEW* (Placed in 14)
 Unconnected minimum 14 found its way to S set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 7 >>>>>>>>>>>>>>>>>>>>> 14 minima and 11 ts are known >>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      9 steps with      1 missing connections, weight=     64.272    
 decide> The unconnected minima in the chain and their distances are:
     2        4.01    14 
 

 tryconnect> 70-iteration DNEB run for minima 2_F and 14_S using 2 images  (DNEB attempt #1)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant      5.050679530    
 Double-ended search iterations= 70 RMS= 0.0909 Dev= 0.18% S= 4.20 time= 0.30
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         22
 DNEB run yielded 1 true transition state(s) time=   3.06

 >>>>>  Path run for ts 12 ...
 Plus  side of path:                     588 steps. Energy=    -528.8862887       time=       1.43
 Minus side of path:                     603 steps. Energy=    -528.8435333       time=       1.47

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -528.8862887 0.94551E-01     -528.7917380 0.51795E-01     -528.8435333   4.383   4.007  27.125   3.945
        Known (#2)                                              Known (#14)
 Connected path found
  ts        E+         Ets - E+          Ets       Ets - E-          E-          S       D      gamma   ~N
   4     -532.9691188  2.5374        -530.4316713  1.4697        -531.9013419  11.848   9.889  10.835   9.876
  10     -531.9013419  8.6203        -523.2810307  8.5832        -531.8641908   4.340   3.379  27.984   3.824
   2     -531.8641908  4.7486        -527.1155801  2.2379        -529.3535114  17.276  13.967   3.060  34.964
   6     -529.3535114 0.54654E-01    -529.2988571 0.50853E-01    -529.3497099   4.455   4.286  15.807   6.769
   3     -529.3497099  4.0877        -525.2619847  5.2731        -530.5350581  20.310  12.127   9.254  11.562
   9     -530.5350581  1.2433        -529.2917607 0.26784E-01    -529.3185444   5.263   4.836  12.015   8.906
   5     -529.3185444  3.7360        -525.5825715  3.1497        -528.7322258  11.595   6.723  13.453   7.953
  11     -528.7322258 0.11468E-01    -528.7207576 0.12278        -528.8435333   4.643   4.534  11.916   8.980
  12     -528.8435333 0.51795E-01    -528.7917380 0.94551E-01    -528.8862887   4.383   4.007  27.125   3.945

 Number of TS in the path       =      9
 Number of cycles               =      7

 Elapsed time=                               186.74
 OPTIM> # of energy calls=                          0 time=           0.00 %=  0.0
 OPTIM> # of energy+gradient calls=             53805 time=         107.22 %= 57.4
 OPTIM> # of energy+gradient+Hessian calls=       761 time=          40.85 %= 21.9
