
 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)@comp34.ch.
                 Created on  5/28/12 at 13: 2:32 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


 OPTIM> Using translational/rotational ev shift=     1000000.000    
 OPTIM> Initial energy=    -381.4721359     RMS force=    0.9165938109E-06
 OPTIM> Final energy  =    -382.2034186     RMS force=    0.9976630485E-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=     45557.    
 decide> The unconnected minima in the chain and their distances are:
     2       35.72     1 
 

 tryconnect> 350-iteration DNEB run for minima 1_S and 2_F using 10 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant     0.3286616756    
 Double-ended search iterations= 350 RMS= 0.0599 Dev= 0.91% S= 41.42 time= 3.92
 Following    1 images are candidates for TS:    5  
 Converged to TS (number of iterations):         97
 DNEB run yielded 1 true transition state(s) time=   9.41

 >>>>>  Path run for ts 1 ...
 Plus  side of path:                    1563 steps. Energy=    -382.7781754       time=       6.65
 Minus side of path:                    1045 steps. Energy=    -382.9499490       time=       3.90

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -382.7781754  1.8998         -380.8783471  2.0716         -382.9499490  56.590  53.677   1.956  74.116
        *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      2 steps with      2 missing connections, weight=     39330.    
 decide> The unconnected minima in the chain and their distances are:
     2       33.17     4     4       14.14     1 
 

 tryconnect> 315-iteration DNEB run for minima 2_F and 4_U using 9 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant     0.4624599827    
 Double-ended search iterations= 315 RMS= 0.0540 Dev= 0.20% S= 34.67 time= 3.31
 Following    1 images are candidates for TS:    5  
 Converged to TS (number of iterations):         97
 DNEB run yielded 1 true transition state(s) time=  11.39

 >>>>>  Path run for ts 2 ...
 Plus  side of path:                    1530 steps. Energy=    -382.7781754       time=       8.07
 Minus side of path:                    1015 steps. Energy=    -382.9499490       time=       2.72

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -382.7781754  1.8175         -380.9606720  1.9893         -382.9499490  56.489  53.692   1.945  74.531
        Known (#3)                                              Known (#4)
 Connection established between members of the U set.

 tryconnect> 140-iteration DNEB run for minima 1_S and 4_U using 4 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      2.550936371    
 Double-ended search iterations= 140 RMS= 0.7647 Dev= 0.27% S= 18.87 time= 0.64
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         38
 DNEB run yielded 1 true transition state(s) time=   6.03

 >>>>>  Path run for ts 3 ...
 Plus  side of path:                    1041 steps. Energy=    -381.4721359       time=       3.45
 Minus side of path:                    1009 steps. Energy=    -382.9439746       time=       3.11

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -381.4721359  2.3314         -379.1407164  3.8033         -382.9439746  17.762  10.655  20.023   7.242
        Known (#1)                                              *NEW* (Placed in 5)
 Unconnected minimum 5 found its way to S set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 3 >>>>>>>>>>>>>>>>>>>>> 5 minima and 3 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      2 steps with      1 missing connections, weight=     39172.    
 decide> The unconnected minima in the chain and their distances are:
     2       33.96     5 
 

 tryconnect> 350-iteration DNEB run for minima 2_F and 5_S using 10 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant     0.3286616756    
 Double-ended search iterations= 350 RMS= 0.2768 Dev= 0.84% S= 35.84 time= 3.93
 Following    1 images are candidates for TS:    6  
 Converged to TS (number of iterations):        100
 DNEB run yielded 1 true transition state(s) time=   8.03
 isnewts> transition state is the same as number        2 energy=     -380.9606720374
 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:                    1545 steps. Energy=    -382.7781754       time=       6.78
 Minus side of path:                    1028 steps. Energy=    -382.9499490       time=       3.80

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -382.7781754  1.8175         -380.9606720  1.9893         -382.9499490  56.488  53.690   1.950  74.372
        Known (#3)                                              Known (#4)
 Connection established between members of the U set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 4 >>>>>>>>>>>>>>>>>>>>> 5 minima and 4 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      3 steps with      2 missing connections, weight=     73412.    
 decide> The unconnected minima in the chain and their distances are:
     2       33.17     4     4        7.42     5 
 

 tryconnect> 805-iteration DNEB run for minima 2_F and 4_U using 23 images  (DNEB attempt #2)  ...
 lbfgs> Final DNEB force constant     0.1300625854    
 Double-ended search iterations= 805 RMS= 0.0200 Dev= 6.60% S= 38.97 time= 20.93
 Following    2 images are candidates for TS:    1   14  
 bfgsts> WARNING *** initial eigenvalue is positive - increase NEBK?
 Converged to TS (number of iterations):         77
 Converged to TS (number of iterations):         58
 DNEB run yielded 2 true transition state(s) time=  14.34
 isnewts> transition state is the same as number        2 energy=     -380.9606720375
 tryconnect> Will not repeat search for TS      2 same as TS      2

 >>>>>  Path run for ts 5 ...
 Plus  side of path:                    1365 steps. Energy=    -382.7543847       time=       7.33
 Minus side of path:                    1043 steps. Energy=    -382.2034186       time=       2.97

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -382.7543847  1.1904         -381.5639427 0.63948         -382.2034186  44.752  40.442   1.846  78.546
        *NEW* (Placed in 6)                                     Known (#2)
 Unconnected minimum 6 found its way to F set.

 tryconnect> 70-iteration DNEB run for minima 4_U and 5_S using 2 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      5.568374182    
 Double-ended search iterations= 70 RMS= 3.7959 Dev= 1.51% S= 7.44 time= 0.16
 Following    1 images are candidates for TS:    1  
 Converged to TS (number of iterations):         20
 DNEB run yielded 1 true transition state(s) time=   4.08

 >>>>>  Path run for ts 6 ...
 Plus  side of path:                     978 steps. Energy=    -382.9499490       time=       2.79
 Minus side of path:                     998 steps. Energy=    -382.9736159       time=       2.86

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -382.9499490 0.98574E-02     -382.9400915 0.33524E-01     -382.9736159   7.111   7.052   2.076  69.837
        Known (#4)                                              *NEW* (Placed in 7)
 Connection established between members of the U set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 5 >>>>>>>>>>>>>>>>>>>>> 7 minima and 6 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      3 steps with      2 missing connections, weight=     38239.    
 decide> The unconnected minima in the chain and their distances are:
     2       33.69     7     7        0.99     5 
 

 tryconnect> 350-iteration DNEB run for minima 2_F and 7_U using 10 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant     0.3286616756    
 Double-ended search iterations= 350 RMS= 0.0288 Dev= 0.65% S= 35.48 time= 3.98
 Following    1 images are candidates for TS:    6  
 Converged to TS (number of iterations):         66
 DNEB run yielded 1 true transition state(s) time=   6.11
 isnewts> transition state is the same as number        2 energy=     -380.9606720375
 tryconnect> Will not repeat search for TS      1 same as TS      2

 tryconnect> 70-iteration DNEB run for minima 5_S and 7_U using 2 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      6.768393620    
 Double-ended search iterations= 70 RMS= 0.0215 Dev= 0.23% S= 0.99 time= 0.16
 Following    1 images are candidates for TS:    1  
 Converged to TS (number of iterations):         13
 DNEB run yielded 1 true transition state(s) time=   3.53

 >>>>>  Path run for ts 7 ...
 Plus  side of path:                     998 steps. Energy=    -382.9439746       time=       3.67
 Minus side of path:                    1002 steps. Energy=    -382.9736159       time=       3.57

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -382.9439746 0.26719E-01     -382.9172558 0.56360E-01     -382.9736159   1.003   0.992  16.941   8.559
        Known (#5)                                              Known (#7)
 Unconnected minimum 7 found its way to S set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 6 >>>>>>>>>>>>>>>>>>>>> 7 minima and 7 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      3 steps with      1 missing connections, weight=     76476.    
 decide> The unconnected minima in the chain and their distances are:
     2       33.69     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.5958316896E-01
 Double-ended search iterations= 805 RMS= 0.0226 Dev= 10.13% S= 43.06 time= 20.66
 Following    2 images are candidates for TS:    1   13  
 bfgsts> WARNING *** initial eigenvalue is positive - increase NEBK?
 Converged to TS (number of iterations):         70
 Converged to TS (number of iterations):         64
 DNEB run yielded 2 true transition state(s) time=  11.25
 isnewts> transition state is the same as number        5 energy=     -381.5639427018
 tryconnect> Try the path again for ts      1 with pushoff=    0.1000000000E-01
 isnewts> transition state is the same as number        2 energy=     -380.9606720374
 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:                    1372 steps. Energy=    -382.7543847       time=       4.43
 Minus side of path:                    1048 steps. Energy=    -382.2034186       time=       2.90

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -382.7543847  1.1904         -381.5639427 0.63948         -382.2034186  44.744  40.428   1.848  78.451
        Known (#6)                                              Known (#2)
 Alternative path found between members of the F set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 7 >>>>>>>>>>>>>>>>>>>>> 7 minima and 8 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      2 steps with      1 missing connections, weight=     78345.    
 decide> The unconnected minima in the chain and their distances are:
     2       33.96     5 
 

 tryconnect> 805-iteration DNEB run for minima 2_F and 5_S using 23 images  (DNEB attempt #2)  ...
 lbfgs> Final DNEB force constant     0.7242371427E-01
 Double-ended search iterations= 805 RMS= 0.0191 Dev= 5.11% S= 39.88 time= 20.68
 Following    1 images are candidates for TS:   13  
 Converged to TS (number of iterations):         79
 DNEB run yielded 1 true transition state(s) time=   6.17
 isnewts> transition state is the same as number        2 energy=     -380.9606720373
 tryconnect> Will not repeat search for TS      1 same as TS      2
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 8 >>>>>>>>>>>>>>>>>>>>> 7 minima and 8 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      1 steps with      1 missing connections, weight=     91114.    
 decide> The unconnected minima in the chain and their distances are:
     2       35.72     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.7532985809    
 Double-ended search iterations= 805 RMS= 0.0409 Dev= 4.51% S= 46.31 time= 20.43
 Following    2 images are candidates for TS:    8   13  
 Converged to TS (number of iterations):         77
 Converged to TS (number of iterations):         33
 DNEB run yielded 2 true transition state(s) time=  14.07

 >>>>>  Path run for ts 9 ...
 Plus  side of path:                    1131 steps. Energy=    -380.0234371       time=       3.05
 Minus side of path:                    1048 steps. Energy=    -381.4282510       time=       3.41

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -380.0234371 0.66870         -379.3547362  2.0735         -381.4282510  41.497  39.475   1.809  80.163
        *NEW* (Placed in 8)                                     *NEW* (Placed in 9)
 Connection established between members of the U set.

 >>>>>  Path run for ts 10 ...
 Plus  side of path:                    1012 steps. Energy=    -382.1663989       time=       3.12
 Minus side of path:                    1035 steps. Energy=    -380.7879935       time=       2.91

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -382.1663989  3.7501         -378.4162786  2.3717         -380.7879935  18.723  10.390  22.646   6.403
        *NEW* (Placed in 10)                                    *NEW* (Placed in 11)
 Connection established between members of the U set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 9 >>>>>>>>>>>>>>>>>>>>> 11 minima and 10 ts are known >>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      5 steps with      3 missing connections, weight=     22540.    
 decide> The unconnected minima in the chain and their distances are:
     2        1.09    10    11       28.06     8     9        7.66     1 
 

 tryconnect> 70-iteration DNEB run for minima 2_F and 10_U using 2 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      6.768393620    
 Double-ended search iterations= 70 RMS= 0.0353 Dev= 0.36% S= 1.09 time= 0.16
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         15
 DNEB run yielded 1 true transition state(s) time=   3.30

 >>>>>  Path run for ts 11 ...
 Plus  side of path:                     974 steps. Energy=    -382.1663989       time=       3.43
 Minus side of path:                    1008 steps. Energy=    -382.2034186       time=       2.88

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -382.1663989 0.23477E-01     -382.1429222 0.60496E-01     -382.2034186   1.105   1.090  16.193   8.954
        Known (#10)                                             Known (#2)
 Unconnected minimum 10 found its way to F set.

 tryconnect> 280-iteration DNEB run for minima 8_U and 11_F using 8 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant     0.6507276371    
 Double-ended search iterations= 280 RMS= 0.0779 Dev= 0.12% S= 28.41 time= 2.48
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         14
 DNEB run yielded 1 true transition state(s) time=   3.26

 >>>>>  Path run for ts 12 ...
 Plus  side of path:                    1026 steps. Energy=    -380.7727545       time=       3.88
 Minus side of path:                    1015 steps. Energy=    -380.0234371       time=       3.51

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -380.7727545 0.80237         -379.9703813 0.53056E-01     -380.0234371  27.257  27.024   1.910  75.908
        *NEW* (Placed in 12)                                    Known (#8)
 Connection established between members of the U set.

 tryconnect> 70-iteration DNEB run for minima 1_S and 9_U using 2 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      5.050679530    
 Double-ended search iterations= 70 RMS= 0.0295 Dev= 0.15% S= 7.66 time= 0.16
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         23
 DNEB run yielded 1 true transition state(s) time=   4.01

 >>>>>  Path run for ts 13 ...
 Plus  side of path:                     996 steps. Energy=    -381.4742424       time=       2.38
 Minus side of path:                     993 steps. Energy=    -381.4721359       time=       2.27

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -381.4742424 0.19943E-01     -381.4542995 0.17836E-01     -381.4721359   1.894   1.891   2.529  57.324
        *NEW* (Placed in 13)                                    Known (#1)
 Unconnected minimum 13 found its way to S set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 10 >>>>>>>>>>>>>>>>>>>>> 13 minima and 13 ts are known >>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      7 steps with      2 missing connections, weight=     378.13    
 decide> The unconnected minima in the chain and their distances are:
    11        1.57    12     9        7.21    13 
 

 tryconnect> 70-iteration DNEB run for minima 11_F and 12_U using 2 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      6.139132535    
 Double-ended search iterations= 70 RMS= 0.0058 Dev= 0.15% S= 1.57 time= 0.16
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         13
 DNEB run yielded 1 true transition state(s) time=   3.28

 >>>>>  Path run for ts 14 ...
 Plus  side of path:                    1008 steps. Energy=    -380.7879935       time=       2.82
 Minus side of path:                    1009 steps. Energy=    -380.7727545       time=       2.32

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -380.7879935 0.25640E-01     -380.7623536 0.10401E-01     -380.7727545   1.577   1.574   2.911  49.815
        Known (#11)                                             Known (#12)
 Unconnected minimum 12 found its way to F set.

 tryconnect> 70-iteration DNEB run for minima 9_F and 13_S using 2 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      5.050679530    
 Double-ended search iterations= 70 RMS= 0.0513 Dev= 0.02% S= 7.21 time= 0.16
 Following    1 images are candidates for TS:    1  
 Converged to TS (number of iterations):         51
 DNEB run yielded 1 true transition state(s) time=   5.42

 >>>>>  Path run for ts 15 ...
 Plus  side of path:                     984 steps. Energy=    -381.4742424       time=       2.62
 Minus side of path:                     975 steps. Energy=    -381.4282510       time=       2.11

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -381.4742424 0.48669E-01     -381.4255732 0.26777E-02     -381.4282510   7.250   7.206   2.065  70.209
        Known (#13)                                             Known (#9)
 Connected path found
  ts        E+         Ets - E+          Ets       Ets - E-          E-          S       D      gamma   ~N
  13     -381.4721359 0.17836E-01    -381.4542995 0.19943E-01    -381.4742424   1.894   1.891   2.529  57.324
  15     -381.4742424 0.48669E-01    -381.4255732 0.26777E-02    -381.4282510   7.250   7.206   2.065  70.209
   9     -381.4282510  2.0735        -379.3547362 0.66870        -380.0234371  41.497  39.475   1.809  80.163
  12     -380.0234371 0.53056E-01    -379.9703813 0.80237        -380.7727545  27.257  27.024   1.910  75.908
  14     -380.7727545 0.10401E-01    -380.7623536 0.25640E-01    -380.7879935   1.577   1.574   2.911  49.815
  10     -380.7879935  2.3717        -378.4162786  3.7501        -382.1663989  18.723  10.390  22.646   6.403
  11     -382.1663989 0.23477E-01    -382.1429222 0.60496E-01    -382.2034186   1.105   1.090  16.193   8.954

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

 Elapsed time=                               325.64
 OPTIM> # of energy calls=                          0 time=           0.00 %=  0.0
 OPTIM> # of energy+gradient calls=            144053 time=         155.14 %= 47.6
 OPTIM> # of energy+gradient+Hessian calls=      1005 time=           4.45 %=  1.4
