
 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)@comp24.ch.
                 Created on  5/28/12 at 12:36: 7 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=    -391.4617264     RMS force=    0.9202775967E-06
 OPTIM> Final energy  =    -391.2684032     RMS force=    0.9870640645E-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=     27228.    
 decide> The unconnected minima in the chain and their distances are:
     2       30.08     1 
 

 tryconnect> 315-iteration DNEB run for minima 1_S and 2_F using 9 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant     0.8305116855    
 Double-ended search iterations= 315 RMS= 0.1347 Dev= 0.85% S= 34.96 time= 4.37
 Following    2 images are candidates for TS:    2    5  
 Converged to TS (number of iterations):         25
 Failed to converge to TS (number of iterations):        251
 DNEB run yielded 1 true transition state(s) time=  24.94

 >>>>>  Path run for ts 1 ...
 Plus  side of path:                     910 steps. Energy=    -391.4617264       time=       2.30
 Minus side of path:                     907 steps. Energy=    -389.3839080       time=       2.20

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -391.4617264  2.8110         -388.6506790 0.73323         -389.3839080   5.780   5.229   6.907  20.994
        Known (#1)                                              *NEW* (Placed in 3)
 Unconnected minimum 3 found its way to S set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 2 >>>>>>>>>>>>>>>>>>>>> 3 minima and 1 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      2 steps with      1 missing connections, weight=     21673.    
 decide> The unconnected minima in the chain and their distances are:
     2       27.88     3 
 

 tryconnect> 280-iteration DNEB run for minima 2_F and 3_S using 8 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant     0.6507276371    
 Double-ended search iterations= 280 RMS= 0.1013 Dev= 1.30% S= 31.90 time= 3.35
 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=  23.52
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 3 >>>>>>>>>>>>>>>>>>>>> 3 minima and 1 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      2 steps with      1 missing connections, weight=     43346.    
 decide> The unconnected minima in the chain and their distances are:
     2       27.88     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.3450947594    
 Double-ended search iterations= 805 RMS= 0.1450 Dev= 4.99% S= 42.96 time= 27.78
 Following    3 images are candidates for TS:   12   16   20  
 Converged to TS (number of iterations):         53
 Converged to TS (number of iterations):         65
 Converged to TS (number of iterations):         26
 DNEB run yielded 3 true transition state(s) time=  14.87

 >>>>>  Path run for ts 2 ...
 Plus  side of path:                    1256 steps. Energy=    -391.2684032       time=       6.62
 Minus side of path:                     909 steps. Energy=    -391.4356342       time=       2.78

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -391.2684032  1.4104         -389.8580234  1.5776         -391.4356342  30.117  26.861   2.353  61.620
        Known (#2)                                              *NEW* (Placed in 4)
 Unconnected minimum 4 found its way to F set.

 >>>>>  Path run for ts 3 ...
 Plus  side of path:                     931 steps. Energy=    -391.4356342       time=       3.13
 Minus side of path:                     926 steps. Energy=    -393.6609809       time=       3.41

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -391.4356342  1.3910         -390.0446368  3.6163         -393.6609809  19.228  17.405   3.265  44.417
        Known (#4)                                              *NEW* (Placed in 5)
 Unconnected minimum 5 found its way to F set.

 >>>>>  Path run for ts 4 ...
 Plus  side of path:                    1005 steps. Energy=    -391.2244416       time=       3.33
 Minus side of path:                     940 steps. Energy=    -389.3839080       time=       2.36

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -391.2244416  2.2178         -389.0066100 0.37730         -389.3839080  16.140  13.727   4.697  30.871
        *NEW* (Placed in 6)                                     Known (#3)
 Unconnected minimum 6 found its way to S set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 4 >>>>>>>>>>>>>>>>>>>>> 6 minima and 4 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      4 steps with      1 missing connections, weight=     1017.2    
 decide> The unconnected minima in the chain and their distances are:
     4       10.06     6 
 

 tryconnect> 105-iteration DNEB run for minima 4_F and 6_S using 3 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      3.589423646    
 Double-ended search iterations= 105 RMS= 0.1115 Dev= 0.59% S= 10.21 time= 0.48
 Following    1 images are candidates for TS:    1  
 Converged to TS (number of iterations):         17
 DNEB run yielded 1 true transition state(s) time=   3.34

 >>>>>  Path run for ts 5 ...
 Plus  side of path:                     861 steps. Energy=    -391.4356342       time=       2.64
 Minus side of path:                     868 steps. Energy=    -392.0698724       time=       2.51

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -391.4356342 0.69070         -390.7449373  1.3249         -392.0698724   3.649   3.439  16.448   8.816
        Known (#4)                                              *NEW* (Placed in 7)
 Unconnected minimum 7 found its way to F set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 5 >>>>>>>>>>>>>>>>>>>>> 7 minima and 5 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      5 steps with      1 missing connections, weight=     775.42    
 decide> The unconnected minima in the chain and their distances are:
     7        9.19     6 
 

 tryconnect> 70-iteration DNEB run for minima 6_S and 7_F using 2 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      5.050679530    
 Double-ended search iterations= 70 RMS= 0.0352 Dev= 0.00% S= 9.19 time= 0.21
 Following    1 images are candidates for TS:    1  
 Converged to TS (number of iterations):         49
 DNEB run yielded 1 true transition state(s) time=   5.54

 >>>>>  Path run for ts 6 ...
 Plus  side of path:                     868 steps. Energy=    -392.0698724       time=       2.83
 Minus side of path:                     900 steps. Energy=    -391.2244416       time=       2.28

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -392.0698724 0.96404         -391.1058370 0.11860         -391.2244416   9.552   9.188   2.406  60.270
        Known (#7)                                              Known (#6)
 Connected path found
  ts        E+         Ets - E+          Ets       Ets - E-          E-          S       D      gamma   ~N
   1     -391.4617264  2.8110        -388.6506790 0.73323        -389.3839080   5.780   5.229   6.907  20.994
   4     -389.3839080 0.37730        -389.0066100  2.2178        -391.2244416  16.140  13.727   4.697  30.871
   6     -391.2244416 0.11860        -391.1058370 0.96404        -392.0698724   9.552   9.188   2.406  60.270
   5     -392.0698724  1.3249        -390.7449373 0.69070        -391.4356342   3.649   3.439  16.448   8.816
   2     -391.4356342  1.5776        -389.8580234  1.4104        -391.2684032  30.117  26.861   2.353  61.620

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

 Elapsed time=                               144.93
 OPTIM> # of energy calls=                          0 time=           0.00 %=  0.0
 OPTIM> # of energy+gradient calls=             44471 time=          65.32 %= 45.1
 OPTIM> # of energy+gradient+Hessian calls=       735 time=           3.76 %=  2.6
