
 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/24/2012 at 11:56:55
  [-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 = 12/07/08 Time = 15:32:39
 NATOM  =     107 NTYPES =      11 NBONH =      48 MBONA  =      59
 NTHETH =     105 MTHETA =      79 NPHIH =     235 MPHIA  =     150
 NHPARM =       0 NPARM  =       0 NNB   =     560 NRES   =       7
 NBONA  =      59 NTHETA =      79 NPHIA =     150 NUMBND =      18
 NUMANG =      35 NPTRA  =      25 NATYP =      14 NPHB   =       0
 IFBOX  =       0 NMXRS  =      22 IFCAP =       0 NEXTRA =       0
 NCOPY  =       0

 Implicit solvent radii are modified Bondi radii (mbondi)                                                   

|     Memory Use     Allocated
|     Real                7111
|     Hollerith            651
|     Integer            25418
|     Max Pairs              1
|     nblistReal             0
|     nblist Int             0
|       Total              157 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    107
 keyword> Local permutational alignment: alignment threshold=        1.00000
 keyword> Local permutational alignment: alignment cutoff=           5.00000
 keyword> Number of groups of permutable atoms=    17
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>  321 Cartesian coordinates will be optimised for  107 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 =        315
 KeyInt>> Parameter file for internal coordinates is naturals-noH.par                                                                                    
 KeyInt>> KD, NNZ are         65      3594
 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=    -533.2855511     RMS force=    0.7920654060E-06
 OPTIM> Final energy  =    -537.9347047     RMS force=    0.9439804723E-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=     14733.    
 decide> The unconnected minima in the chain and their distances are:
     2       24.51     1 
 

 tryconnect> 245-iteration DNEB run for minima 1_S and 2_F using 7 images  (DNEB attempt #1)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant     0.9156391332    
 Double-ended search iterations= 245 RMS= 0.4040 Dev= 2.37% S= 31.76 time= 3.50
 Following    1 images are candidates for TS:    5  
 Converged to TS (number of iterations):        127
 DNEB run yielded 1 true transition state(s) time=  12.04

 >>>>>  Path run for ts 1 ...
 Plus  side of path:                     540 steps. Energy=    -537.6244944       time=       1.32
 Minus side of path:                     603 steps. Energy=    -537.9347047       time=       1.50

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -537.6244944 0.56797E-01     -537.5676973 0.36701         -537.9347047   5.220   4.856  30.509   3.507
        *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=     14892.    
 decide> The unconnected minima in the chain and their distances are:
     3       24.60     1 
 

 tryconnect> 245-iteration DNEB run for minima 1_S and 3_F using 7 images  (DNEB attempt #1)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant     0.9156391332    
 Double-ended search iterations= 245 RMS= 0.3053 Dev= 2.44% S= 32.42 time= 3.52
 Following    1 images are candidates for TS:    5  
 Converged to TS (number of iterations):         77
 DNEB run yielded 1 true transition state(s) time=   7.88

 >>>>>  Path run for ts 2 ...
 Plus  side of path:                     582 steps. Energy=    -537.6244944       time=       1.44
 Minus side of path:                     695 steps. Energy=    -541.0031598       time=       1.76

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -537.6244944  3.2408         -534.3837144  6.6194         -541.0031598  16.463  13.097   2.498  42.842
        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=     18679.    
 decide> The unconnected minima in the chain and their distances are:
     4       26.53     1 
 

 tryconnect> 245-iteration DNEB run for minima 1_S and 4_F using 7 images  (DNEB attempt #1)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant     0.9156391332    
 Double-ended search iterations= 245 RMS= 0.3071 Dev= 1.97% S= 34.92 time= 3.50
 Following    2 images are candidates for TS:    2    4  
 Converged to TS (number of iterations):         79
 Converged to TS (number of iterations):        107
 DNEB run yielded 2 true transition state(s) time=  18.31

 >>>>>  Path run for ts 3 ...
 Plus  side of path:                     715 steps. Energy=    -536.0490186       time=       1.81
 Minus side of path:                     880 steps. Energy=    -541.8338779       time=       2.33

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -536.0490186  3.2903         -532.7587114  9.0752         -541.8338779  23.294  19.555   3.718  28.776
        *NEW* (Placed in 5)                                     *NEW* (Placed in 6)
 Connection established between members of the U set.

 >>>>>  Path run for ts 4 ...
 Plus  side of path:                     627 steps. Energy=    -541.8338779       time=       1.56
 Minus side of path:                     595 steps. Energy=    -541.8858168       time=       1.47

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -541.8338779  5.1405         -536.6933634  5.1925         -541.8858168  16.198  10.237  14.964   7.150
        Known (#6)                                              *NEW* (Placed in 7)
 Connection established between members of the U set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 4 >>>>>>>>>>>>>>>>>>>>> 7 minima and 4 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      6 steps with      2 missing connections, weight=     2611.1    
 decide> The unconnected minima in the chain and their distances are:
     4        6.85     7     5       13.18     1 
 

 tryconnect> 70-iteration DNEB run for minima 4_F and 7_U using 2 images  (DNEB attempt #1)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant      5.050679530    
 Double-ended search iterations= 70 RMS= 0.3643 Dev= 0.14% S= 7.82 time= 0.30
 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.85

 >>>>>  Path run for ts 5 ...
 Plus  side of path:                     574 steps. Energy=    -541.0031598       time=       1.42
 Minus side of path:                     626 steps. Energy=    -541.3055553       time=       1.58

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -541.0031598 0.14645E-01     -540.9885151 0.31704         -541.3055553   4.714   4.500  27.129   3.944
        Known (#4)                                              *NEW* (Placed in 8)
 Unconnected minimum 8 found its way to F set.

 tryconnect> 105-iteration DNEB run for minima 1_S and 5_U using 3 images  (DNEB attempt #1)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant      4.362966876    
 Double-ended search iterations= 105 RMS= 1.5151 Dev= 0.90% S= 13.53 time= 0.66
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         41
 DNEB run yielded 1 true transition state(s) time=   5.53

 >>>>>  Path run for ts 6 ...
 Plus  side of path:                     618 steps. Energy=    -534.3593662       time=       1.71
 Minus side of path:                     593 steps. Energy=    -533.2855511       time=       1.51

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -534.3593662  1.4523         -532.9070977 0.37845         -533.2855511   5.827   5.477  11.330   9.444
        *NEW* (Placed in 9)                                     Known (#1)
 Unconnected minimum 9 found its way to S set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 5 >>>>>>>>>>>>>>>>>>>>> 9 minima and 6 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      8 steps with      2 missing connections, weight=     2288.6    
 decide> The unconnected minima in the chain and their distances are:
     8        3.95     7     5       13.06     9 
 

 tryconnect> 70-iteration DNEB run for minima 7_U and 8_F using 2 images  (DNEB attempt #1)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant      9.070294785    
 Double-ended search iterations= 70 RMS= 1.2212 Dev= 0.48% S= 4.52 time= 0.30
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         22
 DNEB run yielded 1 true transition state(s) time=   3.05

 >>>>>  Path run for ts 7 ...
 Plus  side of path:                     556 steps. Energy=    -541.3055553       time=       1.35
 Minus side of path:                     594 steps. Energy=    -541.8338779       time=       1.47

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -541.3055553 0.23764E-02     -541.3031789 0.53070         -541.8338779   3.730   3.582  19.023   5.625
        Known (#8)                                              *NEW* (Placed in 10)
 Unconnected minimum 10 found its way to F set.

 tryconnect> 105-iteration DNEB run for minima 5_U and 9_S using 3 images  (DNEB attempt #1)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant      3.589423646    
 Double-ended search iterations= 105 RMS= 0.1542 Dev= 0.73% S= 13.26 time= 0.66
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         78
 DNEB run yielded 1 true transition state(s) time=   7.66

 >>>>>  Path run for ts 8 ...
 Plus  side of path:                     665 steps. Energy=    -534.3593662       time=       1.68
 Minus side of path:                     627 steps. Energy=    -534.1642438       time=       1.57

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -534.3593662 0.74735         -533.6120163 0.55223         -534.1642438  12.938  11.827   2.828  37.831
        Known (#9)                                              *NEW* (Placed in 11)
 Unconnected minimum 11 found its way to S set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 6 >>>>>>>>>>>>>>>>>>>>> 11 minima and 8 ts are known >>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has     10 steps with      2 missing connections, weight=     530.51    
 decide> The unconnected minima in the chain and their distances are:
    10        1.65     7     5        8.07    11 
 

 tryconnect> 70-iteration DNEB run for minima 7_U and 10_F using 2 images  (DNEB attempt #1)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant      6.139132535    
 Double-ended search iterations= 70 RMS= 0.2130 Dev= 1.93% S= 2.27 time= 0.31
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         10
 DNEB run yielded 1 true transition state(s) time=   2.04

 >>>>>  Path run for ts 9 ...
 Plus  side of path:                     540 steps. Energy=    -541.8858168       time=       1.36
 Minus side of path:                     578 steps. Energy=    -541.8338779       time=       1.45

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -541.8858168  8.7702         -533.1156095  8.7183         -541.8338779   2.466   1.649  89.609   1.194
        Known (#7)                                              Known (#10)
 Unconnected minimum 7 found its way to F set.

 tryconnect> 70-iteration DNEB run for minima 5_F and 11_S using 2 images  (DNEB attempt #1)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant      5.050679530    
 Double-ended search iterations= 70 RMS= 0.5174 Dev= 0.09% S= 8.49 time= 0.30
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         30
 DNEB run yielded 1 true transition state(s) time=   3.76

 >>>>>  Path run for ts 10 ...
 Plus  side of path:                     634 steps. Energy=    -536.0293735       time=       1.59
 Minus side of path:                     585 steps. Energy=    -534.1642438       time=       1.45

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -536.0293735  1.9787         -534.0506345 0.11361         -534.1642438   6.971   6.111   6.918  15.467
        *NEW* (Placed in 12)                                    Known (#11)
 Unconnected minimum 12 found its way to S set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 7 >>>>>>>>>>>>>>>>>>>>> 12 minima and 10 ts are known >>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has     11 steps with      1 missing connections, weight=     26.742    
 decide> The unconnected minima in the chain and their distances are:
     5        2.99    12 
 

 tryconnect> 70-iteration DNEB run for minima 5_F and 12_S using 2 images  (DNEB attempt #1)  ...
 Finished simple initial interpolation
 lbfgs> Final DNEB force constant      5.050679530    
 Double-ended search iterations= 70 RMS= 0.0066 Dev= 0.01% S= 2.99 time= 0.30
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):          9
 DNEB run yielded 1 true transition state(s) time=   1.95

 >>>>>  Path run for ts 11 ...
 Plus  side of path:                     572 steps. Energy=    -536.0293735       time=       1.41
 Minus side of path:                     596 steps. Energy=    -536.0490186       time=       1.49

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -536.0293735 0.58145E-03     -536.0287920 0.20227E-01     -536.0490186   2.996   2.990   4.569  23.420
        Known (#12)                                             Known (#5)
 Connected path found
  ts        E+         Ets - E+          Ets       Ets - E-          E-          S       D      gamma   ~N
   6     -533.2855511 0.37845        -532.9070977  1.4523        -534.3593662   5.827   5.477  11.330   9.444
   8     -534.3593662 0.74735        -533.6120163 0.55223        -534.1642438  12.938  11.827   2.828  37.831
  10     -534.1642438 0.11361        -534.0506345  1.9787        -536.0293735   6.971   6.111   6.918  15.467
  11     -536.0293735 0.58145E-03    -536.0287920 0.20227E-01    -536.0490186   2.996   2.990   4.569  23.420
   3     -536.0490186  3.2903        -532.7587114  9.0752        -541.8338779  23.294  19.555   3.718  28.776
   4     -541.8338779  5.1405        -536.6933634  5.1925        -541.8858168  16.198  10.237  14.964   7.150
   9     -541.8858168  8.7702        -533.1156095  8.7183        -541.8338779   2.466   1.649  89.609   1.194
   7     -541.8338779 0.53070        -541.3031789 0.23764E-02    -541.3055553   3.730   3.582  19.023   5.625
   5     -541.3055553 0.31704        -540.9885151 0.14645E-01    -541.0031598   4.714   4.500  27.129   3.944
   2     -541.0031598  6.6194        -534.3837144  3.2408        -537.6244944  16.463  13.097   2.498  42.842
   1     -537.6244944 0.56797E-01    -537.5676973 0.36701        -537.9347047   5.220   4.856  30.509   3.507

 Number of TS in the path       =     11
 Number of cycles               =      7

 Elapsed time=                               116.71
 OPTIM> # of energy calls=                          0 time=           0.00 %=  0.0
 OPTIM> # of energy+gradient calls=             27978 time=          56.44 %= 48.4
 OPTIM> # of energy+gradient+Hessian calls=       637 time=          34.81 %= 29.8
