Octave 3.8, jcobi/1

Percentage Accurate: 74.5% → 99.6%

Time: 8.5s

Alternatives: 8

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: 74.5% 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.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{\beta - \alpha}{\left(\beta + \alpha\right) + 2} \leq -0.999999995:\\ \;\;\;\;\frac{\frac{2 + \beta \cdot 2}{\alpha}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{e^{\mathsf{log1p}\left(\frac{\beta - \alpha}{\beta + \left(\alpha + 2\right)}\right)}}{2}\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta)
 :precision binary64
 (if (<= (/ (- beta alpha) (+ (+ beta alpha) 2.0)) -0.999999995)
   (/ (/ (+ 2.0 (* beta 2.0)) alpha) 2.0)
   (/ (exp (log1p (/ (- beta alpha) (+ beta (+ alpha 2.0))))) 2.0)))

C

double code(double alpha, double beta) {
	double tmp;
	if (((beta - alpha) / ((beta + alpha) + 2.0)) <= -0.999999995) {
		tmp = ((2.0 + (beta * 2.0)) / alpha) / 2.0;
	} else {
		tmp = exp(log1p(((beta - alpha) / (beta + (alpha + 2.0))))) / 2.0;
	}
	return tmp;
}

Java

public static double code(double alpha, double beta) {
	double tmp;
	if (((beta - alpha) / ((beta + alpha) + 2.0)) <= -0.999999995) {
		tmp = ((2.0 + (beta * 2.0)) / alpha) / 2.0;
	} else {
		tmp = Math.exp(Math.log1p(((beta - alpha) / (beta + (alpha + 2.0))))) / 2.0;
	}
	return tmp;
}

Python

def code(alpha, beta):
	tmp = 0
	if ((beta - alpha) / ((beta + alpha) + 2.0)) <= -0.999999995:
		tmp = ((2.0 + (beta * 2.0)) / alpha) / 2.0
	else:
		tmp = math.exp(math.log1p(((beta - alpha) / (beta + (alpha + 2.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.999999995)
		tmp = Float64(Float64(Float64(2.0 + Float64(beta * 2.0)) / alpha) / 2.0);
	else
		tmp = Float64(exp(log1p(Float64(Float64(beta - alpha) / Float64(beta + Float64(alpha + 2.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.999999995], N[(N[(N[(2.0 + N[(beta * 2.0), $MachinePrecision]), $MachinePrecision] / alpha), $MachinePrecision] / 2.0), $MachinePrecision], N[(N[Exp[N[Log[1 + N[(N[(beta - alpha), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $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.99999999500000003

   1. Initial program 5.8%

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

      1. +-commutative 5.8%

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

   3. Simplified 5.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 99.9%

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

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

   1. Initial program 99.7%

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

      1. +-commutative 99.7%

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

   3. Simplified 99.7%

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

      1. add-exp-log 99.8%

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

      2. +-commutative 99.8%

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

      3. log1p-define 99.8%

         \[\leadsto \frac{e^{\color{blue}{\mathsf{log1p}\left(\frac{\beta - \alpha}{\left(\beta + \alpha\right) + 2}\right)}}}{2} \]

      4. associate-+l+ 99.8%

         \[\leadsto \frac{e^{\mathsf{log1p}\left(\frac{\beta - \alpha}{\color{blue}{\beta + \left(\alpha + 2\right)}}\right)}}{2} \]

   6. Applied egg-rr 99.8%

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

Alternative 2: 99.6% 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.999999995:\\ \;\;\;\;\frac{\frac{2 + \beta \cdot 2}{\alpha}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{t\_0 + 1}{2}\\ \end{array} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

MATLAB

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

Wolfram

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

   1. Initial program 5.8%

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

      1. +-commutative 5.8%

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

   3. Simplified 5.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 99.9%

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

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

   1. Initial program 99.7%

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

Alternative 3: 92.6% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if alpha < 2.7e25

   1. Initial program 98.6%

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

      1. +-commutative 98.6%

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

   3. Simplified 98.6%

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

   5. Taylor expanded in alpha around 0 96.1%

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

   if 2.7e25 < alpha

   1. Initial program 17.8%

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

      1. +-commutative 17.8%

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

   3. Simplified 17.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 88.3%

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

4. Final simplification 93.4%

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

Alternative 4: 87.3% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if alpha < 2.7e25

   1. Initial program 98.6%

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

      1. +-commutative 98.6%

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

   3. Simplified 98.6%

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

   5. Taylor expanded in alpha around 0 96.1%

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

   if 2.7e25 < alpha

   1. Initial program 17.8%

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

      1. +-commutative 17.8%

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

   3. Simplified 17.8%

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

   5. Taylor expanded in beta around 0 5.3%

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

      1. +-commutative 5.3%

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

   7. Simplified 5.3%

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

   8. Taylor expanded in alpha around inf 73.0%

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

4. Final simplification 88.3%

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

Alternative 5: 69.8% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if alpha < 0.97999999999999998

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

   3. Simplified 100.0%

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

   5. Taylor expanded in beta around 0 71.0%

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

      1. +-commutative 71.0%

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

   7. Simplified 71.0%

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

   8. Taylor expanded in alpha around 0 70.4%

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

      1. *-commutative 70.4%

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

   10. Simplified 70.4%

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

   if 0.97999999999999998 < alpha

   1. Initial program 22.2%

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

      1. +-commutative 22.2%

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

   3. Simplified 22.2%

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

   5. Taylor expanded in beta around 0 7.8%

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

      1. +-commutative 7.8%

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

   7. Simplified 7.8%

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

   8. Taylor expanded in alpha around inf 69.6%

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

Alternative 6: 69.2% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\alpha \leq 1.9:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{2}{\alpha}}{2}\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta)
 :precision binary64
 (if (<= alpha 1.9) 0.5 (/ (/ 2.0 alpha) 2.0)))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[alpha_, beta_] := If[LessEqual[alpha, 1.9], 0.5, N[(N[(2.0 / alpha), $MachinePrecision] / 2.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if alpha < 1.8999999999999999

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

   3. Simplified 100.0%

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

      1. add-exp-log 100.0%

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

      2. +-commutative 100.0%

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

      3. log1p-define 100.0%

         \[\leadsto \frac{e^{\color{blue}{\mathsf{log1p}\left(\frac{\beta - \alpha}{\left(\beta + \alpha\right) + 2}\right)}}}{2} \]

      4. associate-+l+ 100.0%

         \[\leadsto \frac{e^{\mathsf{log1p}\left(\frac{\beta - \alpha}{\color{blue}{\beta + \left(\alpha + 2\right)}}\right)}}{2} \]

   6. Applied egg-rr 100.0%

      \[\leadsto \frac{\color{blue}{e^{\mathsf{log1p}\left(\frac{\beta - \alpha}{\beta + \left(\alpha + 2\right)}\right)}}}{2} \]

   7. Taylor expanded in beta around 0 71.0%

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

      1. sub-neg 71.0%

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

      2. log1p-define 71.0%

         \[\leadsto \frac{e^{\color{blue}{\mathsf{log1p}\left(-\frac{\alpha}{2 + \alpha}\right)}}}{2} \]

      3. +-commutative 71.0%

         \[\leadsto \frac{e^{\mathsf{log1p}\left(-\frac{\alpha}{\color{blue}{\alpha + 2}}\right)}}{2} \]

      4. distribute-neg-frac2 71.0%

         \[\leadsto \frac{e^{\mathsf{log1p}\left(\color{blue}{\frac{\alpha}{-\left(\alpha + 2\right)}}\right)}}{2} \]

      5. +-commutative 71.0%

         \[\leadsto \frac{e^{\mathsf{log1p}\left(\frac{\alpha}{-\color{blue}{\left(2 + \alpha\right)}}\right)}}{2} \]

      6. distribute-neg-in 71.0%

         \[\leadsto \frac{e^{\mathsf{log1p}\left(\frac{\alpha}{\color{blue}{\left(-2\right) + \left(-\alpha\right)}}\right)}}{2} \]

      7. metadata-eval 71.0%

         \[\leadsto \frac{e^{\mathsf{log1p}\left(\frac{\alpha}{\color{blue}{-2} + \left(-\alpha\right)}\right)}}{2} \]

      8. sub-neg 71.0%

         \[\leadsto \frac{e^{\mathsf{log1p}\left(\frac{\alpha}{\color{blue}{-2 - \alpha}}\right)}}{2} \]

   9. Simplified 71.0%

      \[\leadsto \frac{e^{\color{blue}{\mathsf{log1p}\left(\frac{\alpha}{-2 - \alpha}\right)}}}{2} \]

   10. Taylor expanded in alpha around 0 69.6%

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

   if 1.8999999999999999 < alpha

   1. Initial program 22.2%

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

      1. +-commutative 22.2%

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

   3. Simplified 22.2%

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

   5. Taylor expanded in beta around 0 7.8%

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

      1. +-commutative 7.8%

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

   7. Simplified 7.8%

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

   8. Taylor expanded in alpha around inf 69.6%

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

4. Final simplification 69.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\alpha \leq 1.9:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{2}{\alpha}}{2}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 71.1% accurate, 2.2× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 2

   1. Initial program 65.2%

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

      1. +-commutative 65.2%

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

   3. Simplified 65.2%

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

      1. add-exp-log 65.2%

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

      2. +-commutative 65.2%

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

      3. log1p-define 65.2%

         \[\leadsto \frac{e^{\color{blue}{\mathsf{log1p}\left(\frac{\beta - \alpha}{\left(\beta + \alpha\right) + 2}\right)}}}{2} \]

      4. associate-+l+ 65.2%

         \[\leadsto \frac{e^{\mathsf{log1p}\left(\frac{\beta - \alpha}{\color{blue}{\beta + \left(\alpha + 2\right)}}\right)}}{2} \]

   6. Applied egg-rr 65.2%

      \[\leadsto \frac{\color{blue}{e^{\mathsf{log1p}\left(\frac{\beta - \alpha}{\beta + \left(\alpha + 2\right)}\right)}}}{2} \]

   7. Taylor expanded in beta around 0 64.1%

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

      1. sub-neg 64.1%

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

      2. log1p-define 64.1%

         \[\leadsto \frac{e^{\color{blue}{\mathsf{log1p}\left(-\frac{\alpha}{2 + \alpha}\right)}}}{2} \]

      3. +-commutative 64.1%

         \[\leadsto \frac{e^{\mathsf{log1p}\left(-\frac{\alpha}{\color{blue}{\alpha + 2}}\right)}}{2} \]

      4. distribute-neg-frac2 64.1%

         \[\leadsto \frac{e^{\mathsf{log1p}\left(\color{blue}{\frac{\alpha}{-\left(\alpha + 2\right)}}\right)}}{2} \]

      5. +-commutative 64.1%

         \[\leadsto \frac{e^{\mathsf{log1p}\left(\frac{\alpha}{-\color{blue}{\left(2 + \alpha\right)}}\right)}}{2} \]

      6. distribute-neg-in 64.1%

         \[\leadsto \frac{e^{\mathsf{log1p}\left(\frac{\alpha}{\color{blue}{\left(-2\right) + \left(-\alpha\right)}}\right)}}{2} \]

      7. metadata-eval 64.1%

         \[\leadsto \frac{e^{\mathsf{log1p}\left(\frac{\alpha}{\color{blue}{-2} + \left(-\alpha\right)}\right)}}{2} \]

      8. sub-neg 64.1%

         \[\leadsto \frac{e^{\mathsf{log1p}\left(\frac{\alpha}{\color{blue}{-2 - \alpha}}\right)}}{2} \]

   9. Simplified 64.1%

      \[\leadsto \frac{e^{\color{blue}{\mathsf{log1p}\left(\frac{\alpha}{-2 - \alpha}\right)}}}{2} \]

   10. Taylor expanded in alpha around 0 61.2%

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

   if 2 < beta

   1. Initial program 83.2%

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

      1. +-commutative 83.2%

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

   3. Simplified 83.2%

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

   5. Taylor expanded in beta around inf 80.3%

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

4. Final simplification 67.5%

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

Alternative 8: 49.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 71.1%

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

   1. +-commutative 71.1%

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

3. Simplified 71.1%

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

   1. add-exp-log 71.1%

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

   2. +-commutative 71.1%

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

   3. log1p-define 71.1%

      \[\leadsto \frac{e^{\color{blue}{\mathsf{log1p}\left(\frac{\beta - \alpha}{\left(\beta + \alpha\right) + 2}\right)}}}{2} \]

   4. associate-+l+ 71.1%

      \[\leadsto \frac{e^{\mathsf{log1p}\left(\frac{\beta - \alpha}{\color{blue}{\beta + \left(\alpha + 2\right)}}\right)}}{2} \]

6. Applied egg-rr 71.1%

   \[\leadsto \frac{\color{blue}{e^{\mathsf{log1p}\left(\frac{\beta - \alpha}{\beta + \left(\alpha + 2\right)}\right)}}}{2} \]

7. Taylor expanded in beta around 0 47.5%

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

   1. sub-neg 47.5%

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

   2. log1p-define 47.5%

      \[\leadsto \frac{e^{\color{blue}{\mathsf{log1p}\left(-\frac{\alpha}{2 + \alpha}\right)}}}{2} \]

   3. +-commutative 47.5%

      \[\leadsto \frac{e^{\mathsf{log1p}\left(-\frac{\alpha}{\color{blue}{\alpha + 2}}\right)}}{2} \]

   4. distribute-neg-frac2 47.5%

      \[\leadsto \frac{e^{\mathsf{log1p}\left(\color{blue}{\frac{\alpha}{-\left(\alpha + 2\right)}}\right)}}{2} \]

   5. +-commutative 47.5%

      \[\leadsto \frac{e^{\mathsf{log1p}\left(\frac{\alpha}{-\color{blue}{\left(2 + \alpha\right)}}\right)}}{2} \]

   6. distribute-neg-in 47.5%

      \[\leadsto \frac{e^{\mathsf{log1p}\left(\frac{\alpha}{\color{blue}{\left(-2\right) + \left(-\alpha\right)}}\right)}}{2} \]

   7. metadata-eval 47.5%

      \[\leadsto \frac{e^{\mathsf{log1p}\left(\frac{\alpha}{\color{blue}{-2} + \left(-\alpha\right)}\right)}}{2} \]

   8. sub-neg 47.5%

      \[\leadsto \frac{e^{\mathsf{log1p}\left(\frac{\alpha}{\color{blue}{-2 - \alpha}}\right)}}{2} \]

9. Simplified 47.5%

   \[\leadsto \frac{e^{\color{blue}{\mathsf{log1p}\left(\frac{\alpha}{-2 - \alpha}\right)}}}{2} \]

10. Taylor expanded in alpha around 0 46.5%

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

11. Final simplification 46.5%

    \[\leadsto 0.5 \]
12. Add Preprocessing

Reproduce

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