Project Euler problem 86 taking a long time
Given: 1 ≤ a ≤ b ≤ c = M, 

then, min(a*b, b*c, a*c) == a*b

This means, you can remove 2 multiplications and the min operation from shortest-cuboid-dist-has-int-length? as long as you pass your room’s length, width, and height in the proper order.