
 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:53:46
  [-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


 OPTIM> Using translational/rotational ev shift=     1000000.000    
 OPTIM> Initial energy=    -451.7145958     RMS force=    0.9290682787E-06
 OPTIM> Final energy  =    -448.8686756     RMS force=    0.9997769869E-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=     62250.    
 decide> The unconnected minima in the chain and their distances are:
     2       39.63     1 
 

 tryconnect> 385-iteration DNEB run for minima 1_S and 2_F using 11 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant     0.3450947594    
 Double-ended search iterations= 385 RMS= 0.0686 Dev= 3.29% S= 45.60 time= 31.68
 Following    1 images are candidates for TS:    6  
 Converged to TS (number of iterations):         54
 DNEB run yielded 1 true transition state(s) time=  39.81

 >>>>>  Path run for ts 1 ...
 Plus  side of path:                    1285 steps. Energy=    -450.1554378       time=      14.28
 Minus side of path:                    1303 steps. Energy=    -451.2817251       time=      14.60

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -450.1554378 0.18259         -449.9728513  1.3089         -451.2817251  11.362  10.975   3.187  68.408
        *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=     59595.    
 decide> The unconnected minima in the chain and their distances are:
     2       38.74     4     4       11.27     1 
 

 tryconnect> 385-iteration DNEB run for minima 2_F and 4_U using 11 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant     0.2335737168    
 Double-ended search iterations= 385 RMS= 0.0691 Dev= 1.81% S= 42.50 time= 31.84
 Following    1 images are candidates for TS:    4  
 Converged to TS (number of iterations):         96
 DNEB run yielded 1 true transition state(s) time=  69.42

 >>>>>  Path run for ts 2 ...
 Plus  side of path:                    1282 steps. Energy=    -448.8686756       time=      13.81
 Minus side of path:                    1468 steps. Energy=    -450.5580741       time=      16.89

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -448.8686756 0.46643         -448.4022482  2.1558         -450.5580741  55.291  51.744   2.210  98.662
        Known (#2)                                              *NEW* (Placed in 5)
 Unconnected minimum 5 found its way to F set.

 tryconnect> 105-iteration DNEB run for minima 1_S and 4_U using 3 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      3.589423646    
 Double-ended search iterations= 105 RMS= 0.5326 Dev= 0.35% S= 12.64 time= 2.36
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         31
 DNEB run yielded 1 true transition state(s) time=  26.98

 >>>>>  Path run for ts 3 ...
 Plus  side of path:                    1277 steps. Energy=    -451.2817251       time=      13.69
 Minus side of path:                    1301 steps. Energy=    -451.7145958       time=      14.25

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -451.2817251  2.3501         -448.9316587  2.7829         -451.7145958  14.275  11.295  16.074  13.562
        Known (#4)                                              Known (#1)
 Unconnected minimum 4 found its way to S set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 3 >>>>>>>>>>>>>>>>>>>>> 5 minima and 3 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      3 steps with      1 missing connections, weight=     62450.    
 decide> The unconnected minima in the chain and their distances are:
     2       39.67     3 
 

 tryconnect> 385-iteration DNEB run for minima 2_F and 3_S using 11 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant     0.2335737168    
 Double-ended search iterations= 385 RMS= 0.0488 Dev= 1.31% S= 42.31 time= 31.77
 Following    1 images are candidates for TS:    3  
 Converged to TS (number of iterations):         76
 DNEB run yielded 1 true transition state(s) time=  54.47
 isnewts> transition state is the same as number        2 energy=     -448.4022481938
 tryconnect> Try the path again for ts      1 with pushoff=    0.1000000000E-01

 >>>>>  Path run for ts 4 ...
 tryconnect> Trying this transition state path again with pushoff=    0.1000000000E-01
 Plus  side of path:                    1283 steps. Energy=    -448.8686756       time=      13.75
 Minus side of path:                    1441 steps. Energy=    -450.5580741       time=      15.75

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -448.8686756 0.46643         -448.4022482  2.1558         -450.5580741  55.293  51.750   2.205  98.857
        Known (#2)                                              Known (#5)
 Alternative path found between members of the F set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 4 >>>>>>>>>>>>>>>>>>>>> 5 minima and 4 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      2 steps with      1 missing connections, weight=    0.11632E+06
 decide> The unconnected minima in the chain and their distances are:
     2       38.74     4 
 

 tryconnect> 805-iteration DNEB run for minima 2_F and 4_S using 23 images  (DNEB attempt #2)  ...
 lbfgs> Final DNEB force constant     0.3804669723    
 Double-ended search iterations= 805 RMS= 0.0139 Dev= 4.49% S= 45.40 time= 138.65
 Following    1 images are candidates for TS:    8  
 Converged to TS (number of iterations):         81
 DNEB run yielded 1 true transition state(s) time=  60.92
 isnewts> transition state is the same as number        2 energy=     -448.4022481943
 tryconnect> Will not repeat search for TS      1 same as TS      2
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 5 >>>>>>>>>>>>>>>>>>>>> 5 minima and 4 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      4 steps with      1 missing connections, weight=    0.12053E+06
 decide> The unconnected minima in the chain and their distances are:
     5       49.40     3 
 

 tryconnect> 490-iteration DNEB run for minima 3_S and 5_F using 14 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant     0.8383950223E-01
 Double-ended search iterations= 490 RMS= 0.0724 Dev= 1.02% S= 52.53 time= 51.30
 Following    2 images are candidates for TS:    5    8  
 Converged to TS (number of iterations):         23
 Converged to TS (number of iterations):         36
 DNEB run yielded 2 true transition state(s) time=  58.18

 >>>>>  Path run for ts 5 ...
 Plus  side of path:                    1277 steps. Energy=    -449.8816558       time=      15.37
 Minus side of path:                    1307 steps. Energy=    -450.1554378       time=      15.07

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -449.8816558 0.30933         -449.5723270 0.58311         -450.1554378  22.008  21.445   2.790  78.136
        *NEW* (Placed in 6)                                     Known (#3)
 Unconnected minimum 6 found its way to S set.

 >>>>>  Path run for ts 6 ...
 Plus  side of path:                    1420 steps. Energy=    -450.5580741       time=      17.48
 Minus side of path:                    1281 steps. Energy=    -449.8816558       time=      14.56

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -450.5580741 0.73288         -449.8251894 0.56466E-01     -449.8816558  32.040  31.377   1.899 114.779
        Known (#5)                                              Known (#6)
 Connected path found
  ts        E+         Ets - E+          Ets       Ets - E-          E-          S       D      gamma   ~N
   3     -451.7145958  2.7829        -448.9316587  2.3501        -451.2817251  14.275  11.295  16.074  13.562
   1     -451.2817251  1.3089        -449.9728513 0.18259        -450.1554378  11.362  10.975   3.187  68.408
   5     -450.1554378 0.58311        -449.5723270 0.30933        -449.8816558  22.008  21.445   2.790  78.136
   6     -449.8816558 0.56466E-01    -449.8251894 0.73288        -450.5580741  32.040  31.377   1.899 114.779
   2     -450.5580741  2.1558        -448.4022482 0.46643        -448.8686756  55.291  51.744   2.210  98.662

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

 Elapsed time=                               777.32
 OPTIM> # of energy calls=                          0 time=           0.00 %=  0.0
 OPTIM> # of energy+gradient calls=             65420 time=         486.37 %= 62.6
 OPTIM> # of energy+gradient+Hessian calls=       397 time=         116.54 %= 15.0
