
 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 09:59:32
  [-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.
 OPTIM> Using translational/rotational ev shift=     1000000.000    
 OPTIM> Initial energy=    -534.1997122     RMS force=    0.8640551824E-06
 OPTIM> Final energy  =    -531.5047794     RMS force=    0.9923316532E-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=     16683.    
 decide> The unconnected minima in the chain and their distances are:
     2       25.55     1 
 

 tryconnect> 245-iteration DNEB run for minima 1_S and 2_F using 7 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant     0.9156391332    
 Double-ended search iterations= 245 RMS= 0.4422 Dev= 1.75% S= 30.88 time= 3.56
 Following    1 images are candidates for TS:    6  
 Converged to TS (number of iterations):        132
 DNEB run yielded 1 true transition state(s) time=  13.06

 >>>>>  Path run for ts 1 ...
 Plus  side of path:                     628 steps. Energy=    -531.6968194       time=       1.55
 Minus side of path:                     569 steps. Energy=    -531.5047794       time=       1.38

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -531.6968194 0.26621         -531.4306099 0.74169E-01     -531.5047794   4.519   4.078   8.782  12.184
        *NEW* (Placed in 3)                                     Known (#2)
 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=     17227.    
 decide> The unconnected minima in the chain and their distances are:
     3       25.83     1 
 

 tryconnect> 245-iteration DNEB run for minima 1_S and 3_F using 7 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant     0.9156391332    
 Double-ended search iterations= 245 RMS= 1.2239 Dev= 1.71% S= 31.36 time= 3.56
 Following    1 images are candidates for TS:    6  
 Converged to TS (number of iterations):         72
 DNEB run yielded 1 true transition state(s) time=   7.06
 isnewts> transition state is the same as number        1 energy=     -531.4306099474
 tryconnect> Try the path again for ts      1 with pushoff=    0.1000000000E-01

 >>>>>  Path run for ts 2 ...
 tryconnect> Trying this transition state path again with pushoff=    0.1000000000E-01
 Plus  side of path:                     572 steps. Energy=    -531.5047794       time=       1.39
 Minus side of path:                     627 steps. Energy=    -531.6968194       time=       1.55

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -531.5047794 0.74169E-01     -531.4306099 0.26621         -531.6968194   4.519   4.078   8.774  12.196
        Known (#2)                                              Known (#3)
 Alternative path found between members of the F set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 3 >>>>>>>>>>>>>>>>>>>>> 3 minima and 2 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      1 steps with      1 missing connections, weight=     33366.    
 decide> The unconnected minima in the chain and their distances are:
     2       25.55     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.0623 Dev= 4.76% S= 41.11 time= 37.40
 Following    3 images are candidates for TS:   11   14   19  
 Converged to TS (number of iterations):         30
 Converged to TS (number of iterations):        128
 Converged to TS (number of iterations):         73
 DNEB run yielded 3 true transition state(s) time=  26.18
 isnewts> transition state is the same as number        1 energy=     -531.4306099474
 tryconnect> Will not repeat search for TS      3 same as TS      1

 >>>>>  Path run for ts 3 ...
 Plus  side of path:                     602 steps. Energy=    -534.1997122       time=       1.53
 Minus side of path:                     624 steps. Energy=    -533.2726971       time=       1.63

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -534.1997122  2.7271         -531.4726287  1.8001         -533.2726971  11.226   9.992  12.157   8.801
        Known (#1)                                              *NEW* (Placed in 4)
 Unconnected minimum 4 found its way to S set.

 >>>>>  Path run for ts 4 ...
 Plus  side of path:                     688 steps. Energy=    -535.3832044       time=       1.79
 Minus side of path:                     701 steps. Energy=    -533.5989010       time=       1.83

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -535.3832044  2.7080         -532.6752211 0.92368         -533.5989010   8.495   7.208   6.140  17.427
        *NEW* (Placed in 5)                                     *NEW* (Placed in 6)
 Connection established between members of the U set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 4 >>>>>>>>>>>>>>>>>>>>> 6 minima and 4 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      3 steps with      2 missing connections, weight=     7341.7    
 decide> The unconnected minima in the chain and their distances are:
     2       15.54     6     6       15.31     4 
 

 tryconnect> 140-iteration DNEB run for minima 2_F and 6_U using 4 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      2.550936371    
 Double-ended search iterations= 140 RMS= 0.3504 Dev= 0.24% S= 18.15 time= 1.25
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         57
 DNEB run yielded 1 true transition state(s) time=   6.76

 >>>>>  Path run for ts 5 ...
 Plus  side of path:                     951 steps. Energy=    -530.2881462       time=       2.65
 Minus side of path:                     708 steps. Energy=    -531.9013419       time=       1.84

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -530.2881462  1.7963         -528.4918082  3.4095         -531.9013419  28.030  22.191   2.200  48.643
        *NEW* (Placed in 7)                                     *NEW* (Placed in 8)
 Connection established between members of the U set.

 tryconnect> 140-iteration DNEB run for minima 4_S and 6_U using 4 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      2.550936371    
 Double-ended search iterations= 140 RMS= 0.5186 Dev= 0.12% S= 17.99 time= 1.25
 Following    1 images are candidates for TS:    3  
 Converged to TS (number of iterations):         51
 DNEB run yielded 1 true transition state(s) time=   6.21

 >>>>>  Path run for ts 6 ...
 Plus  side of path:                     611 steps. Energy=    -534.5723514       time=       1.56
 Minus side of path:                     588 steps. Energy=    -533.9650399       time=       1.47

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -534.5723514 0.62813         -533.9442250 0.20815E-01     -533.9650399   2.698   2.592  34.049   3.143
        *NEW* (Placed in 9)                                     *NEW* (Placed in 10)
 Connection established between members of the U set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 5 >>>>>>>>>>>>>>>>>>>>> 10 minima and 6 ts are known >>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      3 steps with      2 missing connections, weight=     5817.4    
 decide> The unconnected minima in the chain and their distances are:
     2       16.22     8     8       11.58     4 
 

 tryconnect> 140-iteration DNEB run for minima 2_F and 8_U using 4 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      2.550936371    
 Double-ended search iterations= 140 RMS= 0.2242 Dev= 0.65% S= 17.97 time= 1.24
 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.69
 isnewts> transition state is the same as number        5 energy=     -528.4918081894
 tryconnect> Try the path again for ts      1 with pushoff=    0.1000000000E-01

 >>>>>  Path run for ts 7 ...
 tryconnect> Trying this transition state path again with pushoff=    0.1000000000E-01
 Plus  side of path:                     950 steps. Energy=    -530.2881462       time=       2.67
 Minus side of path:                     696 steps. Energy=    -531.9013419       time=       1.85

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -530.2881462  1.7963         -528.4918082  3.4095         -531.9013419  28.034  22.196   2.193  48.791
        Known (#7)                                              Known (#8)
 Connection established between members of the U set.

 tryconnect> 105-iteration DNEB run for minima 4_S and 8_U using 3 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      3.589423646    
 Double-ended search iterations= 105 RMS= 0.2801 Dev= 0.35% S= 12.87 time= 0.74
 Following    1 images are candidates for TS:    3  
 Converged to TS (number of iterations):         97
 DNEB run yielded 1 true transition state(s) time=   9.95

 >>>>>  Path run for ts 8 ...
 Plus  side of path:                     586 steps. Energy=    -535.2494145       time=       1.43
 Minus side of path:                     595 steps. Energy=    -533.2726971       time=       1.45

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -535.2494145  2.3260         -532.9234135 0.34928         -533.2726971   6.242   4.747  14.421   7.420
        *NEW* (Placed in 11)                                    Known (#4)
 Unconnected minimum 11 found its way to S set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 6 >>>>>>>>>>>>>>>>>>>>> 11 minima and 8 ts are known >>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      6 steps with      3 missing connections, weight=     5900.6    
 decide> The unconnected minima in the chain and their distances are:
     3       16.06     6     6        7.53     8     8       10.99    11 
 

 tryconnect> 140-iteration DNEB run for minima 3_F and 6_U using 4 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      2.550936371    
 Double-ended search iterations= 140 RMS= 0.3036 Dev= 0.51% S= 18.66 time= 1.23
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         69
 DNEB run yielded 1 true transition state(s) time=   7.01

 >>>>>  Path run for ts 9 ...
 Plus  side of path:                     762 steps. Energy=    -531.9282653       time=       1.94
 Minus side of path:                     723 steps. Energy=    -530.2881462       time=       1.81

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -531.9282653  2.1306         -529.7976543 0.49049         -530.2881462  29.252  26.501   5.190  20.617
        *NEW* (Placed in 12)                                    Known (#7)
 Connection established between members of the U set.

 tryconnect> 70-iteration DNEB run for minima 6_U and 8_U using 2 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      5.050679530    
 Double-ended search iterations= 70 RMS= 0.8479 Dev= 0.93% S= 9.59 time= 0.38
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         36
 DNEB run yielded 1 true transition state(s) time=   4.19

 >>>>>  Path run for ts 10 ...
 Plus  side of path:                     765 steps. Energy=    -533.5989010       time=       1.96
 Minus side of path:                     614 steps. Energy=    -531.9013419       time=       1.50

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -533.5989010  1.7783         -531.8205577 0.80784E-01     -531.9013419   9.092   7.592  20.414   5.241
        Known (#6)                                              Known (#8)
 Connection established between members of the U set.

 tryconnect> 105-iteration DNEB run for minima 8_U and 11_S using 3 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      3.589423646    
 Double-ended search iterations= 105 RMS= 0.2470 Dev= 0.45% S= 12.53 time= 0.73
 Following    1 images are candidates for TS:    1  
 Converged to TS (number of iterations):         67
 DNEB run yielded 1 true transition state(s) time=   6.57

 >>>>>  Path run for ts 11 ...
 Plus  side of path:                     598 steps. Energy=    -531.9013419       time=       1.46
 Minus side of path:                     676 steps. Energy=    -534.6241129       time=       1.71

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -531.9013419 0.25033E-01     -531.8763090  2.7478         -534.6241129   6.764   6.023   9.840  10.874
        Known (#8)                                              *NEW* (Placed in 13)
 Connection established between members of the U set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 7 >>>>>>>>>>>>>>>>>>>>> 13 minima and 11 ts are known >>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      8 steps with      2 missing connections, weight=     5375.2    
 decide> The unconnected minima in the chain and their distances are:
     3       15.83    12    13       11.21    11 
 

 tryconnect> 140-iteration DNEB run for minima 3_F and 12_U using 4 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      2.550936371    
 Double-ended search iterations= 140 RMS= 0.1492 Dev= 0.17% S= 16.38 time= 1.23
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         59
 DNEB run yielded 1 true transition state(s) time=   5.97

 >>>>>  Path run for ts 12 ...
 Plus  side of path:                     688 steps. Energy=    -531.9282653       time=       1.76
 Minus side of path:                     665 steps. Energy=    -531.6968194       time=       1.65

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -531.9282653 0.67646         -531.2518018 0.44502         -531.6968194  18.139  15.838   6.512  16.431
        Known (#12)                                             Known (#3)
 Unconnected minimum 12 found its way to F set.

 tryconnect> 105-iteration DNEB run for minima 11_S and 13_F using 3 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      3.589423646    
 Double-ended search iterations= 105 RMS= 0.2391 Dev= 0.16% S= 12.62 time= 0.73
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         36
 DNEB run yielded 1 true transition state(s) time=   4.19

 >>>>>  Path run for ts 13 ...
 Plus  side of path:                     647 steps. Energy=    -534.6241129       time=       1.60
 Minus side of path:                     612 steps. Energy=    -535.2494145       time=       1.50

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -534.6241129 0.74011         -533.8840039  1.3654         -535.2494145  14.145  11.232   9.056  11.816
        Known (#13)                                             Known (#11)
 Connected path found
  ts        E+         Ets - E+          Ets       Ets - E-          E-          S       D      gamma   ~N
   3     -534.1997122  2.7271        -531.4726287  1.8001        -533.2726971  11.226   9.992  12.157   8.801
   8     -533.2726971 0.34928        -532.9234135  2.3260        -535.2494145   6.242   4.747  14.421   7.420
  13     -535.2494145  1.3654        -533.8840039 0.74011        -534.6241129  14.145  11.232   9.056  11.816
  11     -534.6241129  2.7478        -531.8763090 0.25033E-01    -531.9013419   6.764   6.023   9.840  10.874
   5     -531.9013419  3.4095        -528.4918082  1.7963        -530.2881462  28.030  22.191   2.200  48.643
   9     -530.2881462 0.49049        -529.7976543  2.1306        -531.9282653  29.252  26.501   5.190  20.617
  12     -531.9282653 0.67646        -531.2518018 0.44502        -531.6968194  18.139  15.838   6.512  16.431
   1     -531.6968194 0.26621        -531.4306099 0.74169E-01    -531.5047794   4.519   4.078   8.782  12.184

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

 Elapsed time=                               203.76
 OPTIM> # of energy calls=                          0 time=           0.00 %=  0.0
 OPTIM> # of energy+gradient calls=             54520 time=         108.66 %= 53.3
 OPTIM> # of energy+gradient+Hessian calls=       977 time=          54.94 %= 27.0
