
 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)@comp35.ch.
                 Created on  5/28/12 at 13: 0:33 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=    -387.5304289     RMS force=    0.8220300169E-06
 OPTIM> Final energy  =    -386.9974233     RMS force=    0.9038004814E-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=     15805.    
 decide> The unconnected minima in the chain and their distances are:
     2       25.10     1 
 

 tryconnect> 245-iteration DNEB run for minima 1_S and 2_F using 7 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant     0.9156391332    
 Double-ended search iterations= 245 RMS= 0.0859 Dev= 1.00% S= 26.65 time= 2.36
 Following    1 images are candidates for TS:    5  
 Converged to TS (number of iterations):         70
 DNEB run yielded 1 true transition state(s) time=   6.90

 >>>>>  Path run for ts 1 ...
 Plus  side of path:                     940 steps. Energy=    -387.7558183       time=       3.55
 Minus side of path:                     955 steps. Energy=    -386.9974233       time=       3.58

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -387.7558183 0.78848         -386.9673415 0.30082E-01     -386.9974233  14.689  14.326   3.535  41.024
        *NEW* (Placed in 3)                                     Known (#2)
 Unconnected minimum 3 found its way to F set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 2 >>>>>>>>>>>>>>>>>>>>> 3 minima and 1 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      2 steps with      1 missing connections, weight=     8513.7    
 decide> The unconnected minima in the chain and their distances are:
     3       20.42     1 
 

 tryconnect> 210-iteration DNEB run for minima 1_S and 3_F using 6 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      1.288396211    
 Double-ended search iterations= 210 RMS= 0.0946 Dev= 0.60% S= 21.74 time= 1.85
 Following    1 images are candidates for TS:    4  
 Converged to TS (number of iterations):         52
 DNEB run yielded 1 true transition state(s) time=   5.62

 >>>>>  Path run for ts 2 ...
 Plus  side of path:                     950 steps. Energy=    -387.7558183       time=       2.93
 Minus side of path:                     943 steps. Energy=    -386.9763874       time=       3.24

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -387.7558183  1.4296         -386.3262210 0.65017         -386.9763874  20.796  20.031   7.520  19.282
        Known (#3)                                              *NEW* (Placed in 4)
 Unconnected minimum 4 found its way to F set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 3 >>>>>>>>>>>>>>>>>>>>> 4 minima and 2 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      3 steps with      1 missing connections, weight=     188.20    
 decide> The unconnected minima in the chain and their distances are:
     4        5.73     1 
 

 tryconnect> 70-iteration DNEB run for minima 1_S and 4_F using 2 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      6.139132535    
 Double-ended search iterations= 70 RMS= 0.2441 Dev= 1.87% S= 6.13 time= 0.21
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         55
 DNEB run yielded 1 true transition state(s) time=   6.06

 >>>>>  Path run for ts 3 ...
 Plus  side of path:                     919 steps. Energy=    -386.9763874       time=       3.99
 Minus side of path:                     849 steps. Energy=    -386.2877663       time=       3.24

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -386.9763874 0.72089         -386.2554981 0.32268E-01     -386.2877663  13.233  12.979   2.281  63.572
        Known (#4)                                              *NEW* (Placed in 5)
 Unconnected minimum 5 found its way to F set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 4 >>>>>>>>>>>>>>>>>>>>> 5 minima and 3 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      3 steps with      1 missing connections, weight=     376.41    
 decide> The unconnected minima in the chain and their distances are:
     4        5.73     1 
 

 tryconnect> 455-iteration DNEB run for minima 1_S and 4_F using 13 images  (DNEB attempt #2)  ...
 lbfgs> Final DNEB force constant     0.2839103126    
 Double-ended search iterations= 455 RMS= 0.0082 Dev= 2.46% S= 7.82 time= 8.55
 Following    1 images are candidates for TS:    8  
 Converged to TS (number of iterations):         12
 DNEB run yielded 1 true transition state(s) time=   5.09

 >>>>>  Path run for ts 4 ...
 Plus  side of path:                     952 steps. Energy=    -386.9763874       time=       3.92
 Minus side of path:                     948 steps. Energy=    -387.5304289       time=       2.77

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -386.9763874  2.7771         -384.1993319  3.3311         -387.5304289   6.349   5.731  28.908   5.016
        Known (#4)                                              Known (#1)
 Connected path found
  ts        E+         Ets - E+          Ets       Ets - E-          E-          S       D      gamma   ~N
   4     -387.5304289  3.3311        -384.1993319  2.7771        -386.9763874   6.349   5.731  28.908   5.016
   2     -386.9763874 0.65017        -386.3262210  1.4296        -387.7558183  20.796  20.031   7.520  19.282
   1     -387.7558183 0.78848        -386.9673415 0.30082E-01    -386.9974233  14.689  14.326   3.535  41.024

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

 Elapsed time=                                64.00
 OPTIM> # of energy calls=                          0 time=           0.00 %=  0.0
 OPTIM> # of energy+gradient calls=             20249 time=          28.06 %= 43.8
 OPTIM> # of energy+gradient+Hessian calls=       189 time=           1.03 %=  1.6
