
 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)@comp31.ch.
                 Created on  5/28/12 at 12:53:54 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=    -398.1585327     RMS force=    0.8901730718E-06
 OPTIM> Final energy  =    -395.2451371     RMS force=    0.9410782447E-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=     13003.    
 decide> The unconnected minima in the chain and their distances are:
     2       23.52     1 
 

 tryconnect> 245-iteration DNEB run for minima 1_S and 2_F using 7 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      109.2133313    
 Double-ended search iterations= 431 RMS= 109.4709 Dev= 28.75% S= 45.20 time= 4.52
 Following    2 images are candidates for TS:    4    6  
 Converged to TS (number of iterations):        103
 Converged to TS (number of iterations):        128
 DNEB run yielded 2 true transition state(s) time=  16.73

 >>>>>  Path run for ts 1 ...
 Plus  side of path:                     939 steps. Energy=    -397.6503982       time=       2.51
 Minus side of path:                     901 steps. Energy=    -398.1585327       time=       3.14

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -397.6503982  1.4001         -396.2502697  1.9083         -398.1585327  21.319  20.211   9.330  15.541
        *NEW* (Placed in 3)                                     Known (#1)
 Unconnected minimum 3 found its way to S set.

 >>>>>  Path run for ts 2 ...
 Plus  side of path:                     897 steps. Energy=    -398.5381228       time=       3.25
 Minus side of path:                    1056 steps. Energy=    -400.0389661       time=       3.97

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -398.5381228 0.17434E-01     -398.5206886  1.5183         -400.0389661  12.505  11.589   4.307  33.669
        *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      1 steps with      1 missing connections, weight=     26007.    
 decide> The unconnected minima in the chain and their distances are:
     2       23.52     1 
 

 tryconnect> 805-iteration DNEB run for minima 1_S and 2_F using 23 images  (DNEB attempt #2)  ...
 lbfgs> Final DNEB force constant      1380.763207    
 Double-ended search iterations= 805 RMS= 1.1535 Dev= 0.15% S= 24.20 time= 26.82
 Following    1 images are candidates for TS:   12  
 Converged to TS (number of iterations):         92
 DNEB run yielded 1 true transition state(s) time=   8.66

 >>>>>  Path run for ts 3 ...
 Plus  side of path:                     848 steps. Energy=    -395.2451371       time=       2.69
 Minus side of path:                     919 steps. Energy=    -399.2952174       time=       2.34

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -395.2451371 0.44269E-03     -395.2446944  4.0505         -399.2952174   9.275   8.758   8.825  16.431
        Known (#2)                                              *NEW* (Placed in 6)
 Unconnected minimum 6 found its way to F set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 3 >>>>>>>>>>>>>>>>>>>>> 6 minima and 3 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      2 steps with      1 missing connections, weight=     11532.    
 decide> The unconnected minima in the chain and their distances are:
     6       22.59     1 
 

 tryconnect> 210-iteration DNEB run for minima 1_S and 6_F using 6 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      77.61587555    
 Double-ended search iterations= 489 RMS= 9.5001 Dev= 0.15% S= 22.93 time= 4.43
 Following    1 images are candidates for TS:    3  
 Converged to TS (number of iterations):         59
 DNEB run yielded 1 true transition state(s) time=   6.07

 >>>>>  Path run for ts 4 ...
 Plus  side of path:                     924 steps. Energy=    -399.2952174       time=       2.29
 Minus side of path:                     827 steps. Energy=    -398.1585327       time=       2.27

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -399.2952174  1.6389         -397.6563008 0.50223         -398.1585327  24.394  22.653   8.800  16.478
        Known (#6)                                              Known (#1)
 Connected path found
  ts        E+         Ets - E+          Ets       Ets - E-          E-          S       D      gamma   ~N
   4     -398.1585327 0.50223        -397.6563008  1.6389        -399.2952174  24.394  22.653   8.800  16.478
   3     -399.2952174  4.0505        -395.2446944 0.44269E-03    -395.2451371   9.275   8.758   8.825  16.431

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

 Elapsed time=                                89.78
 OPTIM> # of energy calls=                          0 time=           0.00 %=  0.0
 OPTIM> # of energy+gradient calls=             35499 time=          49.80 %= 55.5
 OPTIM> # of energy+gradient+Hessian calls=       382 time=           1.90 %=  2.1
