
 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)@comp25.ch.
                 Created on  5/28/12 at 13: 7:20 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>> 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=    -389.2335056     RMS force=    0.9313438436E-06
 OPTIM> Final energy  =    -389.1046918     RMS force=    0.8739094660E-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=    0.12925E+06
 decide> The unconnected minima in the chain and their distances are:
     2       50.56     1 
 

 tryconnect> 525-iteration DNEB run for minima 1_S and 2_F using 15 images  (DNEB attempt #1)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant     0.6197406068    
 Double-ended search iterations= 525 RMS= 0.1310 Dev= 6.74% S= 67.40 time= 11.02
 Following    2 images are candidates for TS:    7   12  
 Converged to TS (number of iterations):        117
 Converged to TS (number of iterations):         79
 DNEB run yielded 2 true transition state(s) time=  17.93

 >>>>>  Path run for ts 1 ...
 Plus  side of path:                    1032 steps. Energy=    -388.4519192       time=       3.83
 Minus side of path:                    1121 steps. Energy=    -389.2335056       time=       4.78

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -388.4519192  2.2043         -386.2475829  2.9859         -389.2335056  32.790  29.514   4.087  35.478
        *NEW* (Placed in 3)                                     Known (#1)
 Unconnected minimum 3 found its way to S set.

 >>>>>  Path run for ts 2 ...
 Plus  side of path:                    1111 steps. Energy=    -386.7309721       time=       5.60
 Minus side of path:                    1001 steps. Energy=    -385.4120596       time=       3.77

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -386.7309721  1.6330         -385.0979798 0.31408         -385.4120596  30.863  27.600   3.588  40.415
        *NEW* (Placed in 4)                                     *NEW* (Placed in 5)
 Connection established between members of the U set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 2 >>>>>>>>>>>>>>>>>>>>> 5 minima and 2 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      4 steps with      2 missing connections, weight=     29865.    
 decide> The unconnected minima in the chain and their distances are:
     2        8.10     5     4       30.84     3 
 

 tryconnect> 70-iteration DNEB run for minima 2_F and 5_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.1669 Dev= 0.15% S= 8.23 time= 0.20
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         22
 DNEB run yielded 1 true transition state(s) time=   3.45

 >>>>>  Path run for ts 3 ...
 Plus  side of path:                    1059 steps. Energy=    -390.5554047       time=       2.81
 Minus side of path:                     938 steps. Energy=    -385.4120596       time=       2.33

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -390.5554047  5.6209         -384.9345330 0.47753         -385.4120596  13.458  11.904   7.850  18.471
        *NEW* (Placed in 6)                                     Known (#5)
 Connection established between members of the U set.

 tryconnect> 315-iteration DNEB run for minima 3_S and 4_U using 9 images  (DNEB attempt #1)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant      3.957339570    
 Double-ended search iterations= 315 RMS= 0.2398 Dev= 0.62% S= 36.78 time= 3.84
 Following    1 images are candidates for TS:    6  
 Converged to TS (number of iterations):        120
 DNEB run yielded 1 true transition state(s) time=  10.86

 >>>>>  Path run for ts 4 ...
 Plus  side of path:                    1043 steps. Energy=    -388.2386015       time=       3.28
 Minus side of path:                     949 steps. Energy=    -388.4519192       time=       3.47

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -388.2386015 0.70317         -387.5354327 0.91649         -388.4519192  21.730  18.874   3.293  44.027
        *NEW* (Placed in 7)                                     Known (#3)
 Unconnected minimum 7 found its way to S set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 3 >>>>>>>>>>>>>>>>>>>>> 7 minima and 4 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      4 steps with      2 missing connections, weight=     19617.    
 decide> The unconnected minima in the chain and their distances are:
     2        8.10     5     5       26.47     7 
 

 tryconnect> 630-iteration DNEB run for minima 2_F and 5_U using 18 images  (DNEB attempt #2)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant     0.7909635100    
 Double-ended search iterations= 630 RMS= 0.4783 Dev= 3.03% S= 10.94 time= 16.18
 Following    1 images are candidates for TS:   16  
 Converged to TS (number of iterations):         23
 DNEB run yielded 1 true transition state(s) time=   3.41

 >>>>>  Path run for ts 5 ...
 Plus  side of path:                     975 steps. Energy=    -385.4120596       time=       2.39
 Minus side of path:                    1069 steps. Energy=    -390.5554047       time=       2.88

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -385.4120596 0.44359         -384.9684718  5.5869         -390.5554047  13.604  11.902   7.852  18.466
        Known (#5)                                              Known (#6)
 Connection established between members of the U set.

 tryconnect> 245-iteration DNEB run for minima 5_U and 7_S using 7 images  (DNEB attempt #1)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant     0.9156391332    
 Double-ended search iterations= 245 RMS= 0.0846 Dev= 0.65% S= 29.43 time= 2.39
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         78
 DNEB run yielded 1 true transition state(s) time=   9.58

 >>>>>  Path run for ts 6 ...
 Plus  side of path:                     973 steps. Energy=    -388.6809028       time=       4.05
 Minus side of path:                     966 steps. Energy=    -385.4005012       time=       2.45

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -388.6809028  3.7826         -384.8983285 0.50217         -385.4005012  20.588  19.380   2.513  57.693
        *NEW* (Placed in 8)                                     *NEW* (Placed in 9)
 Connection established between members of the U set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 4 >>>>>>>>>>>>>>>>>>>>> 9 minima and 6 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      5 steps with      2 missing connections, weight=     18559.    
 decide> The unconnected minima in the chain and their distances are:
     2        7.82     9     8       26.25     7 
 

 tryconnect> 70-iteration DNEB run for minima 2_F and 9_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.1241 Dev= 0.12% S= 7.95 time= 0.20
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         25
 DNEB run yielded 1 true transition state(s) time=   4.04
 isnewts> transition state is the same as number        3 energy=     -384.9345330388
 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:                    1070 steps. Energy=    -390.5554047       time=       4.37
 Minus side of path:                     953 steps. Energy=    -385.4120596       time=       3.77

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -390.5554047  5.6209         -384.9345330 0.47753         -385.4120596  13.459  11.905   7.863  18.441
        Known (#6)                                              Known (#5)
 Connection established between members of the U set.

 tryconnect> 245-iteration DNEB run for minima 7_S and 8_U using 7 images  (DNEB attempt #1)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant     0.9156391332    
 Double-ended search iterations= 245 RMS= 0.0587 Dev= 0.41% S= 26.93 time= 2.47
 Following    1 images are candidates for TS:    3  
 Converged to TS (number of iterations):         28
 DNEB run yielded 1 true transition state(s) time=   4.25

 >>>>>  Path run for ts 8 ...
 Plus  side of path:                     888 steps. Energy=    -388.2386015       time=       2.39
 Minus side of path:                    1012 steps. Energy=    -388.5796269       time=       4.07

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -388.2386015 0.87707         -387.3615291  1.2181         -388.5796269  14.127  13.006   2.084  69.585
        Known (#7)                                              *NEW* (Placed in 10)
 Unconnected minimum 10 found its way to S set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 5 >>>>>>>>>>>>>>>>>>>>> 10 minima and 8 ts are known >>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      6 steps with      2 missing connections, weight=     4746.3    
 decide> The unconnected minima in the chain and their distances are:
     2        7.82     9     8       15.59    10 
 

 tryconnect> 595-iteration DNEB run for minima 2_F and 9_U using 17 images  (DNEB attempt #2)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant     0.3804669723    
 Double-ended search iterations= 595 RMS= 0.0377 Dev= 5.15% S= 11.21 time= 13.89
 Following    2 images are candidates for TS:    3   15  
 Converged to TS (number of iterations):         16
 Converged to TS (number of iterations):         16
 DNEB run yielded 2 true transition state(s) time=   6.21
 isnewts> transition state is the same as number        3 energy=     -384.9345330390
 tryconnect> Will not repeat search for TS      2 same as TS      3

 >>>>>  Path run for ts 9 ...
 Plus  side of path:                     856 steps. Energy=    -389.1046918       time=       1.96
 Minus side of path:                    1008 steps. Energy=    -390.5554047       time=       2.79

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -389.1046918 0.40270E-01     -389.0644215  1.4910         -390.5554047  13.831  12.858  10.500  13.810
        Known (#2)                                              Known (#6)
 Unconnected minimum 6 found its way to F set.

 tryconnect> 140-iteration DNEB run for minima 8_U and 10_S using 4 images  (DNEB attempt #1)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant      2.550936371    
 Double-ended search iterations= 140 RMS= 0.0239 Dev= 0.06% S= 15.64 time= 0.80
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         47
 DNEB run yielded 1 true transition state(s) time=   6.84

 >>>>>  Path run for ts 10 ...
 Plus  side of path:                     900 steps. Energy=    -388.6809028       time=       3.02
 Minus side of path:                     915 steps. Energy=    -388.5796269       time=       3.12

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -388.6809028 0.14356         -388.5373394 0.42288E-01     -388.5796269  15.726  15.593   2.038  71.140
        Known (#8)                                              Known (#10)
 Unconnected minimum 8 found its way to S set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 6 >>>>>>>>>>>>>>>>>>>>> 10 minima and 10 ts are known >>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      8 steps with      1 missing connections, weight=     3.5536    
 decide> The unconnected minima in the chain and their distances are:
     5        1.53     9 
 

 tryconnect> 70-iteration DNEB run for minima 5_F and 9_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.0117 Dev= 0.02% S= 1.53 time= 0.20
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         12
 DNEB run yielded 1 true transition state(s) time=   3.44

 >>>>>  Path run for ts 11 ...
 Plus  side of path:                     879 steps. Energy=    -385.4005012       time=       2.74
 Minus side of path:                     923 steps. Energy=    -385.4120596       time=       2.99

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -385.4005012 0.24639E-01     -385.3758621 0.36197E-01     -385.4120596   1.536   1.526   2.960  48.991
        Known (#9)                                              Known (#5)
 Connected path found
  ts        E+         Ets - E+          Ets       Ets - E-          E-          S       D      gamma   ~N
   1     -389.2335056  2.9859        -386.2475829  2.2043        -388.4519192  32.790  29.514   4.087  35.478
   4     -388.4519192 0.91649        -387.5354327 0.70317        -388.2386015  21.730  18.874   3.293  44.027
   8     -388.2386015 0.87707        -387.3615291  1.2181        -388.5796269  14.127  13.006   2.084  69.585
  10     -388.5796269 0.42288E-01    -388.5373394 0.14356        -388.6809028  15.726  15.593   2.038  71.140
   6     -388.6809028  3.7826        -384.8983285 0.50217        -385.4005012  20.588  19.380   2.513  57.693
  11     -385.4005012 0.24639E-01    -385.3758621 0.36197E-01    -385.4120596   1.536   1.526   2.960  48.991
   3     -385.4120596 0.47753        -384.9345330  5.6209        -390.5554047  13.458  11.904   7.850  18.471
   9     -390.5554047  1.4910        -389.0644215 0.40270E-01    -389.1046918  13.831  12.858  10.500  13.810

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

 Elapsed time=                               194.35
 OPTIM> # of energy calls=                          0 time=           0.00 %=  0.0
 OPTIM> # of energy+gradient calls=             70138 time=          94.47 %= 48.6
 OPTIM> # of energy+gradient+Hessian calls=       583 time=           2.99 %=  1.5
