# cost = 12
# n_nodes = 15406
# version = 1.0
# time = 3.950

# n=9, i=3, cost=12: no comparisons done
find_1(a,b,c,d,e,f,g,h,i) =
  if a > b
  then find_2(a,b,c,d,e,f,g,h,i)
  else find_2(b,a,c,d,e,f,g,h,i)
# n=9, i=3, cost=11: a>b
find_2(a,b,c,d,e,f,g,h,i) =
  if c > d
  then find_3(a,c,b,d,e,f,g,h,i)
  else find_3(a,d,b,c,e,f,g,h,i)
# n=9, i=3, cost=10: a>c,b>d
find_3(a,b,c,d,e,f,g,h,i) =
  if a > b
  then find_4(a,b,d,c,e,f,g,h,i)
  else find_4(b,a,c,d,e,f,g,h,i)
# n=9, i=3, cost=9: a>b,a>c,a>d,b>c
find_4(a,b,c,d,e,f,g,h,i) =
  if e > f
  then find_5(a,b,e,c,d,f,g,h,i)
  else find_5(a,b,f,c,d,e,g,h,i)
# n=9, i=3, cost=8: a>b,a>d,a>e,b>d,c>f
find_5(a,b,c,d,e,f,g,h,i) =
  if g > h
  then find_6(a,b,c,g,d,e,f,h,i)
  else find_6(a,b,c,h,d,e,f,g,i)
# n=9, i=3, cost=7: a>b,a>e,a>f,b>e,c>g,d>h
find_6(a,b,c,d,e,f,g,h,i) =
  if c > d
  then find_7(a,c,b,d,e,h,f,g,i)
  else find_7(a,d,b,c,e,g,f,h,i)
# n=9, i=3, cost=6: a>c,a>e,a>g,b>d,b>f,b>h,c>e,d>f
find_7(a,b,c,d,e,f,g,h,i) =
  if a > b
  then find_8(b,d,c,h,e,g,i)
  else find_8(a,c,d,g,f,h,i)
# n=7, i=2, cost=5: a>b,a>d,c>e
find_8(a,b,c,d,e,f,g) =
  if f > g
  then find_9(a,c,f,d,b,e,g)
  else find_9(a,c,g,d,b,e,f)
# n=7, i=2, cost=4: a>d,a>e,b>f,c>g
find_9(a,b,c,d,e,f,g) =
  if b > c
  then find_10(b,a,c,f,e,d)
  else find_10(c,a,b,g,e,d)
# n=6, i=2, cost=3: a>c,a>d,b>e,b>f
find_10(a,b,c,d,e,f) =
  if a > b
  then find_11(b,c,d)
  else find_11(a,e,f)
# n=3, i=1, cost=2: no comparisons done
find_11(a,b,c) =
  if a > b
  then find_12(a,c)
  else find_12(b,c)
# n=2, i=1, cost=1: no comparisons done
find_12(a,b) =
  if a > b
  then a
  else b