Octave 3.8, jcobi/1

Percentage Accurate: 74.9% → 99.6%

Time: 10.4s

Alternatives: 13

Speedup: 0.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.9% 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(0.5, \left(\beta + 2\right) \cdot \frac{\mathsf{fma}\left(\beta, -2, -2\right)}{\alpha}, \beta + 1\right)}{\alpha}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{1}{\beta + \left(\alpha + 2\right)}, \beta - \alpha, 1\right)}{2}\\ \end{array} \end{array} \]

FPCore

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

C

double code(double alpha, double beta) {
	double tmp;
	if (((beta - alpha) / ((beta + alpha) + 2.0)) <= -0.5) {
		tmp = fma(0.5, ((beta + 2.0) * (fma(beta, -2.0, -2.0) / alpha)), (beta + 1.0)) / alpha;
	} else {
		tmp = fma((1.0 / (beta + (alpha + 2.0))), (beta - alpha), 1.0) / 2.0;
	}
	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(0.5, Float64(Float64(beta + 2.0) * Float64(fma(beta, -2.0, -2.0) / alpha)), Float64(beta + 1.0)) / alpha);
	else
		tmp = Float64(fma(Float64(1.0 / Float64(beta + Float64(alpha + 2.0))), Float64(beta - alpha), 1.0) / 2.0);
	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[(0.5 * N[(N[(beta + 2.0), $MachinePrecision] * N[(N[(beta * -2.0 + -2.0), $MachinePrecision] / alpha), $MachinePrecision]), $MachinePrecision] + N[(beta + 1.0), $MachinePrecision]), $MachinePrecision] / alpha), $MachinePrecision], N[(N[(N[(1.0 / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(beta - alpha), $MachinePrecision] + 1.0), $MachinePrecision] / 2.0), $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 6.7%

      \[\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. /-lowering-/.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. Simplified 99.8%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(0.5, \left(2 + \beta\right) \cdot \frac{\mathsf{fma}\left(\beta, -2, -2\right)}{\alpha}, 1 + \beta\right)}{\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. clear-num N/A

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

      2. associate-/r/ N/A

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

      3. accelerator-lowering-fma.f64 N/A

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

      4. /-lowering-/.f64 N/A

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

      5. +-commutative N/A

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

      6. associate-+l+ N/A

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

      7. +-lowering-+.f64 N/A

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

      8. +-lowering-+.f64 N/A

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

      9. --lowering--.f64 100.0

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

   4. Applied egg-rr 100.0%

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

Alternative 2: 97.5% 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.002:\\ \;\;\;\;\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}:\\ \;\;\;\;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)
     (/ (+ beta 1.0) alpha)
     (if (<= t_0 0.002)
       (fma beta (fma beta (fma beta 0.0625 -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 = (beta + 1.0) / alpha;
	} else if (t_0 <= 0.002) {
		tmp = fma(beta, fma(beta, fma(beta, 0.0625, -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(Float64(beta + 1.0) / alpha);
	elseif (t_0 <= 0.002)
		tmp = fma(beta, fma(beta, fma(beta, 0.0625, -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[(N[(beta + 1.0), $MachinePrecision] / alpha), $MachinePrecision], If[LessEqual[t$95$0, 0.002], N[(beta * N[(beta * N[(beta * 0.0625 + -0.125), $MachinePrecision] + 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 6.7%

      \[\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. /-lowering-/.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. +-lowering-+.f64 99.1

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

   5. Simplified 99.1%

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

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

   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. accelerator-lowering-fma.f64 N/A

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

      5. /-lowering-/.f64 N/A

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

      6. +-lowering-+.f64 99.5

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

   5. Simplified 99.5%

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

   6. Taylor expanded in beta around 0

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

      1. +-commutative N/A

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

      2. accelerator-lowering-fma.f64 N/A

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

      3. +-commutative N/A

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

      4. accelerator-lowering-fma.f64 N/A

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

      5. sub-neg N/A

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

      6. *-commutative N/A

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

      7. metadata-eval N/A

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

      8. accelerator-lowering-fma.f64 99.3

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

   8. Simplified 99.3%

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

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

   1. Initial program 99.9%

      \[\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. accelerator-lowering-fma.f64 N/A

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

      5. /-lowering-/.f64 N/A

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

      6. +-lowering-+.f64 98.7

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

   5. Simplified 98.7%

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

   6. Taylor expanded in beta around inf

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

      1. sub-neg N/A

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

      2. +-lowering-+.f64 N/A

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

      3. distribute-neg-frac N/A

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

      4. metadata-eval N/A

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

      5. /-lowering-/.f64 97.2

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

   8. Simplified 97.2%

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

4. Final simplification 98.7%

   \[\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.002:\\ \;\;\;\;\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}:\\ \;\;\;\;1 + \frac{-1}{\beta}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 97.5% 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.002:\\ \;\;\;\;\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)
     (/ (+ beta 1.0) alpha)
     (if (<= t_0 0.002)
       (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 = (beta + 1.0) / alpha;
	} else if (t_0 <= 0.002) {
		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(Float64(beta + 1.0) / alpha);
	elseif (t_0 <= 0.002)
		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[(N[(beta + 1.0), $MachinePrecision] / alpha), $MachinePrecision], If[LessEqual[t$95$0, 0.002], 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 6.7%

      \[\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. /-lowering-/.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. +-lowering-+.f64 99.1

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

   5. Simplified 99.1%

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

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

   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. accelerator-lowering-fma.f64 N/A

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

      5. /-lowering-/.f64 N/A

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

      6. +-lowering-+.f64 99.5

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

   5. Simplified 99.5%

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

   6. Taylor expanded in beta around 0

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

      1. +-commutative N/A

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

      2. accelerator-lowering-fma.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. accelerator-lowering-fma.f64 99.1

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

   8. Simplified 99.1%

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

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

   1. Initial program 99.9%

      \[\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. accelerator-lowering-fma.f64 N/A

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

      5. /-lowering-/.f64 N/A

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

      6. +-lowering-+.f64 98.7

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

   5. Simplified 98.7%

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

   6. Taylor expanded in beta around inf

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

      1. sub-neg N/A

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

      2. +-lowering-+.f64 N/A

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

      3. distribute-neg-frac N/A

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

      4. metadata-eval N/A

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

      5. /-lowering-/.f64 97.2

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

   8. Simplified 97.2%

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

4. Final simplification 98.6%

   \[\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.002:\\ \;\;\;\;\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 4: 92.2% 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.002:\\ \;\;\;\;\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.002)
       (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.002) {
		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.002)
		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.002], 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 6.7%

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

      1. clear-num N/A

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

      2. associate-/r/ N/A

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

      3. 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}} \]

      4. metadata-eval N/A

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

      5. metadata-eval N/A

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

      6. metadata-eval N/A

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

      7. accelerator-lowering-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)} \]

      8. /-lowering-/.f64 N/A

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

      9. --lowering--.f64 N/A

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

      10. +-commutative N/A

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

      11. 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) \]

      12. +-lowering-+.f64 N/A

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

      13. +-lowering-+.f64 N/A

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

      14. 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) \]

      15. metadata-eval 6.7

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

   4. Applied egg-rr 6.7%

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

   5. Taylor expanded in beta around 0

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

      1. mul-1-neg N/A

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

      2. distribute-neg-frac2 N/A

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

      3. neg-mul-1 N/A

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

      4. /-lowering-/.f64 N/A

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

      5. neg-mul-1 N/A

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

      6. distribute-neg-in N/A

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

      7. metadata-eval N/A

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

      8. unsub-neg N/A

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

      9. --lowering--.f64 6.2

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

   7. Simplified 6.2%

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

   8. Taylor expanded in alpha around inf

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

      1. /-lowering-/.f64 80.7

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

   10. Simplified 80.7%

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

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

   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. accelerator-lowering-fma.f64 N/A

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

      5. /-lowering-/.f64 N/A

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

      6. +-lowering-+.f64 99.5

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

   5. Simplified 99.5%

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

   6. Taylor expanded in beta around 0

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

      1. +-commutative N/A

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

      2. accelerator-lowering-fma.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. accelerator-lowering-fma.f64 99.1

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

   8. Simplified 99.1%

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

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

   1. Initial program 99.9%

      \[\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. accelerator-lowering-fma.f64 N/A

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

      5. /-lowering-/.f64 N/A

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

      6. +-lowering-+.f64 98.7

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

   5. Simplified 98.7%

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

   6. Taylor expanded in beta around inf

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

      1. sub-neg N/A

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

      2. +-lowering-+.f64 N/A

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

      3. distribute-neg-frac N/A

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

      4. metadata-eval N/A

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

      5. /-lowering-/.f64 97.2

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

   8. Simplified 97.2%

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

4. Final simplification 92.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.002:\\ \;\;\;\;\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 5: 92.1% 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.002:\\ \;\;\;\;\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.002) (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.002) {
		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.002)
		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.002], 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 6.7%

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

      1. clear-num N/A

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

      2. associate-/r/ N/A

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

      3. 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}} \]

      4. metadata-eval N/A

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

      5. metadata-eval N/A

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

      6. metadata-eval N/A

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

      7. accelerator-lowering-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)} \]

      8. /-lowering-/.f64 N/A

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

      9. --lowering--.f64 N/A

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

      10. +-commutative N/A

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

      11. 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) \]

      12. +-lowering-+.f64 N/A

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

      13. +-lowering-+.f64 N/A

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

      14. 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) \]

      15. metadata-eval 6.7

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

   4. Applied egg-rr 6.7%

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

   5. Taylor expanded in beta around 0

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

      1. mul-1-neg N/A

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

      2. distribute-neg-frac2 N/A

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

      3. neg-mul-1 N/A

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

      4. /-lowering-/.f64 N/A

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

      5. neg-mul-1 N/A

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

      6. distribute-neg-in N/A

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

      7. metadata-eval N/A

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

      8. unsub-neg N/A

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

      9. --lowering--.f64 6.2

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

   7. Simplified 6.2%

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

   8. Taylor expanded in alpha around inf

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

      1. /-lowering-/.f64 80.7

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

   10. Simplified 80.7%

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

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

   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. accelerator-lowering-fma.f64 N/A

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

      5. /-lowering-/.f64 N/A

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

      6. +-lowering-+.f64 99.5

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

   5. Simplified 99.5%

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

   6. Taylor expanded in beta around 0

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

      1. +-commutative N/A

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

      2. accelerator-lowering-fma.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. accelerator-lowering-fma.f64 99.1

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

   8. Simplified 99.1%

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

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

   1. Initial program 99.9%

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

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

4. Final simplification 92.6%

   \[\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.002:\\ \;\;\;\;\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 6: 92.0% 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.002:\\ \;\;\;\;\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.002) (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.002) {
		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.002)
		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.002], 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 6.7%

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

      1. clear-num N/A

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

      2. associate-/r/ N/A

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

      3. 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}} \]

      4. metadata-eval N/A

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

      5. metadata-eval N/A

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

      6. metadata-eval N/A

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

      7. accelerator-lowering-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)} \]

      8. /-lowering-/.f64 N/A

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

      9. --lowering--.f64 N/A

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

      10. +-commutative N/A

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

      11. 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) \]

      12. +-lowering-+.f64 N/A

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

      13. +-lowering-+.f64 N/A

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

      14. 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) \]

      15. metadata-eval 6.7

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

   4. Applied egg-rr 6.7%

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

   5. Taylor expanded in beta around 0

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

      1. mul-1-neg N/A

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

      2. distribute-neg-frac2 N/A

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

      3. neg-mul-1 N/A

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

      4. /-lowering-/.f64 N/A

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

      5. neg-mul-1 N/A

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

      6. distribute-neg-in N/A

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

      7. metadata-eval N/A

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

      8. unsub-neg N/A

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

      9. --lowering--.f64 6.2

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

   7. Simplified 6.2%

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

   8. Taylor expanded in alpha around inf

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

      1. /-lowering-/.f64 80.7

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

   10. Simplified 80.7%

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

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

   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. accelerator-lowering-fma.f64 N/A

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

      5. /-lowering-/.f64 N/A

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

      6. +-lowering-+.f64 99.5

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

   5. Simplified 99.5%

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

   6. Taylor expanded in beta around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. accelerator-lowering-fma.f64 98.4

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

   8. Simplified 98.4%

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

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

   1. Initial program 99.9%

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

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

4. Final simplification 92.3%

   \[\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.002:\\ \;\;\;\;\mathsf{fma}\left(\beta, 0.25, 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 99.7% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{\beta - \alpha}{\left(\beta + \alpha\right) + 2} \leq -0.9999998:\\ \;\;\;\;\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.9999998)
   (/ (+ 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.9999998) {
		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.9999998)
		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.9999998], 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.999999799999999994

   1. Initial program 5.9%

      \[\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. /-lowering-/.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. +-lowering-+.f64 99.7

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

   5. Simplified 99.7%

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

   if -0.999999799999999994 < (/.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. clear-num N/A

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

      2. associate-/r/ N/A

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

      3. 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}} \]

      4. metadata-eval N/A

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

      5. metadata-eval N/A

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

      6. metadata-eval N/A

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

      7. accelerator-lowering-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)} \]

      8. /-lowering-/.f64 N/A

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

      9. --lowering--.f64 N/A

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

      10. +-commutative N/A

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

      11. 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) \]

      12. +-lowering-+.f64 N/A

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

      13. +-lowering-+.f64 N/A

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

      14. 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) \]

      15. 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 egg-rr 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.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\beta - \alpha}{\left(\beta + \alpha\right) + 2} \leq -0.9999998:\\ \;\;\;\;\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 8: 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(\frac{0.5}{\beta + 2}, \beta, 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 2.0)) beta 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 + 2.0)), beta, 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(Float64(0.5 / Float64(beta + 2.0)), beta, 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[(N[(0.5 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * beta + 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 6.7%

      \[\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. /-lowering-/.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. +-lowering-+.f64 99.1

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

   5. Simplified 99.1%

      \[\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. accelerator-lowering-fma.f64 N/A

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

      5. /-lowering-/.f64 N/A

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

      6. +-lowering-+.f64 99.2

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

   5. Simplified 99.2%

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

      1. associate-*r/ N/A

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

      2. div-inv N/A

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

      3. accelerator-lowering-fma.f64 N/A

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

      4. *-commutative N/A

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

      5. *-lowering-*.f64 N/A

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

      6. /-lowering-/.f64 N/A

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

      7. +-commutative N/A

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

      8. +-lowering-+.f64 99.2

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

   7. Applied egg-rr 99.2%

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

      1. associate-*l* N/A

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

      2. *-commutative N/A

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

      3. accelerator-lowering-fma.f64 N/A

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

      4. un-div-inv N/A

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

      5. /-lowering-/.f64 N/A

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

      6. +-lowering-+.f64 99.2

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

   9. Applied egg-rr 99.2%

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

4. Final simplification 99.1%

   \[\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(\frac{0.5}{\beta + 2}, \beta, 0.5\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 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 6.7%

      \[\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. /-lowering-/.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. +-lowering-+.f64 99.1

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

   5. Simplified 99.1%

      \[\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. accelerator-lowering-fma.f64 N/A

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

      5. /-lowering-/.f64 N/A

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

      6. +-lowering-+.f64 99.2

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

   5. Simplified 99.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 99.1%

   \[\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 10: 71.4% accurate, 1.3× speedup

Math

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

FPCore

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

C

double code(double alpha, double beta) {
	double tmp;
	if (((beta - alpha) / ((beta + alpha) + 2.0)) <= 0.002) {
		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.002d0) 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.002) {
		tmp = 0.5;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(alpha, beta):
	tmp = 0
	if ((beta - alpha) / ((beta + alpha) + 2.0)) <= 0.002:
		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.002)
		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.002)
		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.002], 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))) < 2e-3

   1. Initial program 59.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. accelerator-lowering-fma.f64 N/A

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

      5. /-lowering-/.f64 N/A

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

      6. +-lowering-+.f64 58.4

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

   5. Simplified 58.4%

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

   6. Taylor expanded in beta around 0

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

   8. Simplified 57.2%

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

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

   1. Initial program 99.9%

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

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

4. Final simplification 68.2%

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

Alternative 11: 71.9% accurate, 2.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 26

   1. Initial program 63.8%

      \[\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. accelerator-lowering-fma.f64 N/A

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

      5. /-lowering-/.f64 N/A

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

      6. +-lowering-+.f64 63.0

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

   5. Simplified 63.0%

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

   6. Taylor expanded in beta around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. accelerator-lowering-fma.f64 62.3

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

   8. Simplified 62.3%

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

   if 26 < beta

   1. Initial program 83.7%

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

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

Alternative 12: 49.9% accurate, 35.0× speedup

Math

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

FPCore

(FPCore (alpha beta) :precision binary64 0.5)

C

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

Fortran

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

Java

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

Python

def code(alpha, beta):
	return 0.5

Julia

function code(alpha, beta)
	return 0.5
end

MATLAB

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

Wolfram

code[alpha_, beta_] := 0.5

Derivation

1. Initial program 70.5%

   \[\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. accelerator-lowering-fma.f64 N/A

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

   5. /-lowering-/.f64 N/A

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

   6. +-lowering-+.f64 69.6

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

5. Simplified 69.6%

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

6. Taylor expanded in beta around 0

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

8. Simplified 46.6%

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

Alternative 13: 3.7% accurate, 35.0× speedup

Math

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

FPCore

(FPCore (alpha beta) :precision binary64 0.0)

C

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

Fortran

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

Java

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

Python

def code(alpha, beta):
	return 0.0

Julia

function code(alpha, beta)
	return 0.0
end

MATLAB

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

Wolfram

code[alpha_, beta_] := 0.0

Derivation

1. Initial program 70.5%

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

   1. clear-num N/A

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

   2. associate-/r/ N/A

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

   3. 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}} \]

   4. metadata-eval N/A

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

   5. metadata-eval N/A

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

   6. metadata-eval N/A

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

   7. accelerator-lowering-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)} \]

   8. /-lowering-/.f64 N/A

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

   9. --lowering--.f64 N/A

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

   10. +-commutative N/A

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

   11. 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) \]

   12. +-lowering-+.f64 N/A

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

   13. +-lowering-+.f64 N/A

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

   14. 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) \]

   15. metadata-eval 70.5

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

4. Applied egg-rr 70.5%

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

5. Taylor expanded in alpha around inf

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

7. Simplified 3.7%

   \[\leadsto \mathsf{fma}\left(\color{blue}{-1}, 0.5, 0.5\right) \]
8. Step-by-step derivation

   1. metadata-eval N/A

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

   2. metadata-eval 3.7

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

9. Applied egg-rr 3.7%

   \[\leadsto \color{blue}{0} \]
10. Add Preprocessing

Reproduce

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