Octave 3.8, jcobi/2

Percentage Accurate: 63.3% → 97.9%

Time: 20.3s

Alternatives: 11

Speedup: 4.8×

Specification

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

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 63.3% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 97.9% accurate, 0.1× speedup

Math

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

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* 2.0 i))) (t_1 (+ alpha (fma 2.0 i beta))))
   (if (<= (/ (/ (* (+ alpha beta) (- beta alpha)) t_0) (+ 2.0 t_0)) -0.999995)
     (/ (/ (+ (- beta beta) (+ 2.0 (+ (* i 4.0) (* beta 2.0)))) alpha) 2.0)
     (/
      (fma (* (+ alpha beta) (/ (- beta alpha) t_1)) (/ 1.0 (+ 2.0 t_1)) 1.0)
      2.0))))

C

double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	double t_1 = alpha + fma(2.0, i, beta);
	double tmp;
	if (((((alpha + beta) * (beta - alpha)) / t_0) / (2.0 + t_0)) <= -0.999995) {
		tmp = (((beta - beta) + (2.0 + ((i * 4.0) + (beta * 2.0)))) / alpha) / 2.0;
	} else {
		tmp = fma(((alpha + beta) * ((beta - alpha) / t_1)), (1.0 / (2.0 + t_1)), 1.0) / 2.0;
	}
	return tmp;
}

Julia

function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * i))
	t_1 = Float64(alpha + fma(2.0, i, beta))
	tmp = 0.0
	if (Float64(Float64(Float64(Float64(alpha + beta) * Float64(beta - alpha)) / t_0) / Float64(2.0 + t_0)) <= -0.999995)
		tmp = Float64(Float64(Float64(Float64(beta - beta) + Float64(2.0 + Float64(Float64(i * 4.0) + Float64(beta * 2.0)))) / alpha) / 2.0);
	else
		tmp = Float64(fma(Float64(Float64(alpha + beta) * Float64(Float64(beta - alpha) / t_1)), Float64(1.0 / Float64(2.0 + t_1)), 1.0) / 2.0);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) 2)) < -0.99999499999999997

   1. Initial program 1.7%

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

   3. Taylor expanded in alpha around inf 94.0%

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

   if -0.99999499999999997 < (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) 2))

   1. Initial program 83.1%

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

      1. div-inv 83.1%

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

      2. associate-+r+ 83.1%

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

      3. fma-def 83.1%

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

   4. Applied egg-rr 99.8%

      \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(\left(\alpha + \beta\right) \cdot \frac{\beta - \alpha}{\alpha + \mathsf{fma}\left(2, i, \beta\right)}, \frac{1}{2 + \left(\alpha + \mathsf{fma}\left(2, i, \beta\right)\right)}, 1\right)}}{2} \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{2 + \left(\left(\alpha + \beta\right) + 2 \cdot i\right)} \leq -0.999995:\\ \;\;\;\;\frac{\frac{\left(\beta - \beta\right) + \left(2 + \left(i \cdot 4 + \beta \cdot 2\right)\right)}{\alpha}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(\left(\alpha + \beta\right) \cdot \frac{\beta - \alpha}{\alpha + \mathsf{fma}\left(2, i, \beta\right)}, \frac{1}{2 + \left(\alpha + \mathsf{fma}\left(2, i, \beta\right)\right)}, 1\right)}{2}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 97.9% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\alpha + \beta\right) + 2 \cdot i\\ \mathbf{if}\;\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{t\_0}}{2 + t\_0} \leq -0.999995:\\ \;\;\;\;\frac{\frac{\left(\beta - \beta\right) + \left(2 + \left(i \cdot 4 + \beta \cdot 2\right)\right)}{\alpha}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{\alpha + \beta}{\alpha + \left(\beta + \mathsf{fma}\left(2, i, 2\right)\right)}, \frac{\beta - \alpha}{\alpha + \mathsf{fma}\left(2, i, \beta\right)}, 1\right)}{2}\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* 2.0 i))))
   (if (<= (/ (/ (* (+ alpha beta) (- beta alpha)) t_0) (+ 2.0 t_0)) -0.999995)
     (/ (/ (+ (- beta beta) (+ 2.0 (+ (* i 4.0) (* beta 2.0)))) alpha) 2.0)
     (/
      (fma
       (/ (+ alpha beta) (+ alpha (+ beta (fma 2.0 i 2.0))))
       (/ (- beta alpha) (+ alpha (fma 2.0 i beta)))
       1.0)
      2.0))))

C

double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	double tmp;
	if (((((alpha + beta) * (beta - alpha)) / t_0) / (2.0 + t_0)) <= -0.999995) {
		tmp = (((beta - beta) + (2.0 + ((i * 4.0) + (beta * 2.0)))) / alpha) / 2.0;
	} else {
		tmp = fma(((alpha + beta) / (alpha + (beta + fma(2.0, i, 2.0)))), ((beta - alpha) / (alpha + fma(2.0, i, beta))), 1.0) / 2.0;
	}
	return tmp;
}

Julia

function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * i))
	tmp = 0.0
	if (Float64(Float64(Float64(Float64(alpha + beta) * Float64(beta - alpha)) / t_0) / Float64(2.0 + t_0)) <= -0.999995)
		tmp = Float64(Float64(Float64(Float64(beta - beta) + Float64(2.0 + Float64(Float64(i * 4.0) + Float64(beta * 2.0)))) / alpha) / 2.0);
	else
		tmp = Float64(fma(Float64(Float64(alpha + beta) / Float64(alpha + Float64(beta + fma(2.0, i, 2.0)))), Float64(Float64(beta - alpha) / Float64(alpha + fma(2.0, i, beta))), 1.0) / 2.0);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) 2)) < -0.99999499999999997

   1. Initial program 1.7%

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

   3. Taylor expanded in alpha around inf 94.0%

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

   if -0.99999499999999997 < (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) 2))

   1. Initial program 83.1%

      \[\frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} + 1}{2} \]
   2. Step-by-step derivation

   3. Simplified 99.8%

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

4. Final simplification 98.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{2 + \left(\left(\alpha + \beta\right) + 2 \cdot i\right)} \leq -0.999995:\\ \;\;\;\;\frac{\frac{\left(\beta - \beta\right) + \left(2 + \left(i \cdot 4 + \beta \cdot 2\right)\right)}{\alpha}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{\alpha + \beta}{\alpha + \left(\beta + \mathsf{fma}\left(2, i, 2\right)\right)}, \frac{\beta - \alpha}{\alpha + \mathsf{fma}\left(2, i, \beta\right)}, 1\right)}{2}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 95.4% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\alpha + \beta\right) + 2 \cdot i\\ t_1 := \frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{t\_0}}{2 + t\_0}\\ \mathbf{if}\;t\_1 \leq -0.999995:\\ \;\;\;\;\frac{\frac{\left(\beta - \beta\right) + \left(2 + \left(i \cdot 4 + \beta \cdot 2\right)\right)}{\alpha}}{2}\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{-15}:\\ \;\;\;\;\frac{t\_1 + 1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{1 + \frac{\beta}{\beta + 2}}{2}\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* 2.0 i)))
        (t_1 (/ (/ (* (+ alpha beta) (- beta alpha)) t_0) (+ 2.0 t_0))))
   (if (<= t_1 -0.999995)
     (/ (/ (+ (- beta beta) (+ 2.0 (+ (* i 4.0) (* beta 2.0)))) alpha) 2.0)
     (if (<= t_1 5e-15)
       (/ (+ t_1 1.0) 2.0)
       (/ (+ 1.0 (/ beta (+ beta 2.0))) 2.0)))))

C

double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	double t_1 = (((alpha + beta) * (beta - alpha)) / t_0) / (2.0 + t_0);
	double tmp;
	if (t_1 <= -0.999995) {
		tmp = (((beta - beta) + (2.0 + ((i * 4.0) + (beta * 2.0)))) / alpha) / 2.0;
	} else if (t_1 <= 5e-15) {
		tmp = (t_1 + 1.0) / 2.0;
	} else {
		tmp = (1.0 + (beta / (beta + 2.0))) / 2.0;
	}
	return tmp;
}

Fortran

real(8) function code(alpha, beta, i)
    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) :: tmp
    t_0 = (alpha + beta) + (2.0d0 * i)
    t_1 = (((alpha + beta) * (beta - alpha)) / t_0) / (2.0d0 + t_0)
    if (t_1 <= (-0.999995d0)) then
        tmp = (((beta - beta) + (2.0d0 + ((i * 4.0d0) + (beta * 2.0d0)))) / alpha) / 2.0d0
    else if (t_1 <= 5d-15) then
        tmp = (t_1 + 1.0d0) / 2.0d0
    else
        tmp = (1.0d0 + (beta / (beta + 2.0d0))) / 2.0d0
    end if
    code = tmp
end function

Java

public static double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	double t_1 = (((alpha + beta) * (beta - alpha)) / t_0) / (2.0 + t_0);
	double tmp;
	if (t_1 <= -0.999995) {
		tmp = (((beta - beta) + (2.0 + ((i * 4.0) + (beta * 2.0)))) / alpha) / 2.0;
	} else if (t_1 <= 5e-15) {
		tmp = (t_1 + 1.0) / 2.0;
	} else {
		tmp = (1.0 + (beta / (beta + 2.0))) / 2.0;
	}
	return tmp;
}

Python

def code(alpha, beta, i):
	t_0 = (alpha + beta) + (2.0 * i)
	t_1 = (((alpha + beta) * (beta - alpha)) / t_0) / (2.0 + t_0)
	tmp = 0
	if t_1 <= -0.999995:
		tmp = (((beta - beta) + (2.0 + ((i * 4.0) + (beta * 2.0)))) / alpha) / 2.0
	elif t_1 <= 5e-15:
		tmp = (t_1 + 1.0) / 2.0
	else:
		tmp = (1.0 + (beta / (beta + 2.0))) / 2.0
	return tmp

Julia

function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * i))
	t_1 = Float64(Float64(Float64(Float64(alpha + beta) * Float64(beta - alpha)) / t_0) / Float64(2.0 + t_0))
	tmp = 0.0
	if (t_1 <= -0.999995)
		tmp = Float64(Float64(Float64(Float64(beta - beta) + Float64(2.0 + Float64(Float64(i * 4.0) + Float64(beta * 2.0)))) / alpha) / 2.0);
	elseif (t_1 <= 5e-15)
		tmp = Float64(Float64(t_1 + 1.0) / 2.0);
	else
		tmp = Float64(Float64(1.0 + Float64(beta / Float64(beta + 2.0))) / 2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(alpha, beta, i)
	t_0 = (alpha + beta) + (2.0 * i);
	t_1 = (((alpha + beta) * (beta - alpha)) / t_0) / (2.0 + t_0);
	tmp = 0.0;
	if (t_1 <= -0.999995)
		tmp = (((beta - beta) + (2.0 + ((i * 4.0) + (beta * 2.0)))) / alpha) / 2.0;
	elseif (t_1 <= 5e-15)
		tmp = (t_1 + 1.0) / 2.0;
	else
		tmp = (1.0 + (beta / (beta + 2.0))) / 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(N[(alpha + beta), $MachinePrecision] * N[(beta - alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(2.0 + t$95$0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -0.999995], N[(N[(N[(N[(beta - beta), $MachinePrecision] + N[(2.0 + N[(N[(i * 4.0), $MachinePrecision] + N[(beta * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / alpha), $MachinePrecision] / 2.0), $MachinePrecision], If[LessEqual[t$95$1, 5e-15], N[(N[(t$95$1 + 1.0), $MachinePrecision] / 2.0), $MachinePrecision], N[(N[(1.0 + N[(beta / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) 2)) < -0.99999499999999997

   1. Initial program 1.7%

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

   3. Taylor expanded in alpha around inf 94.0%

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

   if -0.99999499999999997 < (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) 2)) < 4.99999999999999999e-15

   1. Initial program 99.7%

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

   if 4.99999999999999999e-15 < (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) 2))

   1. Initial program 37.3%

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

   3. Taylor expanded in i around 0 98.4%

      \[\leadsto \frac{\color{blue}{\frac{\beta - \alpha}{2 + \left(\alpha + \beta\right)}} + 1}{2} \]
   4. Step-by-step derivation

      1. +-commutative 98.4%

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

   5. Simplified 98.4%

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

   6. Taylor expanded in alpha around 0 98.4%

      \[\leadsto \frac{\color{blue}{\frac{\beta}{2 + \beta}} + 1}{2} \]
   7. Step-by-step derivation

      1. +-commutative 98.4%

         \[\leadsto \frac{\frac{\beta}{\color{blue}{\beta + 2}} + 1}{2} \]

   8. Simplified 98.4%

      \[\leadsto \frac{\color{blue}{\frac{\beta}{\beta + 2}} + 1}{2} \]
3. Recombined 3 regimes into one program.

4. Final simplification 98.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{2 + \left(\left(\alpha + \beta\right) + 2 \cdot i\right)} \leq -0.999995:\\ \;\;\;\;\frac{\frac{\left(\beta - \beta\right) + \left(2 + \left(i \cdot 4 + \beta \cdot 2\right)\right)}{\alpha}}{2}\\ \mathbf{elif}\;\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{2 + \left(\left(\alpha + \beta\right) + 2 \cdot i\right)} \leq 5 \cdot 10^{-15}:\\ \;\;\;\;\frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{2 + \left(\left(\alpha + \beta\right) + 2 \cdot i\right)} + 1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{1 + \frac{\beta}{\beta + 2}}{2}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 97.9% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\alpha + \beta\right) + 2 \cdot i\\ \mathbf{if}\;\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{t\_0}}{2 + t\_0} \leq -0.999995:\\ \;\;\;\;\frac{\frac{\left(\beta - \beta\right) + \left(2 + \left(i \cdot 4 + \beta \cdot 2\right)\right)}{\alpha}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{1 + \frac{\frac{\alpha + \beta}{\frac{\alpha + \left(\beta + 2 \cdot i\right)}{\beta - \alpha}}}{\left(\alpha + \beta\right) + \left(2 + 2 \cdot i\right)}}{2}\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* 2.0 i))))
   (if (<= (/ (/ (* (+ alpha beta) (- beta alpha)) t_0) (+ 2.0 t_0)) -0.999995)
     (/ (/ (+ (- beta beta) (+ 2.0 (+ (* i 4.0) (* beta 2.0)))) alpha) 2.0)
     (/
      (+
       1.0
       (/
        (/ (+ alpha beta) (/ (+ alpha (+ beta (* 2.0 i))) (- beta alpha)))
        (+ (+ alpha beta) (+ 2.0 (* 2.0 i)))))
      2.0))))

C

double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	double tmp;
	if (((((alpha + beta) * (beta - alpha)) / t_0) / (2.0 + t_0)) <= -0.999995) {
		tmp = (((beta - beta) + (2.0 + ((i * 4.0) + (beta * 2.0)))) / alpha) / 2.0;
	} else {
		tmp = (1.0 + (((alpha + beta) / ((alpha + (beta + (2.0 * i))) / (beta - alpha))) / ((alpha + beta) + (2.0 + (2.0 * i))))) / 2.0;
	}
	return tmp;
}

Fortran

real(8) function code(alpha, beta, i)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: t_0
    real(8) :: tmp
    t_0 = (alpha + beta) + (2.0d0 * i)
    if (((((alpha + beta) * (beta - alpha)) / t_0) / (2.0d0 + t_0)) <= (-0.999995d0)) then
        tmp = (((beta - beta) + (2.0d0 + ((i * 4.0d0) + (beta * 2.0d0)))) / alpha) / 2.0d0
    else
        tmp = (1.0d0 + (((alpha + beta) / ((alpha + (beta + (2.0d0 * i))) / (beta - alpha))) / ((alpha + beta) + (2.0d0 + (2.0d0 * i))))) / 2.0d0
    end if
    code = tmp
end function

Java

public static double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	double tmp;
	if (((((alpha + beta) * (beta - alpha)) / t_0) / (2.0 + t_0)) <= -0.999995) {
		tmp = (((beta - beta) + (2.0 + ((i * 4.0) + (beta * 2.0)))) / alpha) / 2.0;
	} else {
		tmp = (1.0 + (((alpha + beta) / ((alpha + (beta + (2.0 * i))) / (beta - alpha))) / ((alpha + beta) + (2.0 + (2.0 * i))))) / 2.0;
	}
	return tmp;
}

Python

def code(alpha, beta, i):
	t_0 = (alpha + beta) + (2.0 * i)
	tmp = 0
	if ((((alpha + beta) * (beta - alpha)) / t_0) / (2.0 + t_0)) <= -0.999995:
		tmp = (((beta - beta) + (2.0 + ((i * 4.0) + (beta * 2.0)))) / alpha) / 2.0
	else:
		tmp = (1.0 + (((alpha + beta) / ((alpha + (beta + (2.0 * i))) / (beta - alpha))) / ((alpha + beta) + (2.0 + (2.0 * i))))) / 2.0
	return tmp

Julia

function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * i))
	tmp = 0.0
	if (Float64(Float64(Float64(Float64(alpha + beta) * Float64(beta - alpha)) / t_0) / Float64(2.0 + t_0)) <= -0.999995)
		tmp = Float64(Float64(Float64(Float64(beta - beta) + Float64(2.0 + Float64(Float64(i * 4.0) + Float64(beta * 2.0)))) / alpha) / 2.0);
	else
		tmp = Float64(Float64(1.0 + Float64(Float64(Float64(alpha + beta) / Float64(Float64(alpha + Float64(beta + Float64(2.0 * i))) / Float64(beta - alpha))) / Float64(Float64(alpha + beta) + Float64(2.0 + Float64(2.0 * i))))) / 2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(alpha, beta, i)
	t_0 = (alpha + beta) + (2.0 * i);
	tmp = 0.0;
	if (((((alpha + beta) * (beta - alpha)) / t_0) / (2.0 + t_0)) <= -0.999995)
		tmp = (((beta - beta) + (2.0 + ((i * 4.0) + (beta * 2.0)))) / alpha) / 2.0;
	else
		tmp = (1.0 + (((alpha + beta) / ((alpha + (beta + (2.0 * i))) / (beta - alpha))) / ((alpha + beta) + (2.0 + (2.0 * i))))) / 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) 2)) < -0.99999499999999997

   1. Initial program 1.7%

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

   3. Taylor expanded in alpha around inf 94.0%

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

   if -0.99999499999999997 < (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) 2))

   1. Initial program 83.1%

      \[\frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} + 1}{2} \]
   2. Step-by-step derivation

      1. associate-/l* 99.8%

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

      2. associate-+l+ 99.8%

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

      3. associate-+l+ 99.8%

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

   3. Simplified 99.8%

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

4. Final simplification 98.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{2 + \left(\left(\alpha + \beta\right) + 2 \cdot i\right)} \leq -0.999995:\\ \;\;\;\;\frac{\frac{\left(\beta - \beta\right) + \left(2 + \left(i \cdot 4 + \beta \cdot 2\right)\right)}{\alpha}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{1 + \frac{\frac{\alpha + \beta}{\frac{\alpha + \left(\beta + 2 \cdot i\right)}{\beta - \alpha}}}{\left(\alpha + \beta\right) + \left(2 + 2 \cdot i\right)}}{2}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 83.6% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \beta + 2 \cdot i\\ \mathbf{if}\;\alpha \leq 5.8 \cdot 10^{+110}:\\ \;\;\;\;\frac{1 + \frac{\beta}{\beta + 2}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{t\_0 + \left(2 + t\_0\right)}{\alpha}}{2}\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ beta (* 2.0 i))))
   (if (<= alpha 5.8e+110)
     (/ (+ 1.0 (/ beta (+ beta 2.0))) 2.0)
     (/ (/ (+ t_0 (+ 2.0 t_0)) alpha) 2.0))))

C

double code(double alpha, double beta, double i) {
	double t_0 = beta + (2.0 * i);
	double tmp;
	if (alpha <= 5.8e+110) {
		tmp = (1.0 + (beta / (beta + 2.0))) / 2.0;
	} else {
		tmp = ((t_0 + (2.0 + t_0)) / alpha) / 2.0;
	}
	return tmp;
}

Fortran

real(8) function code(alpha, beta, i)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: t_0
    real(8) :: tmp
    t_0 = beta + (2.0d0 * i)
    if (alpha <= 5.8d+110) then
        tmp = (1.0d0 + (beta / (beta + 2.0d0))) / 2.0d0
    else
        tmp = ((t_0 + (2.0d0 + t_0)) / alpha) / 2.0d0
    end if
    code = tmp
end function

Java

public static double code(double alpha, double beta, double i) {
	double t_0 = beta + (2.0 * i);
	double tmp;
	if (alpha <= 5.8e+110) {
		tmp = (1.0 + (beta / (beta + 2.0))) / 2.0;
	} else {
		tmp = ((t_0 + (2.0 + t_0)) / alpha) / 2.0;
	}
	return tmp;
}

Python

def code(alpha, beta, i):
	t_0 = beta + (2.0 * i)
	tmp = 0
	if alpha <= 5.8e+110:
		tmp = (1.0 + (beta / (beta + 2.0))) / 2.0
	else:
		tmp = ((t_0 + (2.0 + t_0)) / alpha) / 2.0
	return tmp

Julia

function code(alpha, beta, i)
	t_0 = Float64(beta + Float64(2.0 * i))
	tmp = 0.0
	if (alpha <= 5.8e+110)
		tmp = Float64(Float64(1.0 + Float64(beta / Float64(beta + 2.0))) / 2.0);
	else
		tmp = Float64(Float64(Float64(t_0 + Float64(2.0 + t_0)) / alpha) / 2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(alpha, beta, i)
	t_0 = beta + (2.0 * i);
	tmp = 0.0;
	if (alpha <= 5.8e+110)
		tmp = (1.0 + (beta / (beta + 2.0))) / 2.0;
	else
		tmp = ((t_0 + (2.0 + t_0)) / alpha) / 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[alpha_, beta_, i_] := Block[{t$95$0 = N[(beta + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[alpha, 5.8e+110], N[(N[(1.0 + N[(beta / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], N[(N[(N[(t$95$0 + N[(2.0 + t$95$0), $MachinePrecision]), $MachinePrecision] / alpha), $MachinePrecision] / 2.0), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if alpha < 5.7999999999999999e110

   1. Initial program 80.5%

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

   3. Taylor expanded in i around 0 79.8%

      \[\leadsto \frac{\color{blue}{\frac{\beta - \alpha}{2 + \left(\alpha + \beta\right)}} + 1}{2} \]
   4. Step-by-step derivation

      1. +-commutative 79.8%

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

   5. Simplified 79.8%

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

   6. Taylor expanded in alpha around 0 85.2%

      \[\leadsto \frac{\color{blue}{\frac{\beta}{2 + \beta}} + 1}{2} \]
   7. Step-by-step derivation

      1. +-commutative 85.2%

         \[\leadsto \frac{\frac{\beta}{\color{blue}{\beta + 2}} + 1}{2} \]

   8. Simplified 85.2%

      \[\leadsto \frac{\color{blue}{\frac{\beta}{\beta + 2}} + 1}{2} \]

   if 5.7999999999999999e110 < alpha

   1. Initial program 3.1%

      \[\frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} + 1}{2} \]
   2. Step-by-step derivation

   3. Simplified 20.6%

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

   5. Taylor expanded in alpha around inf 85.6%

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

4. Final simplification 85.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\alpha \leq 5.8 \cdot 10^{+110}:\\ \;\;\;\;\frac{1 + \frac{\beta}{\beta + 2}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\left(\beta + 2 \cdot i\right) + \left(2 + \left(\beta + 2 \cdot i\right)\right)}{\alpha}}{2}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 83.6% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\alpha \leq 1.3 \cdot 10^{+110}:\\ \;\;\;\;\frac{1 + \frac{\beta}{\beta + 2}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\left(\beta - \beta\right) + \left(2 + \left(i \cdot 4 + \beta \cdot 2\right)\right)}{\alpha}}{2}\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (if (<= alpha 1.3e+110)
   (/ (+ 1.0 (/ beta (+ beta 2.0))) 2.0)
   (/ (/ (+ (- beta beta) (+ 2.0 (+ (* i 4.0) (* beta 2.0)))) alpha) 2.0)))

C

double code(double alpha, double beta, double i) {
	double tmp;
	if (alpha <= 1.3e+110) {
		tmp = (1.0 + (beta / (beta + 2.0))) / 2.0;
	} else {
		tmp = (((beta - beta) + (2.0 + ((i * 4.0) + (beta * 2.0)))) / alpha) / 2.0;
	}
	return tmp;
}

Fortran

real(8) function code(alpha, beta, i)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: tmp
    if (alpha <= 1.3d+110) then
        tmp = (1.0d0 + (beta / (beta + 2.0d0))) / 2.0d0
    else
        tmp = (((beta - beta) + (2.0d0 + ((i * 4.0d0) + (beta * 2.0d0)))) / alpha) / 2.0d0
    end if
    code = tmp
end function

Java

public static double code(double alpha, double beta, double i) {
	double tmp;
	if (alpha <= 1.3e+110) {
		tmp = (1.0 + (beta / (beta + 2.0))) / 2.0;
	} else {
		tmp = (((beta - beta) + (2.0 + ((i * 4.0) + (beta * 2.0)))) / alpha) / 2.0;
	}
	return tmp;
}

Python

def code(alpha, beta, i):
	tmp = 0
	if alpha <= 1.3e+110:
		tmp = (1.0 + (beta / (beta + 2.0))) / 2.0
	else:
		tmp = (((beta - beta) + (2.0 + ((i * 4.0) + (beta * 2.0)))) / alpha) / 2.0
	return tmp

Julia

function code(alpha, beta, i)
	tmp = 0.0
	if (alpha <= 1.3e+110)
		tmp = Float64(Float64(1.0 + Float64(beta / Float64(beta + 2.0))) / 2.0);
	else
		tmp = Float64(Float64(Float64(Float64(beta - beta) + Float64(2.0 + Float64(Float64(i * 4.0) + Float64(beta * 2.0)))) / alpha) / 2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(alpha, beta, i)
	tmp = 0.0;
	if (alpha <= 1.3e+110)
		tmp = (1.0 + (beta / (beta + 2.0))) / 2.0;
	else
		tmp = (((beta - beta) + (2.0 + ((i * 4.0) + (beta * 2.0)))) / alpha) / 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[alpha_, beta_, i_] := If[LessEqual[alpha, 1.3e+110], N[(N[(1.0 + N[(beta / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], N[(N[(N[(N[(beta - beta), $MachinePrecision] + N[(2.0 + N[(N[(i * 4.0), $MachinePrecision] + N[(beta * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / alpha), $MachinePrecision] / 2.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if alpha < 1.3e110

   1. Initial program 80.5%

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

   3. Taylor expanded in i around 0 79.8%

      \[\leadsto \frac{\color{blue}{\frac{\beta - \alpha}{2 + \left(\alpha + \beta\right)}} + 1}{2} \]
   4. Step-by-step derivation

      1. +-commutative 79.8%

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

   5. Simplified 79.8%

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

   6. Taylor expanded in alpha around 0 85.2%

      \[\leadsto \frac{\color{blue}{\frac{\beta}{2 + \beta}} + 1}{2} \]
   7. Step-by-step derivation

      1. +-commutative 85.2%

         \[\leadsto \frac{\frac{\beta}{\color{blue}{\beta + 2}} + 1}{2} \]

   8. Simplified 85.2%

      \[\leadsto \frac{\color{blue}{\frac{\beta}{\beta + 2}} + 1}{2} \]

   if 1.3e110 < alpha

   1. Initial program 3.1%

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

   3. Taylor expanded in alpha around inf 85.6%

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

4. Final simplification 85.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\alpha \leq 1.3 \cdot 10^{+110}:\\ \;\;\;\;\frac{1 + \frac{\beta}{\beta + 2}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\left(\beta - \beta\right) + \left(2 + \left(i \cdot 4 + \beta \cdot 2\right)\right)}{\alpha}}{2}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 75.2% accurate, 2.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;i \leq 2.25 \cdot 10^{+194}:\\ \;\;\;\;\frac{1 + \frac{\beta}{\beta + 2}}{2}\\ \mathbf{else}:\\ \;\;\;\;0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (if (<= i 2.25e+194) (/ (+ 1.0 (/ beta (+ beta 2.0))) 2.0) 0.5))

C

double code(double alpha, double beta, double i) {
	double tmp;
	if (i <= 2.25e+194) {
		tmp = (1.0 + (beta / (beta + 2.0))) / 2.0;
	} else {
		tmp = 0.5;
	}
	return tmp;
}

Fortran

real(8) function code(alpha, beta, i)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: tmp
    if (i <= 2.25d+194) then
        tmp = (1.0d0 + (beta / (beta + 2.0d0))) / 2.0d0
    else
        tmp = 0.5d0
    end if
    code = tmp
end function

Java

public static double code(double alpha, double beta, double i) {
	double tmp;
	if (i <= 2.25e+194) {
		tmp = (1.0 + (beta / (beta + 2.0))) / 2.0;
	} else {
		tmp = 0.5;
	}
	return tmp;
}

Python

def code(alpha, beta, i):
	tmp = 0
	if i <= 2.25e+194:
		tmp = (1.0 + (beta / (beta + 2.0))) / 2.0
	else:
		tmp = 0.5
	return tmp

Julia

function code(alpha, beta, i)
	tmp = 0.0
	if (i <= 2.25e+194)
		tmp = Float64(Float64(1.0 + Float64(beta / Float64(beta + 2.0))) / 2.0);
	else
		tmp = 0.5;
	end
	return tmp
end

MATLAB

function tmp_2 = code(alpha, beta, i)
	tmp = 0.0;
	if (i <= 2.25e+194)
		tmp = (1.0 + (beta / (beta + 2.0))) / 2.0;
	else
		tmp = 0.5;
	end
	tmp_2 = tmp;
end

Wolfram

code[alpha_, beta_, i_] := If[LessEqual[i, 2.25e+194], N[(N[(1.0 + N[(beta / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], 0.5]

Derivation

1. Split input into 2 regimes

2. if i < 2.2499999999999999e194

   1. Initial program 56.6%

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

   3. Taylor expanded in i around 0 68.0%

      \[\leadsto \frac{\color{blue}{\frac{\beta - \alpha}{2 + \left(\alpha + \beta\right)}} + 1}{2} \]
   4. Step-by-step derivation

      1. +-commutative 68.0%

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

   5. Simplified 68.0%

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

   6. Taylor expanded in alpha around 0 68.6%

      \[\leadsto \frac{\color{blue}{\frac{\beta}{2 + \beta}} + 1}{2} \]
   7. Step-by-step derivation

      1. +-commutative 68.6%

         \[\leadsto \frac{\frac{\beta}{\color{blue}{\beta + 2}} + 1}{2} \]

   8. Simplified 68.6%

      \[\leadsto \frac{\color{blue}{\frac{\beta}{\beta + 2}} + 1}{2} \]

   if 2.2499999999999999e194 < i

   1. Initial program 86.2%

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

   3. Taylor expanded in i around inf 96.5%

      \[\leadsto \frac{\color{blue}{1}}{2} \]
3. Recombined 2 regimes into one program.

4. Final simplification 74.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;i \leq 2.25 \cdot 10^{+194}:\\ \;\;\;\;\frac{1 + \frac{\beta}{\beta + 2}}{2}\\ \mathbf{else}:\\ \;\;\;\;0.5\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 77.7% accurate, 2.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\alpha \leq 1.8 \cdot 10^{+156}:\\ \;\;\;\;\frac{1 + \frac{\beta}{\beta + 2}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{2 + \beta \cdot 2}{\alpha}}{2}\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (if (<= alpha 1.8e+156)
   (/ (+ 1.0 (/ beta (+ beta 2.0))) 2.0)
   (/ (/ (+ 2.0 (* beta 2.0)) alpha) 2.0)))

C

double code(double alpha, double beta, double i) {
	double tmp;
	if (alpha <= 1.8e+156) {
		tmp = (1.0 + (beta / (beta + 2.0))) / 2.0;
	} else {
		tmp = ((2.0 + (beta * 2.0)) / alpha) / 2.0;
	}
	return tmp;
}

Fortran

real(8) function code(alpha, beta, i)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: tmp
    if (alpha <= 1.8d+156) then
        tmp = (1.0d0 + (beta / (beta + 2.0d0))) / 2.0d0
    else
        tmp = ((2.0d0 + (beta * 2.0d0)) / alpha) / 2.0d0
    end if
    code = tmp
end function

Java

public static double code(double alpha, double beta, double i) {
	double tmp;
	if (alpha <= 1.8e+156) {
		tmp = (1.0 + (beta / (beta + 2.0))) / 2.0;
	} else {
		tmp = ((2.0 + (beta * 2.0)) / alpha) / 2.0;
	}
	return tmp;
}

Python

def code(alpha, beta, i):
	tmp = 0
	if alpha <= 1.8e+156:
		tmp = (1.0 + (beta / (beta + 2.0))) / 2.0
	else:
		tmp = ((2.0 + (beta * 2.0)) / alpha) / 2.0
	return tmp

Julia

function code(alpha, beta, i)
	tmp = 0.0
	if (alpha <= 1.8e+156)
		tmp = Float64(Float64(1.0 + Float64(beta / Float64(beta + 2.0))) / 2.0);
	else
		tmp = Float64(Float64(Float64(2.0 + Float64(beta * 2.0)) / alpha) / 2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(alpha, beta, i)
	tmp = 0.0;
	if (alpha <= 1.8e+156)
		tmp = (1.0 + (beta / (beta + 2.0))) / 2.0;
	else
		tmp = ((2.0 + (beta * 2.0)) / alpha) / 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[alpha_, beta_, i_] := If[LessEqual[alpha, 1.8e+156], N[(N[(1.0 + N[(beta / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], N[(N[(N[(2.0 + N[(beta * 2.0), $MachinePrecision]), $MachinePrecision] / alpha), $MachinePrecision] / 2.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if alpha < 1.79999999999999989e156

   1. Initial program 77.3%

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

   3. Taylor expanded in i around 0 77.6%

      \[\leadsto \frac{\color{blue}{\frac{\beta - \alpha}{2 + \left(\alpha + \beta\right)}} + 1}{2} \]
   4. Step-by-step derivation

      1. +-commutative 77.6%

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

   5. Simplified 77.6%

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

   6. Taylor expanded in alpha around 0 83.2%

      \[\leadsto \frac{\color{blue}{\frac{\beta}{2 + \beta}} + 1}{2} \]
   7. Step-by-step derivation

      1. +-commutative 83.2%

         \[\leadsto \frac{\frac{\beta}{\color{blue}{\beta + 2}} + 1}{2} \]

   8. Simplified 83.2%

      \[\leadsto \frac{\color{blue}{\frac{\beta}{\beta + 2}} + 1}{2} \]

   if 1.79999999999999989e156 < alpha

   1. Initial program 1.2%

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

   3. Taylor expanded in i around 0 8.5%

      \[\leadsto \frac{\color{blue}{\frac{\beta - \alpha}{2 + \left(\alpha + \beta\right)}} + 1}{2} \]
   4. Step-by-step derivation

      1. +-commutative 8.5%

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

   5. Simplified 8.5%

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

   6. Taylor expanded in alpha around inf 55.6%

      \[\leadsto \frac{\color{blue}{\frac{2 + 2 \cdot \beta}{\alpha}}}{2} \]
   7. Step-by-step derivation

      1. *-commutative 55.6%

         \[\leadsto \frac{\frac{2 + \color{blue}{\beta \cdot 2}}{\alpha}}{2} \]

   8. Simplified 55.6%

      \[\leadsto \frac{\color{blue}{\frac{2 + \beta \cdot 2}{\alpha}}}{2} \]
3. Recombined 2 regimes into one program.

4. Final simplification 77.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\alpha \leq 1.8 \cdot 10^{+156}:\\ \;\;\;\;\frac{1 + \frac{\beta}{\beta + 2}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{2 + \beta \cdot 2}{\alpha}}{2}\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 80.4% accurate, 2.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\alpha \leq 1.15 \cdot 10^{+110}:\\ \;\;\;\;\frac{1 + \frac{\beta}{\beta + 2}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{2 + i \cdot 4}{\alpha}}{2}\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (if (<= alpha 1.15e+110)
   (/ (+ 1.0 (/ beta (+ beta 2.0))) 2.0)
   (/ (/ (+ 2.0 (* i 4.0)) alpha) 2.0)))

C

double code(double alpha, double beta, double i) {
	double tmp;
	if (alpha <= 1.15e+110) {
		tmp = (1.0 + (beta / (beta + 2.0))) / 2.0;
	} else {
		tmp = ((2.0 + (i * 4.0)) / alpha) / 2.0;
	}
	return tmp;
}

Fortran

real(8) function code(alpha, beta, i)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: tmp
    if (alpha <= 1.15d+110) then
        tmp = (1.0d0 + (beta / (beta + 2.0d0))) / 2.0d0
    else
        tmp = ((2.0d0 + (i * 4.0d0)) / alpha) / 2.0d0
    end if
    code = tmp
end function

Java

public static double code(double alpha, double beta, double i) {
	double tmp;
	if (alpha <= 1.15e+110) {
		tmp = (1.0 + (beta / (beta + 2.0))) / 2.0;
	} else {
		tmp = ((2.0 + (i * 4.0)) / alpha) / 2.0;
	}
	return tmp;
}

Python

def code(alpha, beta, i):
	tmp = 0
	if alpha <= 1.15e+110:
		tmp = (1.0 + (beta / (beta + 2.0))) / 2.0
	else:
		tmp = ((2.0 + (i * 4.0)) / alpha) / 2.0
	return tmp

Julia

function code(alpha, beta, i)
	tmp = 0.0
	if (alpha <= 1.15e+110)
		tmp = Float64(Float64(1.0 + Float64(beta / Float64(beta + 2.0))) / 2.0);
	else
		tmp = Float64(Float64(Float64(2.0 + Float64(i * 4.0)) / alpha) / 2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(alpha, beta, i)
	tmp = 0.0;
	if (alpha <= 1.15e+110)
		tmp = (1.0 + (beta / (beta + 2.0))) / 2.0;
	else
		tmp = ((2.0 + (i * 4.0)) / alpha) / 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[alpha_, beta_, i_] := If[LessEqual[alpha, 1.15e+110], N[(N[(1.0 + N[(beta / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], N[(N[(N[(2.0 + N[(i * 4.0), $MachinePrecision]), $MachinePrecision] / alpha), $MachinePrecision] / 2.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if alpha < 1.15e110

   1. Initial program 80.5%

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

   3. Taylor expanded in i around 0 79.8%

      \[\leadsto \frac{\color{blue}{\frac{\beta - \alpha}{2 + \left(\alpha + \beta\right)}} + 1}{2} \]
   4. Step-by-step derivation

      1. +-commutative 79.8%

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

   5. Simplified 79.8%

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

   6. Taylor expanded in alpha around 0 85.2%

      \[\leadsto \frac{\color{blue}{\frac{\beta}{2 + \beta}} + 1}{2} \]
   7. Step-by-step derivation

      1. +-commutative 85.2%

         \[\leadsto \frac{\frac{\beta}{\color{blue}{\beta + 2}} + 1}{2} \]

   8. Simplified 85.2%

      \[\leadsto \frac{\color{blue}{\frac{\beta}{\beta + 2}} + 1}{2} \]

   if 1.15e110 < alpha

   1. Initial program 3.1%

      \[\frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} + 1}{2} \]
   2. Step-by-step derivation

      1. associate-/l* 20.6%

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

      2. associate-+l+ 20.6%

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

      3. associate-+l+ 20.6%

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

   3. Simplified 20.6%

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

   5. Taylor expanded in beta around 0 14.1%

      \[\leadsto \frac{\frac{\frac{\alpha + \beta}{\color{blue}{-1 \cdot \frac{\alpha + 2 \cdot i}{\alpha}}}}{\left(\alpha + \beta\right) + \left(2 \cdot i + 2\right)} + 1}{2} \]
   6. Step-by-step derivation

      1. associate-*r/ 14.1%

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

      2. mul-1-neg 14.1%

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

      3. +-commutative 14.1%

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

   7. Simplified 14.1%

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

   8. Taylor expanded in alpha around inf 74.5%

      \[\leadsto \frac{\color{blue}{\frac{2 + 4 \cdot i}{\alpha}}}{2} \]
   9. Step-by-step derivation

      1. *-commutative 74.5%

         \[\leadsto \frac{\frac{2 + \color{blue}{i \cdot 4}}{\alpha}}{2} \]

   10. Simplified 74.5%

       \[\leadsto \frac{\color{blue}{\frac{2 + i \cdot 4}{\alpha}}}{2} \]
3. Recombined 2 regimes into one program.

4. Final simplification 82.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\alpha \leq 1.15 \cdot 10^{+110}:\\ \;\;\;\;\frac{1 + \frac{\beta}{\beta + 2}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{2 + i \cdot 4}{\alpha}}{2}\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 72.3% accurate, 4.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\beta \leq 1.05 \cdot 10^{+58}:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i) :precision binary64 (if (<= beta 1.05e+58) 0.5 1.0))

C

double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 1.05e+58) {
		tmp = 0.5;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Fortran

real(8) function code(alpha, beta, i)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: tmp
    if (beta <= 1.05d+58) then
        tmp = 0.5d0
    else
        tmp = 1.0d0
    end if
    code = tmp
end function

Java

public static double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 1.05e+58) {
		tmp = 0.5;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(alpha, beta, i):
	tmp = 0
	if beta <= 1.05e+58:
		tmp = 0.5
	else:
		tmp = 1.0
	return tmp

Julia

function code(alpha, beta, i)
	tmp = 0.0
	if (beta <= 1.05e+58)
		tmp = 0.5;
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(alpha, beta, i)
	tmp = 0.0;
	if (beta <= 1.05e+58)
		tmp = 0.5;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[alpha_, beta_, i_] := If[LessEqual[beta, 1.05e+58], 0.5, 1.0]

Derivation

1. Split input into 2 regimes

2. if beta < 1.05000000000000006e58

   1. Initial program 70.0%

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

   3. Taylor expanded in i around inf 69.5%

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

   if 1.05000000000000006e58 < beta

   1. Initial program 36.3%

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

   3. Taylor expanded in beta around inf 80.7%

      \[\leadsto \frac{\color{blue}{2}}{2} \]
3. Recombined 2 regimes into one program.

4. Final simplification 72.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 1.05 \cdot 10^{+58}:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 61.2% accurate, 29.0× speedup

Math

\[\begin{array}{l} \\ 0.5 \end{array} \]

FPCore

(FPCore (alpha beta i) :precision binary64 0.5)

C

double code(double alpha, double beta, double i) {
	return 0.5;
}

Fortran

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

Java

public static double code(double alpha, double beta, double i) {
	return 0.5;
}

Python

def code(alpha, beta, i):
	return 0.5

Julia

function code(alpha, beta, i)
	return 0.5
end

MATLAB

function tmp = code(alpha, beta, i)
	tmp = 0.5;
end

Wolfram

code[alpha_, beta_, i_] := 0.5

Derivation

1. Initial program 62.4%

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

3. Taylor expanded in i around inf 60.3%

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

4. Final simplification 60.3%

   \[\leadsto 0.5 \]
5. Add Preprocessing

Reproduce

herbie shell --seed 2024027 
(FPCore (alpha beta i)
  :name "Octave 3.8, jcobi/2"
  :precision binary64
  :pre (and (and (> alpha -1.0) (> beta -1.0)) (> i 0.0))
  (/ (+ (/ (/ (* (+ alpha beta) (- beta alpha)) (+ (+ alpha beta) (* 2.0 i))) (+ (+ (+ alpha beta) (* 2.0 i)) 2.0)) 1.0) 2.0))