
 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 10:16:30
  [-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


 OPTIM> Using translational/rotational ev shift=     1000000.000    
 OPTIM> Initial energy=    -535.7604611     RMS force=    0.7990666143E-06
 OPTIM> Final energy  =    -535.3795710     RMS force=    0.8594738006E-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=     8490.1    
 decide> The unconnected minima in the chain and their distances are:
     2       20.40     1 
 

 tryconnect> 210-iteration DNEB run for minima 1_S and 2_F using 6 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      2.812407350    
 Double-ended search iterations= 210 RMS= 0.4095 Dev= 1.16% S= 25.19 time= 2.55
 Following    1 images are candidates for TS:    4  
 Converged to TS (number of iterations):         36
 DNEB run yielded 1 true transition state(s) time=   4.17

 >>>>>  Path run for ts 1 ...
 Plus  side of path:                     634 steps. Energy=    -532.8268152       time=       1.57
 Minus side of path:                     620 steps. Energy=    -535.2171923       time=       1.53

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -532.8268152  4.4687         -528.3581603  6.8590         -535.2171923  10.122   8.050   7.114  15.041
        *NEW* (Placed in 3)                                     *NEW* (Placed in 4)
 Connection established between members of the U set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 2 >>>>>>>>>>>>>>>>>>>>> 4 minima and 1 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      3 steps with      2 missing connections, weight=     4727.8    
 decide> The unconnected minima in the chain and their distances are:
     2       12.37     4     3       14.15     1 
 

 tryconnect> 105-iteration DNEB run for minima 2_F and 4_U using 3 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      3.589423646    
 Double-ended search iterations= 105 RMS= 3.4386 Dev= 0.36% S= 13.01 time= 0.64
 Following    1 images are candidates for TS:    1  
 Converged to TS (number of iterations):         54
 DNEB run yielded 1 true transition state(s) time=   5.37

 >>>>>  Path run for ts 2 ...
 Plus  side of path:                     616 steps. Energy=    -535.3795710       time=       1.52
 Minus side of path:                     637 steps. Energy=    -536.2766543       time=       1.58

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -535.3795710 0.40088         -534.9786867  1.2980         -536.2766543   9.265   7.408   3.639  29.405
        Known (#2)                                              *NEW* (Placed in 5)
 Unconnected minimum 5 found its way to F set.

 tryconnect> 140-iteration DNEB run for minima 1_S and 3_U using 4 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      3.418498711    
 Double-ended search iterations= 140 RMS= 0.1643 Dev= 1.01% S= 15.81 time= 1.13
 Following    1 images are candidates for TS:    3  
 Converged to TS (number of iterations):         25
 DNEB run yielded 1 true transition state(s) time=   3.31

 >>>>>  Path run for ts 3 ...
 Plus  side of path:                     798 steps. Energy=    -535.5497463       time=       2.13
 Minus side of path:                     643 steps. Energy=    -535.7604611       time=       1.61

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -535.5497463  3.7929         -531.7568059  4.0037         -535.7604611  20.977  10.171  15.418   6.940
        *NEW* (Placed in 6)                                     Known (#1)
 Unconnected minimum 6 found its way to S set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 3 >>>>>>>>>>>>>>>>>>>>> 6 minima and 3 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      5 steps with      2 missing connections, weight=     3466.1    
 decide> The unconnected minima in the chain and their distances are:
     5       11.87     4     3       12.15     6 
 

 tryconnect> 105-iteration DNEB run for minima 4_U and 5_F using 3 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      3.589423646    
 Double-ended search iterations= 105 RMS= 0.3174 Dev= 0.32% S= 12.66 time= 0.64
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         36
 DNEB run yielded 1 true transition state(s) time=   4.23

 >>>>>  Path run for ts 4 ...
 Plus  side of path:                     664 steps. Energy=    -535.3795710       time=       1.77
 Minus side of path:                     652 steps. Energy=    -535.4570983       time=       1.65

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -535.3795710  1.3844         -533.9951544  1.4619         -535.4570983  13.098  12.002   6.597  16.221
        Known (#2)                                              *NEW* (Placed in 7)
 Unconnected minimum 7 found its way to F set.

 tryconnect> 105-iteration DNEB run for minima 3_U and 6_S using 3 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      3.589423646    
 Double-ended search iterations= 105 RMS= 0.1463 Dev= 0.06% S= 12.36 time= 0.64
 Following    1 images are candidates for TS:    1  
 Converged to TS (number of iterations):         28
 DNEB run yielded 1 true transition state(s) time=   3.52

 >>>>>  Path run for ts 5 ...
 Plus  side of path:                     670 steps. Energy=    -535.5497463       time=       1.71
 Minus side of path:                     574 steps. Energy=    -532.8268152       time=       1.41

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -535.5497463  2.7319         -532.8178714 0.89438E-02     -532.8268152  12.428  12.157   3.642  29.378
        Known (#6)                                              Known (#3)
 Unconnected minimum 3 found its way to S set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 4 >>>>>>>>>>>>>>>>>>>>> 7 minima and 5 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      5 steps with      1 missing connections, weight=     8.4191    
 decide> The unconnected minima in the chain and their distances are:
     7        2.03     4 
 

 tryconnect> 70-iteration DNEB run for minima 4_S and 7_F using 2 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      6.139132535    
 Double-ended search iterations= 70 RMS= 0.3378 Dev= 1.42% S= 2.60 time= 0.29
 Following    1 images are candidates for TS:    1  
 Converged to TS (number of iterations):         12
 DNEB run yielded 1 true transition state(s) time=   2.35

 >>>>>  Path run for ts 6 ...
 Plus  side of path:                     655 steps. Energy=    -535.4570983       time=       1.65
 Minus side of path:                     594 steps. Energy=    -535.2171923       time=       1.47

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -535.4570983  8.7325         -526.7245739  8.4926         -535.2171923   2.703   2.035  36.741   2.912
        Known (#7)                                              Known (#4)
 Connected path found
  ts        E+         Ets - E+          Ets       Ets - E-          E-          S       D      gamma   ~N
   3     -535.7604611  4.0037        -531.7568059  3.7929        -535.5497463  20.977  10.171  15.418   6.940
   5     -535.5497463  2.7319        -532.8178714 0.89438E-02    -532.8268152  12.428  12.157   3.642  29.378
   1     -532.8268152  4.4687        -528.3581603  6.8590        -535.2171923  10.122   8.050   7.114  15.041
   6     -535.2171923  8.4926        -526.7245739  8.7325        -535.4570983   2.703   2.035  36.741   2.912
   4     -535.4570983  1.4619        -533.9951544  1.3844        -535.3795710  13.098  12.002   6.597  16.221

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

 Elapsed time=                                48.81
 OPTIM> # of energy calls=                          0 time=           0.00 %=  0.0
 OPTIM> # of energy+gradient calls=             14327 time=          28.91 %= 59.2
 OPTIM> # of energy+gradient+Hessian calls=       191 time=          10.26 %= 21.0
