
 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> Number of atoms (or variables)  determined as    145
 keyword> Local permutational alignment: alignment threshold=        1.00000
 keyword> Local permutational alignment: alignment cutoff=           5.00000
 keyword> Number of groups of permutable atoms=     6
CHARMMTYPE set to  2
1
                 Chemistry at HARvard Macromolecular Mechanics
                   (CHARMM) - Developmental Version 35b4   February 15, 2010   
       Copyright(c) 1984-2001  President and Fellows of Harvard College
                              All Rights Reserved
      Current operating system: Linux-2.6.16.54-0.2.5-smp(x86_64)@comp32.ch.
                 Created on  5/28/12 at 12:38:14 by user: wales       

            Maximum number of ATOMS:     25140, and RESidues:       14000
            Current HEAP size:         2048000, and STACK size:    500000

 RDTITL> * INPUT FILE FOR TRYPZIP 1LE1
 RDTITL> *
  
 CHARMM>    BOMLev -2
 Parameter: TOP <- "toph19_eef1_bs360.inp"
 Parameter: PAR <- "param19_eef1_bs360.inp"
  
 CHARMM>    WRNLEV -1
  
 CHARMM>    PRNLEV 1
 NBOND          152
 NTHETA          223
 NPHI           88

chsetdihe> number of internal coordinates for segment    1
 chsetdihe> NPHIPSI           24
 chsetdihe> NOMEGAC           11
 chsetdihe> NSIDECHAIN           27
 chsetdihe> NCHIRAL           13

chsetdihe> total number of internal coordinates
 chsetdihe> NPHIPSITOT=            24
 chsetdihe> NOMEGACTOT=            11
 chsetdihe> NSIDECHAINTOT=            27
 chsetdihe> NCHIRALTOT=            13

 chsetdihe>            51  twistable dihedrals identified
chsetdihe> SEG-NR, NSEGATOMS :    1     145

 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>  435 Cartesian coordinates will be optimised for  145 CHARMM 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


 natintsetup, NATOMS          145
 cartres           12
 KeyInt>> Using natural internal coordinates. # of coords =        429
 KeyInt>> Parameter file for internal coordinates is naturals-noH.par                                                                                    
 KeyInt>> KD, NNZ are         50      4500
 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.
 OPTIM> Using translational/rotational ev shift=     1000000.000    
 OPTIM> Initial energy=    -388.8174209     RMS force=    0.9142892131E-06
 OPTIM> Final energy  =    -385.4791588     RMS force=    0.9033076212E-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=     11171.    
 decide> The unconnected minima in the chain and their distances are:
     2       22.35     1 
 

 tryconnect> 210-iteration DNEB run for minima 1_S and 2_F using 6 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      1.288396211    
 Double-ended search iterations= 210 RMS= 0.1881 Dev= 0.34% S= 23.12 time= 1.69
 Following    1 images are candidates for TS:    5  
 Converged to TS (number of iterations):        113
 DNEB run yielded 1 true transition state(s) time=   8.81

 >>>>>  Path run for ts 1 ...
 Plus  side of path:                     927 steps. Energy=    -385.4791588       time=       2.92
 Minus side of path:                     944 steps. Energy=    -385.8162135       time=       3.27

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -385.4791588 0.22210E-01     -385.4569492 0.35926         -385.8162135   9.369   9.188   6.201  23.384
        Known (#2)                                              *NEW* (Placed in 3)
 Unconnected minimum 3 found its way to F set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 2 >>>>>>>>>>>>>>>>>>>>> 3 minima and 1 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      2 steps with      1 missing connections, weight=     20384.    
 decide> The unconnected minima in the chain and their distances are:
     3       27.32     1 
 

 tryconnect> 280-iteration DNEB run for minima 1_S and 3_F using 8 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant     0.6507276371    
 Double-ended search iterations= 280 RMS= 0.2340 Dev= 0.20% S= 29.17 time= 3.02
 Following    1 images are candidates for TS:    6  
 Converged to TS (number of iterations):        100
 DNEB run yielded 1 true transition state(s) time=  10.03

 >>>>>  Path run for ts 2 ...
 Plus  side of path:                     972 steps. Energy=    -386.9948355       time=       3.95
 Minus side of path:                    1142 steps. Energy=    -394.6417674       time=       3.39

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -386.9948355 0.14120         -386.8536333  7.7881         -394.6417674  23.018  21.847   2.385  60.808
        *NEW* (Placed in 4)                                     *NEW* (Placed in 5)
 Connection established between members of the U set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 3 >>>>>>>>>>>>>>>>>>>>> 5 minima and 2 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      3 steps with      2 missing connections, weight=     21483.    
 decide> The unconnected minima in the chain and their distances are:
     3       12.56     4     4       26.92     1 
 

 tryconnect> 105-iteration DNEB run for minima 3_F and 4_U using 3 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      3.589423646    
 Double-ended search iterations= 105 RMS= 0.1794 Dev= 0.19% S= 12.64 time= 0.47
 No maximum in profile - using highest image
 Following    0 images are candidates for TS:    1  
 Converged to TS (number of iterations):         32
 DNEB run yielded 1 true transition state(s) time=   3.96

 >>>>>  Path run for ts 3 ...
 Plus  side of path:                     957 steps. Energy=    -386.9948355       time=       3.34
 Minus side of path:                     906 steps. Energy=    -385.8162135       time=       3.08

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -386.9948355  1.1844         -385.8103897 0.58238E-02     -385.8162135  12.616  12.562   5.647  25.679
        Known (#4)                                              Known (#3)
 Unconnected minimum 4 found its way to F set.

 tryconnect> 280-iteration DNEB run for minima 1_S and 4_F using 8 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant     0.6507276371    
 Double-ended search iterations= 280 RMS= 0.0626 Dev= 0.75% S= 28.73 time= 3.07
 Following    1 images are candidates for TS:    5  
 Converged to TS (number of iterations):        123
 DNEB run yielded 1 true transition state(s) time=  11.32

 >>>>>  Path run for ts 4 ...
 Plus  side of path:                     954 steps. Energy=    -391.6351044       time=       2.41
 Minus side of path:                     922 steps. Energy=    -394.6417674       time=       2.40

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -391.6351044  1.1367         -390.4984037  4.1434         -394.6417674   7.037   6.200  14.243  10.180
        *NEW* (Placed in 6)                                     Known (#5)
 Unconnected minimum 6 found its way to F set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 4 >>>>>>>>>>>>>>>>>>>>> 6 minima and 4 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      1 steps with      1 missing connections, weight=     22341.    
 decide> The unconnected minima in the chain and their distances are:
     2       22.35     1 
 

 tryconnect> 805-iteration DNEB run for minima 1_S and 2_F using 23 images  (DNEB attempt #2)  ...
 lbfgs> Final DNEB force constant     0.5621229993    
 Double-ended search iterations= 805 RMS= 0.0412 Dev= 3.70% S= 29.89 time= 24.03
 Following    2 images are candidates for TS:   13   17  
 Converged to TS (number of iterations):        132
 Converged to TS (number of iterations):         95
 DNEB run yielded 2 true transition state(s) time=  20.78
 isnewts> transition state is the same as number        4 energy=     -390.4984036582
 tryconnect> Try the path again for ts      1 with pushoff=    0.1000000000E-01
 isnewts> transition state is the same as number        2 energy=     -386.8536333438
 tryconnect> Try the path again for ts      2 with pushoff=    0.1000000000E-01

 >>>>>  Path run for ts 5 ...
 tryconnect> Trying this transition state path again with pushoff=    0.1000000000E-01
 Plus  side of path:                     931 steps. Energy=    -394.6417674       time=       2.76
 Minus side of path:                     958 steps. Energy=    -391.6351044       time=       2.51

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -394.6417674  4.1434         -390.4984037  1.1367         -391.6351044   7.037   6.200  14.235  10.186
        Known (#5)                                              Known (#6)
 Alternative path found between members of the F set.

 >>>>>  Path run for ts 6 ...
 tryconnect> Trying this transition state path again with pushoff=    0.1000000000E-01
 Plus  side of path:                     949 steps. Energy=    -386.9948355       time=       2.42
 Minus side of path:                    1143 steps. Energy=    -394.6417674       time=       3.71

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -386.9948355 0.14120         -386.8536333  7.7881         -394.6417674  23.013  21.842   2.390  60.677
        Known (#4)                                              Known (#5)
 Alternative path found between members of the F set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 5 >>>>>>>>>>>>>>>>>>>>> 6 minima and 6 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      3 steps with      1 missing connections, weight=     39002.    
 decide> The unconnected minima in the chain and their distances are:
     4       26.92     1 
 

 tryconnect> 805-iteration DNEB run for minima 1_S and 4_F using 23 images  (DNEB attempt #2)  ...
 lbfgs> Final DNEB force constant     0.3130111196    
 Double-ended search iterations= 805 RMS= 0.0340 Dev= 3.02% S= 33.65 time= 24.63
 Following    1 images are candidates for TS:   19  
 Converged to TS (number of iterations):         74
 DNEB run yielded 1 true transition state(s) time=   6.17
 isnewts> transition state is the same as number        2 energy=     -386.8536333442
 tryconnect> Will not repeat search for TS      1 same as TS      2
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 6 >>>>>>>>>>>>>>>>>>>>> 6 minima and 6 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      2 steps with      1 missing connections, weight=     40767.    
 decide> The unconnected minima in the chain and their distances are:
     3       27.32     1 
 

 tryconnect> 805-iteration DNEB run for minima 1_S and 3_F using 23 images  (DNEB attempt #2)  ...
 lbfgs> Final DNEB force constant     0.6197406068    
 Double-ended search iterations= 805 RMS= 0.0390 Dev= 5.28% S= 39.70 time= 24.40
 Following    3 images are candidates for TS:    4   14   18  
 Converged to TS (number of iterations):         34
 Converged to TS (number of iterations):        113
 Converged to TS (number of iterations):         52
 DNEB run yielded 3 true transition state(s) time=  22.03
 isnewts> transition state is the same as number        4 energy=     -390.4984036582
 tryconnect> Will not repeat search for TS      2 same as TS      4
 isnewts> transition state is the same as number        2 energy=     -386.8536333442
 tryconnect> Will not repeat search for TS      3 same as TS      2

 >>>>>  Path run for ts 7 ...
 Plus  side of path:                     935 steps. Energy=    -388.8174209       time=       3.09
 Minus side of path:                     956 steps. Energy=    -388.6078406       time=       3.79

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -388.8174209 0.24241         -388.5750149 0.32826E-01     -388.6078406   5.971   5.803   3.544  40.912
        Known (#1)                                              *NEW* (Placed in 7)
 Unconnected minimum 7 found its way to S set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 7 >>>>>>>>>>>>>>>>>>>>> 7 minima and 7 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      2 steps with      1 missing connections, weight=     9081.4    
 decide> The unconnected minima in the chain and their distances are:
     2       20.86     7 
 

 tryconnect> 210-iteration DNEB run for minima 2_F and 7_S using 6 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      1.288396211    
 Double-ended search iterations= 210 RMS= 0.1366 Dev= 0.41% S= 21.57 time= 1.83
 Following    1 images are candidates for TS:    3  
 Converged to TS (number of iterations):        143
 DNEB run yielded 1 true transition state(s) time=  12.06
 isnewts> transition state is the same as number        2 energy=     -386.8536333443
 tryconnect> Will not repeat search for TS      1 same as TS      2
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 8 >>>>>>>>>>>>>>>>>>>>> 7 minima and 7 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      4 steps with      1 missing connections, weight=     14357.    
 decide> The unconnected minima in the chain and their distances are:
     4       24.30     7 
 

 tryconnect> 245-iteration DNEB run for minima 4_F and 7_S using 7 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant     0.9156391332    
 Double-ended search iterations= 245 RMS= 0.0781 Dev= 0.51% S= 25.36 time= 2.31
 Following    1 images are candidates for TS:    3  
 Converged to TS (number of iterations):        112
 DNEB run yielded 1 true transition state(s) time=  10.08
 isnewts> transition state is the same as number        2 energy=     -386.8536333442
 tryconnect> Will not repeat search for TS      1 same as TS      2
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 9 >>>>>>>>>>>>>>>>>>>>> 7 minima and 7 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      3 steps with      1 missing connections, weight=     15242.    
 decide> The unconnected minima in the chain and their distances are:
     3       24.79     7 
 

 tryconnect> 245-iteration DNEB run for minima 3_F and 7_S using 7 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant     0.9156391332    
 Double-ended search iterations= 245 RMS= 0.2188 Dev= 0.40% S= 25.89 time= 2.35
 Following    1 images are candidates for TS:    3  
 Converged to TS (number of iterations):        120
 DNEB run yielded 1 true transition state(s) time=   9.72
 isnewts> transition state is the same as number        2 energy=     -386.8536333441
 tryconnect> Will not repeat search for TS      1 same as TS      2
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 10 >>>>>>>>>>>>>>>>>>>>> 7 minima and 7 ts are known >>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      2 steps with      1 missing connections, weight=     18163.    
 decide> The unconnected minima in the chain and their distances are:
     2       20.86     7 
 

 tryconnect> 805-iteration DNEB run for minima 2_F and 7_S using 23 images  (DNEB attempt #2)  ...
 lbfgs> Final DNEB force constant     0.3804669723    
 Double-ended search iterations= 805 RMS= 0.0524 Dev= 4.04% S= 33.68 time= 24.37
 Following    3 images are candidates for TS:    2    8   12  
 Converged to TS (number of iterations):         32
 Converged to TS (number of iterations):         70
 Converged to TS (number of iterations):        109
 DNEB run yielded 3 true transition state(s) time=  21.35
 isnewts> transition state is the same as number        1 energy=     -385.4569491923
 tryconnect> Try the path again for ts      1 with pushoff=    0.1000000000E-01
 isnewts> transition state is the same as number        2 energy=     -386.8536333442
 tryconnect> Will not repeat search for TS      2 same as TS      2

 >>>>>  Path run for ts 8 ...
 tryconnect> Trying this transition state path again with pushoff=    0.1000000000E-01
 Plus  side of path:                     941 steps. Energy=    -385.4791588       time=       2.25
 Minus side of path:                     964 steps. Energy=    -385.8162135       time=       3.25

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -385.4791588 0.22210E-01     -385.4569492 0.35926         -385.8162135   9.369   9.188   6.201  23.382
        Known (#2)                                              Known (#3)
 Alternative path found between members of the F set.

 >>>>>  Path run for ts 9 ...
 Plus  side of path:                     892 steps. Energy=    -387.9455983       time=       2.86
 Minus side of path:                    1060 steps. Energy=    -391.6351044       time=       4.59

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -387.9455983 0.82426E-03     -387.9447740  3.6903         -391.6351044  15.479  15.406   2.437  59.498
        *NEW* (Placed in 8)                                     Known (#6)
 Unconnected minimum 8 found its way to F set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 11 >>>>>>>>>>>>>>>>>>>>> 8 minima and 9 ts are known >>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      7 steps with      1 missing connections, weight=     14937.    
 decide> The unconnected minima in the chain and their distances are:
     8       24.63     7 
 

 tryconnect> 245-iteration DNEB run for minima 7_S and 8_F using 7 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant     0.9156391332    
 Double-ended search iterations= 245 RMS= 0.0409 Dev= 0.07% S= 25.16 time= 2.39
 Following    1 images are candidates for TS:    4  
 Converged to TS (number of iterations):         38
 DNEB run yielded 1 true transition state(s) time=   6.02

 >>>>>  Path run for ts 10 ...
 Plus  side of path:                     937 steps. Energy=    -387.9455983       time=       3.02
 Minus side of path:                     976 steps. Energy=    -388.6935909       time=       3.16

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -387.9455983 0.34135         -387.6042476  1.0893         -388.6935909  22.957  21.851   3.072  47.197
        Known (#8)                                              *NEW* (Placed in 9)
 Unconnected minimum 9 found its way to F set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 12 >>>>>>>>>>>>>>>>>>>>> 9 minima and 10 ts are known >>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      8 steps with      1 missing connections, weight=     269.37    
 decide> The unconnected minima in the chain and their distances are:
     9        6.46     7 
 

 tryconnect> 70-iteration DNEB run for minima 7_S and 9_F using 2 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      5.050679530    
 Double-ended search iterations= 70 RMS= 0.0823 Dev= 0.01% S= 6.47 time= 0.24
 Following    1 images are candidates for TS:    1  
 Converged to TS (number of iterations):         17
 DNEB run yielded 1 true transition state(s) time=   3.40

 >>>>>  Path run for ts 11 ...
 Plus  side of path:                     885 steps. Energy=    -388.6078406       time=       2.48
 Minus side of path:                     937 steps. Energy=    -388.6935909       time=       2.83

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -388.6078406 0.35417E-02     -388.6042989 0.89292E-01     -388.6935909   6.518   6.458   8.915  16.264
        Known (#7)                                              Known (#9)
 Connected path found
  ts        E+         Ets - E+          Ets       Ets - E-          E-          S       D      gamma   ~N
   7     -388.8174209 0.24241        -388.5750149 0.32826E-01    -388.6078406   5.971   5.803   3.544  40.912
  11     -388.6078406 0.35417E-02    -388.6042989 0.89292E-01    -388.6935909   6.518   6.458   8.915  16.264
  10     -388.6935909  1.0893        -387.6042476 0.34135        -387.9455983  22.957  21.851   3.072  47.197
   9     -387.9455983 0.82426E-03    -387.9447740  3.6903        -391.6351044  15.479  15.406   2.437  59.498
   4     -391.6351044  1.1367        -390.4984037  4.1434        -394.6417674   7.037   6.200  14.243  10.180
   2     -394.6417674  7.7881        -386.8536333 0.14120        -386.9948355  23.018  21.847   2.385  60.808
   3     -386.9948355  1.1844        -385.8103897 0.58238E-02    -385.8162135  12.616  12.562   5.647  25.679
   1     -385.8162135 0.35926        -385.4569492 0.22210E-01    -385.4791588   9.369   9.188   6.201  23.384

 Number of TS in the path       =      8
 Number of cycles               =     12

 Elapsed time=                               328.31
 OPTIM> # of energy calls=                          0 time=           0.00 %=  0.0
 OPTIM> # of energy+gradient calls=            127434 time=         162.56 %= 49.5
 OPTIM> # of energy+gradient+Hessian calls=      1509 time=           7.54 %=  2.3
