1

   ABAQUS VERSION 6.6-1                                     DATE 19-Mar-2007   TIME 15:01:33
   For use at Purdue University under academic license from ABAQUS, Inc.





    AAAAAA     BBBBBBBBB      AAAAAA      QQQQQQQQ    U        U    SSSSSSSS
   A      A    B        B    A      A    Q        Q   U        U   S
  A        A   B        B   A        A   Q        Q   U        U   S
  A        A   B        B   A        A   Q        Q   U        U   S
  AAAAAAAAAA   BBBBBBBBB    AAAAAAAAAA   Q        Q   U        U    SSSSSSSS
  A        A   B        B   A        A   Q    Q   Q   U        U            S
  A        A   B        B   A        A   Q     Q  Q   U        U            S
  A        A   B        B   A        A   Q      Q Q   U        U            S
  A        A   BBBBBBBBB    A        A    QQQQQQQQ     UUUUUUUU     SSSSSSSS
 



                      This program has been developed by
 
                                  ABAQUS, Inc.
                                Rising Sun Mills
                               166 Valley Street
                         Providence, RI 02909-2499, USA
 


                   Available for internal use at Purdue University. 
                   Support of your usage is not included in the license
                   price.  To purchase support, or send information to ABAQUS, Inc.
                   about a suspected error, please follow the procedures
                   described in the ABAQUS academic support instructions
                   document. A copy of this document has been sent to the
                   designated user at your site. Additional copies can be
                   obtained by contacting ABAQUS, Inc. or your local ABAQUS
                   representative.

                   Should you have any questions concerning the terms of
                   this academic license, please contact the designated
                   user at your university, Catherine Kozlowski
 
                        On machine buddha.ecn.purdue.edu 
                        you are authorized to run
                        ABAQUS/Standard until 30-Jun-2007

                        Your site id is: 08PURDU 


 
                    For assistance or any other information contact

                                       ABAQUS, Inc. 
                                       Rising Sun Mills 
                                       166 Valley Street 
                                       Providence, RI 02909-2499  
                                       Tel: (1) 401 276 4400  
                                       Fax: (1) 401 276 4408  
                                       Web: http://www.abaqus.com 
                                       E-mail: info@abaqus.com  
                                       Technical support: support@abaqus.com  


                * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * 
                *                                                         * 
                *                   *****************                     * 
                *                   *  N O T I C E  *                     * 
                *                   *****************                     * 
                *                                                         * 
                *                                                         * 
                *                 ABAQUS VERSION 6.6-1                    * 
                *                                                         * 
                *          BUILD ID: 2006_03_22-16.31.34 69548            * 
                *                                                         * 
                *                                                         * 
                *  Please make sure you are using version 6.6 manuals     * 
                *  plus the notes accompanying this release.              * 
                *                                                         * 
                *                                                         * 
                *                                                         * 
                *                                                         * 
                *                                                         * 
                *   This program may not be used for commercial purposes  * 
                *           without payment of a monthly charge.          * 
                *                                                         * 
                * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * 


 



     PROCESSING PART, INSTANCE, AND ASSEMBLY INFORMATION
   *******************************************************


     END PROCESSING PART, INSTANCE, AND ASSEMBLY INFORMATION
   ***********************************************************




     OPTIONS BEING PROCESSED
   ***************************


  *Heading
  *Node
  *Element, type=CPS4I
  *Nset, nset=ASSEMBLY_PART-1-1__PICKEDSET2
  *Elset, elset=ASSEMBLY_PART-1-1__PICKEDSET2
  *Nset, nset=ASSEMBLY__PICKEDSET4
  *Nset, nset=ASSEMBLY__PICKEDSET5
  *Elset, elset=ASSEMBLY__PICKEDSET4
  *Elset, elset=ASSEMBLY__PICKEDSET5
  *Elset, elset=ASSEMBLY___PICKEDSURF6_S1
  *Elset, elset=ASSEMBLY___PICKEDSURF6_S2
  *surface, type=ELEMENT, name=ASSEMBLY__PICKEDSURF6
  *surface, type=ELEMENT, name=ASSEMBLY__PICKEDSURF6
  *material, name=ALUMINUM
  *elastic
  *solidsection, elset=ASSEMBLY_PART-1-1__PICKEDSET2, material=ALUMINUM
  *boundary
  *boundary
  *solidsection, elset=ASSEMBLY_PART-1-1__PICKEDSET2, material=ALUMINUM
  *surface, type=ELEMENT, name=ASSEMBLY__PICKEDSURF6
  *output, field, variable=PRESELECT
  *output, history, variable=PRESELECT
  *output, field, variable=PRESELECT
  *output, history, variable=PRESELECT
  *output, field, variable=PRESELECT
  *output, history, variable=PRESELECT
  *Step, name=Step-1
  *output, field, variable=PRESELECT
  *output, history, variable=PRESELECT
  *Step, name=Step-1
  *Step, name=Step-1
  Problem From Text                                                               
  *static
  *boundary
  *boundary
  *dsload
  *output, field, variable=PRESELECT
  *output, history, variable=PRESELECT
  *endstep
  *Step, name=Step-1
  *static
  *boundary
  *boundary
  *output, field, variable=PRESELECT
  *output, history, variable=PRESELECT
  *endstep

     - (RAMP) OR (STEP) - INDICATE USE OF DEFAULT AMPLITUDES ASSOCIATED WITH THE STEP



                            P R O B L E M   S I Z E


          NUMBER OF ELEMENTS IS                                    36
          NUMBER OF NODES IS                                      123
          NUMBER OF NODES DEFINED BY THE USER                      51
          NUMBER OF INTERNAL NODES GENERATED BY THE PROGRAM        72
          TOTAL NUMBER OF VARIABLES IN THE MODEL                  246
          (DEGREES OF FREEDOM PLUS ANY LAGRANGE MULTIPLIER VARIABLES)



                              END OF USER INPUT PROCESSING



     JOB TIME SUMMARY
       USER TIME (SEC)      =  0.22000    
       SYSTEM TIME (SEC)    =  6.00000E-02
       TOTAL CPU TIME (SEC) =  0.28000    
       WALLCLOCK TIME (SEC) =          7
1

   ABAQUS VERSION 6.6-1                                     DATE 19-Mar-2007   TIME 15:01:47
   For use at Purdue University under academic license from ABAQUS, Inc.

                                                                                               STEP    1  INCREMENT    1
     Problem From Text                                                                    TIME COMPLETED IN THIS STEP   0.00    


                        S T E P       1     S T A T I C   A N A L Y S I S


          Problem From Text                                                               

     AUTOMATIC TIME CONTROL WITH -
          A SUGGESTED INITIAL TIME INCREMENT OF                 1.00    
          AND A TOTAL TIME PERIOD OF                            1.00    
          THE MINIMUM TIME INCREMENT ALLOWED IS                1.000E-05
          THE MAXIMUM TIME INCREMENT ALLOWED IS                 1.00    

     LINEAR EQUATION SOLVER TYPE         DIRECT SPARSE



 STEP     1, INCREMENT          1, TIME INCREMENT=         0.100E+01, TOTAL TIME=         0.100E+01
 REORDERING OF EQUATIONS TO MINIMIZE WAVEFRONT HAS CHANGED THE MEMORY AND DISK ESTIMATES TO:
  
                   M E M O R Y   A N D   D I S K   E S T I M A T E
  
           SUMMARY FOR CURRENT NODE ORDERING
          (NOTE THAT IF NODE ORDERING CHANGES THE SIZE ESTIMATES FOR THE STEPS WILL CHANGE)
  
  
  
      MEMORY ESTIMATES FOR PROCESSOR:  1
  
           STEP   MAXIMUM DOF     FLOATING PT    MINIMUM MEMORY      MEMORY TO      REQUIRED DISKSPACE
                  WAVEFRONT       OPERATIONS       REQUIRED        MINIMIZE I/O
                                PER ITERATION     (MBYTES)           (MBYTES)          (KBYTES)
  
             1          24         3.58E+04          2.99               3.74             50.88
          ----    ---------      ------------    -------------     -------------      -------------
           MAX          24         3.58E+04          2.99               3.74             50.88
  
  
      MEMORY ESTIMATES FOR PROCESSOR:  2
  
           STEP   MAXIMUM DOF     FLOATING PT    MINIMUM MEMORY      MEMORY TO      REQUIRED DISKSPACE
                  WAVEFRONT       OPERATIONS       REQUIRED        MINIMIZE I/O
                                PER ITERATION     (MBYTES)           (MBYTES)          ( BYTES)
  
             1           0         0.00E+00          2.91               2.91              0.00
          ----    ---------      ------------    -------------     -------------      -------------
           MAX           0         0.00E+00          2.91               2.91              0.00
  
  
          IMPORTANT NOTE ABOUT REQUIRED MEMORY ESTIMATES:
              THE MEMORY REQUIREMENTS ARE NOT PREDICTABLE EXACTLY WHEN THE DIRECT
              PARALLEL SOLVER IS USED. WHILE THE MEMORY ESTIMATES ARE GENERALLY
              CONSERVATIVE, IT IS POSSIBLE THAT CERTAIN PROBLEMS WILL REQUIRE
              MORE MEMORY THAN THE MINIMUM ESTIMATE. IF THE ANALYSIS FAILS DUE
              TO INSUFFICIENT MEMORY, INCREASING THE VALUE OF standard_memory
              SHOULD ALLOW THE PROBLEM TO RUN.
  
  
          THE TABLE ABOVE PROVIDES A STEP BY STEP SUMMARY OF SOME BASIC SIZING INFORMATION
          FOR THE PROBLEM. SOME FURTHER DESCRIPTION OF THE PARAMETERS GIVEN FOLLOWS:
  
          (1) MAXIMUM DOF WAVEFRONT - SIZE OF THE BIGGEST FRONT IN THE EQUATION SOLVER.
              PROVIDES A BASIC SIZING OF THE MOST MEMORY INTENSIVE SEGMENT OF SOLVER.
          (2) FLOATING POINT OPERATIONS PER ITERATION - MEASURE OF THE NUMBER OF FLOATING
              POINT OPERATIONS REQUIRED FOR A SINGLE SOLVER PASS. ON A GIVEN PLATFORM
              THE TIME REQUIRED FOR A SOLVER PASS WILL BE ROUGHLY A LINEAR FUNCTION
              OF THIS VALUE.
              NOTE - EXCEPT FOR THE FIRST STEP, THE VALUE IN THIS TABLE DOES NOT INCLUDE
                     ADDITIONAL FLOATING POINT OPERATIONS THAT ARE REQUIRED IN MULTIPLE LOAD
                     CASE STEPS WHEN CONSTRAINTS CHANGE FROM LOAD CASE TO LOAD CASE.  THIS
                     SITUATION CAUSES A REORDERING TO BE PERFORMED, AT WHICH TIME AN UPPER
                     BOUND ON THE NUMBER OF ADDITIONAL FLOATING POINT OPERATIONS WILL BE
                     CALCULATED AND INCLUDED UNDER THE ESTIMATE SUMMARIES FOR THE RELEVANT
                     STEPS (SEE NOTE BELOW ON REORDERING).
          (3) MINIMUM MEMORY REQUIRED - MINIMUM POSSIBLE MEMORY VALUE FOR standard_memory
              THAT ENABLES ABAQUS TO SOLVE THE PROBLEM. USE OF MEMORY WILL BE MINIMIZED BY
              WRITING AS MUCH INFORMATION AS POSSIBLE TO DISK WHICH WILL INCREASE I/O TIME.
          (4) MEMORY TO MINIMIZE I/O - VALUE OF standard_memory THAT ALLOWS ABAQUS TO KEEP
              ALL SIGNIFICANT SCRATCH FILES IN MEMORY. THIS WILL MINIMIZE I/O TIME FOR THE USER
              WITH ACCESS TO A LARGE AMOUNT OF MEMORY.
          (5) REQUIRED DISKSPACE - AMOUNT OF DISK REQUIRED FOR SCRATCH FILES. THESE WILL BE
              DELETED AT THE END OF THE ANALYSIS.
  
  
           NOTE - WHENEVER POSSIBLE THE USER SHOULD SET standard_memory TO BE LESS THAN THE
          PHYSICAL MEMORY ON THE MACHINE. UNLESS NECESSARY USERS SHOULD NOT MAKE USE
          OF VIRTUAL MEMORY EVEN IN AN ATTEMPT TO KEEP SCRATCH FILES IN MEMORY.
  
           NOTE - IF A REORDERING IS PERFORMED (THIS WILL ONLY GENERALLY BE DONE FOR FINITE-
          SLIDING CONTACT PROBLEMS), THE SIZE ESTIMATES DONE AT THIS TIME WILL NO LONGER 
          BE VALID. THE ESTIMATES WILL BE REDONE IN THE EVENT OF A REORDERING AND A NEW 
          SUMMARY WILL BE PRINTED FOR THE REMAINING STEPS.
  
  
  
           S I Z E   E S T I M A T E S   F O R   C U R R E N T   S T E P
  
  
      SIZE ESTIMATES FOR PROCESSOR:  1
  
          NUMBER OF EQUATIONS                        246
          MAX DOF WAVEFRONT                          24
          FLOATING POINT OPS PER SOLVER ITERATION    3.58E+04
          MEMORY USED FOR STEP                     256.00 MBYTES
  
  
           ESTIMATED FILE SIZES
  
           FILE           KWORDS           KBYTES
  
          .fct             2.841           22.195
          .nck             0.432            3.375
          .opr             3.240           25.312
          -------        -------          -------
           TOTAL           6.513           50.883
  
  
      SIZE ESTIMATES FOR PROCESSOR:  2
  
          NUMBER OF EQUATIONS                        0
          MAX DOF WAVEFRONT                          0
          FLOATING POINT OPS PER SOLVER ITERATION    0.00E+00
          MEMORY USED FOR STEP                     256.00 MBYTES
  
  
           ESTIMATED FILE SIZES
  
           FILE            WORDS            BYTES
  
          .fct             0.000            0.000
          -------        -------          -------
           TOTAL           0.000            0.000
  


          THE ANALYSIS HAS BEEN COMPLETED



                              ANALYSIS COMPLETE



     JOB TIME SUMMARY
       USER TIME (SEC)      =   1.5900    
       SYSTEM TIME (SEC)    =  6.00000E-02
       TOTAL CPU TIME (SEC) =   1.6500    
       WALLCLOCK TIME (SEC) =          6
