P A U P *
Version 4.0b10 for 32-bit Microsoft Windows
Tue Jul 26 13:59:20 2005

      -----------------------------NOTICE-----------------------------
        This is a beta-test version.  Please report any crashes,
        apparent calculation errors, or other anomalous results.
        There are no restrictions on publication of results obtained
        with this version, but you should check the WWW site
        frequently for bug announcements and/or updated versions.  
        See the README file on the distribution media for details.
      ----------------------------------------------------------------

Note: Outgroup status not changed by Outgroup or Ingroup command.

T-PTP test for monophyly with heuristic search:
  Testing constraint-tree "mp"
  Starting seed = 331300678
  Number of replicates = 100
  Only ingroup taxa randomized
  Optimality criterion = parsimony
    Character-status summary:
      Of 3096 total characters:
        All characters are of type 'unord'
        All characters have equal weight
        2608 characters are constant
        170 variable characters are parsimony-uninformative
        Number of parsimony-informative characters = 318
  Starting tree(s) obtained via stepwise addition
  Addition sequence: simple (reference taxon = Anaecypri)
  Number of trees held at each step during stepwise addition = 1
  Branch-swapping algorithm: tree-bisection-reconnection (TBR)
  Steepest descent option not in effect
  Initial 'MaxTrees' setting = 100
  Branches collapsed (creating polytomies) if maximum branch length is zero
  'MulTrees' option in effect
  Trees are unrooted

   100 permutation test replicates completed
   Time used = 3.78 sec

Results of T-PTP test:

  Tree length     Number of
   difference**  replicates
  -------------------------
            1*            1
          -53             1
          -56             1
          -58             2
          -59             2
          -60             1
          -61             1
          -62             2
          -65             5
          -66             4
          -67             4
          -68             2
          -69             3
          -70             2
          -71             2
          -72             2
          -73             6
          -74             2
          -75             5
          -76             4
          -77             2
          -78             3
          -79             2
          -80             2
          -81             3
          -82             2
          -83             3
          -84             6
          -85             3
          -86             4
          -87             2
          -88             3
          -89             2
          -90             4
          -93             1
          -94             2
          -95             1
          -96             1
          -97             1
          -99             1
          * = length difference for original (unpermuted) data
         ** = length of shortest tree not compatible with constraints minus
              length of shortest tree compatible with constraints

  P = 0.010000