
 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> input coordinates for AMBER9 system will be read from 
start
start               

          -------------------------------------------------------
          Amber 9  SANDER                              2006
          -------------------------------------------------------

| Run on 05/23/2012 at 21:46:27
  [-O]verwriting output

File Assignments:
|  MDIN: min.in                                                                
| MDOUT: min.out                                                               
|INPCRD: coords.inpcrd                                                         
|  PARM: coords.prmtop                                                         
|RESTRT: coords.rst                                                            
|  REFC: refc                                                                  
| MDVEL: mdvel                                                                 
|  MDEN: mden                                                                  
| MDCRD: coords.mdcrd                                                          
|MDINFO: mdinfo                                                                
|INPDIP: inpdip                                                                
|RSTDIP: rstdip                                                                


 Here is the input file:

Minimization                                                                   
&cntrl                                                                         
   imin=1, maxcyc=1, ncyc=1,                                                   
   igb=2, saltcon=0.2,                                                         
   ntpr=1, ntx=1, ntb=0,                                                       
   cut = 999.0                                                                 
 /                                                                             
	                                                                              

--------------------------------------------------------------------------------
   1.  RESOURCE   USE: 
--------------------------------------------------------------------------------

| Flags:                                                                        
| New format PARM file being parsed.
| Version =    1.000 Date = 02/24/09 Time = 08:52:47
 NATOM  =     218 NTYPES =      12 NBONH =     102 MBONA  =     123
 NTHETH =     230 MTHETA =     169 NPHIH =     463 MPHIA  =     323
 NHPARM =       0 NPARM  =       0 NNB   =    1202 NRES   =      12
 NBONA  =     123 NTHETA =     169 NPHIA =     323 NUMBND =      27
 NUMANG =      57 NPTRA  =      40 NATYP =      21 NPHB   =       0
 IFBOX  =       0 NMXRS  =      24 IFCAP =       0 NEXTRA =       0
 NCOPY  =       0

 Implicit solvent radii are modified Bondi radii (mbondi)                                                   

|     Memory Use     Allocated
|     Real               14260
|     Hollerith           1322
|     Integer            31189
|     Max Pairs              1
|     nblistReal             0
|     nblist Int             0
|       Total              238 kbytes
| Duplicated    0 dihedrals
| Duplicated    0 dihedrals

--------------------------------------------------------------------------------
   2.  CONTROL  DATA  FOR  THE  RUN
--------------------------------------------------------------------------------

                                                                                

General flags:
     imin    =       1, nmropt  =       0
     ifswitch=       0, fswitchbeta=  10.000
 mdread> no continuous cutoff will be used for non-bonded terms

Nature and format of input:
     ntx     =       1, irest   =       0, ntrx    =       1

Nature and format of output:
     ntxo    =       1, ntpr    =       1, ntrx    =       1, ntwr    =     500
     iwrap   =       0, ntwx    =       0, ntwv    =       0, ntwe    =       0
     ioutfm  =       0, ntwprt  =       0, idecomp =       0, rbornstat=      0

Potential function:
     ntf     =       1, ntb     =       0, igb     =       2, nsnb    =      25
     ipol    =       0, gbsa    =       0, iesp    =       0
     dielc   =   1.00000, cut     = 999.00000, intdiel =   1.00000
     saltcon =   0.20000, offset  =   0.09000, gbalpha=    0.80000
     gbbeta  =   0.00000, gbgamma =   2.90912, surften =   0.00500
     rdt     =   0.00000, rgbmax  =  25.00000
     alpb  =        0
     scnb    =   2.00000, scee    =   1.20000

Frozen or restrained atoms:
     ibelly  =       0, ntr     =       0

Energy minimization:
     maxcyc  =       1, ncyc    =       1, ntmin   =       1
     dx0     =   0.01000, drms    =   0.00010
|  INFO: Old style inpcrd file read


--------------------------------------------------------------------------------
   3.  ATOMIC COORDINATES AND VELOCITIES
--------------------------------------------------------------------------------

                                                                                
 begin time read from input coords =     0.000 ps

 Number of triangulated 3-point waters found:        0
 getparams> Number of atoms (or variables)  determined as    218
 keyword> Local permutational alignment: alignment threshold=        1.00000
 keyword> Local permutational alignment: alignment cutoff=           5.00000
 keyword> Number of groups of permutable atoms=    25
read argument: coords.prmtop 
Reading parm file (coords.prmtop)
title:
                                                                                
 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>  654 Cartesian coordinates will be optimised for  218 AMBER 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


 KeyInt>> Using natural internal coordinates. # of coords =        648
 KeyInt>> Parameter file for internal coordinates is naturals-noH.par                                                                                    
 KeyInt>> KD, NNZ are         74      7440
 KeyInt>> Back transform convergence (for interpolation)     0.1000000000E-07
 KeyInt>> Back transform convergence criterion (except for interpolation)     0.1000000000E-03
 KeyInt>> Using internal coordinates for interpolation.
 KeyInt>> using simple internal interpolation.    Image points will not be evenly distributed in Cartesians
 KeyInt>> Permuting endpoint atoms to minimise torsion distance
 OPTIM> Using translational/rotational ev shift=     1000000.000    
 OPTIM> Initial energy=    -450.7536291     RMS force=    0.9283985086E-06
 OPTIM> Final energy  =    -447.7898285     RMS force=    0.9753718272E-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.21870E+06
 decide> The unconnected minima in the chain and their distances are:
     2       60.25     1 
 

 tryconnect> 630-iteration DNEB run for minima 1_S and 2_F using 18 images  (DNEB attempt #1)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant     0.1659964797    
 Double-ended search iterations= 630 RMS= 0.0439 Dev= 5.53% S= 76.34 time= 84.93
 Following    3 images are candidates for TS:    7   11   18  
 Converged to TS (number of iterations):         49
 Failed to converge to TS (number of iterations):        251
 Converged to TS (number of iterations):         39
 DNEB run yielded 2 true transition state(s) time= 188.77

 >>>>>  Path run for ts 1 ...
 Plus  side of path:                    1302 steps. Energy=    -451.0153708       time=      13.75
 Minus side of path:                    1294 steps. Energy=    -450.7536291       time=      13.65

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -451.0153708  2.2194         -448.7959600  1.9577         -450.7536291  13.837  12.072   5.465  39.894
        *NEW* (Placed in 3)                                     Known (#1)
 Unconnected minimum 3 found its way to S set.

 >>>>>  Path run for ts 2 ...
 Plus  side of path:                    1314 steps. Energy=    -447.7898285       time=      13.81
 Minus side of path:                    1381 steps. Energy=    -448.4376628       time=      14.80

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -447.7898285 0.51757E-02     -447.7846528 0.65301         -448.4376628  19.105  18.758   3.369  64.715
        Known (#2)                                              *NEW* (Placed in 4)
 Unconnected minimum 4 found its way to F set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 2 >>>>>>>>>>>>>>>>>>>>> 4 minima and 2 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      3 steps with      1 missing connections, weight=     87172.    
 decide> The unconnected minima in the chain and their distances are:
     4       44.34     3 
 

 tryconnect> 455-iteration DNEB run for minima 3_S and 4_F using 13 images  (DNEB attempt #1)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant     0.1580918855    
 Double-ended search iterations= 455 RMS= 0.1054 Dev= 5.60% S= 49.72 time= 43.89
 Following    1 images are candidates for TS:    9  
 Converged to TS (number of iterations):        147
 DNEB run yielded 1 true transition state(s) time=  73.26

 >>>>>  Path run for ts 3 ...
 Plus  side of path:                    1334 steps. Energy=    -449.0523929       time=      14.58
 Minus side of path:                    1335 steps. Energy=    -448.4376628       time=      15.32

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -449.0523929 0.63182         -448.4205712 0.17092E-01     -448.4376628  16.702  16.456   4.996  43.639
        *NEW* (Placed in 5)                                     Known (#4)
 Unconnected minimum 5 found its way to F set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 3 >>>>>>>>>>>>>>>>>>>>> 5 minima and 3 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      4 steps with      1 missing connections, weight=     65177.    
 decide> The unconnected minima in the chain and their distances are:
     5       40.24     3 
 

 tryconnect> 420-iteration DNEB run for minima 3_S and 5_F using 12 images  (DNEB attempt #1)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant     0.1659964797    
 Double-ended search iterations= 420 RMS= 0.0448 Dev= 5.00% S= 44.57 time= 38.09
 Following    1 images are candidates for TS:    9  
 Converged to TS (number of iterations):        164
 DNEB run yielded 1 true transition state(s) time=  92.37

 >>>>>  Path run for ts 4 ...
 Plus  side of path:                    1430 steps. Energy=    -449.3143586       time=      16.17
 Minus side of path:                    1538 steps. Energy=    -449.0523929       time=      18.00

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -449.3143586  1.3219         -447.9924174  1.0600         -449.0523929  65.310  63.111   2.484  87.769
        *NEW* (Placed in 6)                                     Known (#5)
 Unconnected minimum 6 found its way to F set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 4 >>>>>>>>>>>>>>>>>>>>> 6 minima and 4 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      4 steps with      1 missing connections, weight=     32204.    
 decide> The unconnected minima in the chain and their distances are:
     6       31.82     1 
 

 tryconnect> 315-iteration DNEB run for minima 1_S and 6_F using 9 images  (DNEB attempt #1)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant     0.4624599827    
 Double-ended search iterations= 315 RMS= 0.0887 Dev= 1.41% S= 36.28 time= 21.40
 Following    2 images are candidates for TS:    4    7  
 Converged to TS (number of iterations):         40
 Converged to TS (number of iterations):         47
 DNEB run yielded 2 true transition state(s) time=  66.52
 isnewts> transition state is the same as number        1 energy=     -448.7959599780
 tryconnect> Try the path again for ts      1 with pushoff=    0.1000000000E-01

 >>>>>  Path run for ts 5 ...
 tryconnect> Trying this transition state path again with pushoff=    0.1000000000E-01
 Plus  side of path:                    1301 steps. Energy=    -451.0153708       time=      13.89
 Minus side of path:                    1311 steps. Energy=    -450.7536291       time=      14.20

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -451.0153708  2.2194         -448.7959600  1.9577         -450.7536291  13.837  12.072   5.466  39.886
        Known (#3)                                              Known (#1)
 Alternative path found between members of the S set.

 >>>>>  Path run for ts 6 ...
 Plus  side of path:                    1611 steps. Energy=    -451.9822664       time=      19.47
 Minus side of path:                    1317 steps. Energy=    -449.3143586       time=      14.23

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -451.9822664  5.6886         -446.2936804  3.0207         -449.3143586  34.346  33.453   2.282  95.528
        *NEW* (Placed in 7)                                     Known (#6)
 Unconnected minimum 7 found its way to F set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 5 >>>>>>>>>>>>>>>>>>>>> 7 minima and 6 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      5 steps with      1 missing connections, weight=     50743.    
 decide> The unconnected minima in the chain and their distances are:
     6       37.02     3 
 

 tryconnect> 385-iteration DNEB run for minima 3_S and 6_F using 11 images  (DNEB attempt #1)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant     0.2335737168    
 Double-ended search iterations= 385 RMS= 0.0363 Dev= 2.24% S= 41.63 time= 31.80
 Following    1 images are candidates for TS:    8  
 Converged to TS (number of iterations):         32
 DNEB run yielded 1 true transition state(s) time=  28.76
 isnewts> transition state is the same as number        6 energy=     -446.2936804049
 tryconnect> Try the path again for ts      1 with pushoff=    0.1000000000E-01

 >>>>>  Path run for ts 7 ...
 tryconnect> Trying this transition state path again with pushoff=    0.1000000000E-01
 Plus  side of path:                    1614 steps. Energy=    -451.9822664       time=      19.19
 Minus side of path:                    1313 steps. Energy=    -449.3143586       time=      14.20

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -451.9822664  5.6886         -446.2936804  3.0207         -449.3143586  34.346  33.452   2.285  95.418
        Known (#7)                                              Known (#6)
 Alternative path found between members of the F set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 6 >>>>>>>>>>>>>>>>>>>>> 7 minima and 7 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      4 steps with      1 missing connections, weight=     64409.    
 decide> The unconnected minima in the chain and their distances are:
     6       31.82     1 
 

 tryconnect> 805-iteration DNEB run for minima 1_S and 6_F using 23 images  (DNEB attempt #2)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant      1.009492144    
 Double-ended search iterations= 805 RMS= 0.0469 Dev= 4.22% S= 39.19 time= 139.09
 Following    2 images are candidates for TS:    9   17  
 Converged to TS (number of iterations):         32
 Converged to TS (number of iterations):         32
 DNEB run yielded 2 true transition state(s) time=  65.22
 isnewts> transition state is the same as number        1 energy=     -448.7959599780
 tryconnect> Will not repeat search for TS      1 same as TS      1
 isnewts> transition state is the same as number        6 energy=     -446.2936804049
 tryconnect> Will not repeat search for TS      2 same as TS      6
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 7 >>>>>>>>>>>>>>>>>>>>> 7 minima and 7 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      5 steps with      1 missing connections, weight=    0.10149E+06
 decide> The unconnected minima in the chain and their distances are:
     6       37.02     3 
 

 tryconnect> 805-iteration DNEB run for minima 3_S and 6_F using 23 images  (DNEB attempt #2)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant     0.3130111196    
 Double-ended search iterations= 805 RMS= 0.0308 Dev= 5.07% S= 44.94 time= 140.22
 Following    1 images are candidates for TS:   15  
 Converged to TS (number of iterations):         32
 DNEB run yielded 1 true transition state(s) time=  29.81
 isnewts> transition state is the same as number        6 energy=     -446.2936804049
 tryconnect> Will not repeat search for TS      1 same as TS      6
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 8 >>>>>>>>>>>>>>>>>>>>> 7 minima and 7 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      3 steps with      1 missing connections, weight=    0.11112E+06
 decide> The unconnected minima in the chain and their distances are:
     5       48.08     1 
 

 tryconnect> 490-iteration DNEB run for minima 1_S and 5_F using 14 images  (DNEB attempt #1)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant     0.4855829818    
 Double-ended search iterations= 490 RMS= 0.0835 Dev= 5.22% S= 54.60 time= 51.51
 Following    2 images are candidates for TS:    6   10  
 Converged to TS (number of iterations):         32
 Converged to TS (number of iterations):        151
 DNEB run yielded 2 true transition state(s) time= 103.80
 isnewts> transition state is the same as number        1 energy=     -448.7959599780
 tryconnect> Will not repeat search for TS      1 same as TS      1
 isnewts> transition state is the same as number        4 energy=     -447.9924173671
 tryconnect> Try the path again for ts      2 with pushoff=    0.1000000000E-01

 >>>>>  Path run for ts 8 ...
 tryconnect> Trying this transition state path again with pushoff=    0.1000000000E-01
 Plus  side of path:                    1514 steps. Energy=    -449.0523929       time=      17.47
 Minus side of path:                    1434 steps. Energy=    -449.3143586       time=      15.91

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -449.0523929  1.0600         -447.9924174  1.3219         -449.3143586  65.310  63.113   2.482  87.837
        Known (#5)                                              Known (#6)
 Alternative path found between members of the F set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 9 >>>>>>>>>>>>>>>>>>>>> 7 minima and 8 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      4 steps with      1 missing connections, weight=    0.13035E+06
 decide> The unconnected minima in the chain and their distances are:
     5       40.24     3 
 

 tryconnect> 805-iteration DNEB run for minima 3_S and 5_F using 23 images  (DNEB attempt #2)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant     0.5098621309    
 Double-ended search iterations= 805 RMS= 0.0245 Dev= 4.74% S= 46.05 time= 138.65
 Following    1 images are candidates for TS:   15  
 Converged to TS (number of iterations):         22
 DNEB run yielded 1 true transition state(s) time=  25.79

 >>>>>  Path run for ts 9 ...
 Plus  side of path:                    1844 steps. Energy=    -451.0153708       time=      25.35
 Minus side of path:                    1317 steps. Energy=    -449.0523929       time=      13.98

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -451.0153708  5.1449         -445.8704287  3.1820         -449.0523929  42.208  40.251   1.535 142.031
        Known (#3)                                              Known (#5)
 Connected path found
  ts        E+         Ets - E+          Ets       Ets - E-          E-          S       D      gamma   ~N
   1     -450.7536291  1.9577        -448.7959600  2.2194        -451.0153708  13.837  12.072   5.465  39.894
   9     -451.0153708  5.1449        -445.8704287  3.1820        -449.0523929  42.208  40.251   1.535 142.031
   3     -449.0523929 0.63182        -448.4205712 0.17092E-01    -448.4376628  16.702  16.456   4.996  43.639
   2     -448.4376628 0.65301        -447.7846528 0.51757E-02    -447.7898285  19.105  18.758   3.369  64.715

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

 Elapsed time=                              1652.41
 OPTIM> # of energy calls=                          0 time=           0.00 %=  0.0
 OPTIM> # of energy+gradient calls=            137406 time=        1020.28 %= 61.7
 OPTIM> # of energy+gradient+Hessian calls=      1069 time=         298.56 %= 18.1
