Added simple benchmark for if a rectangle fits inside another rectangle

benchmarks/core/fitsinside.bril

@@ -0,0 +1,16 @@
+# ARGS: 12 4 5 13
+@main (width1:int, height1:int, width2:int, height2:int){
+  output: bool = call @fitsInside width1 height1 width2 height2;
+  print output;
+}
+
+@fitsInside(w1: int, h1: int, w2: int, h2: int) : bool {
+  width_check: bool = le w1 w2; 
+  height_check: bool = le h1 h2;
+  first_check: bool = and width_check height_check;
+  widthheight_check: bool = le w1 h2;
+  heightwidth_check: bool = le h1 w2; 
+  second_check: bool = and widthheight_check heightwidth_check;
+  ret_val: bool = or first_check second_check;
+  ret ret_val;
+}

benchmarks/core/fitsinside.out

@@ -0,0 +1 @@
+true

benchmarks/core/fitsinside.prof

@@ -0,0 +1 @@
+total_dyn_inst: 10

docs/tools/bench.md

@@ -47,6 +47,7 @@ The current benchmarks are:
 * `quadratic`: The [quadratic formula][qf], including a hand-rolled implementation of square root.
 * `recfact`: Compute *n!* using recursive function calls.
 * `rectangles-area-difference`: Output the difference between the areas of rectangles (as a positive value) given their respective side lengths.
+* `fitsinside`: Output whether or not a rectangle fits inside of another rectangle given the width and height lengths.
 * `relative-primes`: Print all numbers relatively prime to *n* using [Euclidean algorithm][euclidean_into].
 * `riemann`: Prints the left, midpoint, and right [Riemann][riemann] Sums for a specified function, which is the square function in this benchmark.
 * `sieve`: Print all prime numbers up to *n* using the [Sieve of Eratosthenes][sievee].