Octave 3.8, jcobi/2

Percentage Accurate: 62.8% → 97.8%

Time: 9.2s

Alternatives: 16

Speedup: 1.1×

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: 62.8% 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.8% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (fma i 2.0 (+ beta alpha)))
        (t_1 (+ (+ alpha beta) (* 2.0 i)))
        (t_2 (/ (/ (* (+ alpha beta) (- beta alpha)) t_1) (+ t_1 2.0))))
   (if (<= t_2 -0.9998)
     (* (/ (+ (fma 4.0 i (* 2.0 beta)) 2.0) alpha) 0.5)
     (if (<= t_2 0.99999995)
       (/
        (fma
         (/ (* (- beta alpha) (+ beta alpha)) (+ t_0 2.0))
         (pow t_0 -1.0)
         1.0)
        2.0)
       (*
        0.5
        (fma
         (/ beta (+ (fma 2.0 i beta) 2.0))
         (/ beta (fma 2.0 i beta))
         1.0))))))

C

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

Julia

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

Wolfram

code[alpha_, beta_, i_] := Block[{t$95$0 = N[(i * 2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(N[(alpha + beta), $MachinePrecision] * N[(beta - alpha), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -0.9998], N[(N[(N[(N[(4.0 * i + N[(2.0 * beta), $MachinePrecision]), $MachinePrecision] + 2.0), $MachinePrecision] / alpha), $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[t$95$2, 0.99999995], N[(N[(N[(N[(N[(beta - alpha), $MachinePrecision] * N[(beta + alpha), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 + 2.0), $MachinePrecision]), $MachinePrecision] * N[Power[t$95$0, -1.0], $MachinePrecision] + 1.0), $MachinePrecision] / 2.0), $MachinePrecision], N[(0.5 * N[(N[(beta / N[(N[(2.0 * i + beta), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] * N[(beta / N[(2.0 * i + beta), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $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.99980000000000002

   1. Initial program 4.0%

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

   3. Taylor expanded in alpha around inf

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

      1. *-commutative N/A

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

      2. distribute-rgt1-in N/A

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

      3. metadata-eval N/A

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

      4. mul0-lft N/A

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

      5. neg-sub0 N/A

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

      6. mul-1-neg N/A

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

      7. remove-double-neg N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. +-commutative N/A

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

      13. lower-fma.f64 N/A

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

      14. lower-*.f64 96.7

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

   5. Applied rewrites 96.7%

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

   if -0.99980000000000002 < (/.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.999999949999999971

   1. Initial program 99.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. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto \frac{\color{blue}{\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. *-rgt-identity N/A

         \[\leadsto \frac{\color{blue}{\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} \cdot 1} + 1}{2} \]

      3. lift-/.f64 N/A

         \[\leadsto \frac{\color{blue}{\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}} \cdot 1 + 1}{2} \]

      4. lift-/.f64 N/A

         \[\leadsto \frac{\frac{\color{blue}{\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} \cdot 1 + 1}{2} \]

      5. associate-/l/ N/A

         \[\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)}} \cdot 1 + 1}{2} \]

      6. associate-*l/ N/A

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

      7. times-frac N/A

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

      8. lower-fma.f64 N/A

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

   4. Applied rewrites 99.9%

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

   if 0.999999949999999971 < (/.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 37.7%

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

   3. Taylor expanded in alpha around 0

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

      1. lower-*.f64 N/A

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

      2. +-commutative N/A

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

      3. unpow2 N/A

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

      4. times-frac N/A

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

      5. lower-fma.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 N/A

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

      9. +-commutative N/A

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

      10. lower-fma.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. +-commutative N/A

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

      13. lower-fma.f64 100.0

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

   5. Applied rewrites 100.0%

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

Alternative 2: 88.3% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* 2.0 i)))
        (t_1 (/ (/ (* (+ alpha beta) (- beta alpha)) t_0) (+ t_0 2.0))))
   (if (<= t_1 (- INFINITY))
     (* (/ (fma 2.0 beta 2.0) alpha) 0.5)
     (if (<= t_1 -0.5)
       (fma (/ i alpha) 2.0 (pow alpha -1.0))
       (if (<= t_1 1e-166)
         0.5
         (fma (/ (- beta alpha) (+ (+ beta alpha) 2.0)) 0.5 0.5))))))

C

double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	double t_1 = (((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0);
	double tmp;
	if (t_1 <= -((double) INFINITY)) {
		tmp = (fma(2.0, beta, 2.0) / alpha) * 0.5;
	} else if (t_1 <= -0.5) {
		tmp = fma((i / alpha), 2.0, pow(alpha, -1.0));
	} else if (t_1 <= 1e-166) {
		tmp = 0.5;
	} else {
		tmp = fma(((beta - alpha) / ((beta + alpha) + 2.0)), 0.5, 0.5);
	}
	return tmp;
}

Julia

function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * i))
	t_1 = Float64(Float64(Float64(Float64(alpha + beta) * Float64(beta - alpha)) / t_0) / Float64(t_0 + 2.0))
	tmp = 0.0
	if (t_1 <= Float64(-Inf))
		tmp = Float64(Float64(fma(2.0, beta, 2.0) / alpha) * 0.5);
	elseif (t_1 <= -0.5)
		tmp = fma(Float64(i / alpha), 2.0, (alpha ^ -1.0));
	elseif (t_1 <= 1e-166)
		tmp = 0.5;
	else
		tmp = fma(Float64(Float64(beta - alpha) / Float64(Float64(beta + alpha) + 2.0)), 0.5, 0.5);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 4 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))) < -inf.0

   1. Initial program 1.1%

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

   3. Taylor expanded in i around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. associate--l+ N/A

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

      4. div-sub N/A

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

      5. lower-+.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower--.f64 N/A

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

      8. +-commutative N/A

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

      9. lower-+.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 7.2

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

   5. Applied rewrites 7.2%

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

   6. Taylor expanded in alpha around inf

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

   8. Applied rewrites 84.1%

      \[\leadsto \frac{\mathsf{fma}\left(2, \beta, 2\right)}{\alpha} \cdot 0.5 \]

   if -inf.0 < (/.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.5

   1. Initial program 14.0%

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

   3. Taylor expanded in alpha around -inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   5. Applied rewrites 93.6%

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

   6. Taylor expanded in beta around 0

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

   8. Applied rewrites 93.5%

      \[\leadsto \frac{\mathsf{fma}\left(4, i, 2\right)}{\alpha} \cdot \color{blue}{0.5} \]

   9. Taylor expanded in i around 0

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

   11. Applied rewrites 93.5%

       \[\leadsto \mathsf{fma}\left(\frac{i}{\alpha}, 2, \frac{1}{\alpha}\right) \]

   if -0.5 < (/.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.00000000000000004e-166

   1. Initial program 100.0%

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

   3. Taylor expanded in i around inf

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

   5. Applied rewrites 97.5%

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

   if 1.00000000000000004e-166 < (/.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 63.1%

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

   3. Taylor expanded in i around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. associate--l+ N/A

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

      4. div-sub N/A

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

      5. lower-+.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower--.f64 N/A

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

      8. +-commutative N/A

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

      9. lower-+.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 94.3

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

   5. Applied rewrites 94.3%

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

   7. Applied rewrites 94.3%

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

4. Final simplification 94.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\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} \leq -\infty:\\ \;\;\;\;\frac{\mathsf{fma}\left(2, \beta, 2\right)}{\alpha} \cdot 0.5\\ \mathbf{elif}\;\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} \leq -0.5:\\ \;\;\;\;\mathsf{fma}\left(\frac{i}{\alpha}, 2, {\alpha}^{-1}\right)\\ \mathbf{elif}\;\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} \leq 10^{-166}:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{\beta - \alpha}{\left(\beta + \alpha\right) + 2}, 0.5, 0.5\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 84.7% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* 2.0 i)))
        (t_1 (/ (/ (* (+ alpha beta) (- beta alpha)) t_0) (+ t_0 2.0))))
   (if (<= t_1 -0.5)
     (pow alpha -1.0)
     (if (<= t_1 0.01) 0.5 (- 1.0 (pow beta -1.0))))))

C

double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	double t_1 = (((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0);
	double tmp;
	if (t_1 <= -0.5) {
		tmp = pow(alpha, -1.0);
	} else if (t_1 <= 0.01) {
		tmp = 0.5;
	} else {
		tmp = 1.0 - pow(beta, -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) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = (alpha + beta) + (2.0d0 * i)
    t_1 = (((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0d0)
    if (t_1 <= (-0.5d0)) then
        tmp = alpha ** (-1.0d0)
    else if (t_1 <= 0.01d0) then
        tmp = 0.5d0
    else
        tmp = 1.0d0 - (beta ** (-1.0d0))
    end if
    code = tmp
end function

Java

public static double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	double t_1 = (((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0);
	double tmp;
	if (t_1 <= -0.5) {
		tmp = Math.pow(alpha, -1.0);
	} else if (t_1 <= 0.01) {
		tmp = 0.5;
	} else {
		tmp = 1.0 - Math.pow(beta, -1.0);
	}
	return tmp;
}

Python

def code(alpha, beta, i):
	t_0 = (alpha + beta) + (2.0 * i)
	t_1 = (((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0)
	tmp = 0
	if t_1 <= -0.5:
		tmp = math.pow(alpha, -1.0)
	elif t_1 <= 0.01:
		tmp = 0.5
	else:
		tmp = 1.0 - math.pow(beta, -1.0)
	return tmp

Julia

function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * i))
	t_1 = Float64(Float64(Float64(Float64(alpha + beta) * Float64(beta - alpha)) / t_0) / Float64(t_0 + 2.0))
	tmp = 0.0
	if (t_1 <= -0.5)
		tmp = alpha ^ -1.0;
	elseif (t_1 <= 0.01)
		tmp = 0.5;
	else
		tmp = Float64(1.0 - (beta ^ -1.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(alpha, beta, i)
	t_0 = (alpha + beta) + (2.0 * i);
	t_1 = (((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0);
	tmp = 0.0;
	if (t_1 <= -0.5)
		tmp = alpha ^ -1.0;
	elseif (t_1 <= 0.01)
		tmp = 0.5;
	else
		tmp = 1.0 - (beta ^ -1.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(N[(alpha + beta), $MachinePrecision] * N[(beta - alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -0.5], N[Power[alpha, -1.0], $MachinePrecision], If[LessEqual[t$95$1, 0.01], 0.5, N[(1.0 - N[Power[beta, -1.0], $MachinePrecision]), $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.5

   1. Initial program 5.4%

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

   3. Taylor expanded in alpha around -inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   5. Applied rewrites 95.7%

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

   6. Taylor expanded in beta around 0

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

   8. Applied rewrites 76.2%

      \[\leadsto \frac{\mathsf{fma}\left(4, i, 2\right)}{\alpha} \cdot \color{blue}{0.5} \]

   9. Taylor expanded in i around 0

      \[\leadsto \frac{1}{\alpha} \]
   10. Step-by-step derivation

   11. Applied rewrites 58.6%

       \[\leadsto \frac{1}{\alpha} \]

   if -0.5 < (/.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.0100000000000000002

   1. Initial program 100.0%

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

   3. Taylor expanded in i around inf

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

   5. Applied rewrites 96.7%

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

   if 0.0100000000000000002 < (/.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 41.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. Add Preprocessing

   3. Taylor expanded in i around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. associate--l+ N/A

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

      4. div-sub N/A

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

      5. lower-+.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower--.f64 N/A

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

      8. +-commutative N/A

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

      9. lower-+.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 91.0

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

   5. Applied rewrites 91.0%

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

   6. Taylor expanded in beta around inf

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

   8. Applied rewrites 89.3%

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

   9. Taylor expanded in alpha around 0

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

   11. Applied rewrites 88.3%

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

4. Final simplification 86.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\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} \leq -0.5:\\ \;\;\;\;{\alpha}^{-1}\\ \mathbf{elif}\;\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} \leq 0.01:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;1 - {\beta}^{-1}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 88.3% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* 2.0 i)))
        (t_1 (/ (/ (* (+ alpha beta) (- beta alpha)) t_0) (+ t_0 2.0))))
   (if (<= t_1 (- INFINITY))
     (* (/ (fma 2.0 beta 2.0) alpha) 0.5)
     (if (<= t_1 -0.5)
       (* (/ (fma 4.0 i 2.0) alpha) 0.5)
       (if (<= t_1 1e-166)
         0.5
         (fma (/ (- beta alpha) (+ (+ beta alpha) 2.0)) 0.5 0.5))))))

C

double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	double t_1 = (((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0);
	double tmp;
	if (t_1 <= -((double) INFINITY)) {
		tmp = (fma(2.0, beta, 2.0) / alpha) * 0.5;
	} else if (t_1 <= -0.5) {
		tmp = (fma(4.0, i, 2.0) / alpha) * 0.5;
	} else if (t_1 <= 1e-166) {
		tmp = 0.5;
	} else {
		tmp = fma(((beta - alpha) / ((beta + alpha) + 2.0)), 0.5, 0.5);
	}
	return tmp;
}

Julia

function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * i))
	t_1 = Float64(Float64(Float64(Float64(alpha + beta) * Float64(beta - alpha)) / t_0) / Float64(t_0 + 2.0))
	tmp = 0.0
	if (t_1 <= Float64(-Inf))
		tmp = Float64(Float64(fma(2.0, beta, 2.0) / alpha) * 0.5);
	elseif (t_1 <= -0.5)
		tmp = Float64(Float64(fma(4.0, i, 2.0) / alpha) * 0.5);
	elseif (t_1 <= 1e-166)
		tmp = 0.5;
	else
		tmp = fma(Float64(Float64(beta - alpha) / Float64(Float64(beta + alpha) + 2.0)), 0.5, 0.5);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 4 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))) < -inf.0

   1. Initial program 1.1%

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

   3. Taylor expanded in i around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. associate--l+ N/A

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

      4. div-sub N/A

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

      5. lower-+.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower--.f64 N/A

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

      8. +-commutative N/A

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

      9. lower-+.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 7.2

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

   5. Applied rewrites 7.2%

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

   6. Taylor expanded in alpha around inf

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

   8. Applied rewrites 84.1%

      \[\leadsto \frac{\mathsf{fma}\left(2, \beta, 2\right)}{\alpha} \cdot 0.5 \]

   if -inf.0 < (/.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.5

   1. Initial program 14.0%

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

   3. Taylor expanded in alpha around -inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   5. Applied rewrites 93.6%

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

   6. Taylor expanded in beta around 0

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

   8. Applied rewrites 93.5%

      \[\leadsto \frac{\mathsf{fma}\left(4, i, 2\right)}{\alpha} \cdot \color{blue}{0.5} \]

   if -0.5 < (/.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.00000000000000004e-166

   1. Initial program 100.0%

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

   3. Taylor expanded in i around inf

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

   5. Applied rewrites 97.5%

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

   if 1.00000000000000004e-166 < (/.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 63.1%

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

   3. Taylor expanded in i around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. associate--l+ N/A

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

      4. div-sub N/A

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

      5. lower-+.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower--.f64 N/A

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

      8. +-commutative N/A

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

      9. lower-+.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 94.3

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

   5. Applied rewrites 94.3%

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

   7. Applied rewrites 94.3%

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

Alternative 5: 89.1% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 4 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))) < -inf.0

   1. Initial program 1.1%

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

   3. Taylor expanded in i around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. associate--l+ N/A

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

      4. div-sub N/A

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

      5. lower-+.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower--.f64 N/A

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

      8. +-commutative N/A

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

      9. lower-+.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 7.2

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

   5. Applied rewrites 7.2%

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

   6. Taylor expanded in alpha around inf

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

   8. Applied rewrites 84.1%

      \[\leadsto \frac{\mathsf{fma}\left(2, \beta, 2\right)}{\alpha} \cdot 0.5 \]

   if -inf.0 < (/.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.5

   1. Initial program 14.0%

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

   3. Taylor expanded in alpha around -inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   5. Applied rewrites 93.6%

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

   6. Taylor expanded in beta around 0

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

   8. Applied rewrites 93.5%

      \[\leadsto \frac{\mathsf{fma}\left(4, i, 2\right)}{\alpha} \cdot \color{blue}{0.5} \]

   if -0.5 < (/.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-3

   1. Initial program 100.0%

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

   3. Taylor expanded in i around inf

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

   5. Applied rewrites 97.2%

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

   if 2e-3 < (/.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 43.1%

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

   3. Taylor expanded in i around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. associate--l+ N/A

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

      4. div-sub N/A

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

      5. lower-+.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower--.f64 N/A

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

      8. +-commutative N/A

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

      9. lower-+.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 91.2

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

   5. Applied rewrites 91.2%

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

   6. Taylor expanded in alpha around 0

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

   8. Applied rewrites 88.6%

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

   10. Applied rewrites 88.6%

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

Alternative 6: 97.8% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(N[(alpha + beta), $MachinePrecision] * N[(beta - alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -0.9998], N[(N[(N[(N[(4.0 * i + N[(2.0 * beta), $MachinePrecision]), $MachinePrecision] + 2.0), $MachinePrecision] / alpha), $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[t$95$1, 0.99999995], N[(N[(t$95$1 + 1.0), $MachinePrecision] / 2.0), $MachinePrecision], N[(0.5 * N[(N[(beta / N[(N[(2.0 * i + beta), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] * N[(beta / N[(2.0 * i + beta), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $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.99980000000000002

   1. Initial program 4.0%

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

   3. Taylor expanded in alpha around inf

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

      1. *-commutative N/A

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

      2. distribute-rgt1-in N/A

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

      3. metadata-eval N/A

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

      4. mul0-lft N/A

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

      5. neg-sub0 N/A

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

      6. mul-1-neg N/A

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

      7. remove-double-neg N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. +-commutative N/A

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

      13. lower-fma.f64 N/A

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

      14. lower-*.f64 96.7

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

   5. Applied rewrites 96.7%

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

   if -0.99980000000000002 < (/.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.999999949999999971

   1. Initial program 99.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. Add Preprocessing

   if 0.999999949999999971 < (/.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 37.7%

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

   3. Taylor expanded in alpha around 0

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

      1. lower-*.f64 N/A

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

      2. +-commutative N/A

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

      3. unpow2 N/A

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

      4. times-frac N/A

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

      5. lower-fma.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 N/A

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

      9. +-commutative N/A

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

      10. lower-fma.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. +-commutative N/A

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

      13. lower-fma.f64 100.0

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

   5. Applied rewrites 100.0%

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

Alternative 7: 97.8% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

code[alpha_, beta_, i_] := Block[{t$95$0 = N[(i * 2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(N[(alpha + beta), $MachinePrecision] * N[(beta - alpha), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -0.9998], N[(N[(N[(N[(4.0 * i + N[(2.0 * beta), $MachinePrecision]), $MachinePrecision] + 2.0), $MachinePrecision] / alpha), $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[t$95$2, 0.99999995], N[(N[(N[(beta - alpha), $MachinePrecision] * N[(N[(beta + alpha), $MachinePrecision] / N[(N[(t$95$0 + 2.0), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / 2.0), $MachinePrecision], N[(0.5 * N[(N[(beta / N[(N[(2.0 * i + beta), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] * N[(beta / N[(2.0 * i + beta), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $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.99980000000000002

   1. Initial program 4.0%

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

   3. Taylor expanded in alpha around inf

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

      1. *-commutative N/A

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

      2. distribute-rgt1-in N/A

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

      3. metadata-eval N/A

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

      4. mul0-lft N/A

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

      5. neg-sub0 N/A

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

      6. mul-1-neg N/A

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

      7. remove-double-neg N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. +-commutative N/A

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

      13. lower-fma.f64 N/A

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

      14. lower-*.f64 96.7

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

   5. Applied rewrites 96.7%

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

   if -0.99980000000000002 < (/.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.999999949999999971

   1. Initial program 99.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. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto \frac{\color{blue}{\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. lift-/.f64 N/A

         \[\leadsto \frac{\color{blue}{\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} \]

      3. lift-/.f64 N/A

         \[\leadsto \frac{\frac{\color{blue}{\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} \]

      4. associate-/l/ N/A

         \[\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} \]

      5. lift-*.f64 N/A

         \[\leadsto \frac{\frac{\color{blue}{\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} \]

      6. *-commutative N/A

         \[\leadsto \frac{\frac{\color{blue}{\left(\beta - \alpha\right) \cdot \left(\alpha + \beta\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} \]

      7. associate-/l* N/A

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

      8. lower-fma.f64 N/A

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

   4. Applied rewrites 99.9%

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

   if 0.999999949999999971 < (/.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 37.7%

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

   3. Taylor expanded in alpha around 0

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

      1. lower-*.f64 N/A

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

      2. +-commutative N/A

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

      3. unpow2 N/A

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

      4. times-frac N/A

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

      5. lower-fma.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 N/A

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

      9. +-commutative N/A

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

      10. lower-fma.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. +-commutative N/A

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

      13. lower-fma.f64 100.0

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

   5. Applied rewrites 100.0%

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

Alternative 8: 94.3% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(N[(alpha + beta), $MachinePrecision] * N[(beta - alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -0.5], N[(N[(N[(N[(4.0 * i + N[(2.0 * beta), $MachinePrecision]), $MachinePrecision] + 2.0), $MachinePrecision] / alpha), $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[t$95$1, 1e-166], N[(0.5 * N[(beta * N[(beta / N[(N[(N[(i * 2.0 + beta), $MachinePrecision] + 2.0), $MachinePrecision] * N[(i * 2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(beta - alpha), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] * 0.5 + 0.5), $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.5

   1. Initial program 5.4%

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

   3. Taylor expanded in alpha around inf

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

      1. *-commutative N/A

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

      2. distribute-rgt1-in N/A

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

      3. metadata-eval N/A

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

      4. mul0-lft N/A

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

      5. neg-sub0 N/A

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

      6. mul-1-neg N/A

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

      7. remove-double-neg N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. +-commutative N/A

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

      13. lower-fma.f64 N/A

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

      14. lower-*.f64 95.7

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

   5. Applied rewrites 95.7%

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

   if -0.5 < (/.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.00000000000000004e-166

   1. Initial program 100.0%

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

   3. Taylor expanded in alpha around 0

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

      1. lower-*.f64 N/A

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

      2. +-commutative N/A

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

      3. unpow2 N/A

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

      4. times-frac N/A

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

      5. lower-fma.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 N/A

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

      9. +-commutative N/A

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

      10. lower-fma.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. +-commutative N/A

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

      13. lower-fma.f64 98.4

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

   5. Applied rewrites 98.4%

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

   7. Applied rewrites 98.4%

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

   if 1.00000000000000004e-166 < (/.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 63.1%

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

   3. Taylor expanded in i around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. associate--l+ N/A

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

      4. div-sub N/A

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

      5. lower-+.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower--.f64 N/A

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

      8. +-commutative N/A

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

      9. lower-+.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 94.3

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

   5. Applied rewrites 94.3%

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

   7. Applied rewrites 94.3%

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

Alternative 9: 83.6% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* 2.0 i)))
        (t_1 (/ (/ (* (+ alpha beta) (- beta alpha)) t_0) (+ t_0 2.0))))
   (if (<= t_1 -0.5)
     (pow alpha -1.0)
     (if (<= t_1 1e-166) 0.5 (fma (/ beta (+ 2.0 beta)) 0.5 0.5)))))

C

double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	double t_1 = (((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0);
	double tmp;
	if (t_1 <= -0.5) {
		tmp = pow(alpha, -1.0);
	} else if (t_1 <= 1e-166) {
		tmp = 0.5;
	} else {
		tmp = fma((beta / (2.0 + beta)), 0.5, 0.5);
	}
	return tmp;
}

Julia

function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * i))
	t_1 = Float64(Float64(Float64(Float64(alpha + beta) * Float64(beta - alpha)) / t_0) / Float64(t_0 + 2.0))
	tmp = 0.0
	if (t_1 <= -0.5)
		tmp = alpha ^ -1.0;
	elseif (t_1 <= 1e-166)
		tmp = 0.5;
	else
		tmp = fma(Float64(beta / Float64(2.0 + beta)), 0.5, 0.5);
	end
	return tmp
end

Wolfram

code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(N[(alpha + beta), $MachinePrecision] * N[(beta - alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -0.5], N[Power[alpha, -1.0], $MachinePrecision], If[LessEqual[t$95$1, 1e-166], 0.5, N[(N[(beta / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] * 0.5 + 0.5), $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.5

   1. Initial program 5.4%

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

   3. Taylor expanded in alpha around -inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   5. Applied rewrites 95.7%

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

   6. Taylor expanded in beta around 0

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

   8. Applied rewrites 76.2%

      \[\leadsto \frac{\mathsf{fma}\left(4, i, 2\right)}{\alpha} \cdot \color{blue}{0.5} \]

   9. Taylor expanded in i around 0

      \[\leadsto \frac{1}{\alpha} \]
   10. Step-by-step derivation

   11. Applied rewrites 58.6%

       \[\leadsto \frac{1}{\alpha} \]

   if -0.5 < (/.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.00000000000000004e-166

   1. Initial program 100.0%

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

   3. Taylor expanded in i around inf

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

   5. Applied rewrites 97.5%

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

   if 1.00000000000000004e-166 < (/.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 63.1%

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

   3. Taylor expanded in i around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. associate--l+ N/A

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

      4. div-sub N/A

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

      5. lower-+.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower--.f64 N/A

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

      8. +-commutative N/A

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

      9. lower-+.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 94.3

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

   5. Applied rewrites 94.3%

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

   6. Taylor expanded in alpha around 0

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

   8. Applied rewrites 90.9%

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

   10. Applied rewrites 90.9%

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

4. Final simplification 87.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} \leq -0.5:\\ \;\;\;\;{\alpha}^{-1}\\ \mathbf{elif}\;\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} \leq 10^{-166}:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{\beta}{2 + \beta}, 0.5, 0.5\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 84.6% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* 2.0 i)))
        (t_1 (/ (/ (* (+ alpha beta) (- beta alpha)) t_0) (+ t_0 2.0))))
   (if (<= t_1 -0.5) (pow alpha -1.0) (if (<= t_1 0.01) 0.5 1.0))))

C

double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	double t_1 = (((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0);
	double tmp;
	if (t_1 <= -0.5) {
		tmp = pow(alpha, -1.0);
	} else if (t_1 <= 0.01) {
		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) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = (alpha + beta) + (2.0d0 * i)
    t_1 = (((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0d0)
    if (t_1 <= (-0.5d0)) then
        tmp = alpha ** (-1.0d0)
    else if (t_1 <= 0.01d0) 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 t_0 = (alpha + beta) + (2.0 * i);
	double t_1 = (((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0);
	double tmp;
	if (t_1 <= -0.5) {
		tmp = Math.pow(alpha, -1.0);
	} else if (t_1 <= 0.01) {
		tmp = 0.5;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(alpha, beta, i):
	t_0 = (alpha + beta) + (2.0 * i)
	t_1 = (((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0)
	tmp = 0
	if t_1 <= -0.5:
		tmp = math.pow(alpha, -1.0)
	elif t_1 <= 0.01:
		tmp = 0.5
	else:
		tmp = 1.0
	return tmp

Julia

function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * i))
	t_1 = Float64(Float64(Float64(Float64(alpha + beta) * Float64(beta - alpha)) / t_0) / Float64(t_0 + 2.0))
	tmp = 0.0
	if (t_1 <= -0.5)
		tmp = alpha ^ -1.0;
	elseif (t_1 <= 0.01)
		tmp = 0.5;
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(alpha, beta, i)
	t_0 = (alpha + beta) + (2.0 * i);
	t_1 = (((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0);
	tmp = 0.0;
	if (t_1 <= -0.5)
		tmp = alpha ^ -1.0;
	elseif (t_1 <= 0.01)
		tmp = 0.5;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

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

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.5

   1. Initial program 5.4%

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

   3. Taylor expanded in alpha around -inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   5. Applied rewrites 95.7%

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

   6. Taylor expanded in beta around 0

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

   8. Applied rewrites 76.2%

      \[\leadsto \frac{\mathsf{fma}\left(4, i, 2\right)}{\alpha} \cdot \color{blue}{0.5} \]

   9. Taylor expanded in i around 0

      \[\leadsto \frac{1}{\alpha} \]
   10. Step-by-step derivation

   11. Applied rewrites 58.6%

       \[\leadsto \frac{1}{\alpha} \]

   if -0.5 < (/.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.0100000000000000002

   1. Initial program 100.0%

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

   3. Taylor expanded in i around inf

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

   5. Applied rewrites 96.7%

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

   if 0.0100000000000000002 < (/.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 41.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. Add Preprocessing

   3. Taylor expanded in beta around inf

      \[\leadsto \color{blue}{1} \]
   4. Step-by-step derivation

   5. Applied rewrites 87.6%

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

4. Final simplification 86.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}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} \leq -0.5:\\ \;\;\;\;{\alpha}^{-1}\\ \mathbf{elif}\;\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} \leq 0.01:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 94.1% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* 2.0 i)))
        (t_1 (/ (/ (* (+ alpha beta) (- beta alpha)) t_0) (+ t_0 2.0))))
   (if (<= t_1 -0.5)
     (* (/ (+ (fma 4.0 i (* 2.0 beta)) 2.0) alpha) 0.5)
     (if (<= t_1 1e-166)
       0.5
       (fma (/ (- beta alpha) (+ (+ beta alpha) 2.0)) 0.5 0.5)))))

C

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

Julia

function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * i))
	t_1 = Float64(Float64(Float64(Float64(alpha + beta) * Float64(beta - alpha)) / t_0) / Float64(t_0 + 2.0))
	tmp = 0.0
	if (t_1 <= -0.5)
		tmp = Float64(Float64(Float64(fma(4.0, i, Float64(2.0 * beta)) + 2.0) / alpha) * 0.5);
	elseif (t_1 <= 1e-166)
		tmp = 0.5;
	else
		tmp = fma(Float64(Float64(beta - alpha) / Float64(Float64(beta + alpha) + 2.0)), 0.5, 0.5);
	end
	return tmp
end

Wolfram

code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(N[(alpha + beta), $MachinePrecision] * N[(beta - alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -0.5], N[(N[(N[(N[(4.0 * i + N[(2.0 * beta), $MachinePrecision]), $MachinePrecision] + 2.0), $MachinePrecision] / alpha), $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[t$95$1, 1e-166], 0.5, N[(N[(N[(beta - alpha), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] * 0.5 + 0.5), $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.5

   1. Initial program 5.4%

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

   3. Taylor expanded in alpha around inf

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

      1. *-commutative N/A

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

      2. distribute-rgt1-in N/A

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

      3. metadata-eval N/A

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

      4. mul0-lft N/A

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

      5. neg-sub0 N/A

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

      6. mul-1-neg N/A

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

      7. remove-double-neg N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. +-commutative N/A

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

      13. lower-fma.f64 N/A

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

      14. lower-*.f64 95.7

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

   5. Applied rewrites 95.7%

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

   if -0.5 < (/.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.00000000000000004e-166

   1. Initial program 100.0%

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

   3. Taylor expanded in i around inf

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

   5. Applied rewrites 97.5%

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

   if 1.00000000000000004e-166 < (/.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 63.1%

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

   3. Taylor expanded in i around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. associate--l+ N/A

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

      4. div-sub N/A

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

      5. lower-+.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower--.f64 N/A

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

      8. +-commutative N/A

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

      9. lower-+.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 94.3

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

   5. Applied rewrites 94.3%

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

   7. Applied rewrites 94.3%

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

Alternative 12: 94.0% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* 2.0 i)))
        (t_1 (/ (/ (* (+ alpha beta) (- beta alpha)) t_0) (+ t_0 2.0))))
   (if (<= t_1 -0.5)
     (* (- -2.0 (* (fma i 2.0 beta) 2.0)) (/ -0.5 alpha))
     (if (<= t_1 1e-166)
       0.5
       (fma (/ (- beta alpha) (+ (+ beta alpha) 2.0)) 0.5 0.5)))))

C

double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	double t_1 = (((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0);
	double tmp;
	if (t_1 <= -0.5) {
		tmp = (-2.0 - (fma(i, 2.0, beta) * 2.0)) * (-0.5 / alpha);
	} else if (t_1 <= 1e-166) {
		tmp = 0.5;
	} else {
		tmp = fma(((beta - alpha) / ((beta + alpha) + 2.0)), 0.5, 0.5);
	}
	return tmp;
}

Julia

function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * i))
	t_1 = Float64(Float64(Float64(Float64(alpha + beta) * Float64(beta - alpha)) / t_0) / Float64(t_0 + 2.0))
	tmp = 0.0
	if (t_1 <= -0.5)
		tmp = Float64(Float64(-2.0 - Float64(fma(i, 2.0, beta) * 2.0)) * Float64(-0.5 / alpha));
	elseif (t_1 <= 1e-166)
		tmp = 0.5;
	else
		tmp = fma(Float64(Float64(beta - alpha) / Float64(Float64(beta + alpha) + 2.0)), 0.5, 0.5);
	end
	return tmp
end

Wolfram

code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(N[(alpha + beta), $MachinePrecision] * N[(beta - alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -0.5], N[(N[(-2.0 - N[(N[(i * 2.0 + beta), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision] * N[(-0.5 / alpha), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1e-166], 0.5, N[(N[(N[(beta - alpha), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] * 0.5 + 0.5), $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.5

   1. Initial program 5.4%

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

   3. Taylor expanded in alpha around -inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   5. Applied rewrites 95.7%

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

   7. Applied rewrites 95.5%

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

   if -0.5 < (/.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.00000000000000004e-166

   1. Initial program 100.0%

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

   3. Taylor expanded in i around inf

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

   5. Applied rewrites 97.5%

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

   if 1.00000000000000004e-166 < (/.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 63.1%

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

   3. Taylor expanded in i around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. associate--l+ N/A

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

      4. div-sub N/A

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

      5. lower-+.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower--.f64 N/A

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

      8. +-commutative N/A

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

      9. lower-+.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 94.3

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

   5. Applied rewrites 94.3%

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

   7. Applied rewrites 94.3%

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

Alternative 13: 91.3% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(N[(alpha + beta), $MachinePrecision] * N[(beta - alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -0.5], N[(N[(N[(4.0 * i + 2.0), $MachinePrecision] / alpha), $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[t$95$1, 0.002], 0.5, N[(N[(beta / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] * 0.5 + 0.5), $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.5

   1. Initial program 5.4%

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

   3. Taylor expanded in alpha around -inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   5. Applied rewrites 95.7%

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

   6. Taylor expanded in beta around 0

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

   8. Applied rewrites 76.2%

      \[\leadsto \frac{\mathsf{fma}\left(4, i, 2\right)}{\alpha} \cdot \color{blue}{0.5} \]

   if -0.5 < (/.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-3

   1. Initial program 100.0%

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

   3. Taylor expanded in i around inf

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

   5. Applied rewrites 97.2%

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

   if 2e-3 < (/.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 43.1%

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

   3. Taylor expanded in i around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. associate--l+ N/A

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

      4. div-sub N/A

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

      5. lower-+.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower--.f64 N/A

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

      8. +-commutative N/A

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

      9. lower-+.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 91.2

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

   5. Applied rewrites 91.2%

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

   6. Taylor expanded in alpha around 0

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

   8. Applied rewrites 88.6%

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

   10. Applied rewrites 88.6%

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

Alternative 14: 97.1% accurate, 0.6× 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}}{t\_0 + 2} \leq -0.5:\\ \;\;\;\;\frac{\mathsf{fma}\left(4, i, 2 \cdot \beta\right) + 2}{\alpha} \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \mathsf{fma}\left(\frac{\beta}{\mathsf{fma}\left(2, i, \beta\right) + 2}, \frac{\beta}{\mathsf{fma}\left(2, i, \beta\right)}, 1\right)\\ \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) (+ t_0 2.0)) -0.5)
     (* (/ (+ (fma 4.0 i (* 2.0 beta)) 2.0) alpha) 0.5)
     (*
      0.5
      (fma (/ beta (+ (fma 2.0 i beta) 2.0)) (/ beta (fma 2.0 i beta)) 1.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) / (t_0 + 2.0)) <= -0.5) {
		tmp = ((fma(4.0, i, (2.0 * beta)) + 2.0) / alpha) * 0.5;
	} else {
		tmp = 0.5 * fma((beta / (fma(2.0, i, beta) + 2.0)), (beta / fma(2.0, i, beta)), 1.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(t_0 + 2.0)) <= -0.5)
		tmp = Float64(Float64(Float64(fma(4.0, i, Float64(2.0 * beta)) + 2.0) / alpha) * 0.5);
	else
		tmp = Float64(0.5 * fma(Float64(beta / Float64(fma(2.0, i, beta) + 2.0)), Float64(beta / fma(2.0, i, beta)), 1.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[(t$95$0 + 2.0), $MachinePrecision]), $MachinePrecision], -0.5], N[(N[(N[(N[(4.0 * i + N[(2.0 * beta), $MachinePrecision]), $MachinePrecision] + 2.0), $MachinePrecision] / alpha), $MachinePrecision] * 0.5), $MachinePrecision], N[(0.5 * N[(N[(beta / N[(N[(2.0 * i + beta), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] * N[(beta / N[(2.0 * i + beta), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $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.5

   1. Initial program 5.4%

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

   3. Taylor expanded in alpha around inf

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

      1. *-commutative N/A

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

      2. distribute-rgt1-in N/A

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

      3. metadata-eval N/A

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

      4. mul0-lft N/A

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

      5. neg-sub0 N/A

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

      6. mul-1-neg N/A

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

      7. remove-double-neg N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. +-commutative N/A

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

      13. lower-fma.f64 N/A

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

      14. lower-*.f64 95.7

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

   5. Applied rewrites 95.7%

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

   if -0.5 < (/.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 86.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. Add Preprocessing

   3. Taylor expanded in alpha around 0

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

      1. lower-*.f64 N/A

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

      2. +-commutative N/A

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

      3. unpow2 N/A

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

      4. times-frac N/A

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

      5. lower-fma.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 N/A

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

      9. +-commutative N/A

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

      10. lower-fma.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. +-commutative N/A

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

      13. lower-fma.f64 97.8

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

   5. Applied rewrites 97.8%

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

Alternative 15: 76.1% accurate, 1.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}}{t\_0 + 2} \leq 0.5:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;1\\ \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) (+ t_0 2.0)) 0.5)
     0.5
     1.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) / (t_0 + 2.0)) <= 0.5) {
		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) :: t_0
    real(8) :: tmp
    t_0 = (alpha + beta) + (2.0d0 * i)
    if (((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0d0)) <= 0.5d0) 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 t_0 = (alpha + beta) + (2.0 * i);
	double tmp;
	if (((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0)) <= 0.5) {
		tmp = 0.5;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(alpha, beta, i):
	t_0 = (alpha + beta) + (2.0 * i)
	tmp = 0
	if ((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0)) <= 0.5:
		tmp = 0.5
	else:
		tmp = 1.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(t_0 + 2.0)) <= 0.5)
		tmp = 0.5;
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

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

Wolfram

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

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.5

   1. Initial program 74.4%

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

   3. Taylor expanded in i around inf

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

   5. Applied rewrites 72.6%

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

   if 0.5 < (/.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 41.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. Add Preprocessing

   3. Taylor expanded in beta around inf

      \[\leadsto \color{blue}{1} \]
   4. Step-by-step derivation

   5. Applied rewrites 87.6%

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

Alternative 16: 60.6% accurate, 73.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 68.7%

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

3. Taylor expanded in i around inf

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

5. Applied rewrites 64.4%

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

Reproduce

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