
 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 18:28:57
  [-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=    -448.5469429     RMS force=    0.9156537740E-06
 OPTIM> Final energy  =    -444.6847971     RMS force=    0.7993715630E-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=     6179.6    
 decide> The unconnected minima in the chain and their distances are:
     2       18.35     1 
 

 tryconnect> 175-iteration DNEB run for minima 1_S and 2_F using 5 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      10.50000000    
 Double-ended search iterations= 175 RMS= 2.2707 Dev= 1.36% S= 25.91 time= 5.67
 Following    1 images are candidates for TS:    3  
 Converged to TS (number of iterations):         70
 DNEB run yielded 1 true transition state(s) time=  48.89

 >>>>>  Path run for ts 1 ...
 Plus  side of path:                    1933 steps. Energy=    -447.0583064       time=      32.21
 Minus side of path:                    1344 steps. Energy=    -448.5469429       time=      16.33

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -447.0583064  1.3778         -445.6804683  2.8665         -448.5469429  51.148  42.840   4.090  53.297
        *NEW* (Placed in 3)                                     Known (#1)
 Unconnected minimum 3 found its way to S set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 2 >>>>>>>>>>>>>>>>>>>>> 3 minima and 1 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      1 steps with      1 missing connections, weight=     12359.    
 decide> The unconnected minima in the chain and their distances are:
     2       18.35     1 
 

 tryconnect> 805-iteration DNEB run for minima 1_S and 2_F using 23 images  (DNEB attempt #2)  ...
 lbfgs> Final DNEB force constant     0.4194648369    
 Double-ended search iterations= 805 RMS= 0.0518 Dev= 4.93% S= 42.27 time= 137.25
 Following    2 images are candidates for TS:    5   17  
 Converged to TS (number of iterations):         26
 Converged to TS (number of iterations):         84
 DNEB run yielded 2 true transition state(s) time=  81.12
 isnewts> transition state is the same as number        1 energy=     -445.6804683451
 tryconnect> Try the path again for ts      1 with pushoff=    0.1000000000E-01

 >>>>>  Path run for ts 2 ...
 tryconnect> Trying this transition state path again with pushoff=    0.1000000000E-01
 Plus  side of path:                    1902 steps. Energy=    -447.0583064       time=      23.83
 Minus side of path:                    1318 steps. Energy=    -448.5469429       time=      13.83

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -447.0583064  1.3778         -445.6804683  2.8665         -448.5469429  51.158  42.863   4.075  53.496
        Known (#3)                                              Known (#1)
 Alternative path found between members of the S set.

 >>>>>  Path run for ts 3 ...
 Plus  side of path:                    1373 steps. Energy=    -445.3358482       time=      14.88
 Minus side of path:                    2047 steps. Energy=    -447.0583064       time=      27.25

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -445.3358482  1.9911         -443.3447908  3.7135         -447.0583064  66.401  58.998   2.570  84.811
        *NEW* (Placed in 4)                                     Known (#3)
 Unconnected minimum 4 found its way to S set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 3 >>>>>>>>>>>>>>>>>>>>> 4 minima and 3 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      3 steps with      1 missing connections, weight=     48907.    
 decide> The unconnected minima in the chain and their distances are:
     2       36.57     4 
 

 tryconnect> 350-iteration DNEB run for minima 2_F and 4_S using 10 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant     0.3286616756    
 Double-ended search iterations= 350 RMS= 0.0389 Dev= 0.04% S= 37.76 time= 26.56
 Following    1 images are candidates for TS:    4  
 Converged to TS (number of iterations):         43
 DNEB run yielded 1 true transition state(s) time=  35.82

 >>>>>  Path run for ts 4 ...
 Plus  side of path:                    1396 steps. Energy=    -444.6847971       time=      16.63
 Minus side of path:                    1371 steps. Energy=    -445.3358482       time=      18.43

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -444.6847971 0.36280         -444.3219971  1.0139         -445.3358482  39.068  36.597   3.183  68.498
        Known (#2)                                              Known (#4)
 Connected path found
  ts        E+         Ets - E+          Ets       Ets - E-          E-          S       D      gamma   ~N
   1     -448.5469429  2.8665        -445.6804683  1.3778        -447.0583064  51.148  42.840   4.090  53.297
   3     -447.0583064  3.7135        -443.3447908  1.9911        -445.3358482  66.401  58.998   2.570  84.811
   4     -445.3358482  1.0139        -444.3219971 0.36280        -444.6847971  39.068  36.597   3.183  68.498

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

 Elapsed time=                               498.91
 OPTIM> # of energy calls=                          0 time=           0.00 %=  0.0
 OPTIM> # of energy+gradient calls=             40588 time=         304.97 %= 61.1
 OPTIM> # of energy+gradient+Hessian calls=       223 time=          65.97 %= 13.2
