Octave 3.8, jcobi/4

Percentage Accurate: 15.4% → 84.1%

Time: 18.9s

Alternatives: 8

Speedup: 115.0×

Specification

\[\left(\alpha > -1 \land \beta > -1\right) \land i > 1\]

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := i \cdot \left(\left(\alpha + \beta\right) + i\right)\\ t_1 := \left(\alpha + \beta\right) + 2 \cdot i\\ t_2 := t\_1 \cdot t\_1\\ \frac{\frac{t\_0 \cdot \left(\beta \cdot \alpha + t\_0\right)}{t\_2}}{t\_2 - 1} \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (* i (+ (+ alpha beta) i)))
        (t_1 (+ (+ alpha beta) (* 2.0 i)))
        (t_2 (* t_1 t_1)))
   (/ (/ (* t_0 (+ (* beta alpha) t_0)) t_2) (- t_2 1.0))))

C

double code(double alpha, double beta, double i) {
	double t_0 = i * ((alpha + beta) + i);
	double t_1 = (alpha + beta) + (2.0 * i);
	double t_2 = t_1 * t_1;
	return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(alpha, beta, i)
use fmin_fmax_functions
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: t_2
    t_0 = i * ((alpha + beta) + i)
    t_1 = (alpha + beta) + (2.0d0 * i)
    t_2 = t_1 * t_1
    code = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0d0)
end function

Java

public static double code(double alpha, double beta, double i) {
	double t_0 = i * ((alpha + beta) + i);
	double t_1 = (alpha + beta) + (2.0 * i);
	double t_2 = t_1 * t_1;
	return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}

Python

def code(alpha, beta, i):
	t_0 = i * ((alpha + beta) + i)
	t_1 = (alpha + beta) + (2.0 * i)
	t_2 = t_1 * t_1
	return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0)

Julia

function code(alpha, beta, i)
	t_0 = Float64(i * Float64(Float64(alpha + beta) + i))
	t_1 = Float64(Float64(alpha + beta) + Float64(2.0 * i))
	t_2 = Float64(t_1 * t_1)
	return Float64(Float64(Float64(t_0 * Float64(Float64(beta * alpha) + t_0)) / t_2) / Float64(t_2 - 1.0))
end

MATLAB

function tmp = code(alpha, beta, i)
	t_0 = i * ((alpha + beta) + i);
	t_1 = (alpha + beta) + (2.0 * i);
	t_2 = t_1 * t_1;
	tmp = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
end

Wolfram

code[alpha_, beta_, i_] := Block[{t$95$0 = N[(i * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * t$95$1), $MachinePrecision]}, N[(N[(N[(t$95$0 * N[(N[(beta * alpha), $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision] / N[(t$95$2 - 1.0), $MachinePrecision]), $MachinePrecision]]]]

Initial Program: 15.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := i \cdot \left(\left(\alpha + \beta\right) + i\right)\\ t_1 := \left(\alpha + \beta\right) + 2 \cdot i\\ t_2 := t\_1 \cdot t\_1\\ \frac{\frac{t\_0 \cdot \left(\beta \cdot \alpha + t\_0\right)}{t\_2}}{t\_2 - 1} \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (* i (+ (+ alpha beta) i)))
        (t_1 (+ (+ alpha beta) (* 2.0 i)))
        (t_2 (* t_1 t_1)))
   (/ (/ (* t_0 (+ (* beta alpha) t_0)) t_2) (- t_2 1.0))))

C

double code(double alpha, double beta, double i) {
	double t_0 = i * ((alpha + beta) + i);
	double t_1 = (alpha + beta) + (2.0 * i);
	double t_2 = t_1 * t_1;
	return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(alpha, beta, i)
use fmin_fmax_functions
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: t_2
    t_0 = i * ((alpha + beta) + i)
    t_1 = (alpha + beta) + (2.0d0 * i)
    t_2 = t_1 * t_1
    code = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0d0)
end function

Java

public static double code(double alpha, double beta, double i) {
	double t_0 = i * ((alpha + beta) + i);
	double t_1 = (alpha + beta) + (2.0 * i);
	double t_2 = t_1 * t_1;
	return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}

Python

def code(alpha, beta, i):
	t_0 = i * ((alpha + beta) + i)
	t_1 = (alpha + beta) + (2.0 * i)
	t_2 = t_1 * t_1
	return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0)

Julia

function code(alpha, beta, i)
	t_0 = Float64(i * Float64(Float64(alpha + beta) + i))
	t_1 = Float64(Float64(alpha + beta) + Float64(2.0 * i))
	t_2 = Float64(t_1 * t_1)
	return Float64(Float64(Float64(t_0 * Float64(Float64(beta * alpha) + t_0)) / t_2) / Float64(t_2 - 1.0))
end

MATLAB

function tmp = code(alpha, beta, i)
	t_0 = i * ((alpha + beta) + i);
	t_1 = (alpha + beta) + (2.0 * i);
	t_2 = t_1 * t_1;
	tmp = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
end

Wolfram

code[alpha_, beta_, i_] := Block[{t$95$0 = N[(i * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * t$95$1), $MachinePrecision]}, N[(N[(N[(t$95$0 * N[(N[(beta * alpha), $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision] / N[(t$95$2 - 1.0), $MachinePrecision]), $MachinePrecision]]]]

Alternative 1: 84.1% accurate, 0.5× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} t_0 := \left(\alpha + \beta\right) + 2 \cdot i\\ t_1 := t\_0 \cdot t\_0\\ t_2 := t\_1 - 1\\ t_3 := i \cdot \left(\left(\alpha + \beta\right) + i\right)\\ \mathbf{if}\;\frac{\frac{t\_3 \cdot \left(\beta \cdot \alpha + t\_3\right)}{t\_1}}{t\_2} \leq \infty:\\ \;\;\;\;\frac{\frac{t\_3}{t\_0} \cdot \frac{\mathsf{fma}\left(\beta, \alpha, t\_3\right)}{t\_0}}{t\_2}\\ \mathbf{else}:\\ \;\;\;\;\left(0.0625 - -0.125 \cdot \frac{\beta}{i}\right) - 0.125 \cdot \frac{\beta}{i}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* 2.0 i)))
        (t_1 (* t_0 t_0))
        (t_2 (- t_1 1.0))
        (t_3 (* i (+ (+ alpha beta) i))))
   (if (<= (/ (/ (* t_3 (+ (* beta alpha) t_3)) t_1) t_2) INFINITY)
     (/ (* (/ t_3 t_0) (/ (fma beta alpha t_3) t_0)) t_2)
     (- (- 0.0625 (* -0.125 (/ beta i))) (* 0.125 (/ beta i))))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	double t_1 = t_0 * t_0;
	double t_2 = t_1 - 1.0;
	double t_3 = i * ((alpha + beta) + i);
	double tmp;
	if ((((t_3 * ((beta * alpha) + t_3)) / t_1) / t_2) <= ((double) INFINITY)) {
		tmp = ((t_3 / t_0) * (fma(beta, alpha, t_3) / t_0)) / t_2;
	} else {
		tmp = (0.0625 - (-0.125 * (beta / i))) - (0.125 * (beta / i));
	}
	return tmp;
}

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * i))
	t_1 = Float64(t_0 * t_0)
	t_2 = Float64(t_1 - 1.0)
	t_3 = Float64(i * Float64(Float64(alpha + beta) + i))
	tmp = 0.0
	if (Float64(Float64(Float64(t_3 * Float64(Float64(beta * alpha) + t_3)) / t_1) / t_2) <= Inf)
		tmp = Float64(Float64(Float64(t_3 / t_0) * Float64(fma(beta, alpha, t_3) / t_0)) / t_2);
	else
		tmp = Float64(Float64(0.0625 - Float64(-0.125 * Float64(beta / i))) - Float64(0.125 * Float64(beta / i)));
	end
	return tmp
end

Wolfram

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 - 1.0), $MachinePrecision]}, Block[{t$95$3 = N[(i * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$3 * N[(N[(beta * alpha), $MachinePrecision] + t$95$3), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$2), $MachinePrecision], Infinity], N[(N[(N[(t$95$3 / t$95$0), $MachinePrecision] * N[(N[(beta * alpha + t$95$3), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[(0.0625 - N[(-0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) < +inf.0

   1. Initial program 41.1%

      \[\frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]
   2. Add Preprocessing

   4. Applied rewrites 99.7%

      \[\leadsto \frac{\color{blue}{\frac{i \cdot \left(\left(\alpha + \beta\right) + i\right)}{\left(\alpha + \beta\right) + 2 \cdot i} \cdot \frac{\mathsf{fma}\left(\beta, \alpha, i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]

   if +inf.0 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64)))

   1. Initial program 0.0%

      \[\frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]
   2. Add Preprocessing

   3. Taylor expanded in i around inf

      \[\leadsto \color{blue}{\left(\frac{1}{16} + \frac{1}{16} \cdot \frac{2 \cdot \alpha + 2 \cdot \beta}{i}\right) - \frac{1}{8} \cdot \frac{\alpha + \beta}{i}} \]

   5. Applied rewrites 75.4%

      \[\leadsto \color{blue}{\left(0.0625 - -0.0625 \cdot \frac{\mathsf{fma}\left(2, \alpha, 2 \cdot \beta\right)}{i}\right) - 0.125 \cdot \frac{\alpha + \beta}{i}} \]

   6. Taylor expanded in alpha around 0

      \[\leadsto \left(\frac{1}{16} - \frac{-1}{8} \cdot \frac{\beta}{i}\right) - \frac{1}{8} \cdot \frac{\alpha + \beta}{i} \]

   8. Applied rewrites 69.1%

      \[\leadsto \left(0.0625 - -0.125 \cdot \frac{\beta}{i}\right) - 0.125 \cdot \frac{\alpha + \beta}{i} \]

   9. Taylor expanded in alpha around 0

      \[\leadsto \left(\frac{1}{16} - \frac{-1}{8} \cdot \frac{\beta}{i}\right) - \frac{1}{8} \cdot \frac{\beta}{\color{blue}{i}} \]

   11. Applied rewrites 69.9%

       \[\leadsto \left(0.0625 - -0.125 \cdot \frac{\beta}{i}\right) - 0.125 \cdot \frac{\beta}{\color{blue}{i}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 2: 83.6% accurate, 0.5× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} t_0 := \left(\alpha + \beta\right) + 2 \cdot i\\ t_1 := t\_0 \cdot t\_0\\ t_2 := t\_1 - 1\\ t_3 := i \cdot \left(\left(\alpha + \beta\right) + i\right)\\ \mathbf{if}\;\frac{\frac{t\_3 \cdot \left(\beta \cdot \alpha + t\_3\right)}{t\_1}}{t\_2} \leq \infty:\\ \;\;\;\;\frac{\frac{t\_3}{t\_0} \cdot \frac{i \cdot \left(\beta + i\right)}{t\_0}}{t\_2}\\ \mathbf{else}:\\ \;\;\;\;\left(0.0625 - -0.125 \cdot \frac{\beta}{i}\right) - 0.125 \cdot \frac{\beta}{i}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* 2.0 i)))
        (t_1 (* t_0 t_0))
        (t_2 (- t_1 1.0))
        (t_3 (* i (+ (+ alpha beta) i))))
   (if (<= (/ (/ (* t_3 (+ (* beta alpha) t_3)) t_1) t_2) INFINITY)
     (/ (* (/ t_3 t_0) (/ (* i (+ beta i)) t_0)) t_2)
     (- (- 0.0625 (* -0.125 (/ beta i))) (* 0.125 (/ beta i))))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	double t_1 = t_0 * t_0;
	double t_2 = t_1 - 1.0;
	double t_3 = i * ((alpha + beta) + i);
	double tmp;
	if ((((t_3 * ((beta * alpha) + t_3)) / t_1) / t_2) <= ((double) INFINITY)) {
		tmp = ((t_3 / t_0) * ((i * (beta + i)) / t_0)) / t_2;
	} else {
		tmp = (0.0625 - (-0.125 * (beta / i))) - (0.125 * (beta / i));
	}
	return tmp;
}

Java

assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	double t_1 = t_0 * t_0;
	double t_2 = t_1 - 1.0;
	double t_3 = i * ((alpha + beta) + i);
	double tmp;
	if ((((t_3 * ((beta * alpha) + t_3)) / t_1) / t_2) <= Double.POSITIVE_INFINITY) {
		tmp = ((t_3 / t_0) * ((i * (beta + i)) / t_0)) / t_2;
	} else {
		tmp = (0.0625 - (-0.125 * (beta / i))) - (0.125 * (beta / i));
	}
	return tmp;
}

Python

[alpha, beta, i] = sort([alpha, beta, i])
def code(alpha, beta, i):
	t_0 = (alpha + beta) + (2.0 * i)
	t_1 = t_0 * t_0
	t_2 = t_1 - 1.0
	t_3 = i * ((alpha + beta) + i)
	tmp = 0
	if (((t_3 * ((beta * alpha) + t_3)) / t_1) / t_2) <= math.inf:
		tmp = ((t_3 / t_0) * ((i * (beta + i)) / t_0)) / t_2
	else:
		tmp = (0.0625 - (-0.125 * (beta / i))) - (0.125 * (beta / i))
	return tmp

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * i))
	t_1 = Float64(t_0 * t_0)
	t_2 = Float64(t_1 - 1.0)
	t_3 = Float64(i * Float64(Float64(alpha + beta) + i))
	tmp = 0.0
	if (Float64(Float64(Float64(t_3 * Float64(Float64(beta * alpha) + t_3)) / t_1) / t_2) <= Inf)
		tmp = Float64(Float64(Float64(t_3 / t_0) * Float64(Float64(i * Float64(beta + i)) / t_0)) / t_2);
	else
		tmp = Float64(Float64(0.0625 - Float64(-0.125 * Float64(beta / i))) - Float64(0.125 * Float64(beta / i)));
	end
	return tmp
end

MATLAB

alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
	t_0 = (alpha + beta) + (2.0 * i);
	t_1 = t_0 * t_0;
	t_2 = t_1 - 1.0;
	t_3 = i * ((alpha + beta) + i);
	tmp = 0.0;
	if ((((t_3 * ((beta * alpha) + t_3)) / t_1) / t_2) <= Inf)
		tmp = ((t_3 / t_0) * ((i * (beta + i)) / t_0)) / t_2;
	else
		tmp = (0.0625 - (-0.125 * (beta / i))) - (0.125 * (beta / i));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 - 1.0), $MachinePrecision]}, Block[{t$95$3 = N[(i * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$3 * N[(N[(beta * alpha), $MachinePrecision] + t$95$3), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$2), $MachinePrecision], Infinity], N[(N[(N[(t$95$3 / t$95$0), $MachinePrecision] * N[(N[(i * N[(beta + i), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[(0.0625 - N[(-0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) < +inf.0

   1. Initial program 41.1%

      \[\frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]
   2. Add Preprocessing

   3. Taylor expanded in alpha around 0

      \[\leadsto \frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \color{blue}{\left(i \cdot \left(\beta + i\right)\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]

   5. Applied rewrites 38.1%

      \[\leadsto \frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \color{blue}{\left(i \cdot \left(\beta + i\right)\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]

   7. Applied rewrites 90.6%

      \[\leadsto \frac{\color{blue}{\frac{i \cdot \left(\left(\alpha + \beta\right) + i\right)}{\left(\alpha + \beta\right) + 2 \cdot i} \cdot \frac{i \cdot \left(\beta + i\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]

   if +inf.0 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64)))

   1. Initial program 0.0%

      \[\frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]
   2. Add Preprocessing

   3. Taylor expanded in i around inf

      \[\leadsto \color{blue}{\left(\frac{1}{16} + \frac{1}{16} \cdot \frac{2 \cdot \alpha + 2 \cdot \beta}{i}\right) - \frac{1}{8} \cdot \frac{\alpha + \beta}{i}} \]

   5. Applied rewrites 75.4%

      \[\leadsto \color{blue}{\left(0.0625 - -0.0625 \cdot \frac{\mathsf{fma}\left(2, \alpha, 2 \cdot \beta\right)}{i}\right) - 0.125 \cdot \frac{\alpha + \beta}{i}} \]

   6. Taylor expanded in alpha around 0

      \[\leadsto \left(\frac{1}{16} - \frac{-1}{8} \cdot \frac{\beta}{i}\right) - \frac{1}{8} \cdot \frac{\alpha + \beta}{i} \]

   8. Applied rewrites 69.1%

      \[\leadsto \left(0.0625 - -0.125 \cdot \frac{\beta}{i}\right) - 0.125 \cdot \frac{\alpha + \beta}{i} \]

   9. Taylor expanded in alpha around 0

      \[\leadsto \left(\frac{1}{16} - \frac{-1}{8} \cdot \frac{\beta}{i}\right) - \frac{1}{8} \cdot \frac{\beta}{\color{blue}{i}} \]

   11. Applied rewrites 69.9%

       \[\leadsto \left(0.0625 - -0.125 \cdot \frac{\beta}{i}\right) - 0.125 \cdot \frac{\beta}{\color{blue}{i}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 83.6% accurate, 0.5× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} t_0 := \left(\alpha + \beta\right) + 2 \cdot i\\ t_1 := t\_0 \cdot t\_0\\ t_2 := t\_1 - 1\\ t_3 := i \cdot \left(\left(\alpha + \beta\right) + i\right)\\ t_4 := i \cdot \left(\beta + i\right)\\ \mathbf{if}\;\frac{\frac{t\_3 \cdot \left(\beta \cdot \alpha + t\_3\right)}{t\_1}}{t\_2} \leq \infty:\\ \;\;\;\;\frac{\frac{t\_4}{\beta + 2 \cdot i} \cdot \frac{t\_4}{t\_0}}{t\_2}\\ \mathbf{else}:\\ \;\;\;\;\left(0.0625 - -0.125 \cdot \frac{\beta}{i}\right) - 0.125 \cdot \frac{\beta}{i}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* 2.0 i)))
        (t_1 (* t_0 t_0))
        (t_2 (- t_1 1.0))
        (t_3 (* i (+ (+ alpha beta) i)))
        (t_4 (* i (+ beta i))))
   (if (<= (/ (/ (* t_3 (+ (* beta alpha) t_3)) t_1) t_2) INFINITY)
     (/ (* (/ t_4 (+ beta (* 2.0 i))) (/ t_4 t_0)) t_2)
     (- (- 0.0625 (* -0.125 (/ beta i))) (* 0.125 (/ beta i))))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	double t_1 = t_0 * t_0;
	double t_2 = t_1 - 1.0;
	double t_3 = i * ((alpha + beta) + i);
	double t_4 = i * (beta + i);
	double tmp;
	if ((((t_3 * ((beta * alpha) + t_3)) / t_1) / t_2) <= ((double) INFINITY)) {
		tmp = ((t_4 / (beta + (2.0 * i))) * (t_4 / t_0)) / t_2;
	} else {
		tmp = (0.0625 - (-0.125 * (beta / i))) - (0.125 * (beta / i));
	}
	return tmp;
}

Java

assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	double t_1 = t_0 * t_0;
	double t_2 = t_1 - 1.0;
	double t_3 = i * ((alpha + beta) + i);
	double t_4 = i * (beta + i);
	double tmp;
	if ((((t_3 * ((beta * alpha) + t_3)) / t_1) / t_2) <= Double.POSITIVE_INFINITY) {
		tmp = ((t_4 / (beta + (2.0 * i))) * (t_4 / t_0)) / t_2;
	} else {
		tmp = (0.0625 - (-0.125 * (beta / i))) - (0.125 * (beta / i));
	}
	return tmp;
}

Python

[alpha, beta, i] = sort([alpha, beta, i])
def code(alpha, beta, i):
	t_0 = (alpha + beta) + (2.0 * i)
	t_1 = t_0 * t_0
	t_2 = t_1 - 1.0
	t_3 = i * ((alpha + beta) + i)
	t_4 = i * (beta + i)
	tmp = 0
	if (((t_3 * ((beta * alpha) + t_3)) / t_1) / t_2) <= math.inf:
		tmp = ((t_4 / (beta + (2.0 * i))) * (t_4 / t_0)) / t_2
	else:
		tmp = (0.0625 - (-0.125 * (beta / i))) - (0.125 * (beta / i))
	return tmp

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * i))
	t_1 = Float64(t_0 * t_0)
	t_2 = Float64(t_1 - 1.0)
	t_3 = Float64(i * Float64(Float64(alpha + beta) + i))
	t_4 = Float64(i * Float64(beta + i))
	tmp = 0.0
	if (Float64(Float64(Float64(t_3 * Float64(Float64(beta * alpha) + t_3)) / t_1) / t_2) <= Inf)
		tmp = Float64(Float64(Float64(t_4 / Float64(beta + Float64(2.0 * i))) * Float64(t_4 / t_0)) / t_2);
	else
		tmp = Float64(Float64(0.0625 - Float64(-0.125 * Float64(beta / i))) - Float64(0.125 * Float64(beta / i)));
	end
	return tmp
end

MATLAB

alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
	t_0 = (alpha + beta) + (2.0 * i);
	t_1 = t_0 * t_0;
	t_2 = t_1 - 1.0;
	t_3 = i * ((alpha + beta) + i);
	t_4 = i * (beta + i);
	tmp = 0.0;
	if ((((t_3 * ((beta * alpha) + t_3)) / t_1) / t_2) <= Inf)
		tmp = ((t_4 / (beta + (2.0 * i))) * (t_4 / t_0)) / t_2;
	else
		tmp = (0.0625 - (-0.125 * (beta / i))) - (0.125 * (beta / i));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 - 1.0), $MachinePrecision]}, Block[{t$95$3 = N[(i * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(i * N[(beta + i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$3 * N[(N[(beta * alpha), $MachinePrecision] + t$95$3), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$2), $MachinePrecision], Infinity], N[(N[(N[(t$95$4 / N[(beta + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(t$95$4 / t$95$0), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[(0.0625 - N[(-0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) < +inf.0

   1. Initial program 41.1%

      \[\frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]
   2. Add Preprocessing

   3. Taylor expanded in alpha around 0

      \[\leadsto \frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \color{blue}{\left(i \cdot \left(\beta + i\right)\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]

   5. Applied rewrites 38.1%

      \[\leadsto \frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \color{blue}{\left(i \cdot \left(\beta + i\right)\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]

   7. Applied rewrites 90.6%

      \[\leadsto \frac{\color{blue}{\frac{i \cdot \left(\left(\alpha + \beta\right) + i\right)}{\left(\alpha + \beta\right) + 2 \cdot i} \cdot \frac{i \cdot \left(\beta + i\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]

   8. Taylor expanded in alpha around 0

      \[\leadsto \frac{\color{blue}{\frac{i \cdot \left(\beta + i\right)}{\beta + 2 \cdot i}} \cdot \frac{i \cdot \left(\beta + i\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]

   10. Applied rewrites 90.5%

       \[\leadsto \frac{\color{blue}{\frac{i \cdot \left(\beta + i\right)}{\beta + 2 \cdot i}} \cdot \frac{i \cdot \left(\beta + i\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]

   if +inf.0 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64)))

   1. Initial program 0.0%

      \[\frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]
   2. Add Preprocessing

   3. Taylor expanded in i around inf

      \[\leadsto \color{blue}{\left(\frac{1}{16} + \frac{1}{16} \cdot \frac{2 \cdot \alpha + 2 \cdot \beta}{i}\right) - \frac{1}{8} \cdot \frac{\alpha + \beta}{i}} \]

   5. Applied rewrites 75.4%

      \[\leadsto \color{blue}{\left(0.0625 - -0.0625 \cdot \frac{\mathsf{fma}\left(2, \alpha, 2 \cdot \beta\right)}{i}\right) - 0.125 \cdot \frac{\alpha + \beta}{i}} \]

   6. Taylor expanded in alpha around 0

      \[\leadsto \left(\frac{1}{16} - \frac{-1}{8} \cdot \frac{\beta}{i}\right) - \frac{1}{8} \cdot \frac{\alpha + \beta}{i} \]

   8. Applied rewrites 69.1%

      \[\leadsto \left(0.0625 - -0.125 \cdot \frac{\beta}{i}\right) - 0.125 \cdot \frac{\alpha + \beta}{i} \]

   9. Taylor expanded in alpha around 0

      \[\leadsto \left(\frac{1}{16} - \frac{-1}{8} \cdot \frac{\beta}{i}\right) - \frac{1}{8} \cdot \frac{\beta}{\color{blue}{i}} \]

   11. Applied rewrites 69.9%

       \[\leadsto \left(0.0625 - -0.125 \cdot \frac{\beta}{i}\right) - 0.125 \cdot \frac{\beta}{\color{blue}{i}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 80.7% accurate, 0.5× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} t_0 := \left(\alpha + \beta\right) + 2 \cdot i\\ t_1 := t\_0 \cdot t\_0\\ t_2 := i \cdot \left(\left(\alpha + \beta\right) + i\right)\\ \mathbf{if}\;\frac{\frac{t\_2 \cdot \left(\beta \cdot \alpha + t\_2\right)}{t\_1}}{t\_1 - 1} \leq 0.1:\\ \;\;\;\;\frac{\frac{t\_2 \cdot \left(i \cdot \left(\beta + i\right)\right)}{t\_1}}{t\_0 \cdot \left(\beta + 2 \cdot i\right) - 1}\\ \mathbf{else}:\\ \;\;\;\;\left(0.0625 - -0.125 \cdot \frac{\beta}{i}\right) - 0.125 \cdot \frac{\beta}{i}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* 2.0 i)))
        (t_1 (* t_0 t_0))
        (t_2 (* i (+ (+ alpha beta) i))))
   (if (<= (/ (/ (* t_2 (+ (* beta alpha) t_2)) t_1) (- t_1 1.0)) 0.1)
     (/ (/ (* t_2 (* i (+ beta i))) t_1) (- (* t_0 (+ beta (* 2.0 i))) 1.0))
     (- (- 0.0625 (* -0.125 (/ beta i))) (* 0.125 (/ beta i))))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	double t_1 = t_0 * t_0;
	double t_2 = i * ((alpha + beta) + i);
	double tmp;
	if ((((t_2 * ((beta * alpha) + t_2)) / t_1) / (t_1 - 1.0)) <= 0.1) {
		tmp = ((t_2 * (i * (beta + i))) / t_1) / ((t_0 * (beta + (2.0 * i))) - 1.0);
	} else {
		tmp = (0.0625 - (-0.125 * (beta / i))) - (0.125 * (beta / i));
	}
	return tmp;
}

Fortran

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(alpha, beta, i)
use fmin_fmax_functions
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_0 = (alpha + beta) + (2.0d0 * i)
    t_1 = t_0 * t_0
    t_2 = i * ((alpha + beta) + i)
    if ((((t_2 * ((beta * alpha) + t_2)) / t_1) / (t_1 - 1.0d0)) <= 0.1d0) then
        tmp = ((t_2 * (i * (beta + i))) / t_1) / ((t_0 * (beta + (2.0d0 * i))) - 1.0d0)
    else
        tmp = (0.0625d0 - ((-0.125d0) * (beta / i))) - (0.125d0 * (beta / i))
    end if
    code = tmp
end function

Java

assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	double t_1 = t_0 * t_0;
	double t_2 = i * ((alpha + beta) + i);
	double tmp;
	if ((((t_2 * ((beta * alpha) + t_2)) / t_1) / (t_1 - 1.0)) <= 0.1) {
		tmp = ((t_2 * (i * (beta + i))) / t_1) / ((t_0 * (beta + (2.0 * i))) - 1.0);
	} else {
		tmp = (0.0625 - (-0.125 * (beta / i))) - (0.125 * (beta / i));
	}
	return tmp;
}

Python

[alpha, beta, i] = sort([alpha, beta, i])
def code(alpha, beta, i):
	t_0 = (alpha + beta) + (2.0 * i)
	t_1 = t_0 * t_0
	t_2 = i * ((alpha + beta) + i)
	tmp = 0
	if (((t_2 * ((beta * alpha) + t_2)) / t_1) / (t_1 - 1.0)) <= 0.1:
		tmp = ((t_2 * (i * (beta + i))) / t_1) / ((t_0 * (beta + (2.0 * i))) - 1.0)
	else:
		tmp = (0.0625 - (-0.125 * (beta / i))) - (0.125 * (beta / i))
	return tmp

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * i))
	t_1 = Float64(t_0 * t_0)
	t_2 = Float64(i * Float64(Float64(alpha + beta) + i))
	tmp = 0.0
	if (Float64(Float64(Float64(t_2 * Float64(Float64(beta * alpha) + t_2)) / t_1) / Float64(t_1 - 1.0)) <= 0.1)
		tmp = Float64(Float64(Float64(t_2 * Float64(i * Float64(beta + i))) / t_1) / Float64(Float64(t_0 * Float64(beta + Float64(2.0 * i))) - 1.0));
	else
		tmp = Float64(Float64(0.0625 - Float64(-0.125 * Float64(beta / i))) - Float64(0.125 * Float64(beta / i)));
	end
	return tmp
end

MATLAB

alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
	t_0 = (alpha + beta) + (2.0 * i);
	t_1 = t_0 * t_0;
	t_2 = i * ((alpha + beta) + i);
	tmp = 0.0;
	if ((((t_2 * ((beta * alpha) + t_2)) / t_1) / (t_1 - 1.0)) <= 0.1)
		tmp = ((t_2 * (i * (beta + i))) / t_1) / ((t_0 * (beta + (2.0 * i))) - 1.0);
	else
		tmp = (0.0625 - (-0.125 * (beta / i))) - (0.125 * (beta / i));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(i * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$2 * N[(N[(beta * alpha), $MachinePrecision] + t$95$2), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 - 1.0), $MachinePrecision]), $MachinePrecision], 0.1], N[(N[(N[(t$95$2 * N[(i * N[(beta + i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(N[(t$95$0 * N[(beta + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision], N[(N[(0.0625 - N[(-0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) < 0.10000000000000001

   1. Initial program 99.7%

      \[\frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]
   2. Add Preprocessing

   3. Taylor expanded in alpha around 0

      \[\leadsto \frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \color{blue}{\left(i \cdot \left(\beta + i\right)\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]

   5. Applied rewrites 91.9%

      \[\leadsto \frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \color{blue}{\left(i \cdot \left(\beta + i\right)\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]

   6. Taylor expanded in alpha around 0

      \[\leadsto \frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(i \cdot \left(\beta + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\color{blue}{\beta} + 2 \cdot i\right) - 1} \]

   8. Applied rewrites 92.4%

      \[\leadsto \frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(i \cdot \left(\beta + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\color{blue}{\beta} + 2 \cdot i\right) - 1} \]

   if 0.10000000000000001 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64)))

   1. Initial program 0.8%

      \[\frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]
   2. Add Preprocessing

   3. Taylor expanded in i around inf

      \[\leadsto \color{blue}{\left(\frac{1}{16} + \frac{1}{16} \cdot \frac{2 \cdot \alpha + 2 \cdot \beta}{i}\right) - \frac{1}{8} \cdot \frac{\alpha + \beta}{i}} \]

   5. Applied rewrites 77.3%

      \[\leadsto \color{blue}{\left(0.0625 - -0.0625 \cdot \frac{\mathsf{fma}\left(2, \alpha, 2 \cdot \beta\right)}{i}\right) - 0.125 \cdot \frac{\alpha + \beta}{i}} \]

   6. Taylor expanded in alpha around 0

      \[\leadsto \left(\frac{1}{16} - \frac{-1}{8} \cdot \frac{\beta}{i}\right) - \frac{1}{8} \cdot \frac{\alpha + \beta}{i} \]

   8. Applied rewrites 72.3%

      \[\leadsto \left(0.0625 - -0.125 \cdot \frac{\beta}{i}\right) - 0.125 \cdot \frac{\alpha + \beta}{i} \]

   9. Taylor expanded in alpha around 0

      \[\leadsto \left(\frac{1}{16} - \frac{-1}{8} \cdot \frac{\beta}{i}\right) - \frac{1}{8} \cdot \frac{\beta}{\color{blue}{i}} \]

   11. Applied rewrites 73.2%

       \[\leadsto \left(0.0625 - -0.125 \cdot \frac{\beta}{i}\right) - 0.125 \cdot \frac{\beta}{\color{blue}{i}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 74.3% accurate, 2.7× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} t_0 := 0.125 \cdot \frac{\beta}{i}\\ \mathbf{if}\;\beta \leq 1.46 \cdot 10^{+240}:\\ \;\;\;\;0.0625\\ \mathbf{else}:\\ \;\;\;\;t\_0 - t\_0\\ \end{array} \end{array} \]

FPCore

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (* 0.125 (/ beta i))))
   (if (<= beta 1.46e+240) 0.0625 (- t_0 t_0))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double t_0 = 0.125 * (beta / i);
	double tmp;
	if (beta <= 1.46e+240) {
		tmp = 0.0625;
	} else {
		tmp = t_0 - t_0;
	}
	return tmp;
}

Fortran

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(alpha, beta, i)
use fmin_fmax_functions
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: t_0
    real(8) :: tmp
    t_0 = 0.125d0 * (beta / i)
    if (beta <= 1.46d+240) then
        tmp = 0.0625d0
    else
        tmp = t_0 - t_0
    end if
    code = tmp
end function

Java

assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
	double t_0 = 0.125 * (beta / i);
	double tmp;
	if (beta <= 1.46e+240) {
		tmp = 0.0625;
	} else {
		tmp = t_0 - t_0;
	}
	return tmp;
}

Python

[alpha, beta, i] = sort([alpha, beta, i])
def code(alpha, beta, i):
	t_0 = 0.125 * (beta / i)
	tmp = 0
	if beta <= 1.46e+240:
		tmp = 0.0625
	else:
		tmp = t_0 - t_0
	return tmp

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	t_0 = Float64(0.125 * Float64(beta / i))
	tmp = 0.0
	if (beta <= 1.46e+240)
		tmp = 0.0625;
	else
		tmp = Float64(t_0 - t_0);
	end
	return tmp
end

MATLAB

alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
	t_0 = 0.125 * (beta / i);
	tmp = 0.0;
	if (beta <= 1.46e+240)
		tmp = 0.0625;
	else
		tmp = t_0 - t_0;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.46e+240], 0.0625, N[(t$95$0 - t$95$0), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if beta < 1.4600000000000001e240

   1. Initial program 16.4%

      \[\frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]
   2. Add Preprocessing

   3. Taylor expanded in i around inf

      \[\leadsto \color{blue}{\frac{1}{16}} \]

   5. Applied rewrites 77.8%

      \[\leadsto \color{blue}{0.0625} \]

   if 1.4600000000000001e240 < beta

   1. Initial program 0.0%

      \[\frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]
   2. Add Preprocessing

   3. Taylor expanded in i around inf

      \[\leadsto \color{blue}{\left(\frac{1}{16} + \frac{1}{16} \cdot \frac{2 \cdot \alpha + 2 \cdot \beta}{i}\right) - \frac{1}{8} \cdot \frac{\alpha + \beta}{i}} \]

   5. Applied rewrites 37.0%

      \[\leadsto \color{blue}{\left(0.0625 - -0.0625 \cdot \frac{\mathsf{fma}\left(2, \alpha, 2 \cdot \beta\right)}{i}\right) - 0.125 \cdot \frac{\alpha + \beta}{i}} \]

   6. Taylor expanded in alpha around 0

      \[\leadsto \left(\frac{1}{16} - \frac{-1}{8} \cdot \frac{\beta}{i}\right) - \frac{1}{8} \cdot \frac{\alpha + \beta}{i} \]

   8. Applied rewrites 34.0%

      \[\leadsto \left(0.0625 - -0.125 \cdot \frac{\beta}{i}\right) - 0.125 \cdot \frac{\alpha + \beta}{i} \]

   9. Taylor expanded in alpha around 0

      \[\leadsto \left(\frac{1}{16} - \frac{-1}{8} \cdot \frac{\beta}{i}\right) - \frac{1}{8} \cdot \frac{\beta}{\color{blue}{i}} \]

   11. Applied rewrites 37.0%

       \[\leadsto \left(0.0625 - -0.125 \cdot \frac{\beta}{i}\right) - 0.125 \cdot \frac{\beta}{\color{blue}{i}} \]

   12. Taylor expanded in beta around inf

       \[\leadsto \frac{1}{8} \cdot \frac{\beta}{i} - \color{blue}{\frac{1}{8}} \cdot \frac{\beta}{i} \]

   14. Applied rewrites 26.5%

       \[\leadsto 0.125 \cdot \frac{\beta}{i} - \color{blue}{0.125} \cdot \frac{\beta}{i} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 6: 78.0% accurate, 2.9× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \left(0.0625 - -0.125 \cdot \frac{\beta}{i}\right) - 0.125 \cdot \frac{\beta}{i} \end{array} \]

FPCore

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
 :precision binary64
 (- (- 0.0625 (* -0.125 (/ beta i))) (* 0.125 (/ beta i))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	return (0.0625 - (-0.125 * (beta / i))) - (0.125 * (beta / i));
}

Fortran

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(alpha, beta, i)
use fmin_fmax_functions
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    code = (0.0625d0 - ((-0.125d0) * (beta / i))) - (0.125d0 * (beta / i))
end function

Java

assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
	return (0.0625 - (-0.125 * (beta / i))) - (0.125 * (beta / i));
}

Python

[alpha, beta, i] = sort([alpha, beta, i])
def code(alpha, beta, i):
	return (0.0625 - (-0.125 * (beta / i))) - (0.125 * (beta / i))

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	return Float64(Float64(0.0625 - Float64(-0.125 * Float64(beta / i))) - Float64(0.125 * Float64(beta / i)))
end

MATLAB

alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
	tmp = (0.0625 - (-0.125 * (beta / i))) - (0.125 * (beta / i));
end

Wolfram

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := N[(N[(0.0625 - N[(-0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 15.1%

   \[\frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]
2. Add Preprocessing

3. Taylor expanded in i around inf

   \[\leadsto \color{blue}{\left(\frac{1}{16} + \frac{1}{16} \cdot \frac{2 \cdot \alpha + 2 \cdot \beta}{i}\right) - \frac{1}{8} \cdot \frac{\alpha + \beta}{i}} \]

5. Applied rewrites 78.5%

   \[\leadsto \color{blue}{\left(0.0625 - -0.0625 \cdot \frac{\mathsf{fma}\left(2, \alpha, 2 \cdot \beta\right)}{i}\right) - 0.125 \cdot \frac{\alpha + \beta}{i}} \]

6. Taylor expanded in alpha around 0

   \[\leadsto \left(\frac{1}{16} - \frac{-1}{8} \cdot \frac{\beta}{i}\right) - \frac{1}{8} \cdot \frac{\alpha + \beta}{i} \]

8. Applied rewrites 74.0%

   \[\leadsto \left(0.0625 - -0.125 \cdot \frac{\beta}{i}\right) - 0.125 \cdot \frac{\alpha + \beta}{i} \]

9. Taylor expanded in alpha around 0

   \[\leadsto \left(\frac{1}{16} - \frac{-1}{8} \cdot \frac{\beta}{i}\right) - \frac{1}{8} \cdot \frac{\beta}{\color{blue}{i}} \]

11. Applied rewrites 75.0%

    \[\leadsto \left(0.0625 - -0.125 \cdot \frac{\beta}{i}\right) - 0.125 \cdot \frac{\beta}{\color{blue}{i}} \]
12. Add Preprocessing

Alternative 7: 74.0% accurate, 3.7× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 1.46 \cdot 10^{+240}:\\ \;\;\;\;0.0625\\ \mathbf{else}:\\ \;\;\;\;\frac{i \cdot \left(\alpha + i\right)}{\beta \cdot \beta}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
 :precision binary64
 (if (<= beta 1.46e+240) 0.0625 (/ (* i (+ alpha i)) (* beta beta))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 1.46e+240) {
		tmp = 0.0625;
	} else {
		tmp = (i * (alpha + i)) / (beta * beta);
	}
	return tmp;
}

Fortran

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(alpha, beta, i)
use fmin_fmax_functions
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: tmp
    if (beta <= 1.46d+240) then
        tmp = 0.0625d0
    else
        tmp = (i * (alpha + i)) / (beta * beta)
    end if
    code = tmp
end function

Java

assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 1.46e+240) {
		tmp = 0.0625;
	} else {
		tmp = (i * (alpha + i)) / (beta * beta);
	}
	return tmp;
}

Python

[alpha, beta, i] = sort([alpha, beta, i])
def code(alpha, beta, i):
	tmp = 0
	if beta <= 1.46e+240:
		tmp = 0.0625
	else:
		tmp = (i * (alpha + i)) / (beta * beta)
	return tmp

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	tmp = 0.0
	if (beta <= 1.46e+240)
		tmp = 0.0625;
	else
		tmp = Float64(Float64(i * Float64(alpha + i)) / Float64(beta * beta));
	end
	return tmp
end

MATLAB

alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
	tmp = 0.0;
	if (beta <= 1.46e+240)
		tmp = 0.0625;
	else
		tmp = (i * (alpha + i)) / (beta * beta);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := If[LessEqual[beta, 1.46e+240], 0.0625, N[(N[(i * N[(alpha + i), $MachinePrecision]), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if beta < 1.4600000000000001e240

   1. Initial program 16.4%

      \[\frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]
   2. Add Preprocessing

   3. Taylor expanded in i around inf

      \[\leadsto \color{blue}{\frac{1}{16}} \]

   5. Applied rewrites 77.8%

      \[\leadsto \color{blue}{0.0625} \]

   if 1.4600000000000001e240 < beta

   1. Initial program 0.0%

      \[\frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]
   2. Add Preprocessing

   3. Taylor expanded in beta around inf

      \[\leadsto \color{blue}{\frac{i \cdot \left(\alpha + i\right)}{{\beta}^{2}}} \]

   5. Applied rewrites 20.4%

      \[\leadsto \color{blue}{\frac{i \cdot \left(\alpha + i\right)}{\beta \cdot \beta}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 8: 71.3% accurate, 115.0× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ 0.0625 \end{array} \]

FPCore

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i) :precision binary64 0.0625)

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	return 0.0625;
}

Fortran

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(alpha, beta, i)
use fmin_fmax_functions
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    code = 0.0625d0
end function

Java

assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
	return 0.0625;
}

Python

[alpha, beta, i] = sort([alpha, beta, i])
def code(alpha, beta, i):
	return 0.0625

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	return 0.0625
end

MATLAB

alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
	tmp = 0.0625;
end

Wolfram

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := 0.0625

Derivation

1. Initial program 15.1%

   \[\frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]
2. Add Preprocessing

3. Taylor expanded in i around inf

   \[\leadsto \color{blue}{\frac{1}{16}} \]

5. Applied rewrites 72.9%

   \[\leadsto \color{blue}{0.0625} \]
6. Add Preprocessing

Reproduce

herbie shell --seed 2025036 -o generate:simplify -o generate:proofs
(FPCore (alpha beta i)
  :name "Octave 3.8, jcobi/4"
  :precision binary64
  :pre (and (and (> alpha -1.0) (> beta -1.0)) (> i 1.0))
  (/ (/ (* (* i (+ (+ alpha beta) i)) (+ (* beta alpha) (* i (+ (+ alpha beta) i)))) (* (+ (+ alpha beta) (* 2.0 i)) (+ (+ alpha beta) (* 2.0 i)))) (- (* (+ (+ alpha beta) (* 2.0 i)) (+ (+ alpha beta) (* 2.0 i))) 1.0)))