
 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)@comp26.ch.
                 Created on  5/28/12 at 13: 4:39 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.8415109     RMS force=    0.9664367083E-06
 OPTIM> Final energy  =    -377.2153963     RMS force=    0.9844289940E-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.11469E+06
 decide> The unconnected minima in the chain and their distances are:
     2       48.59     1 
 

 tryconnect> 490-iteration DNEB run for minima 1_S and 2_F using 14 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      19.79931599    
 Double-ended search iterations= 490 RMS= 2.0748 Dev= 0.30% S= 52.69 time= 7.65
 Following    1 images are candidates for TS:    9  
 Converged to TS (number of iterations):         85
 DNEB run yielded 1 true transition state(s) time=  11.62

 >>>>>  Path run for ts 1 ...
 Plus  side of path:                    1011 steps. Energy=    -379.8939722       time=       4.31
 Minus side of path:                    1021 steps. Energy=    -380.1934631       time=       4.06

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -379.8939722 0.18046         -379.7135094 0.47995         -380.1934631   7.116   6.148   1.846  78.560
        *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=     53770.    
 decide> The unconnected minima in the chain and their distances are:
     2       36.35     3     4       17.92     1 
 

 tryconnect> 350-iteration DNEB run for minima 2_F and 3_U using 10 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      6.768393620    
 Double-ended search iterations= 350 RMS= 0.1916 Dev= 2.60% S= 39.66 time= 3.95
 Following    1 images are candidates for TS:    5  
 Failed to converge to TS (number of iterations):        251
 DNEB run yielded 0 true transition state(s) time=  22.60

 tryconnect> 175-iteration DNEB run for minima 1_S and 4_U using 5 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      4.362966876    
 Double-ended search iterations= 175 RMS= 0.0806 Dev= 0.34% S= 18.12 time= 1.00
 Following    1 images are candidates for TS:    3  
 Converged to TS (number of iterations):         29
 DNEB run yielded 1 true transition state(s) time=   4.79

 >>>>>  Path run for ts 2 ...
 Plus  side of path:                    1024 steps. Energy=    -380.1934631       time=       3.03
 Minus side of path:                    1018 steps. Energy=    -381.8415109       time=       4.29

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -380.1934631 0.91911         -379.2743536  2.5672         -381.8415109  19.523  17.965   3.059  47.394
        Known (#4)                                              Known (#1)
 Unconnected minimum 4 found its way to S set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 3 >>>>>>>>>>>>>>>>>>>>> 4 minima and 2 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      2 steps with      1 missing connections, weight=     57860.    
 decide> The unconnected minima in the chain and their distances are:
     2       38.68     4 
 

 tryconnect> 385-iteration DNEB run for minima 2_F and 4_S using 11 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      11.57625000    
 Double-ended search iterations= 385 RMS= 0.3566 Dev= 0.16% S= 41.90 time= 4.75
 Following    1 images are candidates for TS:    6  
 Failed to converge to TS (number of iterations):        251
 DNEB run yielded 0 true transition state(s) time=  21.14
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 4 >>>>>>>>>>>>>>>>>>>>> 4 minima and 2 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      3 steps with      1 missing connections, weight=     96035.    
 decide> The unconnected minima in the chain and their distances are:
     2       36.35     3 
 

 tryconnect> 805-iteration DNEB run for minima 2_F and 3_S using 23 images  (DNEB attempt #2)  ...
 lbfgs> Final DNEB force constant     0.5098621309    
 Double-ended search iterations= 805 RMS= 0.1264 Dev= 4.66% S= 49.76 time= 19.98
 Following    1 images are candidates for TS:    9  
 Converged to TS (number of iterations):        139
 DNEB run yielded 1 true transition state(s) time=  11.93

 >>>>>  Path run for ts 3 ...
 Plus  side of path:                    1093 steps. Energy=    -377.2153963       time=       3.03
 Minus side of path:                    1176 steps. Energy=    -379.4875075       time=       3.30

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -377.2153963  3.2917         -373.9237051  5.5638         -379.4875075  43.353  31.975   3.669  39.520
        Known (#2)                                              *NEW* (Placed in 5)
 Unconnected minimum 5 found its way to F set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 5 >>>>>>>>>>>>>>>>>>>>> 5 minima and 3 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      4 steps with      1 missing connections, weight=     6769.8    
 decide> The unconnected minima in the chain and their distances are:
     5       18.92     3 
 

 tryconnect> 175-iteration DNEB run for minima 3_S and 5_F using 5 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      4.810170981    
 Double-ended search iterations= 175 RMS= 0.0806 Dev= 0.35% S= 19.14 time= 0.96
 Following    1 images are candidates for TS:    3  
 Converged to TS (number of iterations):         34
 DNEB run yielded 1 true transition state(s) time=   4.13
 isnewts> transition state is the same as number        1 energy=     -379.7135094057
 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:                    1010 steps. Energy=    -380.1934631       time=       2.26
 Minus side of path:                    1006 steps. Energy=    -379.8939722       time=       2.32

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -380.1934631 0.47995         -379.7135094 0.18046         -379.8939722   7.116   6.148   1.846  78.562
        Known (#4)                                              Known (#3)
 Alternative path found between members of the S set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 6 >>>>>>>>>>>>>>>>>>>>> 5 minima and 4 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      3 steps with      1 missing connections, weight=     9183.0    
 decide> The unconnected minima in the chain and their distances are:
     5       20.94     4 
 

 tryconnect> 210-iteration DNEB run for minima 4_S and 5_F using 6 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      5.050679530    
 Double-ended search iterations= 210 RMS= 0.1193 Dev= 0.23% S= 21.14 time= 1.36
 Following    1 images are candidates for TS:    5  
 Converged to TS (number of iterations):         27
 DNEB run yielded 1 true transition state(s) time=   3.87

 >>>>>  Path run for ts 5 ...
 Plus  side of path:                     978 steps. Energy=    -379.4875075       time=       2.20
 Minus side of path:                    1030 steps. Energy=    -379.5093502       time=       2.39

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -379.4875075 0.28448E-01     -379.4590599 0.50290E-01     -379.5093502   0.891   0.855   7.884  18.391
        Known (#5)                                              *NEW* (Placed in 6)
 Unconnected minimum 6 found its way to F set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 7 >>>>>>>>>>>>>>>>>>>>> 6 minima and 5 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      5 steps with      1 missing connections, weight=     6646.8    
 decide> The unconnected minima in the chain and their distances are:
     6       18.80     3 
 

 tryconnect> 175-iteration DNEB run for minima 3_S and 6_F using 5 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      4.810170981    
 Double-ended search iterations= 175 RMS= 0.0760 Dev= 0.46% S= 19.01 time= 0.95
 Following    1 images are candidates for TS:    3  
 Converged to TS (number of iterations):         33
 DNEB run yielded 1 true transition state(s) time=   4.16
 isnewts> transition state is the same as number        1 energy=     -379.7135094057
 tryconnect> Will not repeat search for TS      1 same as TS      1
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 8 >>>>>>>>>>>>>>>>>>>>> 6 minima and 5 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      4 steps with      1 missing connections, weight=     9027.9    
 decide> The unconnected minima in the chain and their distances are:
     6       20.82     4 
 

 tryconnect> 210-iteration DNEB run for minima 4_S and 6_F using 6 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      5.050679530    
 Double-ended search iterations= 210 RMS= 0.0715 Dev= 0.40% S= 21.02 time= 1.36
 Following    1 images are candidates for TS:    5  
 Converged to TS (number of iterations):         35
 DNEB run yielded 1 true transition state(s) time=   4.76

 >>>>>  Path run for ts 6 ...
 Plus  side of path:                    1003 steps. Energy=    -379.5093502       time=       4.01
 Minus side of path:                    1025 steps. Energy=    -380.1934631       time=       3.17

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -379.5093502 0.11595         -379.3933954 0.80007         -380.1934631  21.475  20.834   2.583  56.129
        Known (#6)                                              Known (#4)
 Connected path found
  ts        E+         Ets - E+          Ets       Ets - E-          E-          S       D      gamma   ~N
   2     -381.8415109  2.5672        -379.2743536 0.91911        -380.1934631  19.523  17.965   3.059  47.394
   6     -380.1934631 0.80007        -379.3933954 0.11595        -379.5093502  21.475  20.834   2.583  56.129
   5     -379.5093502 0.50290E-01    -379.4590599 0.28448E-01    -379.4875075   0.891   0.855   7.884  18.391
   3     -379.4875075  5.5638        -373.9237051  3.2917        -377.2153963  43.353  31.975   3.669  39.520

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

 Elapsed time=                               169.43
 OPTIM> # of energy calls=                          0 time=           0.00 %=  0.0
 OPTIM> # of energy+gradient calls=             61478 time=          64.55 %= 38.1
 OPTIM> # of energy+gradient+Hessian calls=       882 time=           4.37 %=  2.6
