
 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)@comp18.ch.
                 Created on  5/28/12 at 13: 9:42 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.
 KeyInt>> Permuting endpoint atoms to minimise torsion distance
 OPTIM> Using translational/rotational ev shift=     1000000.000    
 OPTIM> Initial energy=    -380.0677513     RMS force=    0.9921181688E-06
 OPTIM> Final energy  =    -385.0052262     RMS force=    0.9812633651E-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=     40714.    
 decide> The unconnected minima in the chain and their distances are:
     2       34.40     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.1525 Dev= 2.26% S= 39.49 time= 4.91
 Following    2 images are candidates for TS:    3    6  
 Converged to TS (number of iterations):         62
 Failed to converge to TS (number of iterations):        251
 DNEB run yielded 1 true transition state(s) time=  30.63

 >>>>>  Path run for ts 1 ...
 Plus  side of path:                     962 steps. Energy=    -381.0004776       time=       2.40
 Minus side of path:                    1551 steps. Energy=    -391.6562364       time=       7.88

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -381.0004776 0.72784E-01     -380.9276941  10.729         -391.6562364  46.987  46.050   2.554  56.772
        *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=     3954.7    
 decide> The unconnected minima in the chain and their distances are:
     2       14.56     4     3        9.53     1 
 

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

 >>>>>  Path run for ts 2 ...
 Plus  side of path:                     993 steps. Energy=    -389.0531689       time=       3.50
 Minus side of path:                     993 steps. Energy=    -385.5492809       time=       2.86

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -389.0531689  4.7099         -384.3432929  1.2060         -385.5492809  15.481  14.664  13.446  10.784
        *NEW* (Placed in 5)                                     *NEW* (Placed in 6)
 Connection established between members of the U set.

 tryconnect> 70-iteration DNEB run for minima 1_S and 3_U using 2 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      5.050679530    
 Double-ended search iterations= 70 RMS= 0.1094 Dev= 0.06% S= 9.62 time= 0.24
 Following    1 images are candidates for TS:    1  
 Converged to TS (number of iterations):         46
 DNEB run yielded 1 true transition state(s) time=   4.97

 >>>>>  Path run for ts 3 ...
 Plus  side of path:                     976 steps. Energy=    -380.0677513       time=       2.45
 Minus side of path:                    1855 steps. Energy=    -391.6562364       time=       9.13

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -380.0677513 0.91644E-02     -380.0585869  11.598         -391.6562364  41.449  40.888   2.731  53.086
        Known (#1)                                              Known (#4)
 Unconnected minimum 4 found its way to S set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 3 >>>>>>>>>>>>>>>>>>>>> 6 minima and 3 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      4 steps with      2 missing connections, weight=     2612.4    
 decide> The unconnected minima in the chain and their distances are:
     2       10.71     6     5       11.14     4 
 

 tryconnect> 105-iteration DNEB run for minima 2_F and 6_U using 3 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      3.589423646    
 Double-ended search iterations= 105 RMS= 0.0414 Dev= 0.03% S= 10.73 time= 0.50
 Following    1 images are candidates for TS:    1  
 Converged to TS (number of iterations):         22
 DNEB run yielded 1 true transition state(s) time=   4.41

 >>>>>  Path run for ts 4 ...
 Plus  side of path:                     925 steps. Energy=    -385.0052262       time=       3.30
 Minus side of path:                    1005 steps. Energy=    -385.5492809       time=       3.79

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -385.0052262 0.21186E-01     -384.9840403 0.56524         -385.5492809  11.212  10.716   2.231  64.986
        Known (#2)                                              Known (#6)
 Unconnected minimum 6 found its way to F set.

 tryconnect> 105-iteration DNEB run for minima 4_S and 5_F using 3 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      3.589423646    
 Double-ended search iterations= 105 RMS= 0.3202 Dev= 0.40% S= 11.85 time= 0.54
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         42
 DNEB run yielded 1 true transition state(s) time=   4.94

 >>>>>  Path run for ts 5 ...
 Plus  side of path:                     977 steps. Energy=    -392.3683405       time=       2.51
 Minus side of path:                     997 steps. Energy=    -391.7748680       time=       2.59

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -392.3683405  2.7746         -389.5937803  2.1811         -391.7748680  13.594  12.666   2.715  53.412
        *NEW* (Placed in 7)                                     *NEW* (Placed in 8)
 Connection established between members of the U set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 4 >>>>>>>>>>>>>>>>>>>>> 8 minima and 5 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      3 steps with      1 missing connections, weight=     2290.9    
 decide> The unconnected minima in the chain and their distances are:
     6       13.18     4 
 

 tryconnect> 105-iteration DNEB run for minima 4_S and 6_F using 3 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      3.589423646    
 Double-ended search iterations= 105 RMS= 4.4619 Dev= 0.50% S= 14.09 time= 0.50
 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=  19.74
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 5 >>>>>>>>>>>>>>>>>>>>> 8 minima and 5 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      5 steps with      2 missing connections, weight=     2661.5    
 decide> The unconnected minima in the chain and their distances are:
     5        5.43     7     7       13.58     4 
 

 tryconnect> 70-iteration DNEB run for minima 5_F and 7_U using 2 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      10.00000000    
 Double-ended search iterations= 70 RMS= 0.6685 Dev= 1.33% S= 5.75 time= 0.26
 Following    1 images are candidates for TS:    1  
 bfgsts> WARNING *** initial eigenvalue is positive - increase NEBK?
 Converged to TS (number of iterations):         54
 DNEB run yielded 1 true transition state(s) time=   5.28

 >>>>>  Path run for ts 6 ...
 Plus  side of path:                     979 steps. Energy=    -389.4913124       time=       2.75
 Minus side of path:                     912 steps. Energy=    -389.0531689       time=       3.04

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -389.4913124 0.45366         -389.0376539 0.15515E-01     -389.0531689  15.440  14.743   3.071  47.213
        *NEW* (Placed in 9)                                     Known (#5)
 Unconnected minimum 9 found its way to F set.

 tryconnect> 140-iteration DNEB run for minima 4_S and 7_U using 4 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      2.550936371    
 Double-ended search iterations= 140 RMS= 0.9464 Dev= 0.29% S= 14.25 time= 0.89
 Following    1 images are candidates for TS:    3  
 Converged to TS (number of iterations):         25
 DNEB run yielded 1 true transition state(s) time=   5.79
 isnewts> transition state is the same as number        5 energy=     -389.5937803464
 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:                     968 steps. Energy=    -392.3683405       time=       3.26
 Minus side of path:                    1010 steps. Energy=    -391.7748680       time=       3.63

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -392.3683405  2.7746         -389.5937803  2.1811         -391.7748680  13.594  12.666   2.715  53.417
        Known (#7)                                              Known (#8)
 Connection established between members of the U set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 6 >>>>>>>>>>>>>>>>>>>>> 9 minima and 7 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      4 steps with      1 missing connections, weight=     2764.5    
 decide> The unconnected minima in the chain and their distances are:
     5       11.14     4 
 

 tryconnect> 805-iteration DNEB run for minima 4_S and 5_F using 23 images  (DNEB attempt #2)  ...
 lbfgs> Final DNEB force constant      1.491479664    
 Double-ended search iterations= 805 RMS= 0.0840 Dev= 4.72% S= 18.14 time= 26.51
 Following    3 images are candidates for TS:    6   14   19  
 Converged to TS (number of iterations):         17
 Converged to TS (number of iterations):         17
 Converged to TS (number of iterations):         19
 DNEB run yielded 3 true transition state(s) time=  14.13
 isnewts> transition state is the same as number        5 energy=     -389.5937803463
 tryconnect> Will not repeat search for TS      2 same as TS      5

 >>>>>  Path run for ts 8 ...
 Plus  side of path:                    1027 steps. Energy=    -391.7748680       time=       3.55
 Minus side of path:                     986 steps. Energy=    -391.6562364       time=       3.49

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -391.7748680  2.1829         -389.5919319  2.0643         -391.6562364  17.290  16.344   2.503  57.924
        Known (#8)                                              Known (#4)
 Unconnected minimum 8 found its way to S set.

 >>>>>  Path run for ts 9 ...
 Plus  side of path:                     985 steps. Energy=    -389.0531689       time=       3.50
 Minus side of path:                     982 steps. Energy=    -392.3683405       time=       2.97

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -389.0531689  2.4639         -386.5892836  5.7791         -392.3683405  14.145   5.434   3.803  38.128
        Known (#5)                                              Known (#7)
 Connected path found
  ts        E+         Ets - E+          Ets       Ets - E-          E-          S       D      gamma   ~N
   3     -380.0677513 0.91644E-02    -380.0585869  11.598        -391.6562364  41.449  40.888   2.731  53.086
   8     -391.6562364  2.0643        -389.5919319  2.1829        -391.7748680  17.290  16.344   2.503  57.924
   5     -391.7748680  2.1811        -389.5937803  2.7746        -392.3683405  13.594  12.666   2.715  53.412
   9     -392.3683405  5.7791        -386.5892836  2.4639        -389.0531689  14.145   5.434   3.803  38.128
   2     -389.0531689  4.7099        -384.3432929  1.2060        -385.5492809  15.481  14.664  13.446  10.784
   4     -385.5492809 0.56524        -384.9840403 0.21186E-01    -385.0052262  11.212  10.716   2.231  64.986

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

 Elapsed time=                               198.14
 OPTIM> # of energy calls=                          0 time=           0.00 %=  0.0
 OPTIM> # of energy+gradient calls=             57490 time=          79.58 %= 40.2
 OPTIM> # of energy+gradient+Hessian calls=       857 time=           4.13 %=  2.1
