
 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/28/2012 at 09:33:20
  [-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=    -533.0478937     RMS force=    0.9477439123E-06
 OPTIM> Final energy  =    -532.3570695     RMS force=    0.8605762448E-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=     2161.9    
 decide> The unconnected minima in the chain and their distances are:
     2       12.93     1 
 

 tryconnect> 105-iteration DNEB run for minima 1_S and 2_F using 3 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      5.846792891    
 Double-ended search iterations= 105 RMS= 1.0066 Dev= 2.45% S= 15.89 time= 0.63
 Following    1 images are candidates for TS:    3  
 Converged to TS (number of iterations):         42
 DNEB run yielded 1 true transition state(s) time=   4.97

 >>>>>  Path run for ts 1 ...
 Plus  side of path:                     702 steps. Energy=    -531.6968194       time=       1.74
 Minus side of path:                     654 steps. Energy=    -531.9695271       time=       1.62

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -531.6968194  3.4968         -528.2000193  3.7695         -531.9695271  11.018   5.246  26.661   4.013
        *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      2 steps with      2 missing connections, weight=     1561.4    
 decide> The unconnected minima in the chain and their distances are:
     2       11.04     4     4        6.01     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= 1.3898 Dev= 1.28% S= 12.46 time= 0.65
 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.38

 >>>>>  Path run for ts 2 ...
 Plus  side of path:                     624 steps. Energy=    -531.6968194       time=       1.54
 Minus side of path:                     673 steps. Energy=    -531.9695271       time=       1.67

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -531.6968194  3.5643         -528.1325449  3.8370         -531.9695271   9.224   5.250  26.532   4.033
        Known (#3)                                              Known (#4)
 Connection established between members of the U set.

 tryconnect> 70-iteration DNEB run for minima 1_S and 4_U using 2 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      5.050679530    
 Double-ended search iterations= 70 RMS= 1.6084 Dev= 0.04% S= 6.12 time= 0.29
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         46
 DNEB run yielded 1 true transition state(s) time=   5.58

 >>>>>  Path run for ts 3 ...
 Plus  side of path:                     589 steps. Energy=    -533.2255430       time=       1.44
 Minus side of path:                     534 steps. Energy=    -531.9098565       time=       1.28

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -533.2255430  1.3161         -531.9094604 0.39613E-03     -531.9098565   4.480   4.403  12.522   8.545
        *NEW* (Placed in 5)                                     *NEW* (Placed in 6)
 Connection established between members of the U set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 3 >>>>>>>>>>>>>>>>>>>>> 6 minima and 3 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      3 steps with      2 missing connections, weight=     1301.8    
 decide> The unconnected minima in the chain and their distances are:
     2       10.73     6     5        4.07     1 
 

 tryconnect> 105-iteration DNEB run for minima 2_F and 6_U using 3 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      5.303213506    
 Double-ended search iterations= 105 RMS= 1.9634 Dev= 2.78% S= 12.71 time= 0.63
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         38
 DNEB run yielded 1 true transition state(s) time=   4.46

 >>>>>  Path run for ts 4 ...
 Plus  side of path:                     629 steps. Energy=    -531.4834531       time=       1.53
 Minus side of path:                     619 steps. Energy=    -531.8176810       time=       1.50

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -531.4834531  3.3216         -528.1618979  3.6558         -531.8176810   9.265   5.700  20.137   5.314
        *NEW* (Placed in 7)                                     *NEW* (Placed in 8)
 Connection established between members of the U set.

 tryconnect> 70-iteration DNEB run for minima 1_S and 5_U using 2 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      5.050679530    
 Double-ended search iterations= 70 RMS= 0.0763 Dev= 0.08% S= 4.11 time= 0.28
 Following    1 images are candidates for TS:    1  
 Converged to TS (number of iterations):         27
 DNEB run yielded 1 true transition state(s) time=   3.51

 >>>>>  Path run for ts 5 ...
 Plus  side of path:                     603 steps. Energy=    -533.2255430       time=       1.45
 Minus side of path:                     606 steps. Energy=    -533.0478937       time=       1.46

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -533.2255430 0.18681         -533.0387301 0.91636E-02     -533.0478937   4.303   4.066   6.271  17.062
        Known (#5)                                              Known (#1)
 Unconnected minimum 5 found its way to S set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 4 >>>>>>>>>>>>>>>>>>>>> 8 minima and 5 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      5 steps with      2 missing connections, weight=     1613.6    
 decide> The unconnected minima in the chain and their distances are:
     2       11.48     3     4        4.65     6 
 

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

 >>>>>  Path run for ts 6 ...
 Plus  side of path:                     728 steps. Energy=    -533.0478937       time=       1.82
 Minus side of path:                     709 steps. Energy=    -532.3570695       time=       1.78

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -533.0478937  2.7985         -530.2494109  2.1077         -532.3570695  17.829  13.034  12.823   8.345
        Known (#1)                                              Known (#2)

 tryconnect> 70-iteration DNEB run for minima 4_U and 6_S using 2 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      5.050679530    
 Double-ended search iterations= 70 RMS= 0.1007 Dev= 0.07% S= 4.76 time= 0.28
 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.15

 >>>>>  Path run for ts 7 ...
 Plus  side of path:                     650 steps. Energy=    -531.9695271       time=       1.60
 Minus side of path:                     572 steps. Energy=    -531.9098565       time=       1.37

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -531.9695271 0.15707         -531.8124608 0.97396E-01     -531.9098565   5.266   4.655   6.865  15.586
        Known (#4)                                              Known (#6)
 Unconnected minimum 4 found its way to S set.
 Connected path found
  ts        E+         Ets - E+          Ets       Ets - E-          E-          S       D      gamma   ~N
   6     -533.0478937  2.7985        -530.2494109  2.1077        -532.3570695  17.829  13.034  12.823   8.345

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

 Elapsed time=                                58.48
 OPTIM> # of energy calls=                          0 time=           0.00 %=  0.0
 OPTIM> # of energy+gradient calls=             15454 time=          30.87 %= 52.8
 OPTIM> # of energy+gradient+Hessian calls=       280 time=          15.15 %= 25.9
