
 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: 4:43 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=    -379.2028400     RMS force=    0.9034979018E-06
 OPTIM> Final energy  =    -384.6819565     RMS force=    0.8757164468E-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=     87261.    
 decide> The unconnected minima in the chain and their distances are:
     2       44.35     1 
 

 tryconnect> 455-iteration DNEB run for minima 1_S and 2_F using 13 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      109.2133313    
 Double-ended search iterations= 455 RMS= 0.9557 Dev= 0.50% S= 44.92 time= 7.50
 Following    1 images are candidates for TS:    7  
 Converged to TS (number of iterations):         58
 DNEB run yielded 1 true transition state(s) time=   7.99

 >>>>>  Path run for ts 1 ...
 Plus  side of path:                     911 steps. Energy=    -385.0216927       time=       2.29
 Minus side of path:                     927 steps. Energy=    -385.1178926       time=       2.11

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -385.0216927 0.15708E-01     -385.0059852 0.11191         -385.1178926   1.035   1.032  40.256   3.602
        *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=    0.11042E+06
 decide> The unconnected minima in the chain and their distances are:
     2        6.74     3     3       47.93     1 
 

 tryconnect> 70-iteration DNEB run for minima 2_F and 3_U using 2 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      10.00000000    
 Double-ended search iterations= 70 RMS= 0.2013 Dev= 0.30% S= 6.75 time= 0.18
 Following    1 images are candidates for TS:    1  
 Converged to TS (number of iterations):         13
 DNEB run yielded 1 true transition state(s) time=   2.98

 >>>>>  Path run for ts 2 ...
 Plus  side of path:                     909 steps. Energy=    -384.6819565       time=       3.04
 Minus side of path:                     926 steps. Energy=    -385.1178926       time=       3.39

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -384.6819565 0.25883         -384.4231299 0.69476         -385.1178926   7.066   6.899   2.421  59.897
        Known (#2)                                              Known (#4)
 Unconnected minimum 4 found its way to F set.

 tryconnect> 490-iteration DNEB run for minima 1_S and 3_F using 14 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      35.55672688    
 Double-ended search iterations= 490 RMS= 2.6354 Dev= 0.45% S= 48.93 time= 8.51
 Following    1 images are candidates for TS:    8  
 Failed to converge to TS (number of iterations):        251
 DNEB run yielded 0 true transition state(s) time=  18.87
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 3 >>>>>>>>>>>>>>>>>>>>> 4 minima and 2 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      2 steps with      1 missing connections, weight=    0.11170E+06
 decide> The unconnected minima in the chain and their distances are:
     4       48.16     1 
 

 tryconnect> 490-iteration DNEB run for minima 1_S and 4_F using 14 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      94.34258183    
 Double-ended search iterations= 490 RMS= 0.4247 Dev= 0.43% S= 48.86 time= 8.34
 Following    1 images are candidates for TS:    8  
 Converged to TS (number of iterations):         53
 DNEB run yielded 1 true transition state(s) time=   7.20
 isnewts> transition state is the same as number        1 energy=     -385.0059851785
 tryconnect> Try the path again for ts      1 with pushoff=    0.1000000000E-01

 >>>>>  Path run for ts 3 ...
 tryconnect> Trying this transition state path again with pushoff=    0.1000000000E-01
 Plus  side of path:                     905 steps. Energy=    -385.0216927       time=       2.65
 Minus side of path:                     925 steps. Energy=    -385.1178926       time=       2.43

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -385.0216927 0.15708E-01     -385.0059852 0.11191         -385.1178926   1.035   1.032  40.258   3.602
        Known (#3)                                              Known (#4)
 Alternative path found between members of the F set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 4 >>>>>>>>>>>>>>>>>>>>> 4 minima and 3 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      1 steps with      1 missing connections, weight=    0.17452E+06
 decide> The unconnected minima in the chain and their distances are:
     2       44.35     1 
 

 tryconnect> 805-iteration DNEB run for minima 1_S and 2_F using 23 images  (DNEB attempt #2)  ...
 lbfgs> Final DNEB force constant      12.76281562    
 Double-ended search iterations= 805 RMS= 0.4351 Dev= 0.78% S= 46.30 time= 22.43
 Following    1 images are candidates for TS:   14  
 Converged to TS (number of iterations):        100
 DNEB run yielded 1 true transition state(s) time=   8.44

 >>>>>  Path run for ts 4 ...
 Plus  side of path:                    1043 steps. Energy=    -379.2028400       time=       3.18
 Minus side of path:                    1629 steps. Energy=    -384.5540878       time=       8.39

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -379.2028400 0.32565         -378.8771850  5.6769         -384.5540878  51.495  47.065   2.017  71.906
        Known (#1)                                              *NEW* (Placed in 5)
 Unconnected minimum 5 found its way to S set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 5 >>>>>>>>>>>>>>>>>>>>> 5 minima and 4 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      4 steps with      1 missing connections, weight=     111.97    
 decide> The unconnected minima in the chain and their distances are:
     3        4.82     5 
 

 tryconnect> 70-iteration DNEB run for minima 3_F and 5_S using 2 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      8.227024748    
 Double-ended search iterations= 70 RMS= 0.2769 Dev= 0.35% S= 4.89 time= 0.18
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         27
 DNEB run yielded 1 true transition state(s) time=   3.97

 >>>>>  Path run for ts 5 ...
 Plus  side of path:                     919 steps. Energy=    -384.5540878       time=       2.77
 Minus side of path:                     964 steps. Energy=    -385.1178926       time=       3.73

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -384.5540878 0.18849E-01     -384.5352389 0.58265         -385.1178926   5.093   4.831   5.438  26.666
        Known (#5)                                              Known (#4)
 Connected path found
  ts        E+         Ets - E+          Ets       Ets - E-          E-          S       D      gamma   ~N
   4     -379.2028400 0.32565        -378.8771850  5.6769        -384.5540878  51.495  47.065   2.017  71.906
   5     -384.5540878 0.18849E-01    -384.5352389 0.58265        -385.1178926   5.093   4.831   5.438  26.666
   2     -385.1178926 0.69476        -384.4231299 0.25883        -384.6819565   7.066   6.899   2.421  59.897

 Number of TS in the path       =      3
 Number of cycles               =      5

 Elapsed time=                               130.65
 OPTIM> # of energy calls=                          0 time=           0.00 %=  0.0
 OPTIM> # of energy+gradient calls=             55633 time=          65.89 %= 50.4
 OPTIM> # of energy+gradient+Hessian calls=       501 time=           2.39 %=  1.8
