Octave 3.8, jcobi/2

Percentage Accurate: 63.5% → 97.7%

Time: 30.1s

Alternatives: 13

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.5% 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.7% 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.99995:\\ \;\;\;\;\frac{\frac{\left(\beta - \beta\right) + \left(2 + \left(\beta \cdot 2 + i \cdot 4\right)\right)}{\alpha}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{{\left({\left(\mathsf{fma}\left(\beta - \alpha, \frac{\frac{\alpha + \beta}{\beta + \mathsf{fma}\left(2, i, \alpha\right)}}{\left(\alpha + \beta\right) + \mathsf{fma}\left(2, i, 2\right)}, 1\right)\right)}^{3}\right)}^{0.3333333333333333}}{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.99995)
     (/ (/ (+ (- beta beta) (+ 2.0 (+ (* beta 2.0) (* i 4.0)))) alpha) 2.0)
     (/
      (pow
       (pow
        (fma
         (- beta alpha)
         (/
          (/ (+ alpha beta) (+ beta (fma 2.0 i alpha)))
          (+ (+ alpha beta) (fma 2.0 i 2.0)))
         1.0)
        3.0)
       0.3333333333333333)
      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.99995) {
		tmp = (((beta - beta) + (2.0 + ((beta * 2.0) + (i * 4.0)))) / alpha) / 2.0;
	} else {
		tmp = pow(pow(fma((beta - alpha), (((alpha + beta) / (beta + fma(2.0, i, alpha))) / ((alpha + beta) + fma(2.0, i, 2.0))), 1.0), 3.0), 0.3333333333333333) / 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.99995)
		tmp = Float64(Float64(Float64(Float64(beta - beta) + Float64(2.0 + Float64(Float64(beta * 2.0) + Float64(i * 4.0)))) / alpha) / 2.0);
	else
		tmp = Float64(((fma(Float64(beta - alpha), Float64(Float64(Float64(alpha + beta) / Float64(beta + fma(2.0, i, alpha))) / Float64(Float64(alpha + beta) + fma(2.0, i, 2.0))), 1.0) ^ 3.0) ^ 0.3333333333333333) / 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.99995], N[(N[(N[(N[(beta - beta), $MachinePrecision] + N[(2.0 + N[(N[(beta * 2.0), $MachinePrecision] + N[(i * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / alpha), $MachinePrecision] / 2.0), $MachinePrecision], N[(N[Power[N[Power[N[(N[(beta - alpha), $MachinePrecision] * N[(N[(N[(alpha + beta), $MachinePrecision] / N[(beta + N[(2.0 * i + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision], 3.0], $MachinePrecision], 0.3333333333333333], $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 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) < -0.999950000000000006

   1. Initial program 2.9%

      \[\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 18.5%

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

   5. Taylor expanded in alpha around inf 87.8%

      \[\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.999950000000000006 < (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64)))

   1. Initial program 77.8%

      \[\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{\frac{\left(\beta - \alpha\right) \cdot \frac{\alpha + \beta}{\mathsf{fma}\left(2, i, \alpha + \beta\right)}}{\alpha + \left(\beta + \mathsf{fma}\left(2, i, 2\right)\right)} + 1}{2}} \]
   4. Add Preprocessing

   6. Applied egg-rr 99.8%

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

4. Final simplification 96.9%

   \[\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.99995:\\ \;\;\;\;\frac{\frac{\left(\beta - \beta\right) + \left(2 + \left(\beta \cdot 2 + i \cdot 4\right)\right)}{\alpha}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{{\left({\left(\mathsf{fma}\left(\beta - \alpha, \frac{\frac{\alpha + \beta}{\beta + \mathsf{fma}\left(2, i, \alpha\right)}}{\left(\alpha + \beta\right) + \mathsf{fma}\left(2, i, 2\right)}, 1\right)\right)}^{3}\right)}^{0.3333333333333333}}{2}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 97.7% 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.99995:\\ \;\;\;\;\frac{\frac{\left(\beta - \beta\right) + \left(2 + \left(\beta \cdot 2 + i \cdot 4\right)\right)}{\alpha}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{e^{\log \left(\mathsf{fma}\left(\left(\alpha + \beta\right) \cdot \frac{\beta - \alpha}{\beta + \mathsf{fma}\left(2, i, \alpha\right)}, \frac{1}{\beta + \left(\alpha + \mathsf{fma}\left(2, i, 2\right)\right)}, 1\right)\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.99995)
     (/ (/ (+ (- beta beta) (+ 2.0 (+ (* beta 2.0) (* i 4.0)))) alpha) 2.0)
     (/
      (exp
       (log
        (fma
         (* (+ alpha beta) (/ (- beta alpha) (+ beta (fma 2.0 i alpha))))
         (/ 1.0 (+ beta (+ alpha (fma 2.0 i 2.0))))
         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.99995) {
		tmp = (((beta - beta) + (2.0 + ((beta * 2.0) + (i * 4.0)))) / alpha) / 2.0;
	} else {
		tmp = exp(log(fma(((alpha + beta) * ((beta - alpha) / (beta + fma(2.0, i, alpha)))), (1.0 / (beta + (alpha + fma(2.0, i, 2.0)))), 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.99995)
		tmp = Float64(Float64(Float64(Float64(beta - beta) + Float64(2.0 + Float64(Float64(beta * 2.0) + Float64(i * 4.0)))) / alpha) / 2.0);
	else
		tmp = Float64(exp(log(fma(Float64(Float64(alpha + beta) * Float64(Float64(beta - alpha) / Float64(beta + fma(2.0, i, alpha)))), Float64(1.0 / Float64(beta + Float64(alpha + fma(2.0, i, 2.0)))), 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.99995], N[(N[(N[(N[(beta - beta), $MachinePrecision] + N[(2.0 + N[(N[(beta * 2.0), $MachinePrecision] + N[(i * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / alpha), $MachinePrecision] / 2.0), $MachinePrecision], N[(N[Exp[N[Log[N[(N[(N[(alpha + beta), $MachinePrecision] * N[(N[(beta - alpha), $MachinePrecision] / N[(beta + N[(2.0 * i + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[(beta + N[(alpha + N[(2.0 * i + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $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 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) < -0.999950000000000006

   1. Initial program 2.9%

      \[\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 18.5%

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

   5. Taylor expanded in alpha around inf 87.8%

      \[\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.999950000000000006 < (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64)))

   1. Initial program 77.8%

      \[\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{\frac{\left(\beta - \alpha\right) \cdot \frac{\alpha + \beta}{\mathsf{fma}\left(2, i, \alpha + \beta\right)}}{\alpha + \left(\beta + \mathsf{fma}\left(2, i, 2\right)\right)} + 1}{2}} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. div-inv 99.8%

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

      2. associate-*r/ 77.8%

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

      3. *-commutative 77.8%

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

      4. fma-undefine 77.8%

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

      5. +-commutative 77.8%

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

      6. fma-define 77.9%

         \[\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}{\alpha + \left(\beta + \mathsf{fma}\left(2, i, 2\right)\right)}, 1\right)}}{2} \]

   6. Applied egg-rr 99.8%

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

      1. add-exp-log 99.8%

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

      2. *-commutative 99.8%

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

      3. +-commutative 99.8%

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

      4. associate-+r+ 99.8%

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

   8. Applied egg-rr 99.8%

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

4. Final simplification 96.9%

   \[\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.99995:\\ \;\;\;\;\frac{\frac{\left(\beta - \beta\right) + \left(2 + \left(\beta \cdot 2 + i \cdot 4\right)\right)}{\alpha}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{e^{\log \left(\mathsf{fma}\left(\left(\alpha + \beta\right) \cdot \frac{\beta - \alpha}{\beta + \mathsf{fma}\left(2, i, \alpha\right)}, \frac{1}{\beta + \left(\alpha + \mathsf{fma}\left(2, i, 2\right)\right)}, 1\right)\right)}}{2}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 97.7% 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.99995:\\ \;\;\;\;\frac{\frac{\left(\beta - \beta\right) + \left(2 + \left(\beta \cdot 2 + i \cdot 4\right)\right)}{\alpha}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(\alpha + \beta, \frac{\frac{\beta - \alpha}{\alpha + \left(\beta + \mathsf{fma}\left(2, i, 2\right)\right)}}{\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.99995)
     (/ (/ (+ (- beta beta) (+ 2.0 (+ (* beta 2.0) (* i 4.0)))) alpha) 2.0)
     (/
      (fma
       (+ alpha beta)
       (/
        (/ (- beta alpha) (+ alpha (+ beta (fma 2.0 i 2.0))))
        (+ 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.99995) {
		tmp = (((beta - beta) + (2.0 + ((beta * 2.0) + (i * 4.0)))) / alpha) / 2.0;
	} else {
		tmp = fma((alpha + beta), (((beta - alpha) / (alpha + (beta + fma(2.0, i, 2.0)))) / (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.99995)
		tmp = Float64(Float64(Float64(Float64(beta - beta) + Float64(2.0 + Float64(Float64(beta * 2.0) + Float64(i * 4.0)))) / alpha) / 2.0);
	else
		tmp = Float64(fma(Float64(alpha + beta), Float64(Float64(Float64(beta - alpha) / Float64(alpha + Float64(beta + fma(2.0, i, 2.0)))) / 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.99995], N[(N[(N[(N[(beta - beta), $MachinePrecision] + N[(2.0 + N[(N[(beta * 2.0), $MachinePrecision] + N[(i * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / alpha), $MachinePrecision] / 2.0), $MachinePrecision], N[(N[(N[(alpha + beta), $MachinePrecision] * N[(N[(N[(beta - alpha), $MachinePrecision] / N[(alpha + N[(beta + N[(2.0 * i + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $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 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) < -0.999950000000000006

   1. Initial program 2.9%

      \[\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 18.5%

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

   5. Taylor expanded in alpha around inf 87.8%

      \[\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.999950000000000006 < (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64)))

   1. Initial program 77.8%

      \[\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(\alpha + \beta, \frac{\frac{\beta - \alpha}{\alpha + \left(\beta + \mathsf{fma}\left(2, i, 2\right)\right)}}{\alpha + \mathsf{fma}\left(2, i, \beta\right)}, 1\right)}{2}} \]
   4. Add Preprocessing
3. Recombined 2 regimes into one program.

4. Final simplification 96.9%

   \[\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.99995:\\ \;\;\;\;\frac{\frac{\left(\beta - \beta\right) + \left(2 + \left(\beta \cdot 2 + i \cdot 4\right)\right)}{\alpha}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(\alpha + \beta, \frac{\frac{\beta - \alpha}{\alpha + \left(\beta + \mathsf{fma}\left(2, i, 2\right)\right)}}{\alpha + \mathsf{fma}\left(2, i, \beta\right)}, 1\right)}{2}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 97.7% 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.99995:\\ \;\;\;\;\frac{\frac{\left(\beta - \beta\right) + \left(2 + \left(\beta \cdot 2 + i \cdot 4\right)\right)}{\alpha}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\left(\beta - \alpha\right) \cdot \frac{\alpha + \beta}{\mathsf{fma}\left(2, i, \alpha + \beta\right)}}{\alpha + \left(\beta + \mathsf{fma}\left(2, i, 2\right)\right)} + 1}{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.99995)
     (/ (/ (+ (- beta beta) (+ 2.0 (+ (* beta 2.0) (* i 4.0)))) alpha) 2.0)
     (/
      (+
       (/
        (* (- beta alpha) (/ (+ alpha beta) (fma 2.0 i (+ alpha beta))))
        (+ alpha (+ beta (fma 2.0 i 2.0))))
       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.99995) {
		tmp = (((beta - beta) + (2.0 + ((beta * 2.0) + (i * 4.0)))) / alpha) / 2.0;
	} else {
		tmp = ((((beta - alpha) * ((alpha + beta) / fma(2.0, i, (alpha + beta)))) / (alpha + (beta + fma(2.0, i, 2.0)))) + 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.99995)
		tmp = Float64(Float64(Float64(Float64(beta - beta) + Float64(2.0 + Float64(Float64(beta * 2.0) + Float64(i * 4.0)))) / alpha) / 2.0);
	else
		tmp = Float64(Float64(Float64(Float64(Float64(beta - alpha) * Float64(Float64(alpha + beta) / fma(2.0, i, Float64(alpha + beta)))) / Float64(alpha + Float64(beta + fma(2.0, i, 2.0)))) + 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.99995], N[(N[(N[(N[(beta - beta), $MachinePrecision] + N[(2.0 + N[(N[(beta * 2.0), $MachinePrecision] + N[(i * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / alpha), $MachinePrecision] / 2.0), $MachinePrecision], N[(N[(N[(N[(N[(beta - alpha), $MachinePrecision] * N[(N[(alpha + beta), $MachinePrecision] / N[(2.0 * i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + N[(2.0 * i + 2.0), $MachinePrecision]), $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 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) < -0.999950000000000006

   1. Initial program 2.9%

      \[\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 18.5%

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

   5. Taylor expanded in alpha around inf 87.8%

      \[\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.999950000000000006 < (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64)))

   1. Initial program 77.8%

      \[\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{\frac{\left(\beta - \alpha\right) \cdot \frac{\alpha + \beta}{\mathsf{fma}\left(2, i, \alpha + \beta\right)}}{\alpha + \left(\beta + \mathsf{fma}\left(2, i, 2\right)\right)} + 1}{2}} \]
   4. Add Preprocessing
3. Recombined 2 regimes into one program.

4. Final simplification 96.9%

   \[\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.99995:\\ \;\;\;\;\frac{\frac{\left(\beta - \beta\right) + \left(2 + \left(\beta \cdot 2 + i \cdot 4\right)\right)}{\alpha}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\left(\beta - \alpha\right) \cdot \frac{\alpha + \beta}{\mathsf{fma}\left(2, i, \alpha + \beta\right)}}{\alpha + \left(\beta + \mathsf{fma}\left(2, i, 2\right)\right)} + 1}{2}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 97.4% accurate, 0.2× 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.9995:\\ \;\;\;\;\frac{\frac{\left(\beta - \beta\right) + \left(2 + \left(\beta \cdot 2 + i \cdot 4\right)\right)}{\alpha}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\left(\beta - \alpha\right) \cdot \frac{\beta}{\beta + 2 \cdot i}}{\alpha + \left(\beta + \mathsf{fma}\left(2, i, 2\right)\right)} + 1}{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.9995)
     (/ (/ (+ (- beta beta) (+ 2.0 (+ (* beta 2.0) (* i 4.0)))) alpha) 2.0)
     (/
      (+
       (/
        (* (- beta alpha) (/ beta (+ beta (* 2.0 i))))
        (+ alpha (+ beta (fma 2.0 i 2.0))))
       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.9995) {
		tmp = (((beta - beta) + (2.0 + ((beta * 2.0) + (i * 4.0)))) / alpha) / 2.0;
	} else {
		tmp = ((((beta - alpha) * (beta / (beta + (2.0 * i)))) / (alpha + (beta + fma(2.0, i, 2.0)))) + 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.9995)
		tmp = Float64(Float64(Float64(Float64(beta - beta) + Float64(2.0 + Float64(Float64(beta * 2.0) + Float64(i * 4.0)))) / alpha) / 2.0);
	else
		tmp = Float64(Float64(Float64(Float64(Float64(beta - alpha) * Float64(beta / Float64(beta + Float64(2.0 * i)))) / Float64(alpha + Float64(beta + fma(2.0, i, 2.0)))) + 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.9995], N[(N[(N[(N[(beta - beta), $MachinePrecision] + N[(2.0 + N[(N[(beta * 2.0), $MachinePrecision] + N[(i * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / alpha), $MachinePrecision] / 2.0), $MachinePrecision], N[(N[(N[(N[(N[(beta - alpha), $MachinePrecision] * N[(beta / N[(beta + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + N[(2.0 * i + 2.0), $MachinePrecision]), $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 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) < -0.99950000000000006

   1. Initial program 4.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. Step-by-step derivation

   3. Simplified 19.5%

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

   5. Taylor expanded in alpha around inf 87.1%

      \[\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.99950000000000006 < (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64)))

   1. Initial program 77.8%

      \[\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.9%

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

   5. Taylor expanded in alpha around 0 98.8%

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

4. Final simplification 95.9%

   \[\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.9995:\\ \;\;\;\;\frac{\frac{\left(\beta - \beta\right) + \left(2 + \left(\beta \cdot 2 + i \cdot 4\right)\right)}{\alpha}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\left(\beta - \alpha\right) \cdot \frac{\beta}{\beta + 2 \cdot i}}{\alpha + \left(\beta + \mathsf{fma}\left(2, i, 2\right)\right)} + 1}{2}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 96.0% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (* (+ alpha beta) (- beta alpha)))
        (t_1 (+ alpha (+ beta 2.0)))
        (t_2 (+ (+ alpha beta) (* 2.0 i)))
        (t_3 (/ (/ t_0 t_2) (+ 2.0 t_2))))
   (if (<= t_3 -0.99995)
     (/ (/ (+ (- beta beta) (+ 2.0 (+ (* beta 2.0) (* i 4.0)))) alpha) 2.0)
     (if (<= t_3 2e-8)
       (/
        (+
         (/
          t_0
          (*
           (+ (+ alpha beta) (+ 2.0 (* 2.0 i)))
           (+ beta (+ alpha (* 2.0 i)))))
         1.0)
        2.0)
       (/ (+ (- (/ beta t_1) (/ alpha t_1)) 1.0) 2.0)))))

C

double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) * (beta - alpha);
	double t_1 = alpha + (beta + 2.0);
	double t_2 = (alpha + beta) + (2.0 * i);
	double t_3 = (t_0 / t_2) / (2.0 + t_2);
	double tmp;
	if (t_3 <= -0.99995) {
		tmp = (((beta - beta) + (2.0 + ((beta * 2.0) + (i * 4.0)))) / alpha) / 2.0;
	} else if (t_3 <= 2e-8) {
		tmp = ((t_0 / (((alpha + beta) + (2.0 + (2.0 * i))) * (beta + (alpha + (2.0 * i))))) + 1.0) / 2.0;
	} else {
		tmp = (((beta / t_1) - (alpha / t_1)) + 1.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) :: t_2
    real(8) :: t_3
    real(8) :: tmp
    t_0 = (alpha + beta) * (beta - alpha)
    t_1 = alpha + (beta + 2.0d0)
    t_2 = (alpha + beta) + (2.0d0 * i)
    t_3 = (t_0 / t_2) / (2.0d0 + t_2)
    if (t_3 <= (-0.99995d0)) then
        tmp = (((beta - beta) + (2.0d0 + ((beta * 2.0d0) + (i * 4.0d0)))) / alpha) / 2.0d0
    else if (t_3 <= 2d-8) then
        tmp = ((t_0 / (((alpha + beta) + (2.0d0 + (2.0d0 * i))) * (beta + (alpha + (2.0d0 * i))))) + 1.0d0) / 2.0d0
    else
        tmp = (((beta / t_1) - (alpha / t_1)) + 1.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) * (beta - alpha);
	double t_1 = alpha + (beta + 2.0);
	double t_2 = (alpha + beta) + (2.0 * i);
	double t_3 = (t_0 / t_2) / (2.0 + t_2);
	double tmp;
	if (t_3 <= -0.99995) {
		tmp = (((beta - beta) + (2.0 + ((beta * 2.0) + (i * 4.0)))) / alpha) / 2.0;
	} else if (t_3 <= 2e-8) {
		tmp = ((t_0 / (((alpha + beta) + (2.0 + (2.0 * i))) * (beta + (alpha + (2.0 * i))))) + 1.0) / 2.0;
	} else {
		tmp = (((beta / t_1) - (alpha / t_1)) + 1.0) / 2.0;
	}
	return tmp;
}

Python

def code(alpha, beta, i):
	t_0 = (alpha + beta) * (beta - alpha)
	t_1 = alpha + (beta + 2.0)
	t_2 = (alpha + beta) + (2.0 * i)
	t_3 = (t_0 / t_2) / (2.0 + t_2)
	tmp = 0
	if t_3 <= -0.99995:
		tmp = (((beta - beta) + (2.0 + ((beta * 2.0) + (i * 4.0)))) / alpha) / 2.0
	elif t_3 <= 2e-8:
		tmp = ((t_0 / (((alpha + beta) + (2.0 + (2.0 * i))) * (beta + (alpha + (2.0 * i))))) + 1.0) / 2.0
	else:
		tmp = (((beta / t_1) - (alpha / t_1)) + 1.0) / 2.0
	return tmp

Julia

function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) * Float64(beta - alpha))
	t_1 = Float64(alpha + Float64(beta + 2.0))
	t_2 = Float64(Float64(alpha + beta) + Float64(2.0 * i))
	t_3 = Float64(Float64(t_0 / t_2) / Float64(2.0 + t_2))
	tmp = 0.0
	if (t_3 <= -0.99995)
		tmp = Float64(Float64(Float64(Float64(beta - beta) + Float64(2.0 + Float64(Float64(beta * 2.0) + Float64(i * 4.0)))) / alpha) / 2.0);
	elseif (t_3 <= 2e-8)
		tmp = Float64(Float64(Float64(t_0 / Float64(Float64(Float64(alpha + beta) + Float64(2.0 + Float64(2.0 * i))) * Float64(beta + Float64(alpha + Float64(2.0 * i))))) + 1.0) / 2.0);
	else
		tmp = Float64(Float64(Float64(Float64(beta / t_1) - Float64(alpha / t_1)) + 1.0) / 2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(alpha, beta, i)
	t_0 = (alpha + beta) * (beta - alpha);
	t_1 = alpha + (beta + 2.0);
	t_2 = (alpha + beta) + (2.0 * i);
	t_3 = (t_0 / t_2) / (2.0 + t_2);
	tmp = 0.0;
	if (t_3 <= -0.99995)
		tmp = (((beta - beta) + (2.0 + ((beta * 2.0) + (i * 4.0)))) / alpha) / 2.0;
	elseif (t_3 <= 2e-8)
		tmp = ((t_0 / (((alpha + beta) + (2.0 + (2.0 * i))) * (beta + (alpha + (2.0 * i))))) + 1.0) / 2.0;
	else
		tmp = (((beta / t_1) - (alpha / t_1)) + 1.0) / 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] * N[(beta - alpha), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(t$95$0 / t$95$2), $MachinePrecision] / N[(2.0 + t$95$2), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, -0.99995], N[(N[(N[(N[(beta - beta), $MachinePrecision] + N[(2.0 + N[(N[(beta * 2.0), $MachinePrecision] + N[(i * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / alpha), $MachinePrecision] / 2.0), $MachinePrecision], If[LessEqual[t$95$3, 2e-8], N[(N[(N[(t$95$0 / N[(N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(beta + N[(alpha + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / 2.0), $MachinePrecision], N[(N[(N[(N[(beta / t$95$1), $MachinePrecision] - N[(alpha / t$95$1), $MachinePrecision]), $MachinePrecision] + 1.0), $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 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) < -0.999950000000000006

   1. Initial program 2.9%

      \[\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 18.5%

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

   5. Taylor expanded in alpha around inf 87.8%

      \[\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.999950000000000006 < (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) < 2e-8

   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. Step-by-step derivation

      1. associate-/l/ 99.7%

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

      2. associate-+l+ 99.7%

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

      3. +-commutative 99.7%

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

      4. associate-+l+ 99.7%

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

   3. Simplified 99.7%

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

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

   1. Initial program 39.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 100.0%

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

   5. Taylor expanded in i around 0 95.0%

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

      1. associate-+r+ 95.0%

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

      2. +-commutative 95.0%

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

   7. Simplified 95.0%

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

      1. div-sub 95.0%

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

      2. associate-+l+ 95.0%

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

      3. associate-+l+ 95.0%

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

   9. Applied egg-rr 95.0%

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

4. Final simplification 95.6%

   \[\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.99995:\\ \;\;\;\;\frac{\frac{\left(\beta - \beta\right) + \left(2 + \left(\beta \cdot 2 + i \cdot 4\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 2 \cdot 10^{-8}:\\ \;\;\;\;\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\left(\alpha + \beta\right) + \left(2 + 2 \cdot i\right)\right) \cdot \left(\beta + \left(\alpha + 2 \cdot i\right)\right)} + 1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(\frac{\beta}{\alpha + \left(\beta + 2\right)} - \frac{\alpha}{\alpha + \left(\beta + 2\right)}\right) + 1}{2}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 83.1% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\alpha \leq 4500000000:\\ \;\;\;\;\frac{\frac{\beta - \alpha}{\beta + \left(\alpha + 2\right)} + 1}{2}\\ \mathbf{elif}\;\alpha \leq 1.4 \cdot 10^{+31}:\\ \;\;\;\;\frac{\frac{\left(2 - \beta\right) + 2 \cdot \frac{\beta - 2}{\alpha}}{\alpha}}{2}\\ \mathbf{elif}\;\alpha \leq 5.1 \cdot 10^{+73}:\\ \;\;\;\;\frac{\frac{\beta}{\beta + 2} + 1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\left(\beta - \beta\right) + \left(2 + \left(\beta \cdot 2 + i \cdot 4\right)\right)}{\alpha}}{2}\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (if (<= alpha 4500000000.0)
   (/ (+ (/ (- beta alpha) (+ beta (+ alpha 2.0))) 1.0) 2.0)
   (if (<= alpha 1.4e+31)
     (/ (/ (+ (- 2.0 beta) (* 2.0 (/ (- beta 2.0) alpha))) alpha) 2.0)
     (if (<= alpha 5.1e+73)
       (/ (+ (/ beta (+ beta 2.0)) 1.0) 2.0)
       (/
        (/ (+ (- beta beta) (+ 2.0 (+ (* beta 2.0) (* i 4.0)))) alpha)
        2.0)))))

C

double code(double alpha, double beta, double i) {
	double tmp;
	if (alpha <= 4500000000.0) {
		tmp = (((beta - alpha) / (beta + (alpha + 2.0))) + 1.0) / 2.0;
	} else if (alpha <= 1.4e+31) {
		tmp = (((2.0 - beta) + (2.0 * ((beta - 2.0) / alpha))) / alpha) / 2.0;
	} else if (alpha <= 5.1e+73) {
		tmp = ((beta / (beta + 2.0)) + 1.0) / 2.0;
	} else {
		tmp = (((beta - beta) + (2.0 + ((beta * 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 <= 4500000000.0d0) then
        tmp = (((beta - alpha) / (beta + (alpha + 2.0d0))) + 1.0d0) / 2.0d0
    else if (alpha <= 1.4d+31) then
        tmp = (((2.0d0 - beta) + (2.0d0 * ((beta - 2.0d0) / alpha))) / alpha) / 2.0d0
    else if (alpha <= 5.1d+73) then
        tmp = ((beta / (beta + 2.0d0)) + 1.0d0) / 2.0d0
    else
        tmp = (((beta - beta) + (2.0d0 + ((beta * 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 <= 4500000000.0) {
		tmp = (((beta - alpha) / (beta + (alpha + 2.0))) + 1.0) / 2.0;
	} else if (alpha <= 1.4e+31) {
		tmp = (((2.0 - beta) + (2.0 * ((beta - 2.0) / alpha))) / alpha) / 2.0;
	} else if (alpha <= 5.1e+73) {
		tmp = ((beta / (beta + 2.0)) + 1.0) / 2.0;
	} else {
		tmp = (((beta - beta) + (2.0 + ((beta * 2.0) + (i * 4.0)))) / alpha) / 2.0;
	}
	return tmp;
}

Python

def code(alpha, beta, i):
	tmp = 0
	if alpha <= 4500000000.0:
		tmp = (((beta - alpha) / (beta + (alpha + 2.0))) + 1.0) / 2.0
	elif alpha <= 1.4e+31:
		tmp = (((2.0 - beta) + (2.0 * ((beta - 2.0) / alpha))) / alpha) / 2.0
	elif alpha <= 5.1e+73:
		tmp = ((beta / (beta + 2.0)) + 1.0) / 2.0
	else:
		tmp = (((beta - beta) + (2.0 + ((beta * 2.0) + (i * 4.0)))) / alpha) / 2.0
	return tmp

Julia

function code(alpha, beta, i)
	tmp = 0.0
	if (alpha <= 4500000000.0)
		tmp = Float64(Float64(Float64(Float64(beta - alpha) / Float64(beta + Float64(alpha + 2.0))) + 1.0) / 2.0);
	elseif (alpha <= 1.4e+31)
		tmp = Float64(Float64(Float64(Float64(2.0 - beta) + Float64(2.0 * Float64(Float64(beta - 2.0) / alpha))) / alpha) / 2.0);
	elseif (alpha <= 5.1e+73)
		tmp = Float64(Float64(Float64(beta / Float64(beta + 2.0)) + 1.0) / 2.0);
	else
		tmp = Float64(Float64(Float64(Float64(beta - beta) + Float64(2.0 + Float64(Float64(beta * 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 <= 4500000000.0)
		tmp = (((beta - alpha) / (beta + (alpha + 2.0))) + 1.0) / 2.0;
	elseif (alpha <= 1.4e+31)
		tmp = (((2.0 - beta) + (2.0 * ((beta - 2.0) / alpha))) / alpha) / 2.0;
	elseif (alpha <= 5.1e+73)
		tmp = ((beta / (beta + 2.0)) + 1.0) / 2.0;
	else
		tmp = (((beta - beta) + (2.0 + ((beta * 2.0) + (i * 4.0)))) / alpha) / 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[alpha_, beta_, i_] := If[LessEqual[alpha, 4500000000.0], N[(N[(N[(N[(beta - alpha), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / 2.0), $MachinePrecision], If[LessEqual[alpha, 1.4e+31], N[(N[(N[(N[(2.0 - beta), $MachinePrecision] + N[(2.0 * N[(N[(beta - 2.0), $MachinePrecision] / alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / alpha), $MachinePrecision] / 2.0), $MachinePrecision], If[LessEqual[alpha, 5.1e+73], N[(N[(N[(beta / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / 2.0), $MachinePrecision], N[(N[(N[(N[(beta - beta), $MachinePrecision] + N[(2.0 + N[(N[(beta * 2.0), $MachinePrecision] + N[(i * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / alpha), $MachinePrecision] / 2.0), $MachinePrecision]]]]

Derivation

1. Split input into 4 regimes

2. if alpha < 4.5e9

   1. Initial program 81.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. Step-by-step derivation

   3. Simplified 99.8%

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

   5. Taylor expanded in i around 0 92.6%

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

      1. associate-+r+ 92.6%

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

      2. +-commutative 92.6%

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

   7. Simplified 92.6%

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

   if 4.5e9 < alpha < 1.40000000000000008e31

   1. Initial program 24.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. Step-by-step derivation

   3. Simplified 38.1%

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

   5. Taylor expanded in i around 0 25.2%

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

      1. *-commutative 25.2%

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

      2. associate-+r+ 25.2%

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

      3. +-commutative 25.2%

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

   7. Simplified 25.2%

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

   8. Taylor expanded in beta around 0 11.1%

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

   9. Taylor expanded in alpha around inf 72.6%

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

   if 1.40000000000000008e31 < alpha < 5.10000000000000024e73

   1. Initial program 47.8%

      \[\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 52.9%

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

   5. Taylor expanded in i around 0 24.5%

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

      1. *-commutative 24.5%

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

      2. associate-+r+ 24.5%

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

      3. +-commutative 24.5%

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

   7. Simplified 24.5%

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

   8. Taylor expanded in alpha around 0 71.4%

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

   if 5.10000000000000024e73 < alpha

   1. Initial program 12.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. Step-by-step derivation

   3. Simplified 37.7%

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

   5. Taylor expanded in alpha around inf 69.4%

      \[\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 4 regimes into one program.

4. Final simplification 84.8%

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

Alternative 8: 79.7% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\alpha \leq 11000000000:\\ \;\;\;\;\frac{\frac{\beta - \alpha}{\beta + \left(\alpha + 2\right)} + 1}{2}\\ \mathbf{elif}\;\alpha \leq 6.6 \cdot 10^{+30}:\\ \;\;\;\;\frac{\frac{\left(2 - \beta\right) + 2 \cdot \frac{\beta - 2}{\alpha}}{\alpha}}{2}\\ \mathbf{elif}\;\alpha \leq 1.2 \cdot 10^{+74}:\\ \;\;\;\;\frac{\frac{\beta}{\beta + 2} + 1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{2 + i \cdot 4}{\alpha}}{2}\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (if (<= alpha 11000000000.0)
   (/ (+ (/ (- beta alpha) (+ beta (+ alpha 2.0))) 1.0) 2.0)
   (if (<= alpha 6.6e+30)
     (/ (/ (+ (- 2.0 beta) (* 2.0 (/ (- beta 2.0) alpha))) alpha) 2.0)
     (if (<= alpha 1.2e+74)
       (/ (+ (/ beta (+ beta 2.0)) 1.0) 2.0)
       (/ (/ (+ 2.0 (* i 4.0)) alpha) 2.0)))))

C

double code(double alpha, double beta, double i) {
	double tmp;
	if (alpha <= 11000000000.0) {
		tmp = (((beta - alpha) / (beta + (alpha + 2.0))) + 1.0) / 2.0;
	} else if (alpha <= 6.6e+30) {
		tmp = (((2.0 - beta) + (2.0 * ((beta - 2.0) / alpha))) / alpha) / 2.0;
	} else if (alpha <= 1.2e+74) {
		tmp = ((beta / (beta + 2.0)) + 1.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 <= 11000000000.0d0) then
        tmp = (((beta - alpha) / (beta + (alpha + 2.0d0))) + 1.0d0) / 2.0d0
    else if (alpha <= 6.6d+30) then
        tmp = (((2.0d0 - beta) + (2.0d0 * ((beta - 2.0d0) / alpha))) / alpha) / 2.0d0
    else if (alpha <= 1.2d+74) then
        tmp = ((beta / (beta + 2.0d0)) + 1.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 <= 11000000000.0) {
		tmp = (((beta - alpha) / (beta + (alpha + 2.0))) + 1.0) / 2.0;
	} else if (alpha <= 6.6e+30) {
		tmp = (((2.0 - beta) + (2.0 * ((beta - 2.0) / alpha))) / alpha) / 2.0;
	} else if (alpha <= 1.2e+74) {
		tmp = ((beta / (beta + 2.0)) + 1.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 <= 11000000000.0:
		tmp = (((beta - alpha) / (beta + (alpha + 2.0))) + 1.0) / 2.0
	elif alpha <= 6.6e+30:
		tmp = (((2.0 - beta) + (2.0 * ((beta - 2.0) / alpha))) / alpha) / 2.0
	elif alpha <= 1.2e+74:
		tmp = ((beta / (beta + 2.0)) + 1.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 <= 11000000000.0)
		tmp = Float64(Float64(Float64(Float64(beta - alpha) / Float64(beta + Float64(alpha + 2.0))) + 1.0) / 2.0);
	elseif (alpha <= 6.6e+30)
		tmp = Float64(Float64(Float64(Float64(2.0 - beta) + Float64(2.0 * Float64(Float64(beta - 2.0) / alpha))) / alpha) / 2.0);
	elseif (alpha <= 1.2e+74)
		tmp = Float64(Float64(Float64(beta / Float64(beta + 2.0)) + 1.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 <= 11000000000.0)
		tmp = (((beta - alpha) / (beta + (alpha + 2.0))) + 1.0) / 2.0;
	elseif (alpha <= 6.6e+30)
		tmp = (((2.0 - beta) + (2.0 * ((beta - 2.0) / alpha))) / alpha) / 2.0;
	elseif (alpha <= 1.2e+74)
		tmp = ((beta / (beta + 2.0)) + 1.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, 11000000000.0], N[(N[(N[(N[(beta - alpha), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / 2.0), $MachinePrecision], If[LessEqual[alpha, 6.6e+30], N[(N[(N[(N[(2.0 - beta), $MachinePrecision] + N[(2.0 * N[(N[(beta - 2.0), $MachinePrecision] / alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / alpha), $MachinePrecision] / 2.0), $MachinePrecision], If[LessEqual[alpha, 1.2e+74], N[(N[(N[(beta / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] + 1.0), $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 4 regimes

2. if alpha < 1.1e10

   1. Initial program 81.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. Step-by-step derivation

   3. Simplified 99.8%

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

   5. Taylor expanded in i around 0 92.6%

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

      1. associate-+r+ 92.6%

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

      2. +-commutative 92.6%

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

   7. Simplified 92.6%

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

   if 1.1e10 < alpha < 6.60000000000000053e30

   1. Initial program 24.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. Step-by-step derivation

   3. Simplified 38.1%

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

   5. Taylor expanded in i around 0 25.2%

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

      1. *-commutative 25.2%

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

      2. associate-+r+ 25.2%

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

      3. +-commutative 25.2%

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

   7. Simplified 25.2%

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

   8. Taylor expanded in beta around 0 11.1%

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

   9. Taylor expanded in alpha around inf 72.6%

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

   if 6.60000000000000053e30 < alpha < 1.20000000000000004e74

   1. Initial program 47.8%

      \[\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 52.9%

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

   5. Taylor expanded in i around 0 24.5%

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

      1. *-commutative 24.5%

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

      2. associate-+r+ 24.5%

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

      3. +-commutative 24.5%

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

   7. Simplified 24.5%

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

   8. Taylor expanded in alpha around 0 71.4%

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

   if 1.20000000000000004e74 < alpha

   1. Initial program 12.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. Step-by-step derivation

   3. Simplified 36.8%

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

   5. Taylor expanded in beta around 0 24.6%

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

   6. Taylor expanded in alpha around inf 63.3%

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

4. Final simplification 83.2%

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

Alternative 9: 74.9% accurate, 2.1× speedup

Math

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

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (if (<= alpha 5.8e+73)
   (/ (+ (/ beta (+ beta 2.0)) 1.0) 2.0)
   (/ (/ (- 2.0 beta) alpha) 2.0)))

C

double code(double alpha, double beta, double i) {
	double tmp;
	if (alpha <= 5.8e+73) {
		tmp = ((beta / (beta + 2.0)) + 1.0) / 2.0;
	} else {
		tmp = ((2.0 - beta) / 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 <= 5.8d+73) then
        tmp = ((beta / (beta + 2.0d0)) + 1.0d0) / 2.0d0
    else
        tmp = ((2.0d0 - beta) / alpha) / 2.0d0
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[alpha_, beta_, i_] := If[LessEqual[alpha, 5.8e+73], N[(N[(N[(beta / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / 2.0), $MachinePrecision], N[(N[(N[(2.0 - beta), $MachinePrecision] / alpha), $MachinePrecision] / 2.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if alpha < 5.8000000000000005e73

   1. Initial program 76.9%

      \[\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 81.3%

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

   5. Taylor expanded in i around 0 73.6%

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

      1. *-commutative 73.6%

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

      2. associate-+r+ 73.6%

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

      3. +-commutative 73.6%

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

   7. Simplified 73.6%

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

   8. Taylor expanded in alpha around 0 87.8%

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

   if 5.8000000000000005e73 < alpha

   1. Initial program 12.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. Step-by-step derivation

   3. Simplified 24.7%

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

   5. Taylor expanded in i around 0 16.4%

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

      1. *-commutative 16.4%

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

      2. associate-+r+ 16.4%

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

      3. +-commutative 16.4%

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

   7. Simplified 16.4%

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

   8. Taylor expanded in beta around 0 4.1%

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

   9. Taylor expanded in alpha around -inf 39.5%

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

       1. mul-1-neg 39.5%

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

   11. Simplified 39.5%

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

4. Final simplification 75.0%

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

Alternative 10: 78.6% accurate, 2.1× speedup

Math

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

FPCore

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

C

double code(double alpha, double beta, double i) {
	double tmp;
	if (alpha <= 2.6e+73) {
		tmp = ((beta / (beta + 2.0)) + 1.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 <= 2.6d+73) then
        tmp = ((beta / (beta + 2.0d0)) + 1.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 <= 2.6e+73) {
		tmp = ((beta / (beta + 2.0)) + 1.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 <= 2.6e+73:
		tmp = ((beta / (beta + 2.0)) + 1.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 <= 2.6e+73)
		tmp = Float64(Float64(Float64(beta / Float64(beta + 2.0)) + 1.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 <= 2.6e+73)
		tmp = ((beta / (beta + 2.0)) + 1.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, 2.6e+73], N[(N[(N[(beta / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] + 1.0), $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 < 2.6000000000000001e73

   1. Initial program 76.9%

      \[\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 81.3%

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

   5. Taylor expanded in i around 0 73.6%

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

      1. *-commutative 73.6%

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

      2. associate-+r+ 73.6%

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

      3. +-commutative 73.6%

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

   7. Simplified 73.6%

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

   8. Taylor expanded in alpha around 0 87.8%

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

   if 2.6000000000000001e73 < alpha

   1. Initial program 12.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. Step-by-step derivation

   3. Simplified 24.7%

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

   5. Taylor expanded in i around 0 16.4%

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

      1. *-commutative 16.4%

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

      2. associate-+r+ 16.4%

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

      3. +-commutative 16.4%

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

   7. Simplified 16.4%

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

   8. Taylor expanded in alpha around inf 46.6%

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

4. Final simplification 76.9%

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

Alternative 11: 80.6% accurate, 2.1× speedup

Math

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

FPCore

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

C

double code(double alpha, double beta, double i) {
	double tmp;
	if (alpha <= 2.5e+73) {
		tmp = ((beta / (beta + 2.0)) + 1.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 <= 2.5d+73) then
        tmp = ((beta / (beta + 2.0d0)) + 1.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 <= 2.5e+73) {
		tmp = ((beta / (beta + 2.0)) + 1.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 <= 2.5e+73:
		tmp = ((beta / (beta + 2.0)) + 1.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 <= 2.5e+73)
		tmp = Float64(Float64(Float64(beta / Float64(beta + 2.0)) + 1.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 <= 2.5e+73)
		tmp = ((beta / (beta + 2.0)) + 1.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, 2.5e+73], N[(N[(N[(beta / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] + 1.0), $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 < 2.49999999999999988e73

   1. Initial program 76.9%

      \[\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 81.3%

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

   5. Taylor expanded in i around 0 73.6%

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

      1. *-commutative 73.6%

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

      2. associate-+r+ 73.6%

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

      3. +-commutative 73.6%

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

   7. Simplified 73.6%

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

   8. Taylor expanded in alpha around 0 87.8%

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

   if 2.49999999999999988e73 < alpha

   1. Initial program 12.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. Step-by-step derivation

   3. Simplified 36.8%

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

   5. Taylor expanded in beta around 0 24.6%

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

   6. Taylor expanded in alpha around inf 63.3%

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

4. Final simplification 81.3%

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

Alternative 12: 73.3% accurate, 4.8× speedup

Math

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

FPCore

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

C

double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 1.8e+26) {
		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.8d+26) 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.8e+26) {
		tmp = 0.5;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

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

Julia

function code(alpha, beta, i)
	tmp = 0.0
	if (beta <= 1.8e+26)
		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.8e+26)
		tmp = 0.5;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 1.80000000000000012e26

   1. Initial program 69.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. Step-by-step derivation

   3. Simplified 74.0%

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

   5. Taylor expanded in i around inf 69.1%

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

   if 1.80000000000000012e26 < beta

   1. Initial program 38.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. Step-by-step derivation

   3. Simplified 93.7%

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

   5. Taylor expanded in beta around inf 79.4%

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

4. Final simplification 72.3%

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

Alternative 13: 61.9% 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 59.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. Step-by-step derivation

3. Simplified 80.1%

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

5. Taylor expanded in i around inf 56.3%

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

6. Final simplification 56.3%

   \[\leadsto 0.5 \]
7. Add Preprocessing

Reproduce

herbie shell --seed 2024073 
(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))