# Generate a single shapefile from various intersection agreements

I have five vector files wherein I want to determine the spatial agreements among them using intersect. Here is my illustration. (Actually these are forest shapefiles from five different forest maps.)

`````` A = vector_file_1.shp
B = vector_file_2.shp
C = vector_file_3.shp
D = vector_file_4.shp
E = vector_file_5.shp
``````

So that I will have a set of spatial agreement from 2/5, 3/5, 4/5 to 5/5. For example:

``````1)   2/5 = A∩B, A∩C, A∩D, A∩E, B∩C, B∩D, B∩E, C∩D, C∩E
2)   3/5 = A∩B∩C, A∩B∩D, A∩B∩E, A∩C∩D, A∩D∩E, A∩C∩E, B∩C∩E, B∩C∩D, B∩D∩E, C∩D∩E
3)   4/5 = A∩B∩C∩D, A∩B∩C∩E, B∩C∩D∩E, A∩C∩D∩E
4)   5/5 = A∩B∩C∩D∩E
``````

My question is what geoprocessing technique will I use to generate a single shapefile from each agreement above (except item # 4), supposing I've done the intersection combinations for agreement items 1-3? Will I use intersection again, union or other technique?

(My professor told me to just add a field and put a number code on that field, for each shapefile, unfortunately I forgot the next process he mentioned.)

The other approach is Intersect. Since only areas of overlap are preserved, you have to do a number of intersects. With an Advanced license, since you can have more than two inputs, you basically have to run as many intersects as you have combinations (including item 4). However if you're limited to just two inputs, you have to do Item 1 first, then use those results in doing Item 2 - so it isn't `int ABC`, it's `result AB int c`. Essentially 'building' your intersections two inputs at a time, so to get ABCD would take three intersects.