Octave 3.8, jcobi/1

Percentage Accurate: 74.4% → 99.9%
Time: 8.6s
Alternatives: 12
Speedup: 0.7×

Specification

?
\[\alpha > -1 \land \beta > -1\]
\[\begin{array}{l} \\ \frac{\frac{\beta - \alpha}{\left(\alpha + \beta\right) + 2} + 1}{2} \end{array} \]
(FPCore (alpha beta)
 :precision binary64
 (/ (+ (/ (- beta alpha) (+ (+ alpha beta) 2.0)) 1.0) 2.0))
double code(double alpha, double beta) {
	return (((beta - alpha) / ((alpha + beta) + 2.0)) + 1.0) / 2.0;
}
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
public static double code(double alpha, double beta) {
	return (((beta - alpha) / ((alpha + beta) + 2.0)) + 1.0) / 2.0;
}
def code(alpha, beta):
	return (((beta - alpha) / ((alpha + beta) + 2.0)) + 1.0) / 2.0
function code(alpha, beta)
	return Float64(Float64(Float64(Float64(beta - alpha) / Float64(Float64(alpha + beta) + 2.0)) + 1.0) / 2.0)
end
function tmp = code(alpha, beta)
	tmp = (((beta - alpha) / ((alpha + beta) + 2.0)) + 1.0) / 2.0;
end
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]
\begin{array}{l}

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

Sampling outcomes in binary64 precision:

Local Percentage Accuracy vs ?

The average percentage accuracy by input value. Horizontal axis shows value of an input variable; the variable is choosen in the title. Vertical axis is accuracy; higher is better. Red represent the original program, while blue represents Herbie's suggestion. These can be toggled with buttons below the plot. The line is an average while dots represent individual samples.

Accuracy vs Speed?

Herbie found 12 alternatives:

AlternativeAccuracySpeedup
The accuracy (vertical axis) and speed (horizontal axis) of each alternatives. Up and to the right is better. The red square shows the initial program, and each blue circle shows an alternative.The line shows the best available speed-accuracy tradeoffs.

Initial Program: 74.4% accurate, 1.0× speedup?

\[\begin{array}{l} \\ \frac{\frac{\beta - \alpha}{\left(\alpha + \beta\right) + 2} + 1}{2} \end{array} \]
(FPCore (alpha beta)
 :precision binary64
 (/ (+ (/ (- beta alpha) (+ (+ alpha beta) 2.0)) 1.0) 2.0))
double code(double alpha, double beta) {
	return (((beta - alpha) / ((alpha + beta) + 2.0)) + 1.0) / 2.0;
}
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
public static double code(double alpha, double beta) {
	return (((beta - alpha) / ((alpha + beta) + 2.0)) + 1.0) / 2.0;
}
def code(alpha, beta):
	return (((beta - alpha) / ((alpha + beta) + 2.0)) + 1.0) / 2.0
function code(alpha, beta)
	return Float64(Float64(Float64(Float64(beta - alpha) / Float64(Float64(alpha + beta) + 2.0)) + 1.0) / 2.0)
end
function tmp = code(alpha, beta)
	tmp = (((beta - alpha) / ((alpha + beta) + 2.0)) + 1.0) / 2.0;
end
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]
\begin{array}{l}

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

Alternative 1: 99.9% accurate, 0.4× speedup?

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{\beta - \alpha}{2 + \left(\alpha + \beta\right)} \leq -0.95:\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{\left(-2 - \beta\right) \cdot \left(\frac{\beta - -2}{\alpha} - 1\right)}{\alpha} \cdot \mathsf{fma}\left(-2, \beta, -2\right), 0.5, 1 + \beta\right)}{\alpha}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{\alpha - \beta}{-2 - \mathsf{fma}\left(\frac{\alpha}{\beta}, \beta, \beta\right)}, 0.5, 0.5\right)\\ \end{array} \end{array} \]
(FPCore (alpha beta)
 :precision binary64
 (if (<= (/ (- beta alpha) (+ 2.0 (+ alpha beta))) -0.95)
   (/
    (fma
     (*
      (/ (* (- -2.0 beta) (- (/ (- beta -2.0) alpha) 1.0)) alpha)
      (fma -2.0 beta -2.0))
     0.5
     (+ 1.0 beta))
    alpha)
   (fma (/ (- alpha beta) (- -2.0 (fma (/ alpha beta) beta beta))) 0.5 0.5)))
double code(double alpha, double beta) {
	double tmp;
	if (((beta - alpha) / (2.0 + (alpha + beta))) <= -0.95) {
		tmp = fma(((((-2.0 - beta) * (((beta - -2.0) / alpha) - 1.0)) / alpha) * fma(-2.0, beta, -2.0)), 0.5, (1.0 + beta)) / alpha;
	} else {
		tmp = fma(((alpha - beta) / (-2.0 - fma((alpha / beta), beta, beta))), 0.5, 0.5);
	}
	return tmp;
}
function code(alpha, beta)
	tmp = 0.0
	if (Float64(Float64(beta - alpha) / Float64(2.0 + Float64(alpha + beta))) <= -0.95)
		tmp = Float64(fma(Float64(Float64(Float64(Float64(-2.0 - beta) * Float64(Float64(Float64(beta - -2.0) / alpha) - 1.0)) / alpha) * fma(-2.0, beta, -2.0)), 0.5, Float64(1.0 + beta)) / alpha);
	else
		tmp = fma(Float64(Float64(alpha - beta) / Float64(-2.0 - fma(Float64(alpha / beta), beta, beta))), 0.5, 0.5);
	end
	return tmp
end
code[alpha_, beta_] := If[LessEqual[N[(N[(beta - alpha), $MachinePrecision] / N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.95], N[(N[(N[(N[(N[(N[(-2.0 - beta), $MachinePrecision] * N[(N[(N[(beta - -2.0), $MachinePrecision] / alpha), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision] / alpha), $MachinePrecision] * N[(-2.0 * beta + -2.0), $MachinePrecision]), $MachinePrecision] * 0.5 + N[(1.0 + beta), $MachinePrecision]), $MachinePrecision] / alpha), $MachinePrecision], N[(N[(N[(alpha - beta), $MachinePrecision] / N[(-2.0 - N[(N[(alpha / beta), $MachinePrecision] * beta + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 0.5 + 0.5), $MachinePrecision]]
\begin{array}{l}

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

\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{\alpha - \beta}{-2 - \mathsf{fma}\left(\frac{\alpha}{\beta}, \beta, \beta\right)}, 0.5, 0.5\right)\\


\end{array}
\end{array}
Derivation
  1. Split input into 2 regimes
  2. if (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) < -0.94999999999999996

    1. Initial program 10.4%

      \[\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) + \left(\frac{1}{2} \cdot \frac{-1 \cdot {\left(2 + \beta\right)}^{2} - \beta \cdot \left(2 + \beta\right)}{\alpha} + \frac{1}{2} \cdot \frac{{\left(2 + \beta\right)}^{3} - -1 \cdot \left(\beta \cdot {\left(2 + \beta\right)}^{2}\right)}{{\alpha}^{2}}\right)}{\alpha}} \]
    4. Applied rewrites94.9%

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

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

      if -0.94999999999999996 < (/.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-/.f64N/A

          \[\leadsto \color{blue}{\frac{\frac{\beta - \alpha}{\left(\alpha + \beta\right) + 2} + 1}{2}} \]
        2. clear-numN/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-+.f64N/A

          \[\leadsto \frac{1}{2} \cdot \color{blue}{\left(\frac{\beta - \alpha}{\left(\alpha + \beta\right) + 2} + 1\right)} \]
        5. distribute-rgt-inN/A

          \[\leadsto \color{blue}{\frac{\beta - \alpha}{\left(\alpha + \beta\right) + 2} \cdot \frac{1}{2} + 1 \cdot \frac{1}{2}} \]
        6. metadata-evalN/A

          \[\leadsto \frac{\beta - \alpha}{\left(\alpha + \beta\right) + 2} \cdot \frac{1}{2} + 1 \cdot \color{blue}{\frac{1}{2}} \]
        7. metadata-evalN/A

          \[\leadsto \frac{\beta - \alpha}{\left(\alpha + \beta\right) + 2} \cdot \frac{1}{2} + \color{blue}{\frac{1}{2}} \]
        8. metadata-evalN/A

          \[\leadsto \frac{\beta - \alpha}{\left(\alpha + \beta\right) + 2} \cdot \frac{1}{2} + \color{blue}{\frac{1}{2}} \]
        9. lower-fma.f64N/A

          \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{\beta - \alpha}{\left(\alpha + \beta\right) + 2}, \frac{1}{2}, \frac{1}{2}\right)} \]
      4. Applied rewrites100.0%

        \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{\alpha - \beta}{-2 - \left(\alpha + \beta\right)}, 0.5, 0.5\right)} \]
      5. Taylor expanded in beta around inf

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

          \[\leadsto \mathsf{fma}\left(\frac{\alpha - \beta}{-2 - \beta \cdot \color{blue}{\left(\frac{\alpha}{\beta} + 1\right)}}, \frac{1}{2}, \frac{1}{2}\right) \]
        2. distribute-rgt-inN/A

          \[\leadsto \mathsf{fma}\left(\frac{\alpha - \beta}{-2 - \color{blue}{\left(\frac{\alpha}{\beta} \cdot \beta + 1 \cdot \beta\right)}}, \frac{1}{2}, \frac{1}{2}\right) \]
        3. *-lft-identityN/A

          \[\leadsto \mathsf{fma}\left(\frac{\alpha - \beta}{-2 - \left(\frac{\alpha}{\beta} \cdot \beta + \color{blue}{\beta}\right)}, \frac{1}{2}, \frac{1}{2}\right) \]
        4. lower-fma.f64N/A

          \[\leadsto \mathsf{fma}\left(\frac{\alpha - \beta}{-2 - \color{blue}{\mathsf{fma}\left(\frac{\alpha}{\beta}, \beta, \beta\right)}}, \frac{1}{2}, \frac{1}{2}\right) \]
        5. lower-/.f64100.0

          \[\leadsto \mathsf{fma}\left(\frac{\alpha - \beta}{-2 - \mathsf{fma}\left(\color{blue}{\frac{\alpha}{\beta}}, \beta, \beta\right)}, 0.5, 0.5\right) \]
      7. Applied rewrites100.0%

        \[\leadsto \mathsf{fma}\left(\frac{\alpha - \beta}{-2 - \color{blue}{\mathsf{fma}\left(\frac{\alpha}{\beta}, \beta, \beta\right)}}, 0.5, 0.5\right) \]
    6. Recombined 2 regimes into one program.
    7. Final simplification100.0%

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

    Alternative 2: 97.8% accurate, 0.5× speedup?

    \[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\beta - \alpha}{2 + \left(\alpha + \beta\right)}\\ \mathbf{if}\;t\_0 \leq -0.5:\\ \;\;\;\;\frac{1 + \beta}{\alpha}\\ \mathbf{elif}\;t\_0 \leq 0.001:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.0625, \beta, -0.125\right), \beta, 0.25\right), \beta, 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;1 - \frac{1}{\beta}\\ \end{array} \end{array} \]
    (FPCore (alpha beta)
     :precision binary64
     (let* ((t_0 (/ (- beta alpha) (+ 2.0 (+ alpha beta)))))
       (if (<= t_0 -0.5)
         (/ (+ 1.0 beta) alpha)
         (if (<= t_0 0.001)
           (fma (fma (fma 0.0625 beta -0.125) beta 0.25) beta 0.5)
           (- 1.0 (/ 1.0 beta))))))
    double code(double alpha, double beta) {
    	double t_0 = (beta - alpha) / (2.0 + (alpha + beta));
    	double tmp;
    	if (t_0 <= -0.5) {
    		tmp = (1.0 + beta) / alpha;
    	} else if (t_0 <= 0.001) {
    		tmp = fma(fma(fma(0.0625, beta, -0.125), beta, 0.25), beta, 0.5);
    	} else {
    		tmp = 1.0 - (1.0 / beta);
    	}
    	return tmp;
    }
    
    function code(alpha, beta)
    	t_0 = Float64(Float64(beta - alpha) / Float64(2.0 + Float64(alpha + beta)))
    	tmp = 0.0
    	if (t_0 <= -0.5)
    		tmp = Float64(Float64(1.0 + beta) / alpha);
    	elseif (t_0 <= 0.001)
    		tmp = fma(fma(fma(0.0625, beta, -0.125), beta, 0.25), beta, 0.5);
    	else
    		tmp = Float64(1.0 - Float64(1.0 / beta));
    	end
    	return tmp
    end
    
    code[alpha_, beta_] := Block[{t$95$0 = N[(N[(beta - alpha), $MachinePrecision] / N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -0.5], N[(N[(1.0 + beta), $MachinePrecision] / alpha), $MachinePrecision], If[LessEqual[t$95$0, 0.001], N[(N[(N[(0.0625 * beta + -0.125), $MachinePrecision] * beta + 0.25), $MachinePrecision] * beta + 0.5), $MachinePrecision], N[(1.0 - N[(1.0 / beta), $MachinePrecision]), $MachinePrecision]]]]
    
    \begin{array}{l}
    
    \\
    \begin{array}{l}
    t_0 := \frac{\beta - \alpha}{2 + \left(\alpha + \beta\right)}\\
    \mathbf{if}\;t\_0 \leq -0.5:\\
    \;\;\;\;\frac{1 + \beta}{\alpha}\\
    
    \mathbf{elif}\;t\_0 \leq 0.001:\\
    \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.0625, \beta, -0.125\right), \beta, 0.25\right), \beta, 0.5\right)\\
    
    \mathbf{else}:\\
    \;\;\;\;1 - \frac{1}{\beta}\\
    
    
    \end{array}
    \end{array}
    
    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 8.6%

        \[\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-/.f64N/A

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

          \[\leadsto \frac{\frac{1}{2} \cdot \color{blue}{\left(2 \cdot \beta + 2\right)}}{\alpha} \]
        4. distribute-lft-inN/A

          \[\leadsto \frac{\color{blue}{\frac{1}{2} \cdot \left(2 \cdot \beta\right) + \frac{1}{2} \cdot 2}}{\alpha} \]
        5. metadata-evalN/A

          \[\leadsto \frac{\frac{1}{2} \cdot \left(2 \cdot \beta\right) + \color{blue}{1}}{\alpha} \]
        6. associate-*r*N/A

          \[\leadsto \frac{\color{blue}{\left(\frac{1}{2} \cdot 2\right) \cdot \beta} + 1}{\alpha} \]
        7. metadata-evalN/A

          \[\leadsto \frac{\color{blue}{1} \cdot \beta + 1}{\alpha} \]
        8. *-lft-identityN/A

          \[\leadsto \frac{\color{blue}{\beta} + 1}{\alpha} \]
        9. lower-+.f6497.6

          \[\leadsto \frac{\color{blue}{\beta + 1}}{\alpha} \]
      5. Applied rewrites97.6%

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

      if -0.5 < (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) < 1e-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. +-commutativeN/A

          \[\leadsto \frac{1}{2} \cdot \color{blue}{\left(\frac{\beta}{2 + \beta} + 1\right)} \]
        2. distribute-rgt-inN/A

          \[\leadsto \color{blue}{\frac{\beta}{2 + \beta} \cdot \frac{1}{2} + 1 \cdot \frac{1}{2}} \]
        3. metadata-evalN/A

          \[\leadsto \frac{\beta}{2 + \beta} \cdot \frac{1}{2} + \color{blue}{\frac{1}{2}} \]
        4. lower-fma.f64N/A

          \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{\beta}{2 + \beta}, \frac{1}{2}, \frac{1}{2}\right)} \]
        5. lower-/.f64N/A

          \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{\beta}{2 + \beta}}, \frac{1}{2}, \frac{1}{2}\right) \]
        6. +-commutativeN/A

          \[\leadsto \mathsf{fma}\left(\frac{\beta}{\color{blue}{\beta + 2}}, \frac{1}{2}, \frac{1}{2}\right) \]
        7. metadata-evalN/A

          \[\leadsto \mathsf{fma}\left(\frac{\beta}{\beta + \color{blue}{\left(\mathsf{neg}\left(-2\right)\right)}}, \frac{1}{2}, \frac{1}{2}\right) \]
        8. metadata-evalN/A

          \[\leadsto \mathsf{fma}\left(\frac{\beta}{\beta + \left(\mathsf{neg}\left(\color{blue}{-1 \cdot 2}\right)\right)}, \frac{1}{2}, \frac{1}{2}\right) \]
        9. sub-negN/A

          \[\leadsto \mathsf{fma}\left(\frac{\beta}{\color{blue}{\beta - -1 \cdot 2}}, \frac{1}{2}, \frac{1}{2}\right) \]
        10. lower--.f64N/A

          \[\leadsto \mathsf{fma}\left(\frac{\beta}{\color{blue}{\beta - -1 \cdot 2}}, \frac{1}{2}, \frac{1}{2}\right) \]
        11. metadata-eval98.5

          \[\leadsto \mathsf{fma}\left(\frac{\beta}{\beta - \color{blue}{-2}}, 0.5, 0.5\right) \]
      5. Applied rewrites98.5%

        \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{\beta}{\beta - -2}, 0.5, 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
        1. Applied rewrites98.2%

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

        if 1e-3 < (/.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. +-commutativeN/A

            \[\leadsto \frac{1}{2} \cdot \color{blue}{\left(\frac{\beta}{2 + \beta} + 1\right)} \]
          2. distribute-rgt-inN/A

            \[\leadsto \color{blue}{\frac{\beta}{2 + \beta} \cdot \frac{1}{2} + 1 \cdot \frac{1}{2}} \]
          3. metadata-evalN/A

            \[\leadsto \frac{\beta}{2 + \beta} \cdot \frac{1}{2} + \color{blue}{\frac{1}{2}} \]
          4. lower-fma.f64N/A

            \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{\beta}{2 + \beta}, \frac{1}{2}, \frac{1}{2}\right)} \]
          5. lower-/.f64N/A

            \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{\beta}{2 + \beta}}, \frac{1}{2}, \frac{1}{2}\right) \]
          6. +-commutativeN/A

            \[\leadsto \mathsf{fma}\left(\frac{\beta}{\color{blue}{\beta + 2}}, \frac{1}{2}, \frac{1}{2}\right) \]
          7. metadata-evalN/A

            \[\leadsto \mathsf{fma}\left(\frac{\beta}{\beta + \color{blue}{\left(\mathsf{neg}\left(-2\right)\right)}}, \frac{1}{2}, \frac{1}{2}\right) \]
          8. metadata-evalN/A

            \[\leadsto \mathsf{fma}\left(\frac{\beta}{\beta + \left(\mathsf{neg}\left(\color{blue}{-1 \cdot 2}\right)\right)}, \frac{1}{2}, \frac{1}{2}\right) \]
          9. sub-negN/A

            \[\leadsto \mathsf{fma}\left(\frac{\beta}{\color{blue}{\beta - -1 \cdot 2}}, \frac{1}{2}, \frac{1}{2}\right) \]
          10. lower--.f64N/A

            \[\leadsto \mathsf{fma}\left(\frac{\beta}{\color{blue}{\beta - -1 \cdot 2}}, \frac{1}{2}, \frac{1}{2}\right) \]
          11. metadata-eval98.8

            \[\leadsto \mathsf{fma}\left(\frac{\beta}{\beta - \color{blue}{-2}}, 0.5, 0.5\right) \]
        5. Applied rewrites98.8%

          \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{\beta}{\beta - -2}, 0.5, 0.5\right)} \]
        6. Taylor expanded in beta around inf

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

            \[\leadsto 1 - \color{blue}{\frac{1}{\beta}} \]
        8. Recombined 3 regimes into one program.
        9. Final simplification97.8%

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

        Reproduce

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