Octave 3.8, jcobi/1

Percentage Accurate: 75.9% → 99.3%

Time: 7.2s

Alternatives: 6

Speedup: 0.9×

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: 75.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.3% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

function tmp_2 = code(alpha, beta)
	tmp = 0.0;
	if (((beta - alpha) / ((beta + alpha) + 2.0)) <= -0.8)
		tmp = (beta + 1.0) / alpha;
	else
		tmp = 0.5 + ((alpha - beta) * (-0.5 / (beta + (alpha + 2.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.8], N[(N[(beta + 1.0), $MachinePrecision] / alpha), $MachinePrecision], N[(0.5 + N[(N[(alpha - beta), $MachinePrecision] * N[(-0.5 / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 6.7%

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

      1. +-commutative 6.7%

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

   3. Simplified 6.7%

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

   5. Taylor expanded in alpha around inf 99.3%

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

      1. *-commutative 99.3%

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

   7. Simplified 99.3%

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

   8. Taylor expanded in beta around 0 99.3%

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

      1. +-commutative 99.3%

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

      2. *-lft-identity 99.3%

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

      3. associate-*l/ 99.2%

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

      4. *-rgt-identity 99.2%

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

      5. distribute-lft-in 99.2%

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

      6. associate-*l/ 99.3%

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

      7. *-lft-identity 99.3%

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

   10. Simplified 99.3%

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

   if -0.80000000000000004 < (/.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. Step-by-step derivation

      1. +-commutative 100.0%

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

      2. sub-neg 100.0%

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

      3. +-commutative 100.0%

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

      4. neg-sub0 100.0%

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

      5. associate-+l- 100.0%

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

      6. sub0-neg 100.0%

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

      7. distribute-frac-neg 100.0%

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

      8. +-commutative 100.0%

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

      9. sub-neg 100.0%

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

      10. div-sub 100.0%

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

      11. sub-neg 100.0%

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

      12. metadata-eval 100.0%

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

      13. neg-mul-1 100.0%

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

      14. *-commutative 100.0%

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

      15. +-commutative 100.0%

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

      16. associate-/l/ 100.0%

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

      17. associate-*l/ 100.0%

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

   3. Simplified 100.0%

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

Alternative 2: 93.3% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if alpha < 2.9e17

   1. Initial program 99.8%

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

      1. +-commutative 99.8%

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

      2. sub-neg 99.8%

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

      3. +-commutative 99.8%

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

      4. neg-sub0 99.8%

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

      5. associate-+l- 99.8%

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

      6. sub0-neg 99.8%

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

      7. distribute-frac-neg 99.8%

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

      8. +-commutative 99.8%

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

      9. sub-neg 99.8%

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

      10. div-sub 99.8%

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

      11. sub-neg 99.8%

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

      12. metadata-eval 99.8%

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

      13. neg-mul-1 99.8%

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

      14. *-commutative 99.8%

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

      15. +-commutative 99.8%

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

      16. associate-/l/ 99.8%

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

      17. associate-*l/ 99.8%

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

   3. Simplified 99.8%

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

   5. Taylor expanded in alpha around 0 98.6%

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

      1. metadata-eval 98.6%

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

      2. distribute-neg-frac 98.6%

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

      3. distribute-neg-frac2 98.6%

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

      4. distribute-neg-in 98.6%

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

      5. metadata-eval 98.6%

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

      6. unsub-neg 98.6%

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

   7. Simplified 98.6%

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

   if 2.9e17 < alpha

   1. Initial program 20.7%

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

      1. +-commutative 20.7%

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

   3. Simplified 20.7%

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

   5. Taylor expanded in alpha around inf 84.9%

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

      1. *-commutative 84.9%

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

   7. Simplified 84.9%

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

   8. Taylor expanded in beta around 0 85.0%

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

      1. +-commutative 85.0%

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

      2. *-lft-identity 85.0%

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

      3. associate-*l/ 84.9%

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

      4. *-rgt-identity 84.9%

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

      5. distribute-lft-in 84.9%

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

      6. associate-*l/ 85.0%

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

      7. *-lft-identity 85.0%

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

   10. Simplified 85.0%

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

4. Final simplification 95.3%

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

Alternative 3: 91.2% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (alpha beta)
 :precision binary64
 (if (<= alpha 1.92e+62)
   (/ (+ 1.0 (/ beta (+ beta 2.0))) 2.0)
   (/ (+ beta 1.0) alpha)))

C

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

Fortran

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

Java

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

Python

def code(alpha, beta):
	tmp = 0
	if alpha <= 1.92e+62:
		tmp = (1.0 + (beta / (beta + 2.0))) / 2.0
	else:
		tmp = (beta + 1.0) / alpha
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if alpha < 1.9199999999999999e62

   1. Initial program 97.4%

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

      1. +-commutative 97.4%

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

   3. Simplified 97.4%

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

   5. Taylor expanded in alpha around 0 95.9%

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

      1. +-commutative 95.9%

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

      2. +-commutative 95.9%

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

   7. Simplified 95.9%

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

   if 1.9199999999999999e62 < alpha

   1. Initial program 14.8%

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

      1. +-commutative 14.8%

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

   3. Simplified 14.8%

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

   5. Taylor expanded in alpha around inf 91.1%

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

      1. *-commutative 91.1%

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

   7. Simplified 91.1%

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

   8. Taylor expanded in beta around 0 91.1%

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

      1. +-commutative 91.1%

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

      2. *-lft-identity 91.1%

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

      3. associate-*l/ 91.0%

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

      4. *-rgt-identity 91.0%

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

      5. distribute-lft-in 91.0%

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

      6. associate-*l/ 91.1%

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

      7. *-lft-identity 91.1%

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

   10. Simplified 91.1%

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

4. Final simplification 94.9%

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

Alternative 4: 72.9% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 2

   1. Initial program 76.3%

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

      1. +-commutative 76.3%

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

   3. Simplified 76.3%

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

   5. Taylor expanded in alpha around 0 74.1%

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

      1. +-commutative 74.1%

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

      2. +-commutative 74.1%

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

   7. Simplified 74.1%

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

   8. Taylor expanded in beta around 0 73.4%

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

   if 2 < beta

   1. Initial program 89.2%

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

      1. +-commutative 89.2%

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

      2. sub-neg 89.2%

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

      3. +-commutative 89.2%

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

      4. neg-sub0 89.2%

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

      5. associate-+l- 89.2%

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

      6. sub0-neg 89.2%

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

      7. distribute-frac-neg 89.2%

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

      8. +-commutative 89.2%

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

      9. sub-neg 89.2%

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

      10. div-sub 89.2%

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

      11. sub-neg 89.2%

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

      12. metadata-eval 89.2%

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

      13. neg-mul-1 89.2%

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

      14. *-commutative 89.2%

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

      15. +-commutative 89.2%

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

      16. associate-/l/ 89.2%

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

      17. associate-*l/ 89.2%

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

   3. Simplified 89.2%

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

   5. Taylor expanded in beta around inf 88.9%

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

4. Final simplification 78.3%

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

Alternative 5: 72.5% accurate, 2.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\beta \leq 2.1:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta) :precision binary64 (if (<= beta 2.1) 0.5 1.0))

C

double code(double alpha, double beta) {
	double tmp;
	if (beta <= 2.1) {
		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 <= 2.1d0) 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 <= 2.1) {
		tmp = 0.5;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(alpha, beta):
	tmp = 0
	if beta <= 2.1:
		tmp = 0.5
	else:
		tmp = 1.0
	return tmp

Julia

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

MATLAB

function tmp_2 = code(alpha, beta)
	tmp = 0.0;
	if (beta <= 2.1)
		tmp = 0.5;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[alpha_, beta_] := If[LessEqual[beta, 2.1], 0.5, 1.0]

Derivation

1. Split input into 2 regimes

2. if beta < 2.10000000000000009

   1. Initial program 76.3%

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

      1. +-commutative 76.3%

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

   3. Simplified 76.3%

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

   5. Taylor expanded in beta around 0 75.2%

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

   6. Taylor expanded in alpha around 0 73.1%

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

   if 2.10000000000000009 < beta

   1. Initial program 89.2%

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

      1. +-commutative 89.2%

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

      2. sub-neg 89.2%

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

      3. +-commutative 89.2%

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

      4. neg-sub0 89.2%

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

      5. associate-+l- 89.2%

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

      6. sub0-neg 89.2%

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

      7. distribute-frac-neg 89.2%

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

      8. +-commutative 89.2%

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

      9. sub-neg 89.2%

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

      10. div-sub 89.2%

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

      11. sub-neg 89.2%

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

      12. metadata-eval 89.2%

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

      13. neg-mul-1 89.2%

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

      14. *-commutative 89.2%

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

      15. +-commutative 89.2%

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

      16. associate-/l/ 89.2%

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

      17. associate-*l/ 89.2%

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

   3. Simplified 89.2%

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

   5. Taylor expanded in beta around inf 88.9%

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

4. Final simplification 78.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 2.1:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 50.5% accurate, 13.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 80.3%

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

   1. +-commutative 80.3%

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

3. Simplified 80.3%

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

5. Taylor expanded in beta around 0 56.3%

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

6. Taylor expanded in alpha around 0 55.7%

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

7. Final simplification 55.7%

   \[\leadsto 0.5 \]
8. Add Preprocessing

Reproduce

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