Octave 3.8, jcobi/1

Percentage Accurate: 74.7% → 99.6%

Time: 9.5s

Alternatives: 14

Speedup: 1.7×

Specification

\[\alpha > -1 \land \beta > -1\]

Math

\[\begin{array}{l} \\ \frac{\frac{\beta - \alpha}{\left(\alpha + \beta\right) + 2} + 1}{2} \end{array} \]

FPCore

(FPCore (alpha beta)
 :precision binary64
 (/ (+ (/ (- beta alpha) (+ (+ alpha beta) 2.0)) 1.0) 2.0))

C

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

Fortran

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

Java

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

Python

def code(alpha, beta):
	return (((beta - alpha) / ((alpha + beta) + 2.0)) + 1.0) / 2.0

Julia

function code(alpha, beta)
	return Float64(Float64(Float64(Float64(beta - alpha) / Float64(Float64(alpha + beta) + 2.0)) + 1.0) / 2.0)
end

MATLAB

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

Wolfram

code[alpha_, beta_] := N[(N[(N[(N[(beta - alpha), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / 2.0), $MachinePrecision]

Initial Program: 74.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{\frac{\beta - \alpha}{\left(\alpha + \beta\right) + 2} + 1}{2} \end{array} \]

FPCore

(FPCore (alpha beta)
 :precision binary64
 (/ (+ (/ (- beta alpha) (+ (+ alpha beta) 2.0)) 1.0) 2.0))

C

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

Fortran

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

Java

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

Python

def code(alpha, beta):
	return (((beta - alpha) / ((alpha + beta) + 2.0)) + 1.0) / 2.0

Julia

function code(alpha, beta)
	return Float64(Float64(Float64(Float64(beta - alpha) / Float64(Float64(alpha + beta) + 2.0)) + 1.0) / 2.0)
end

MATLAB

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

Wolfram

code[alpha_, beta_] := N[(N[(N[(N[(beta - alpha), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / 2.0), $MachinePrecision]

Alternative 1: 99.6% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{\beta - \alpha}{\left(\beta + \alpha\right) + 2} \leq -0.5:\\ \;\;\;\;\frac{\mathsf{fma}\left(\beta + 2, \frac{\beta + 1}{\alpha}, -1 - \beta\right)}{-\alpha}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\beta - \alpha, \frac{0.5}{\beta + \left(\alpha + 2\right)}, 0.5\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta)
 :precision binary64
 (if (<= (/ (- beta alpha) (+ (+ beta alpha) 2.0)) -0.5)
   (/ (fma (+ beta 2.0) (/ (+ beta 1.0) alpha) (- -1.0 beta)) (- alpha))
   (fma (- beta alpha) (/ 0.5 (+ beta (+ alpha 2.0))) 0.5)))

C

double code(double alpha, double beta) {
	double tmp;
	if (((beta - alpha) / ((beta + alpha) + 2.0)) <= -0.5) {
		tmp = fma((beta + 2.0), ((beta + 1.0) / alpha), (-1.0 - beta)) / -alpha;
	} else {
		tmp = fma((beta - alpha), (0.5 / (beta + (alpha + 2.0))), 0.5);
	}
	return tmp;
}

Julia

function code(alpha, beta)
	tmp = 0.0
	if (Float64(Float64(beta - alpha) / Float64(Float64(beta + alpha) + 2.0)) <= -0.5)
		tmp = Float64(fma(Float64(beta + 2.0), Float64(Float64(beta + 1.0) / alpha), Float64(-1.0 - beta)) / Float64(-alpha));
	else
		tmp = fma(Float64(beta - alpha), Float64(0.5 / Float64(beta + Float64(alpha + 2.0))), 0.5);
	end
	return tmp
end

Wolfram

code[alpha_, beta_] := If[LessEqual[N[(N[(beta - alpha), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision], -0.5], N[(N[(N[(beta + 2.0), $MachinePrecision] * N[(N[(beta + 1.0), $MachinePrecision] / alpha), $MachinePrecision] + N[(-1.0 - beta), $MachinePrecision]), $MachinePrecision] / (-alpha)), $MachinePrecision], N[(N[(beta - alpha), $MachinePrecision] * N[(0.5 / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 0.5), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) < -0.5

   1. Initial program 7.5%

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

   3. Taylor expanded in alpha around inf

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

      1. lower-/.f64 N/A

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

   5. Applied rewrites 99.7%

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

   6. Taylor expanded in alpha around -inf

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

   8. Applied rewrites 99.7%

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

   if -0.5 < (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64)))

   1. Initial program 100.0%

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

      1. lift-/.f64 N/A

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

      2. clear-num N/A

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

      3. associate-/r/ N/A

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

      4. lift-+.f64 N/A

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

      5. distribute-rgt-in N/A

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

      6. metadata-eval N/A

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

      7. metadata-eval N/A

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

      8. metadata-eval N/A

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

      9. lower-fma.f64 N/A

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

      10. lift-+.f64 N/A

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

      11. lift-+.f64 N/A

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

      12. +-commutative N/A

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

      13. associate-+l+ N/A

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

      14. lower-+.f64 N/A

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

      15. lower-+.f64 N/A

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

      16. metadata-eval N/A

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

      17. metadata-eval 100.0

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

   4. Applied rewrites 100.0%

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

      1. lift-fma.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*l/ N/A

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

      4. associate-/l* N/A

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

      5. lower-fma.f64 N/A

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

      6. lower-/.f64 100.0

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

   6. Applied rewrites 100.0%

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

4. Final simplification 99.9%

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

Alternative 2: 97.7% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\beta - \alpha}{\left(\beta + \alpha\right) + 2}\\ \mathbf{if}\;t\_0 \leq -0.5:\\ \;\;\;\;\frac{\beta + 1}{\alpha}\\ \mathbf{elif}\;t\_0 \leq 0.05:\\ \;\;\;\;\mathsf{fma}\left(\beta, \mathsf{fma}\left(\beta, \mathsf{fma}\left(\beta, 0.0625, -0.125\right), 0.25\right), 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{\beta + \left(-1 - \alpha\right)}{\beta}\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta)
 :precision binary64
 (let* ((t_0 (/ (- beta alpha) (+ (+ beta alpha) 2.0))))
   (if (<= t_0 -0.5)
     (/ (+ beta 1.0) alpha)
     (if (<= t_0 0.05)
       (fma beta (fma beta (fma beta 0.0625 -0.125) 0.25) 0.5)
       (/ (+ beta (- -1.0 alpha)) beta)))))

C

double code(double alpha, double beta) {
	double t_0 = (beta - alpha) / ((beta + alpha) + 2.0);
	double tmp;
	if (t_0 <= -0.5) {
		tmp = (beta + 1.0) / alpha;
	} else if (t_0 <= 0.05) {
		tmp = fma(beta, fma(beta, fma(beta, 0.0625, -0.125), 0.25), 0.5);
	} else {
		tmp = (beta + (-1.0 - alpha)) / beta;
	}
	return tmp;
}

Julia

function code(alpha, beta)
	t_0 = Float64(Float64(beta - alpha) / Float64(Float64(beta + alpha) + 2.0))
	tmp = 0.0
	if (t_0 <= -0.5)
		tmp = Float64(Float64(beta + 1.0) / alpha);
	elseif (t_0 <= 0.05)
		tmp = fma(beta, fma(beta, fma(beta, 0.0625, -0.125), 0.25), 0.5);
	else
		tmp = Float64(Float64(beta + Float64(-1.0 - alpha)) / beta);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) < -0.5

   1. Initial program 7.5%

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

   3. Taylor expanded in alpha around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. distribute-lft-in N/A

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

      4. metadata-eval N/A

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

      5. associate-*r* N/A

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

      6. metadata-eval N/A

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

      7. *-lft-identity N/A

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

      8. lower-+.f64 98.6

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

   5. Applied rewrites 98.6%

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

   if -0.5 < (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) < 0.050000000000000003

   1. Initial program 100.0%

      \[\frac{\frac{\beta - \alpha}{\left(\alpha + \beta\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 + \beta}\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. metadata-eval N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-+.f64 99.2

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

   5. Applied rewrites 99.2%

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

   6. Taylor expanded in beta around 0

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

   8. Applied rewrites 98.7%

      \[\leadsto \mathsf{fma}\left(\beta, \color{blue}{\mathsf{fma}\left(\beta, \mathsf{fma}\left(\beta, 0.0625, -0.125\right), 0.25\right)}, 0.5\right) \]

   if 0.050000000000000003 < (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64)))

   1. Initial program 100.0%

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

   3. Taylor expanded in beta around -inf

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. sub-neg N/A

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

      5. neg-mul-1 N/A

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

      6. +-commutative N/A

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

      7. mul-1-neg N/A

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

      8. sub-neg N/A

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

      9. lower--.f64 N/A

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

      10. distribute-lft-in N/A

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

      11. mul-1-neg N/A

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

      12. unsub-neg N/A

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

      13. lower--.f64 N/A

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

      14. metadata-eval 96.2

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

   5. Applied rewrites 96.2%

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

   6. Taylor expanded in beta around 0

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

   8. Applied rewrites 96.2%

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

4. Final simplification 98.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\beta - \alpha}{\left(\beta + \alpha\right) + 2} \leq -0.5:\\ \;\;\;\;\frac{\beta + 1}{\alpha}\\ \mathbf{elif}\;\frac{\beta - \alpha}{\left(\beta + \alpha\right) + 2} \leq 0.05:\\ \;\;\;\;\mathsf{fma}\left(\beta, \mathsf{fma}\left(\beta, \mathsf{fma}\left(\beta, 0.0625, -0.125\right), 0.25\right), 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{\beta + \left(-1 - \alpha\right)}{\beta}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 98.0% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (alpha beta)
 :precision binary64
 (let* ((t_0 (/ (- beta alpha) (+ (+ beta alpha) 2.0))))
   (if (<= t_0 -0.9999995)
     (/ (+ beta 1.0) alpha)
     (if (<= t_0 0.05)
       (/ 1.0 (+ alpha 2.0))
       (/ (+ beta (- -1.0 alpha)) beta)))))

C

double code(double alpha, double beta) {
	double t_0 = (beta - alpha) / ((beta + alpha) + 2.0);
	double tmp;
	if (t_0 <= -0.9999995) {
		tmp = (beta + 1.0) / alpha;
	} else if (t_0 <= 0.05) {
		tmp = 1.0 / (alpha + 2.0);
	} else {
		tmp = (beta + (-1.0 - alpha)) / beta;
	}
	return tmp;
}

Fortran

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

Java

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

Python

def code(alpha, beta):
	t_0 = (beta - alpha) / ((beta + alpha) + 2.0)
	tmp = 0
	if t_0 <= -0.9999995:
		tmp = (beta + 1.0) / alpha
	elif t_0 <= 0.05:
		tmp = 1.0 / (alpha + 2.0)
	else:
		tmp = (beta + (-1.0 - alpha)) / beta
	return tmp

Julia

function code(alpha, beta)
	t_0 = Float64(Float64(beta - alpha) / Float64(Float64(beta + alpha) + 2.0))
	tmp = 0.0
	if (t_0 <= -0.9999995)
		tmp = Float64(Float64(beta + 1.0) / alpha);
	elseif (t_0 <= 0.05)
		tmp = Float64(1.0 / Float64(alpha + 2.0));
	else
		tmp = Float64(Float64(beta + Float64(-1.0 - alpha)) / beta);
	end
	return tmp
end

MATLAB

function tmp_2 = code(alpha, beta)
	t_0 = (beta - alpha) / ((beta + alpha) + 2.0);
	tmp = 0.0;
	if (t_0 <= -0.9999995)
		tmp = (beta + 1.0) / alpha;
	elseif (t_0 <= 0.05)
		tmp = 1.0 / (alpha + 2.0);
	else
		tmp = (beta + (-1.0 - alpha)) / beta;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) < -0.999999500000000041

   1. Initial program 6.5%

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

   3. Taylor expanded in alpha around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. distribute-lft-in N/A

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

      4. metadata-eval N/A

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

      5. associate-*r* N/A

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

      6. metadata-eval N/A

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

      7. *-lft-identity N/A

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

      8. lower-+.f64 99.4

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

   5. Applied rewrites 99.4%

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

   if -0.999999500000000041 < (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) < 0.050000000000000003

   1. Initial program 99.8%

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

   3. Taylor expanded in alpha around inf

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

      1. lower-/.f64 N/A

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

   5. Applied rewrites 1.5%

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

   7. Applied rewrites 1.5%

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

   8. Taylor expanded in alpha around inf

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

   10. Applied rewrites 99.7%

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

   11. Taylor expanded in beta around 0

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

   13. Applied rewrites 98.2%

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

   if 0.050000000000000003 < (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64)))

   1. Initial program 100.0%

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

   3. Taylor expanded in beta around -inf

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. sub-neg N/A

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

      5. neg-mul-1 N/A

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

      6. +-commutative N/A

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

      7. mul-1-neg N/A

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

      8. sub-neg N/A

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

      9. lower--.f64 N/A

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

      10. distribute-lft-in N/A

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

      11. mul-1-neg N/A

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

      12. unsub-neg N/A

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

      13. lower--.f64 N/A

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

      14. metadata-eval 96.2

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

   5. Applied rewrites 96.2%

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

   6. Taylor expanded in beta around 0

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

   8. Applied rewrites 96.2%

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

4. Final simplification 97.9%

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

Alternative 4: 97.9% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (alpha beta)
 :precision binary64
 (let* ((t_0 (/ (- beta alpha) (+ (+ beta alpha) 2.0))))
   (if (<= t_0 -0.9999995)
     (/ (+ beta 1.0) alpha)
     (if (<= t_0 0.05) (/ 1.0 (+ alpha 2.0)) (+ 1.0 (/ -1.0 beta))))))

C

double code(double alpha, double beta) {
	double t_0 = (beta - alpha) / ((beta + alpha) + 2.0);
	double tmp;
	if (t_0 <= -0.9999995) {
		tmp = (beta + 1.0) / alpha;
	} else if (t_0 <= 0.05) {
		tmp = 1.0 / (alpha + 2.0);
	} else {
		tmp = 1.0 + (-1.0 / beta);
	}
	return tmp;
}

Fortran

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

Java

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

Python

def code(alpha, beta):
	t_0 = (beta - alpha) / ((beta + alpha) + 2.0)
	tmp = 0
	if t_0 <= -0.9999995:
		tmp = (beta + 1.0) / alpha
	elif t_0 <= 0.05:
		tmp = 1.0 / (alpha + 2.0)
	else:
		tmp = 1.0 + (-1.0 / beta)
	return tmp

Julia

function code(alpha, beta)
	t_0 = Float64(Float64(beta - alpha) / Float64(Float64(beta + alpha) + 2.0))
	tmp = 0.0
	if (t_0 <= -0.9999995)
		tmp = Float64(Float64(beta + 1.0) / alpha);
	elseif (t_0 <= 0.05)
		tmp = Float64(1.0 / Float64(alpha + 2.0));
	else
		tmp = Float64(1.0 + Float64(-1.0 / beta));
	end
	return tmp
end

MATLAB

function tmp_2 = code(alpha, beta)
	t_0 = (beta - alpha) / ((beta + alpha) + 2.0);
	tmp = 0.0;
	if (t_0 <= -0.9999995)
		tmp = (beta + 1.0) / alpha;
	elseif (t_0 <= 0.05)
		tmp = 1.0 / (alpha + 2.0);
	else
		tmp = 1.0 + (-1.0 / beta);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) < -0.999999500000000041

   1. Initial program 6.5%

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

   3. Taylor expanded in alpha around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. distribute-lft-in N/A

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

      4. metadata-eval N/A

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

      5. associate-*r* N/A

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

      6. metadata-eval N/A

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

      7. *-lft-identity N/A

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

      8. lower-+.f64 99.4

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

   5. Applied rewrites 99.4%

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

   if -0.999999500000000041 < (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) < 0.050000000000000003

   1. Initial program 99.8%

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

   3. Taylor expanded in alpha around inf

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

      1. lower-/.f64 N/A

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

   5. Applied rewrites 1.5%

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

   7. Applied rewrites 1.5%

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

   8. Taylor expanded in alpha around inf

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

   10. Applied rewrites 99.7%

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

   11. Taylor expanded in beta around 0

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

   13. Applied rewrites 98.2%

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

   if 0.050000000000000003 < (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64)))

   1. Initial program 100.0%

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

   3. Taylor expanded in beta around -inf

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. sub-neg N/A

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

      5. neg-mul-1 N/A

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

      6. +-commutative N/A

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

      7. mul-1-neg N/A

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

      8. sub-neg N/A

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

      9. lower--.f64 N/A

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

      10. distribute-lft-in N/A

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

      11. mul-1-neg N/A

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

      12. unsub-neg N/A

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

      13. lower--.f64 N/A

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

      14. metadata-eval 96.2

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

   5. Applied rewrites 96.2%

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

   6. Taylor expanded in alpha around 0

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

   8. Applied rewrites 95.1%

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

4. Final simplification 97.6%

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

Alternative 5: 92.0% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\beta - \alpha}{\left(\beta + \alpha\right) + 2}\\ \mathbf{if}\;t\_0 \leq -0.5:\\ \;\;\;\;\frac{1}{\alpha}\\ \mathbf{elif}\;t\_0 \leq 0.05:\\ \;\;\;\;\mathsf{fma}\left(\beta, \mathsf{fma}\left(\beta, -0.125, 0.25\right), 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;1 + \frac{-1}{\beta}\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta)
 :precision binary64
 (let* ((t_0 (/ (- beta alpha) (+ (+ beta alpha) 2.0))))
   (if (<= t_0 -0.5)
     (/ 1.0 alpha)
     (if (<= t_0 0.05)
       (fma beta (fma beta -0.125 0.25) 0.5)
       (+ 1.0 (/ -1.0 beta))))))

C

double code(double alpha, double beta) {
	double t_0 = (beta - alpha) / ((beta + alpha) + 2.0);
	double tmp;
	if (t_0 <= -0.5) {
		tmp = 1.0 / alpha;
	} else if (t_0 <= 0.05) {
		tmp = fma(beta, fma(beta, -0.125, 0.25), 0.5);
	} else {
		tmp = 1.0 + (-1.0 / beta);
	}
	return tmp;
}

Julia

function code(alpha, beta)
	t_0 = Float64(Float64(beta - alpha) / Float64(Float64(beta + alpha) + 2.0))
	tmp = 0.0
	if (t_0 <= -0.5)
		tmp = Float64(1.0 / alpha);
	elseif (t_0 <= 0.05)
		tmp = fma(beta, fma(beta, -0.125, 0.25), 0.5);
	else
		tmp = Float64(1.0 + Float64(-1.0 / beta));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) < -0.5

   1. Initial program 7.5%

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

   3. Taylor expanded in alpha around inf

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

      1. lower-/.f64 N/A

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

   5. Applied rewrites 99.7%

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

   6. Taylor expanded in beta around 0

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

   8. Applied rewrites 76.8%

      \[\leadsto \frac{1 + \frac{-2}{\alpha}}{\alpha} \]

   9. Taylor expanded in alpha around inf

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

   11. Applied rewrites 76.1%

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

   if -0.5 < (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) < 0.050000000000000003

   1. Initial program 100.0%

      \[\frac{\frac{\beta - \alpha}{\left(\alpha + \beta\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 + \beta}\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. metadata-eval N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-+.f64 99.2

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

   5. Applied rewrites 99.2%

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

   6. Taylor expanded in beta around 0

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

   8. Applied rewrites 98.6%

      \[\leadsto \mathsf{fma}\left(\beta, \color{blue}{\mathsf{fma}\left(\beta, -0.125, 0.25\right)}, 0.5\right) \]

   if 0.050000000000000003 < (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64)))

   1. Initial program 100.0%

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

   3. Taylor expanded in beta around -inf

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. sub-neg N/A

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

      5. neg-mul-1 N/A

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

      6. +-commutative N/A

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

      7. mul-1-neg N/A

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

      8. sub-neg N/A

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

      9. lower--.f64 N/A

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

      10. distribute-lft-in N/A

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

      11. mul-1-neg N/A

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

      12. unsub-neg N/A

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

      13. lower--.f64 N/A

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

      14. metadata-eval 96.2

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

   5. Applied rewrites 96.2%

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

   6. Taylor expanded in alpha around 0

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

   8. Applied rewrites 95.1%

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

4. Final simplification 91.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\beta - \alpha}{\left(\beta + \alpha\right) + 2} \leq -0.5:\\ \;\;\;\;\frac{1}{\alpha}\\ \mathbf{elif}\;\frac{\beta - \alpha}{\left(\beta + \alpha\right) + 2} \leq 0.05:\\ \;\;\;\;\mathsf{fma}\left(\beta, \mathsf{fma}\left(\beta, -0.125, 0.25\right), 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;1 + \frac{-1}{\beta}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 91.8% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\beta - \alpha}{\left(\beta + \alpha\right) + 2}\\ \mathbf{if}\;t\_0 \leq -0.5:\\ \;\;\;\;\frac{1}{\alpha}\\ \mathbf{elif}\;t\_0 \leq 0.05:\\ \;\;\;\;\mathsf{fma}\left(\beta, \mathsf{fma}\left(\beta, -0.125, 0.25\right), 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta)
 :precision binary64
 (let* ((t_0 (/ (- beta alpha) (+ (+ beta alpha) 2.0))))
   (if (<= t_0 -0.5)
     (/ 1.0 alpha)
     (if (<= t_0 0.05) (fma beta (fma beta -0.125 0.25) 0.5) 1.0))))

C

double code(double alpha, double beta) {
	double t_0 = (beta - alpha) / ((beta + alpha) + 2.0);
	double tmp;
	if (t_0 <= -0.5) {
		tmp = 1.0 / alpha;
	} else if (t_0 <= 0.05) {
		tmp = fma(beta, fma(beta, -0.125, 0.25), 0.5);
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Julia

function code(alpha, beta)
	t_0 = Float64(Float64(beta - alpha) / Float64(Float64(beta + alpha) + 2.0))
	tmp = 0.0
	if (t_0 <= -0.5)
		tmp = Float64(1.0 / alpha);
	elseif (t_0 <= 0.05)
		tmp = fma(beta, fma(beta, -0.125, 0.25), 0.5);
	else
		tmp = 1.0;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) < -0.5

   1. Initial program 7.5%

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

   3. Taylor expanded in alpha around inf

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

      1. lower-/.f64 N/A

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

   5. Applied rewrites 99.7%

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

   6. Taylor expanded in beta around 0

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

   8. Applied rewrites 76.8%

      \[\leadsto \frac{1 + \frac{-2}{\alpha}}{\alpha} \]

   9. Taylor expanded in alpha around inf

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

   11. Applied rewrites 76.1%

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

   if -0.5 < (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) < 0.050000000000000003

   1. Initial program 100.0%

      \[\frac{\frac{\beta - \alpha}{\left(\alpha + \beta\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 + \beta}\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. metadata-eval N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-+.f64 99.2

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

   5. Applied rewrites 99.2%

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

   6. Taylor expanded in beta around 0

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

   8. Applied rewrites 98.6%

      \[\leadsto \mathsf{fma}\left(\beta, \color{blue}{\mathsf{fma}\left(\beta, -0.125, 0.25\right)}, 0.5\right) \]

   if 0.050000000000000003 < (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64)))

   1. Initial program 100.0%

      \[\frac{\frac{\beta - \alpha}{\left(\alpha + \beta\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 94.4%

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

4. Final simplification 91.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\beta - \alpha}{\left(\beta + \alpha\right) + 2} \leq -0.5:\\ \;\;\;\;\frac{1}{\alpha}\\ \mathbf{elif}\;\frac{\beta - \alpha}{\left(\beta + \alpha\right) + 2} \leq 0.05:\\ \;\;\;\;\mathsf{fma}\left(\beta, \mathsf{fma}\left(\beta, -0.125, 0.25\right), 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 91.6% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (alpha beta)
 :precision binary64
 (let* ((t_0 (/ (- beta alpha) (+ (+ beta alpha) 2.0))))
   (if (<= t_0 -0.5)
     (/ 1.0 alpha)
     (if (<= t_0 0.05) (fma beta 0.25 0.5) 1.0))))

C

double code(double alpha, double beta) {
	double t_0 = (beta - alpha) / ((beta + alpha) + 2.0);
	double tmp;
	if (t_0 <= -0.5) {
		tmp = 1.0 / alpha;
	} else if (t_0 <= 0.05) {
		tmp = fma(beta, 0.25, 0.5);
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Julia

function code(alpha, beta)
	t_0 = Float64(Float64(beta - alpha) / Float64(Float64(beta + alpha) + 2.0))
	tmp = 0.0
	if (t_0 <= -0.5)
		tmp = Float64(1.0 / alpha);
	elseif (t_0 <= 0.05)
		tmp = fma(beta, 0.25, 0.5);
	else
		tmp = 1.0;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) < -0.5

   1. Initial program 7.5%

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

   3. Taylor expanded in alpha around inf

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

      1. lower-/.f64 N/A

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

   5. Applied rewrites 99.7%

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

   6. Taylor expanded in beta around 0

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

   8. Applied rewrites 76.8%

      \[\leadsto \frac{1 + \frac{-2}{\alpha}}{\alpha} \]

   9. Taylor expanded in alpha around inf

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

   11. Applied rewrites 76.1%

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

   if -0.5 < (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) < 0.050000000000000003

   1. Initial program 100.0%

      \[\frac{\frac{\beta - \alpha}{\left(\alpha + \beta\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 + \beta}\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. metadata-eval N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-+.f64 99.2

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

   5. Applied rewrites 99.2%

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

   6. Taylor expanded in beta around 0

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

   8. Applied rewrites 98.3%

      \[\leadsto \mathsf{fma}\left(\beta, \color{blue}{0.25}, 0.5\right) \]

   if 0.050000000000000003 < (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64)))

   1. Initial program 100.0%

      \[\frac{\frac{\beta - \alpha}{\left(\alpha + \beta\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 94.4%

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

4. Final simplification 91.4%

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

Alternative 8: 99.6% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{\beta - \alpha}{\left(\beta + \alpha\right) + 2} \leq -0.9999995:\\ \;\;\;\;\frac{\beta + 1}{\alpha}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{\beta - \alpha}{\beta + \left(\alpha + 2\right)}, 0.5, 0.5\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta)
 :precision binary64
 (if (<= (/ (- beta alpha) (+ (+ beta alpha) 2.0)) -0.9999995)
   (/ (+ beta 1.0) alpha)
   (fma (/ (- beta alpha) (+ beta (+ alpha 2.0))) 0.5 0.5)))

C

double code(double alpha, double beta) {
	double tmp;
	if (((beta - alpha) / ((beta + alpha) + 2.0)) <= -0.9999995) {
		tmp = (beta + 1.0) / alpha;
	} else {
		tmp = fma(((beta - alpha) / (beta + (alpha + 2.0))), 0.5, 0.5);
	}
	return tmp;
}

Julia

function code(alpha, beta)
	tmp = 0.0
	if (Float64(Float64(beta - alpha) / Float64(Float64(beta + alpha) + 2.0)) <= -0.9999995)
		tmp = Float64(Float64(beta + 1.0) / alpha);
	else
		tmp = fma(Float64(Float64(beta - alpha) / Float64(beta + Float64(alpha + 2.0))), 0.5, 0.5);
	end
	return tmp
end

Wolfram

code[alpha_, beta_] := If[LessEqual[N[(N[(beta - alpha), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision], -0.9999995], N[(N[(beta + 1.0), $MachinePrecision] / alpha), $MachinePrecision], N[(N[(N[(beta - alpha), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 0.5 + 0.5), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) < -0.999999500000000041

   1. Initial program 6.5%

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

   3. Taylor expanded in alpha around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. distribute-lft-in N/A

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

      4. metadata-eval N/A

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

      5. associate-*r* N/A

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

      6. metadata-eval N/A

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

      7. *-lft-identity N/A

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

      8. lower-+.f64 99.4

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

   5. Applied rewrites 99.4%

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

   if -0.999999500000000041 < (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64)))

   1. Initial program 99.8%

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

      1. lift-/.f64 N/A

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

      2. clear-num N/A

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

      3. associate-/r/ N/A

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

      4. lift-+.f64 N/A

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

      5. distribute-rgt-in N/A

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

      6. metadata-eval N/A

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

      7. metadata-eval N/A

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

      8. metadata-eval N/A

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

      9. lower-fma.f64 N/A

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

      10. lift-+.f64 N/A

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

      11. lift-+.f64 N/A

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

      12. +-commutative N/A

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

      13. associate-+l+ N/A

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

      14. lower-+.f64 N/A

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

      15. lower-+.f64 N/A

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

      16. metadata-eval N/A

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

      17. metadata-eval 99.8

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

   4. Applied rewrites 99.8%

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

4. Final simplification 99.7%

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

Alternative 9: 99.6% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{\beta - \alpha}{\left(\beta + \alpha\right) + 2} \leq -0.9999995:\\ \;\;\;\;\frac{\beta + 1}{\alpha}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\beta - \alpha, \frac{0.5}{\beta + \left(\alpha + 2\right)}, 0.5\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta)
 :precision binary64
 (if (<= (/ (- beta alpha) (+ (+ beta alpha) 2.0)) -0.9999995)
   (/ (+ beta 1.0) alpha)
   (fma (- beta alpha) (/ 0.5 (+ beta (+ alpha 2.0))) 0.5)))

C

double code(double alpha, double beta) {
	double tmp;
	if (((beta - alpha) / ((beta + alpha) + 2.0)) <= -0.9999995) {
		tmp = (beta + 1.0) / alpha;
	} else {
		tmp = fma((beta - alpha), (0.5 / (beta + (alpha + 2.0))), 0.5);
	}
	return tmp;
}

Julia

function code(alpha, beta)
	tmp = 0.0
	if (Float64(Float64(beta - alpha) / Float64(Float64(beta + alpha) + 2.0)) <= -0.9999995)
		tmp = Float64(Float64(beta + 1.0) / alpha);
	else
		tmp = fma(Float64(beta - alpha), Float64(0.5 / Float64(beta + Float64(alpha + 2.0))), 0.5);
	end
	return tmp
end

Wolfram

code[alpha_, beta_] := If[LessEqual[N[(N[(beta - alpha), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision], -0.9999995], N[(N[(beta + 1.0), $MachinePrecision] / alpha), $MachinePrecision], N[(N[(beta - alpha), $MachinePrecision] * N[(0.5 / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 0.5), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) < -0.999999500000000041

   1. Initial program 6.5%

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

   3. Taylor expanded in alpha around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. distribute-lft-in N/A

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

      4. metadata-eval N/A

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

      5. associate-*r* N/A

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

      6. metadata-eval N/A

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

      7. *-lft-identity N/A

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

      8. lower-+.f64 99.4

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

   5. Applied rewrites 99.4%

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

   if -0.999999500000000041 < (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64)))

   1. Initial program 99.8%

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

      1. lift-/.f64 N/A

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

      2. clear-num N/A

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

      3. associate-/r/ N/A

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

      4. lift-+.f64 N/A

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

      5. distribute-rgt-in N/A

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

      6. metadata-eval N/A

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

      7. metadata-eval N/A

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

      8. metadata-eval N/A

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

      9. lower-fma.f64 N/A

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

      10. lift-+.f64 N/A

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

      11. lift-+.f64 N/A

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

      12. +-commutative N/A

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

      13. associate-+l+ N/A

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

      14. lower-+.f64 N/A

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

      15. lower-+.f64 N/A

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

      16. metadata-eval N/A

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

      17. metadata-eval 99.8

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

   4. Applied rewrites 99.8%

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

      1. lift-fma.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*l/ N/A

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

      4. associate-/l* N/A

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

      5. lower-fma.f64 N/A

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

      6. lower-/.f64 99.8

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

   6. Applied rewrites 99.8%

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

4. Final simplification 99.7%

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

Alternative 10: 98.0% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{\beta - \alpha}{\left(\beta + \alpha\right) + 2} \leq -0.5:\\ \;\;\;\;\frac{\beta + 1}{\alpha}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(0.5, \frac{\beta}{\beta + 2}, 0.5\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta)
 :precision binary64
 (if (<= (/ (- beta alpha) (+ (+ beta alpha) 2.0)) -0.5)
   (/ (+ beta 1.0) alpha)
   (fma 0.5 (/ beta (+ beta 2.0)) 0.5)))

C

double code(double alpha, double beta) {
	double tmp;
	if (((beta - alpha) / ((beta + alpha) + 2.0)) <= -0.5) {
		tmp = (beta + 1.0) / alpha;
	} else {
		tmp = fma(0.5, (beta / (beta + 2.0)), 0.5);
	}
	return tmp;
}

Julia

function code(alpha, beta)
	tmp = 0.0
	if (Float64(Float64(beta - alpha) / Float64(Float64(beta + alpha) + 2.0)) <= -0.5)
		tmp = Float64(Float64(beta + 1.0) / alpha);
	else
		tmp = fma(0.5, Float64(beta / Float64(beta + 2.0)), 0.5);
	end
	return tmp
end

Wolfram

code[alpha_, beta_] := If[LessEqual[N[(N[(beta - alpha), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision], -0.5], N[(N[(beta + 1.0), $MachinePrecision] / alpha), $MachinePrecision], N[(0.5 * N[(beta / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] + 0.5), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) < -0.5

   1. Initial program 7.5%

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

   3. Taylor expanded in alpha around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. distribute-lft-in N/A

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

      4. metadata-eval N/A

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

      5. associate-*r* N/A

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

      6. metadata-eval N/A

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

      7. *-lft-identity N/A

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

      8. lower-+.f64 98.6

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

   5. Applied rewrites 98.6%

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

   if -0.5 < (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64)))

   1. Initial program 100.0%

      \[\frac{\frac{\beta - \alpha}{\left(\alpha + \beta\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 + \beta}\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. metadata-eval N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-+.f64 98.2

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

   5. Applied rewrites 98.2%

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

4. Final simplification 98.3%

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

Alternative 11: 71.1% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{\beta - \alpha}{\left(\beta + \alpha\right) + 2} \leq 0.05:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta)
 :precision binary64
 (if (<= (/ (- beta alpha) (+ (+ beta alpha) 2.0)) 0.05) 0.5 1.0))

C

double code(double alpha, double beta) {
	double tmp;
	if (((beta - alpha) / ((beta + alpha) + 2.0)) <= 0.05) {
		tmp = 0.5;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Fortran

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

Java

public static double code(double alpha, double beta) {
	double tmp;
	if (((beta - alpha) / ((beta + alpha) + 2.0)) <= 0.05) {
		tmp = 0.5;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(alpha, beta):
	tmp = 0
	if ((beta - alpha) / ((beta + alpha) + 2.0)) <= 0.05:
		tmp = 0.5
	else:
		tmp = 1.0
	return tmp

Julia

function code(alpha, beta)
	tmp = 0.0
	if (Float64(Float64(beta - alpha) / Float64(Float64(beta + alpha) + 2.0)) <= 0.05)
		tmp = 0.5;
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

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

Wolfram

code[alpha_, beta_] := If[LessEqual[N[(N[(beta - alpha), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision], 0.05], 0.5, 1.0]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) < 0.050000000000000003

   1. Initial program 66.0%

      \[\frac{\frac{\beta - \alpha}{\left(\alpha + \beta\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 + \beta}\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. metadata-eval N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-+.f64 64.7

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

   5. Applied rewrites 64.7%

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

   6. Taylor expanded in beta around 0

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

   8. Applied rewrites 63.6%

      \[\leadsto 0.5 \]

   if 0.050000000000000003 < (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64)))

   1. Initial program 100.0%

      \[\frac{\frac{\beta - \alpha}{\left(\alpha + \beta\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 94.4%

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

4. Final simplification 72.5%

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

Alternative 12: 92.7% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\beta \leq 3.8:\\ \;\;\;\;\frac{1}{\alpha + 2}\\ \mathbf{else}:\\ \;\;\;\;1 + \frac{-1}{\beta}\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta)
 :precision binary64
 (if (<= beta 3.8) (/ 1.0 (+ alpha 2.0)) (+ 1.0 (/ -1.0 beta))))

C

double code(double alpha, double beta) {
	double tmp;
	if (beta <= 3.8) {
		tmp = 1.0 / (alpha + 2.0);
	} else {
		tmp = 1.0 + (-1.0 / beta);
	}
	return tmp;
}

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 3.7999999999999998

   1. Initial program 71.2%

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

   3. Taylor expanded in alpha around inf

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

      1. lower-/.f64 N/A

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

   5. Applied rewrites 31.6%

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

   7. Applied rewrites 31.6%

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

   8. Taylor expanded in alpha around inf

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

   10. Applied rewrites 99.8%

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

   11. Taylor expanded in beta around 0

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

   13. Applied rewrites 98.0%

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

   if 3.7999999999999998 < beta

   1. Initial program 84.4%

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

   3. Taylor expanded in beta around -inf

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. sub-neg N/A

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

      5. neg-mul-1 N/A

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

      6. +-commutative N/A

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

      7. mul-1-neg N/A

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

      8. sub-neg N/A

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

      9. lower--.f64 N/A

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

      10. distribute-lft-in N/A

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

      11. mul-1-neg N/A

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

      12. unsub-neg N/A

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

      13. lower--.f64 N/A

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

      14. metadata-eval 80.2

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

   5. Applied rewrites 80.2%

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

   6. Taylor expanded in alpha around 0

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

   8. Applied rewrites 80.2%

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

4. Final simplification 91.8%

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

Alternative 13: 71.5% accurate, 2.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\beta \leq 2:\\ \;\;\;\;\mathsf{fma}\left(\beta, 0.25, 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta)
 :precision binary64
 (if (<= beta 2.0) (fma beta 0.25 0.5) 1.0))

C

double code(double alpha, double beta) {
	double tmp;
	if (beta <= 2.0) {
		tmp = fma(beta, 0.25, 0.5);
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Julia

function code(alpha, beta)
	tmp = 0.0
	if (beta <= 2.0)
		tmp = fma(beta, 0.25, 0.5);
	else
		tmp = 1.0;
	end
	return tmp
end

Wolfram

code[alpha_, beta_] := If[LessEqual[beta, 2.0], N[(beta * 0.25 + 0.5), $MachinePrecision], 1.0]

Derivation

1. Split input into 2 regimes

2. if beta < 2

   1. Initial program 71.2%

      \[\frac{\frac{\beta - \alpha}{\left(\alpha + \beta\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 + \beta}\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. metadata-eval N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-+.f64 69.9

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

   5. Applied rewrites 69.9%

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

   6. Taylor expanded in beta around 0

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

   8. Applied rewrites 69.3%

      \[\leadsto \mathsf{fma}\left(\beta, \color{blue}{0.25}, 0.5\right) \]

   if 2 < beta

   1. Initial program 84.4%

      \[\frac{\frac{\beta - \alpha}{\left(\alpha + \beta\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 79.7%

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

Alternative 14: 37.0% accurate, 35.0× speedup

Math

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

FPCore

(FPCore (alpha beta) :precision binary64 1.0)

C

double code(double alpha, double beta) {
	return 1.0;
}

Fortran

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

Java

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

Python

def code(alpha, beta):
	return 1.0

Julia

function code(alpha, beta)
	return 1.0
end

MATLAB

function tmp = code(alpha, beta)
	tmp = 1.0;
end

Wolfram

code[alpha_, beta_] := 1.0

Derivation

1. Initial program 75.8%

   \[\frac{\frac{\beta - \alpha}{\left(\alpha + \beta\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 37.2%

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

Reproduce

herbie shell --seed 2024234 
(FPCore (alpha beta)
  :name "Octave 3.8, jcobi/1"
  :precision binary64
  :pre (and (> alpha -1.0) (> beta -1.0))
  (/ (+ (/ (- beta alpha) (+ (+ alpha beta) 2.0)) 1.0) 2.0))