
 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)@comp23.ch.
                 Created on  5/28/12 at 13: 5:19 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=    -386.6206187     RMS force=    0.9496290450E-06
 OPTIM> Final energy  =    -390.3597304     RMS force=    0.9799319487E-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=     12231.    
 decide> The unconnected minima in the chain and their distances are:
     2       23.04     1 
 

 tryconnect> 210-iteration DNEB run for minima 1_S and 2_F using 6 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      77.61587555    
 Double-ended search iterations= 805 RMS= 3.5294 Dev= 0.11% S= 23.50 time= 6.99
 Following    1 images are candidates for TS:    3  
 Converged to TS (number of iterations):         21
 DNEB run yielded 1 true transition state(s) time=   4.51

 >>>>>  Path run for ts 1 ...
 Plus  side of path:                     871 steps. Energy=    -389.7581693       time=       2.73
 Minus side of path:                     918 steps. Energy=    -390.9626283       time=       3.25

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -389.7581693 0.44328         -389.3148930  1.6477         -390.9626283   3.549   3.190  15.991   9.068
        *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=     12075.    
 decide> The unconnected minima in the chain and their distances are:
     2        5.29     4     3       22.85     1 
 

 tryconnect> 70-iteration DNEB run for minima 2_F and 4_U using 2 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      6.139132535    
 Double-ended search iterations= 70 RMS= 0.1827 Dev= 0.40% S= 5.68 time= 0.20
 Following    1 images are candidates for TS:    1  
 Converged to TS (number of iterations):         57
 DNEB run yielded 1 true transition state(s) time=   5.24

 >>>>>  Path run for ts 2 ...
 Plus  side of path:                     947 steps. Energy=    -390.3597304       time=       2.52
 Minus side of path:                     785 steps. Energy=    -390.1968967       time=       1.92

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -390.3597304 0.16551         -390.1942228 0.26739E-02     -390.1968967   4.374   4.286  32.648   4.441
        Known (#2)                                              *NEW* (Placed in 5)
 Unconnected minimum 5 found its way to F set.

 tryconnect> 210-iteration DNEB run for minima 1_S and 3_U using 6 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      77.61587555    
 Double-ended search iterations= 1038 RMS= 2.5543 Dev= 0.20% S= 23.32 time= 9.13
 Following    1 images are candidates for TS:    3  
 Converged to TS (number of iterations):         53
 DNEB run yielded 1 true transition state(s) time=   5.75

 >>>>>  Path run for ts 3 ...
 Plus  side of path:                     900 steps. Energy=    -386.6206187       time=       3.36
 Minus side of path:                     980 steps. Energy=    -389.7581693       time=       3.90

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -386.6206187 0.14662         -386.4740005  3.2842         -389.7581693  23.712  22.898   8.305  17.459
        Known (#1)                                              Known (#3)
 Unconnected minimum 3 found its way to S set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 3 >>>>>>>>>>>>>>>>>>>>> 5 minima and 3 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      4 steps with      1 missing connections, weight=     271.21    
 decide> The unconnected minima in the chain and their distances are:
     5        6.47     4 
 

 tryconnect> 70-iteration DNEB run for minima 4_S and 5_F using 2 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      8.227024748    
 Double-ended search iterations= 70 RMS= 0.2904 Dev= 0.31% S= 6.84 time= 0.20
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         43
 DNEB run yielded 1 true transition state(s) time=   6.22
 isnewts> transition state is the same as number        2 energy=     -390.1942227912
 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:                     926 steps. Energy=    -390.3597304       time=       3.49
 Minus side of path:                     825 steps. Energy=    -390.1968967       time=       2.41

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -390.3597304 0.16551         -390.1942228 0.26739E-02     -390.1968967   4.374   4.286  32.674   4.438
        Known (#2)                                              Known (#5)
 Alternative path found between members of the F set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 4 >>>>>>>>>>>>>>>>>>>>> 5 minima and 4 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      3 steps with      1 missing connections, weight=     296.74    
 decide> The unconnected minima in the chain and their distances are:
     2        5.29     4 
 

 tryconnect> 420-iteration DNEB run for minima 2_F and 4_S using 12 images  (DNEB attempt #2)  ...
 lbfgs> Final DNEB force constant     0.6507276371    
 Double-ended search iterations= 420 RMS= 0.0105 Dev= 3.13% S= 7.05 time= 6.96
 Following    1 images are candidates for TS:    5  
 Converged to TS (number of iterations):         13
 DNEB run yielded 1 true transition state(s) time=   2.88

 >>>>>  Path run for ts 5 ...
 Plus  side of path:                     920 steps. Energy=    -390.3597304       time=       2.24
 Minus side of path:                     960 steps. Energy=    -390.9626283       time=       2.43

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -390.3597304  2.4759         -387.8838157  3.0788         -390.9626283   5.957   5.296  31.796   4.560
        Known (#2)                                              Known (#4)
 Connected path found
  ts        E+         Ets - E+          Ets       Ets - E-          E-          S       D      gamma   ~N
   3     -386.6206187 0.14662        -386.4740005  3.2842        -389.7581693  23.712  22.898   8.305  17.459
   1     -389.7581693 0.44328        -389.3148930  1.6477        -390.9626283   3.549   3.190  15.991   9.068
   5     -390.9626283  3.0788        -387.8838157  2.4759        -390.3597304   5.957   5.296  31.796   4.560

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

 Elapsed time=                                76.44
 OPTIM> # of energy calls=                          0 time=           0.00 %=  0.0
 OPTIM> # of energy+gradient calls=             30097 time=          41.33 %= 54.1
 OPTIM> # of energy+gradient+Hessian calls=       187 time=           0.99 %=  1.3
