
 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 11:58:38
  [-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=    -533.8934689     RMS force=    0.9370030017E-06
 OPTIM> Final energy  =    -535.9666195     RMS force=    0.9878243274E-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=     9105.2    
 decide> The unconnected minima in the chain and their distances are:
     2       20.88     1 
 

 tryconnect> 210-iteration DNEB run for minima 1_S and 2_F using 6 images  (DNEB attempt #1)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant      1.288396211    
 Double-ended search iterations= 210 RMS= 0.1481 Dev= 0.52% S= 23.35 time= 2.57
 Following    1 images are candidates for TS:    5  
 Converged to TS (number of iterations):         95
 DNEB run yielded 1 true transition state(s) time=   8.92

 >>>>>  Path run for ts 1 ...
 Plus  side of path:                     738 steps. Energy=    -533.8864722       time=       1.87
 Minus side of path:                     607 steps. Energy=    -533.3292663       time=       1.49

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -533.8864722 0.64453         -533.2419383 0.87328E-01     -533.3292663  14.413  13.497   2.549  41.984
        *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      3 steps with      2 missing connections, weight=     7084.2    
 decide> The unconnected minima in the chain and their distances are:
     2        3.57     3     4       19.16     1 
 

 tryconnect> 70-iteration DNEB run for minima 2_F and 3_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.0939 Dev= 0.07% S= 3.79 time= 0.30
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         12
 DNEB run yielded 1 true transition state(s) time=   2.33

 >>>>>  Path run for ts 2 ...
 Plus  side of path:                     609 steps. Energy=    -535.9666195       time=       1.50
 Minus side of path:                     600 steps. Energy=    -533.8864722       time=       1.49

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -535.9666195  2.1201         -533.8464839 0.39988E-01     -533.8864722   3.735   3.570  33.608   3.184
        Known (#2)                                              Known (#3)
 Unconnected minimum 3 found its way to F set.

 tryconnect> 175-iteration DNEB run for minima 1_S and 4_F using 5 images  (DNEB attempt #1)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant      1.812902854    
 Double-ended search iterations= 175 RMS= 0.1242 Dev= 0.15% S= 19.93 time= 1.79
 Following    1 images are candidates for TS:    4  
 Converged to TS (number of iterations):         99
 DNEB run yielded 1 true transition state(s) time=   9.28

 >>>>>  Path run for ts 3 ...
 Plus  side of path:                     631 steps. Energy=    -533.1047074       time=       1.55
 Minus side of path:                     690 steps. Energy=    -533.8712700       time=       1.73

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -533.1047074 0.70343E-01     -533.0343647 0.83691         -533.8712700   6.966   6.379   6.280  17.037
        *NEW* (Placed in 5)                                     *NEW* (Placed in 6)
 Connection established between members of the U set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 3 >>>>>>>>>>>>>>>>>>>>> 6 minima and 3 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      4 steps with      2 missing connections, weight=     2348.3    
 decide> The unconnected minima in the chain and their distances are:
     4       10.93     5     5       10.14     1 
 

 tryconnect> 105-iteration DNEB run for minima 4_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.0897 Dev= 0.20% S= 11.20 time= 0.66
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         91
 DNEB run yielded 1 true transition state(s) time=   8.61
 isnewts> transition state is the same as number        3 energy=     -533.0343646529
 tryconnect> Try the path again for ts      1 with pushoff=    0.1000000000E-01

 >>>>>  Path run for ts 4 ...
 tryconnect> Trying this transition state path again with pushoff=    0.1000000000E-01
 Plus  side of path:                     650 steps. Energy=    -533.1047074       time=       1.60
 Minus side of path:                     694 steps. Energy=    -533.8712700       time=       1.76

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -533.1047074 0.70343E-01     -533.0343647 0.83691         -533.8712700   6.966   6.379   6.284  17.027
        Known (#5)                                              Known (#6)
 Connection established between members of the U set.

 tryconnect> 105-iteration DNEB run for minima 1_S 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.0700 Dev= 0.10% S= 10.18 time= 0.65
 Following    1 images are candidates for TS:    3  
 Converged to TS (number of iterations):         46
 DNEB run yielded 1 true transition state(s) time=   5.18

 >>>>>  Path run for ts 5 ...
 Plus  side of path:                     634 steps. Energy=    -533.1047074       time=       1.58
 Minus side of path:                     647 steps. Energy=    -534.3529802       time=       1.62

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -533.1047074 0.17642         -532.9282899  1.4247         -534.3529802  12.780  12.102   2.181  49.062
        Known (#5)                                              *NEW* (Placed in 7)
 Connection established between members of the U set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 4 >>>>>>>>>>>>>>>>>>>>> 7 minima and 5 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      6 steps with      2 missing connections, weight=     2684.9    
 decide> The unconnected minima in the chain and their distances are:
     4       13.09     6     7        7.63     1 
 

 tryconnect> 105-iteration DNEB run for minima 4_F and 6_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.1990 Dev= 0.14% S= 13.75 time= 0.66
 Following    1 images are candidates for TS:    2  
 Failed to converge to TS (number of iterations):        251
 DNEB run yielded 0 true transition state(s) time=  25.41

 tryconnect> 70-iteration DNEB run for minima 1_S 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.6867 Dev= 0.03% S= 7.65 time= 0.30
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         21
 DNEB run yielded 1 true transition state(s) time=   3.22

 >>>>>  Path run for ts 6 ...
 Plus  side of path:                     643 steps. Energy=    -533.8934689       time=       1.63
 Minus side of path:                     600 steps. Energy=    -534.3626992       time=       1.47

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -533.8934689 0.19769         -533.6957764 0.66692         -534.3626992   7.437   7.366   2.539  42.138
        Known (#1)                                              *NEW* (Placed in 8)
 Unconnected minimum 8 found its way to S set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 5 >>>>>>>>>>>>>>>>>>>>> 8 minima and 6 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      6 steps with      2 missing connections, weight=     2617.1    
 decide> The unconnected minima in the chain and their distances are:
     4       10.93     5     7        2.02     8 
 

 tryconnect> 805-iteration DNEB run for minima 4_F and 5_U using 23 images  (DNEB attempt #2)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant      11.57625000    
 Double-ended search iterations= 805 RMS= 0.0697 Dev= 8.22% S= 12.19 time= 37.22
 Following    1 images are candidates for TS:    9  
 Converged to TS (number of iterations):         85
 DNEB run yielded 1 true transition state(s) time=   8.27
 isnewts> transition state is the same as number        1 energy=     -533.2419383184
 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:                     735 steps. Energy=    -533.8864722       time=       1.87
 Minus side of path:                     616 steps. Energy=    -533.3292663       time=       1.51

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -533.8864722 0.64453         -533.2419383 0.87328E-01     -533.3292663  14.413  13.497   2.544  42.054
        Known (#3)                                              Known (#4)
 Alternative path found between members of the F set.

 tryconnect> 70-iteration DNEB run for minima 7_U and 8_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.0159 Dev= 0.01% S= 2.05 time= 0.30
 Following    1 images are candidates for TS:    1  
 Converged to TS (number of iterations):         14
 DNEB run yielded 1 true transition state(s) time=   2.47

 >>>>>  Path run for ts 8 ...
 Plus  side of path:                     610 steps. Energy=    -534.3626992       time=       1.50
 Minus side of path:                     614 steps. Energy=    -534.3529802       time=       1.51

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -534.3626992 0.15856E-01     -534.3468435 0.61367E-02     -534.3529802   2.105   2.021  24.910   4.295
        Known (#8)                                              Known (#7)
 Unconnected minimum 7 found its way to S set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 6 >>>>>>>>>>>>>>>>>>>>> 8 minima and 8 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      7 steps with      1 missing connections, weight=     4481.3    
 decide> The unconnected minima in the chain and their distances are:
     4       13.09     6 
 

 tryconnect> 805-iteration DNEB run for minima 4_F and 6_S using 23 images  (DNEB attempt #2)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant     0.1921616749    
 Double-ended search iterations= 805 RMS= 0.0136 Dev= 3.01% S= 19.67 time= 37.36
 Following    1 images are candidates for TS:    5  
 Converged to TS (number of iterations):         67
 DNEB run yielded 1 true transition state(s) time=   6.98

 >>>>>  Path run for ts 9 ...
 Plus  side of path:                     645 steps. Energy=    -533.9337811       time=       1.61
 Minus side of path:                     762 steps. Energy=    -533.6189959       time=       1.98

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -533.9337811 0.44229         -533.4914906 0.12751         -533.6189959  12.482  10.883   2.451  43.651
        *NEW* (Placed in 9)                                     *NEW* (Placed in 10)
 Connection established between members of the U set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 7 >>>>>>>>>>>>>>>>>>>>> 10 minima and 9 ts are known >>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      7 steps with      2 missing connections, weight=     3632.4    
 decide> The unconnected minima in the chain and their distances are:
     3        4.23    10     9       15.26     5 
 

 tryconnect> 70-iteration DNEB run for minima 3_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= 1.0158 Dev= 0.07% S= 4.39 time= 0.30
 Following    1 images are candidates for TS:    2  
 bfgsts> WARNING *** initial eigenvalue is positive - increase NEBK?
 Converged to TS (number of iterations):         27
 DNEB run yielded 1 true transition state(s) time=   3.53

 >>>>>  Path run for ts 10 ...
 Plus  side of path:                     594 steps. Energy=    -533.6189959       time=       1.46
 Minus side of path:                     623 steps. Energy=    -533.8864722       time=       1.54

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -533.6189959 0.30544E-02     -533.6159415 0.27053         -533.8864722   4.473   4.230  23.402   4.572
        Known (#10)                                             Known (#3)
 Unconnected minimum 10 found its way to F set.

 tryconnect> 140-iteration DNEB run for minima 5_S and 9_F using 4 images  (DNEB attempt #1)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant      2.550936371    
 Double-ended search iterations= 140 RMS= 0.2042 Dev= 0.09% S= 15.98 time= 1.16
 Following    1 images are candidates for TS:    3  
 Converged to TS (number of iterations):         61
 DNEB run yielded 1 true transition state(s) time=   6.10

 >>>>>  Path run for ts 11 ...
 Plus  side of path:                     607 steps. Energy=    -533.9337811       time=       1.50
 Minus side of path:                     592 steps. Energy=    -533.6151640       time=       1.46

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -533.9337811 0.34324         -533.5905396 0.24624E-01     -533.6151640   7.065   6.786   2.287  46.785
        Known (#9)                                              *NEW* (Placed in 11)
 Unconnected minimum 11 found its way to F set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 8 >>>>>>>>>>>>>>>>>>>>> 11 minima and 11 ts are known >>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      8 steps with      1 missing connections, weight=     1526.0    
 decide> The unconnected minima in the chain and their distances are:
    11       11.51     5 
 

 tryconnect> 105-iteration DNEB run for minima 5_S and 11_F using 3 images  (DNEB attempt #1)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant      3.589423646    
 Double-ended search iterations= 105 RMS= 0.6887 Dev= 0.22% S= 12.00 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.21
 isnewts> transition state is the same as number        3 energy=     -533.0343646530
 tryconnect> Will not repeat search for TS      1 same as TS      3
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 9 >>>>>>>>>>>>>>>>>>>>> 11 minima and 11 ts are known >>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      9 steps with      1 missing connections, weight=     1739.5    
 decide> The unconnected minima in the chain and their distances are:
    11       12.03     6 
 

 tryconnect> 105-iteration DNEB run for minima 6_S and 11_F using 3 images  (DNEB attempt #1)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant      3.589423646    
 Double-ended search iterations= 105 RMS= 7.3434 Dev= 0.53% S= 12.29 time= 0.66
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         51
 DNEB run yielded 1 true transition state(s) time=   5.30

 >>>>>  Path run for ts 12 ...
 Plus  side of path:                     767 steps. Energy=    -533.8712700       time=       1.99
 Minus side of path:                     610 steps. Energy=    -533.6151640       time=       1.53

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -533.8712700 0.33137         -533.5399029 0.75261E-01     -533.6151640  13.710  12.031   3.340  32.034
        Known (#6)                                              Known (#11)
 Connected path found
  ts        E+         Ets - E+          Ets       Ets - E-          E-          S       D      gamma   ~N
   6     -533.8934689 0.19769        -533.6957764 0.66692        -534.3626992   7.437   7.366   2.539  42.138
   8     -534.3626992 0.15856E-01    -534.3468435 0.61367E-02    -534.3529802   2.105   2.021  24.910   4.295
   5     -534.3529802  1.4247        -532.9282899 0.17642        -533.1047074  12.780  12.102   2.181  49.062
   3     -533.1047074 0.70343E-01    -533.0343647 0.83691        -533.8712700   6.966   6.379   6.280  17.037
  12     -533.8712700 0.33137        -533.5399029 0.75261E-01    -533.6151640  13.710  12.031   3.340  32.034
  11     -533.6151640 0.24624E-01    -533.5905396 0.34324        -533.9337811   7.065   6.786   2.287  46.785
   9     -533.9337811 0.44229        -533.4914906 0.12751        -533.6189959  12.482  10.883   2.451  43.651
  10     -533.6189959 0.30544E-02    -533.6159415 0.27053        -533.8864722   4.473   4.230  23.402   4.572
   2     -533.8864722 0.39988E-01    -533.8464839  2.1201        -535.9666195   3.735   3.570  33.608   3.184

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

 Elapsed time=                               225.07
 OPTIM> # of energy calls=                          0 time=           0.00 %=  0.0
 OPTIM> # of energy+gradient calls=             68464 time=         135.82 %= 60.3
 OPTIM> # of energy+gradient+Hessian calls=       965 time=          51.90 %= 23.1
