
 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:00:06
  [-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=    -534.6711754     RMS force=    0.9676615577E-06
 OPTIM> Final energy  =    -528.7249325     RMS force=    0.7703196372E-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=     27779.    
 decide> The unconnected minima in the chain and their distances are:
     2       30.29     1 
 

 tryconnect> 315-iteration DNEB run for minima 1_S and 2_F using 9 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      3.255713058    
 Double-ended search iterations= 315 RMS= 0.4985 Dev= 1.52% S= 37.01 time= 5.39
 Following    1 images are candidates for TS:    7  
 Converged to TS (number of iterations):         50
 DNEB run yielded 1 true transition state(s) time=   5.46

 >>>>>  Path run for ts 1 ...
 Plus  side of path:                    1071 steps. Energy=    -534.1997122       time=       3.12
 Minus side of path:                     627 steps. Energy=    -528.7249325       time=       1.56

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -534.1997122  7.0282         -527.1714739  1.5535         -528.7249325  27.166  25.243   2.956  36.194
        *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=     2323.8    
 decide> The unconnected minima in the chain and their distances are:
     3       13.25     1 
 

 tryconnect> 105-iteration DNEB run for minima 1_S and 3_F using 3 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      10.50000000    
 Double-ended search iterations= 105 RMS= 2.9056 Dev= 2.15% S= 17.72 time= 0.57
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         69
 DNEB run yielded 1 true transition state(s) time=   6.64

 >>>>>  Path run for ts 2 ...
 Plus  side of path:                     552 steps. Energy=    -534.6787748       time=       1.34
 Minus side of path:                     575 steps. Energy=    -535.2417289       time=       1.41

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -534.6787748 0.54537E-01     -534.6242380 0.61749         -535.2417289   5.860   5.805   3.841  27.860
        *NEW* (Placed in 4)                                     *NEW* (Placed in 5)
 Connection established between members of the U set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 3 >>>>>>>>>>>>>>>>>>>>> 5 minima and 2 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      4 steps with      2 missing connections, weight=     1480.1    
 decide> The unconnected minima in the chain and their distances are:
     3       11.38     4     5        1.69     1 
 

 tryconnect> 105-iteration DNEB run for minima 3_F and 4_U using 3 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      7.106813301    
 Double-ended search iterations= 105 RMS= 0.9500 Dev= 0.71% S= 16.06 time= 0.60
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         85
 DNEB run yielded 1 true transition state(s) time=   8.29
 isnewts> transition state is the same as number        2 energy=     -534.6242380002
 tryconnect> Try the path again for ts      1 with pushoff=    0.1000000000E-01

 >>>>>  Path run for ts 3 ...
 tryconnect> Trying this transition state path again with pushoff=    0.1000000000E-01
 Plus  side of path:                     592 steps. Energy=    -535.2417289       time=       1.46
 Minus side of path:                     535 steps. Energy=    -534.6787748       time=       1.30

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -535.2417289 0.61749         -534.6242380 0.54537E-01     -534.6787748   5.861   5.805   3.851  27.785
        Known (#5)                                              Known (#4)
 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      6.139132535    
 Double-ended search iterations= 70 RMS= 0.2648 Dev= 1.62% S= 2.28 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.28

 >>>>>  Path run for ts 4 ...
 Plus  side of path:                     554 steps. Energy=    -534.6711754       time=       1.35
 Minus side of path:                     556 steps. Energy=    -535.2417289       time=       1.36

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -534.6711754  8.1711         -526.5000622  8.7417         -535.2417289   2.627   1.690  57.800   1.851
        Known (#1)                                              Known (#5)
 Unconnected minimum 5 found its way to S set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 4 >>>>>>>>>>>>>>>>>>>>> 5 minima and 4 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      3 steps with      1 missing connections, weight=     2373.1    
 decide> The unconnected minima in the chain and their distances are:
     3       13.34     5 
 

 tryconnect> 140-iteration DNEB run for minima 3_F and 5_S using 4 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      9.070294785    
 Double-ended search iterations= 140 RMS= 1.9583 Dev= 1.94% S= 18.67 time= 1.13
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):        183
 DNEB run yielded 1 true transition state(s) time=  16.89

 >>>>>  Path run for ts 5 ...
 Plus  side of path:                     626 steps. Energy=    -532.5920133       time=       1.56
 Minus side of path:                     596 steps. Energy=    -531.5800328       time=       1.47

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -532.5920133  1.1574         -531.4346609 0.14537         -531.5800328   5.808   5.462  11.517   9.290
        *NEW* (Placed in 6)                                     *NEW* (Placed in 7)
 Connection established between members of the U set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 5 >>>>>>>>>>>>>>>>>>>>> 7 minima and 5 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      4 steps with      1 missing connections, weight=     2950.5    
 decide> The unconnected minima in the chain and their distances are:
     3       11.38     4 
 

 tryconnect> 805-iteration DNEB run for minima 3_F and 4_S using 23 images  (DNEB attempt #2)  ...
 lbfgs> Final DNEB force constant     0.5098621309    
 Double-ended search iterations= 805 RMS= 0.0300 Dev= 1.55% S= 21.10 time= 36.88
 Following    1 images are candidates for TS:   14  
 Converged to TS (number of iterations):         43
 DNEB run yielded 1 true transition state(s) time=   4.68
 isnewts> transition state is the same as number        2 energy=     -534.6242379996
 tryconnect> Will not repeat search for TS      1 same as TS      2
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 6 >>>>>>>>>>>>>>>>>>>>> 7 minima and 5 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      2 steps with      1 missing connections, weight=     4647.5    
 decide> The unconnected minima in the chain and their distances are:
     3       13.25     1 
 

 tryconnect> 805-iteration DNEB run for minima 1_S and 3_F using 23 images  (DNEB attempt #2)  ...
 lbfgs> Final DNEB force constant      4.810170981    
 Double-ended search iterations= 805 RMS= 0.0970 Dev= 4.77% S= 22.64 time= 36.71
 Following    2 images are candidates for TS:    7   10  
 Converged to TS (number of iterations):         33
 Converged to TS (number of iterations):         35
 DNEB run yielded 2 true transition state(s) time=   7.83

 >>>>>  Path run for ts 6 ...
 Plus  side of path:                     584 steps. Energy=    -534.6711754       time=       1.44
 Minus side of path:                     559 steps. Energy=    -535.2417289       time=       1.37

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -534.6711754  8.3601         -526.3110658  8.9307         -535.2417289   5.189   1.690  59.780   1.790
        Known (#1)                                              Known (#5)
 Alternative path found between members of the S set.

 >>>>>  Path run for ts 7 ...
 Plus  side of path:                     665 steps. Energy=    -534.5278451       time=       1.67
 Minus side of path:                     733 steps. Energy=    -535.3372163       time=       1.89

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -534.5278451  3.4847         -531.0431372  4.2941         -535.3372163  17.764  10.831  12.535   8.536
        *NEW* (Placed in 8)                                     *NEW* (Placed in 9)
 Connection established between members of the U set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 7 >>>>>>>>>>>>>>>>>>>>> 9 minima and 7 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      5 steps with      2 missing connections, weight=     557.63    
 decide> The unconnected minima in the chain and their distances are:
     3        7.38     8     9        5.38     5 
 

 tryconnect> 70-iteration DNEB run for minima 3_F and 8_U using 2 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      5.050679530    
 Double-ended search iterations= 70 RMS= 0.1012 Dev= 0.06% S= 7.43 time= 0.29
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         52
 DNEB run yielded 1 true transition state(s) time=   5.78

 >>>>>  Path run for ts 8 ...
 Plus  side of path:                     566 steps. Energy=    -534.7851393       time=       1.38
 Minus side of path:                     522 steps. Energy=    -534.5864911       time=       1.26

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -534.7851393 0.27820         -534.5069412 0.79550E-01     -534.5864911   5.365   5.094   3.423  31.262
        *NEW* (Placed in 10)                                    *NEW* (Placed in 11)
 Connection established between members of the U set.

 tryconnect> 70-iteration DNEB run for minima 5_S and 9_U using 2 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      5.050679530    
 Double-ended search iterations= 70 RMS= 0.1242 Dev= 0.60% S= 5.65 time= 0.29
 Following    1 images are candidates for TS:    1  
 Converged to TS (number of iterations):         20
 DNEB run yielded 1 true transition state(s) time=   2.71

 >>>>>  Path run for ts 9 ...
 Plus  side of path:                     541 steps. Energy=    -535.2417289       time=       1.31
 Minus side of path:                     539 steps. Energy=    -535.3372163       time=       1.31

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -535.2417289 0.31232         -534.9294137 0.40780         -535.3372163   5.773   5.383  10.413  10.276
        Known (#5)                                              Known (#9)
 Unconnected minimum 9 found its way to S set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 8 >>>>>>>>>>>>>>>>>>>>> 11 minima and 9 ts are known >>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      7 steps with      2 missing connections, weight=     167.61    
 decide> The unconnected minima in the chain and their distances are:
     3        5.12    11    10        3.23     8 
 

 tryconnect> 70-iteration DNEB run for minima 3_F and 11_U using 2 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      5.050679530    
 Double-ended search iterations= 70 RMS= 0.4805 Dev= 0.26% S= 5.50 time= 0.29
 Following    1 images are candidates for TS:    1  
 Converged to TS (number of iterations):         15
 DNEB run yielded 1 true transition state(s) time=   2.46

 >>>>>  Path run for ts 10 ...
 Plus  side of path:                     566 steps. Energy=    -534.1997122       time=       1.38
 Minus side of path:                     572 steps. Energy=    -534.5864911       time=       1.40

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -534.1997122 0.78097E-01     -534.1216152 0.46488         -534.5864911   5.520   5.120  19.582   5.464
        Known (#3)                                              Known (#11)
 Unconnected minimum 11 found its way to F set.

 tryconnect> 70-iteration DNEB run for minima 8_S and 10_F using 2 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      5.050679530    
 Double-ended search iterations= 70 RMS= 0.1146 Dev= 0.10% S= 3.27 time= 0.29
 Following    1 images are candidates for TS:    1  
 Converged to TS (number of iterations):         13
 DNEB run yielded 1 true transition state(s) time=   2.28

 >>>>>  Path run for ts 11 ...
 Plus  side of path:                     558 steps. Energy=    -534.5278451       time=       1.37
 Minus side of path:                     563 steps. Energy=    -534.7851393       time=       1.39

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -534.5278451 0.65089E-01     -534.4627563 0.32238         -534.7851393   3.328   3.225   9.808  10.909
        Known (#8)                                              Known (#10)
 Connected path found
  ts        E+         Ets - E+          Ets       Ets - E-          E-          S       D      gamma   ~N
   4     -534.6711754  8.1711        -526.5000622  8.7417        -535.2417289   2.627   1.690  57.800   1.851
   9     -535.2417289 0.31232        -534.9294137 0.40780        -535.3372163   5.773   5.383  10.413  10.276
   7     -535.3372163  4.2941        -531.0431372  3.4847        -534.5278451  17.764  10.831  12.535   8.536
  11     -534.5278451 0.65089E-01    -534.4627563 0.32238        -534.7851393   3.328   3.225   9.808  10.909
   8     -534.7851393 0.27820        -534.5069412 0.79550E-01    -534.5864911   5.365   5.094   3.423  31.262
  10     -534.5864911 0.46488        -534.1216152 0.78097E-01    -534.1997122   5.520   5.120  19.582   5.464
   1     -534.1997122  7.0282        -527.1714739  1.5535        -528.7249325  27.166  25.243   2.956  36.194

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

 Elapsed time=                               182.03
 OPTIM> # of energy calls=                          0 time=           0.00 %=  0.0
 OPTIM> # of energy+gradient calls=             62343 time=         124.36 %= 68.3
 OPTIM> # of energy+gradient+Hessian calls=       610 time=          32.84 %= 18.0
