Octave 3.8, jcobi/1

Percentage Accurate: 73.8% → 99.5%

Time: 9.3s

Alternatives: 11

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: 73.8% 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.5% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\beta - \alpha}{\left(\beta + \alpha\right) + 2}\\ \mathbf{if}\;t\_0 \leq -0.6:\\ \;\;\;\;\frac{\frac{2 + \left(\beta \cdot \left(2 - \frac{2}{\alpha}\right) - \frac{4}{\alpha}\right)}{\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.6)
     (/ (/ (+ 2.0 (- (* beta (- 2.0 (/ 2.0 alpha))) (/ 4.0 alpha))) 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.6) {
		tmp = ((2.0 + ((beta * (2.0 - (2.0 / alpha))) - (4.0 / alpha))) / 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.6d0)) then
        tmp = ((2.0d0 + ((beta * (2.0d0 - (2.0d0 / alpha))) - (4.0d0 / alpha))) / 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.6) {
		tmp = ((2.0 + ((beta * (2.0 - (2.0 / alpha))) - (4.0 / alpha))) / 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.6:
		tmp = ((2.0 + ((beta * (2.0 - (2.0 / alpha))) - (4.0 / alpha))) / 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.6)
		tmp = Float64(Float64(Float64(2.0 + Float64(Float64(beta * Float64(2.0 - Float64(2.0 / alpha))) - Float64(4.0 / alpha))) / 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.6)
		tmp = ((2.0 + ((beta * (2.0 - (2.0 / alpha))) - (4.0 / alpha))) / 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.6], N[(N[(N[(2.0 + N[(N[(beta * N[(2.0 - N[(2.0 / alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 / alpha), $MachinePrecision]), $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.599999999999999978

   1. Initial program 6.4%

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

      1. +-commutative 6.4%

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

   3. Simplified 6.4%

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

   5. Taylor expanded in alpha around inf 98.6%

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

      1. +-commutative 98.6%

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

      2. associate--l+ 98.6%

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

      3. +-commutative 98.6%

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

      4. mul-1-neg 98.6%

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

      5. unsub-neg 98.6%

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

      6. sub-neg 98.6%

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

      7. associate-/l* 98.6%

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

      8. distribute-rgt-neg-in 98.6%

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

      9. distribute-frac-neg 98.6%

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

      10. distribute-neg-in 98.6%

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

      11. metadata-eval 98.6%

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

      12. unsub-neg 98.6%

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

   7. Simplified 98.6%

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

   8. Taylor expanded in beta around 0 100.0%

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

   9. Taylor expanded in beta around 0 99.9%

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

       1. associate--l+ 100.0%

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

       2. associate-*r/ 100.0%

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

       3. metadata-eval 100.0%

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

       4. associate-*r/ 100.0%

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

       5. metadata-eval 100.0%

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

   11. Simplified 100.0%

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

   if -0.599999999999999978 < (/.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. Recombined 2 regimes into one program.

4. Final simplification 100.0%

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

Alternative 2: 99.3% 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.6:\\ \;\;\;\;\frac{2 \cdot \frac{\beta}{\alpha} + 2 \cdot \frac{1}{\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.6)
     (/ (+ (* 2.0 (/ beta alpha)) (* 2.0 (/ 1.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.6) {
		tmp = ((2.0 * (beta / alpha)) + (2.0 * (1.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.6d0)) then
        tmp = ((2.0d0 * (beta / alpha)) + (2.0d0 * (1.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.6) {
		tmp = ((2.0 * (beta / alpha)) + (2.0 * (1.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.6:
		tmp = ((2.0 * (beta / alpha)) + (2.0 * (1.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.6)
		tmp = Float64(Float64(Float64(2.0 * Float64(beta / alpha)) + Float64(2.0 * Float64(1.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.6)
		tmp = ((2.0 * (beta / alpha)) + (2.0 * (1.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.6], N[(N[(N[(2.0 * N[(beta / alpha), $MachinePrecision]), $MachinePrecision] + N[(2.0 * N[(1.0 / alpha), $MachinePrecision]), $MachinePrecision]), $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.599999999999999978

   1. Initial program 6.4%

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

      1. +-commutative 6.4%

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

   3. Simplified 6.4%

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

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

   6. Taylor expanded in beta around 0 99.6%

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

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

Alternative 3: 66.1% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\beta \leq 1.75 \cdot 10^{-295}:\\ \;\;\;\;\frac{1 - \alpha \cdot 0.5}{2}\\ \mathbf{elif}\;\beta \leq 3.2 \cdot 10^{-164}:\\ \;\;\;\;\frac{\frac{2}{\alpha}}{2}\\ \mathbf{elif}\;\beta \leq 2:\\ \;\;\;\;\frac{1 + \beta \cdot 0.5}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 - \frac{2}{\beta}}{2}\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta)
 :precision binary64
 (if (<= beta 1.75e-295)
   (/ (- 1.0 (* alpha 0.5)) 2.0)
   (if (<= beta 3.2e-164)
     (/ (/ 2.0 alpha) 2.0)
     (if (<= beta 2.0)
       (/ (+ 1.0 (* beta 0.5)) 2.0)
       (/ (- 2.0 (/ 2.0 beta)) 2.0)))))

C

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

Java

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

Python

def code(alpha, beta):
	tmp = 0
	if beta <= 1.75e-295:
		tmp = (1.0 - (alpha * 0.5)) / 2.0
	elif beta <= 3.2e-164:
		tmp = (2.0 / alpha) / 2.0
	elif beta <= 2.0:
		tmp = (1.0 + (beta * 0.5)) / 2.0
	else:
		tmp = (2.0 - (2.0 / beta)) / 2.0
	return tmp

Julia

function code(alpha, beta)
	tmp = 0.0
	if (beta <= 1.75e-295)
		tmp = Float64(Float64(1.0 - Float64(alpha * 0.5)) / 2.0);
	elseif (beta <= 3.2e-164)
		tmp = Float64(Float64(2.0 / alpha) / 2.0);
	elseif (beta <= 2.0)
		tmp = Float64(Float64(1.0 + Float64(beta * 0.5)) / 2.0);
	else
		tmp = Float64(Float64(2.0 - Float64(2.0 / beta)) / 2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(alpha, beta)
	tmp = 0.0;
	if (beta <= 1.75e-295)
		tmp = (1.0 - (alpha * 0.5)) / 2.0;
	elseif (beta <= 3.2e-164)
		tmp = (2.0 / alpha) / 2.0;
	elseif (beta <= 2.0)
		tmp = (1.0 + (beta * 0.5)) / 2.0;
	else
		tmp = (2.0 - (2.0 / beta)) / 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 4 regimes

2. if beta < 1.74999999999999994e-295

   1. Initial program 70.4%

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

      1. +-commutative 70.4%

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

   3. Simplified 70.4%

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

   5. Taylor expanded in beta around 0 70.4%

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

      1. +-commutative 70.4%

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

   7. Simplified 70.4%

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

   8. Taylor expanded in alpha around 0 68.0%

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

   if 1.74999999999999994e-295 < beta < 3.2e-164

   1. Initial program 42.1%

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

      1. +-commutative 42.1%

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

   3. Simplified 42.1%

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

   5. Taylor expanded in alpha around inf 62.4%

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

   6. Taylor expanded in beta around 0 62.4%

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

   if 3.2e-164 < beta < 2

   1. Initial program 76.4%

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

      1. +-commutative 76.4%

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

   3. Simplified 76.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 74.7%

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

   6. Taylor expanded in beta around 0 74.7%

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

      1. *-commutative 74.7%

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

   8. Simplified 74.7%

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

   if 2 < beta

   1. Initial program 86.9%

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

      1. +-commutative 86.9%

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

   3. Simplified 86.9%

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

   5. Taylor expanded in alpha around 0 85.8%

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

   6. Taylor expanded in beta around inf 85.0%

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

      1. associate-*r/ 85.0%

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

      2. metadata-eval 85.0%

         \[\leadsto \frac{2 - \frac{\color{blue}{2}}{\beta}}{2} \]

   8. Simplified 85.0%

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

4. Final simplification 74.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 1.75 \cdot 10^{-295}:\\ \;\;\;\;\frac{1 - \alpha \cdot 0.5}{2}\\ \mathbf{elif}\;\beta \leq 3.2 \cdot 10^{-164}:\\ \;\;\;\;\frac{\frac{2}{\alpha}}{2}\\ \mathbf{elif}\;\beta \leq 2:\\ \;\;\;\;\frac{1 + \beta \cdot 0.5}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 - \frac{2}{\beta}}{2}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 65.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\beta \leq 1.75 \cdot 10^{-295}:\\ \;\;\;\;\frac{1 - \alpha \cdot 0.5}{2}\\ \mathbf{elif}\;\beta \leq 3.1 \cdot 10^{-164}:\\ \;\;\;\;\frac{\frac{2}{\alpha}}{2}\\ \mathbf{elif}\;\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 1.75e-295)
   (/ (- 1.0 (* alpha 0.5)) 2.0)
   (if (<= beta 3.1e-164)
     (/ (/ 2.0 alpha) 2.0)
     (if (<= beta 2.0) (/ (+ 1.0 (* beta 0.5)) 2.0) 1.0))))

C

double code(double alpha, double beta) {
	double tmp;
	if (beta <= 1.75e-295) {
		tmp = (1.0 - (alpha * 0.5)) / 2.0;
	} else if (beta <= 3.1e-164) {
		tmp = (2.0 / alpha) / 2.0;
	} else 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 <= 1.75d-295) then
        tmp = (1.0d0 - (alpha * 0.5d0)) / 2.0d0
    else if (beta <= 3.1d-164) then
        tmp = (2.0d0 / alpha) / 2.0d0
    else 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 <= 1.75e-295) {
		tmp = (1.0 - (alpha * 0.5)) / 2.0;
	} else if (beta <= 3.1e-164) {
		tmp = (2.0 / alpha) / 2.0;
	} else 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 <= 1.75e-295:
		tmp = (1.0 - (alpha * 0.5)) / 2.0
	elif beta <= 3.1e-164:
		tmp = (2.0 / alpha) / 2.0
	elif 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 <= 1.75e-295)
		tmp = Float64(Float64(1.0 - Float64(alpha * 0.5)) / 2.0);
	elseif (beta <= 3.1e-164)
		tmp = Float64(Float64(2.0 / alpha) / 2.0);
	elseif (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 <= 1.75e-295)
		tmp = (1.0 - (alpha * 0.5)) / 2.0;
	elseif (beta <= 3.1e-164)
		tmp = (2.0 / alpha) / 2.0;
	elseif (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, 1.75e-295], N[(N[(1.0 - N[(alpha * 0.5), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], If[LessEqual[beta, 3.1e-164], N[(N[(2.0 / alpha), $MachinePrecision] / 2.0), $MachinePrecision], 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 4 regimes

2. if beta < 1.74999999999999994e-295

   1. Initial program 70.4%

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

      1. +-commutative 70.4%

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

   3. Simplified 70.4%

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

   5. Taylor expanded in beta around 0 70.4%

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

      1. +-commutative 70.4%

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

   7. Simplified 70.4%

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

   8. Taylor expanded in alpha around 0 68.0%

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

   if 1.74999999999999994e-295 < beta < 3.1000000000000001e-164

   1. Initial program 42.1%

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

      1. +-commutative 42.1%

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

   3. Simplified 42.1%

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

   5. Taylor expanded in alpha around inf 62.4%

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

   6. Taylor expanded in beta around 0 62.4%

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

   if 3.1000000000000001e-164 < beta < 2

   1. Initial program 76.4%

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

      1. +-commutative 76.4%

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

   3. Simplified 76.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 74.7%

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

   6. Taylor expanded in beta around 0 74.7%

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

      1. *-commutative 74.7%

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

   8. Simplified 74.7%

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

   if 2 < beta

   1. Initial program 86.9%

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

      1. +-commutative 86.9%

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

   3. Simplified 86.9%

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

   5. Taylor expanded in beta around inf 84.1%

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

4. Final simplification 74.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 1.75 \cdot 10^{-295}:\\ \;\;\;\;\frac{1 - \alpha \cdot 0.5}{2}\\ \mathbf{elif}\;\beta \leq 3.1 \cdot 10^{-164}:\\ \;\;\;\;\frac{\frac{2}{\alpha}}{2}\\ \mathbf{elif}\;\beta \leq 2:\\ \;\;\;\;\frac{1 + \beta \cdot 0.5}{2}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 66.4% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{1 + \beta \cdot 0.5}{2}\\ \mathbf{if}\;\beta \leq 1.7 \cdot 10^{-295}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;\beta \leq 3.1 \cdot 10^{-164}:\\ \;\;\;\;\frac{\frac{2}{\alpha}}{2}\\ \mathbf{elif}\;\beta \leq 2:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta)
 :precision binary64
 (let* ((t_0 (/ (+ 1.0 (* beta 0.5)) 2.0)))
   (if (<= beta 1.7e-295)
     t_0
     (if (<= beta 3.1e-164)
       (/ (/ 2.0 alpha) 2.0)
       (if (<= beta 2.0) t_0 1.0)))))

C

double code(double alpha, double beta) {
	double t_0 = (1.0 + (beta * 0.5)) / 2.0;
	double tmp;
	if (beta <= 1.7e-295) {
		tmp = t_0;
	} else if (beta <= 3.1e-164) {
		tmp = (2.0 / alpha) / 2.0;
	} else if (beta <= 2.0) {
		tmp = t_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) :: t_0
    real(8) :: tmp
    t_0 = (1.0d0 + (beta * 0.5d0)) / 2.0d0
    if (beta <= 1.7d-295) then
        tmp = t_0
    else if (beta <= 3.1d-164) then
        tmp = (2.0d0 / alpha) / 2.0d0
    else if (beta <= 2.0d0) then
        tmp = t_0
    else
        tmp = 1.0d0
    end if
    code = tmp
end function

Java

public static double code(double alpha, double beta) {
	double t_0 = (1.0 + (beta * 0.5)) / 2.0;
	double tmp;
	if (beta <= 1.7e-295) {
		tmp = t_0;
	} else if (beta <= 3.1e-164) {
		tmp = (2.0 / alpha) / 2.0;
	} else if (beta <= 2.0) {
		tmp = t_0;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(alpha, beta):
	t_0 = (1.0 + (beta * 0.5)) / 2.0
	tmp = 0
	if beta <= 1.7e-295:
		tmp = t_0
	elif beta <= 3.1e-164:
		tmp = (2.0 / alpha) / 2.0
	elif beta <= 2.0:
		tmp = t_0
	else:
		tmp = 1.0
	return tmp

Julia

function code(alpha, beta)
	t_0 = Float64(Float64(1.0 + Float64(beta * 0.5)) / 2.0)
	tmp = 0.0
	if (beta <= 1.7e-295)
		tmp = t_0;
	elseif (beta <= 3.1e-164)
		tmp = Float64(Float64(2.0 / alpha) / 2.0);
	elseif (beta <= 2.0)
		tmp = t_0;
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(alpha, beta)
	t_0 = (1.0 + (beta * 0.5)) / 2.0;
	tmp = 0.0;
	if (beta <= 1.7e-295)
		tmp = t_0;
	elseif (beta <= 3.1e-164)
		tmp = (2.0 / alpha) / 2.0;
	elseif (beta <= 2.0)
		tmp = t_0;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if beta < 1.70000000000000004e-295 or 3.1000000000000001e-164 < beta < 2

   1. Initial program 72.3%

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

      1. +-commutative 72.3%

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

   3. Simplified 72.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 69.7%

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

   6. Taylor expanded in beta around 0 69.7%

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

      1. *-commutative 69.7%

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

   8. Simplified 69.7%

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

   if 1.70000000000000004e-295 < beta < 3.1000000000000001e-164

   1. Initial program 42.1%

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

      1. +-commutative 42.1%

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

   3. Simplified 42.1%

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

   5. Taylor expanded in alpha around inf 62.4%

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

   6. Taylor expanded in beta around 0 62.4%

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

   if 2 < beta

   1. Initial program 86.9%

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

      1. +-commutative 86.9%

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

   3. Simplified 86.9%

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

   5. Taylor expanded in beta around inf 84.1%

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

4. Final simplification 73.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 1.7 \cdot 10^{-295}:\\ \;\;\;\;\frac{1 + \beta \cdot 0.5}{2}\\ \mathbf{elif}\;\beta \leq 3.1 \cdot 10^{-164}:\\ \;\;\;\;\frac{\frac{2}{\alpha}}{2}\\ \mathbf{elif}\;\beta \leq 2:\\ \;\;\;\;\frac{1 + \beta \cdot 0.5}{2}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 93.4% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if alpha < 2.05e9

   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 alpha around 0 97.4%

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

   if 2.05e9 < alpha

   1. Initial program 24.3%

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

      1. +-commutative 24.3%

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

   3. Simplified 24.3%

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

   5. Taylor expanded in alpha around inf 82.0%

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

   6. Taylor expanded in beta around 0 82.0%

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

4. Final simplification 92.0%

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

Alternative 7: 93.4% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\alpha \leq 50000000000:\\ \;\;\;\;\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 50000000000.0)
   (/ (+ 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 <= 50000000000.0) {
		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 <= 50000000000.0d0) 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 <= 50000000000.0) {
		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 <= 50000000000.0:
		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 <= 50000000000.0)
		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 <= 50000000000.0)
		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, 50000000000.0], 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 < 5e10

   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 alpha around 0 97.4%

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

   if 5e10 < alpha

   1. Initial program 24.3%

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

      1. +-commutative 24.3%

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

   3. Simplified 24.3%

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

   5. Taylor expanded in alpha around inf 82.0%

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

4. Final simplification 92.0%

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

Alternative 8: 87.5% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\alpha \leq 48000000000:\\ \;\;\;\;\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 48000000000.0)
   (/ (+ 1.0 (/ beta (+ beta 2.0))) 2.0)
   (/ (/ 2.0 alpha) 2.0)))

C

double code(double alpha, double beta) {
	double tmp;
	if (alpha <= 48000000000.0) {
		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 <= 48000000000.0d0) 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 <= 48000000000.0) {
		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 <= 48000000000.0:
		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 <= 48000000000.0)
		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 <= 48000000000.0)
		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, 48000000000.0], 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 < 4.8e10

   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 alpha around 0 97.4%

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

   if 4.8e10 < alpha

   1. Initial program 24.3%

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

      1. +-commutative 24.3%

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

   3. Simplified 24.3%

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

   5. Taylor expanded in alpha around inf 82.0%

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

   6. Taylor expanded in beta around 0 67.4%

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

4. Final simplification 86.9%

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

Alternative 9: 50.1% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\beta \leq 1.5 \cdot 10^{-37}:\\ \;\;\;\;\frac{\frac{2}{\alpha}}{2}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta)
 :precision binary64
 (if (<= beta 1.5e-37) (/ (/ 2.0 alpha) 2.0) 1.0))

C

double code(double alpha, double beta) {
	double tmp;
	if (beta <= 1.5e-37) {
		tmp = (2.0 / alpha) / 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 <= 1.5d-37) then
        tmp = (2.0d0 / alpha) / 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 <= 1.5e-37) {
		tmp = (2.0 / alpha) / 2.0;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(alpha, beta):
	tmp = 0
	if beta <= 1.5e-37:
		tmp = (2.0 / alpha) / 2.0
	else:
		tmp = 1.0
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 1.5e-37

   1. Initial program 64.5%

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

      1. +-commutative 64.5%

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

   3. Simplified 64.5%

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

   5. Taylor expanded in alpha around inf 40.0%

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

   6. Taylor expanded in beta around 0 39.5%

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

   if 1.5e-37 < beta

   1. Initial program 87.6%

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

      1. +-commutative 87.6%

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

   3. Simplified 87.6%

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

   5. Taylor expanded in beta around inf 75.5%

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

4. Final simplification 53.7%

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

Alternative 10: 40.1% accurate, 1.6× speedup

Math

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

FPCore

(FPCore (alpha beta)
 :precision binary64
 (if (<= alpha 1e+145) 1.0 (/ beta alpha)))

C

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

Java

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

Python

def code(alpha, beta):
	tmp = 0
	if alpha <= 1e+145:
		tmp = 1.0
	else:
		tmp = beta / alpha
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if alpha < 9.9999999999999999e144

   1. Initial program 86.2%

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

      1. +-commutative 86.2%

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

   3. Simplified 86.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 43.4%

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

   if 9.9999999999999999e144 < alpha

   1. Initial program 14.7%

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

      1. +-commutative 14.7%

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

   3. Simplified 14.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 91.6%

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

   6. Taylor expanded in beta around inf 27.7%

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

   7. Taylor expanded in beta around 0 27.7%

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

4. Final simplification 40.7%

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

Alternative 11: 37.0% accurate, 13.0× speedup

Math

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

FPCore

(FPCore (alpha beta) :precision binary64 1.0)

C

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

Fortran

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

Java

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

Python

def code(alpha, beta):
	return 1.0

Julia

function code(alpha, beta)
	return 1.0
end

MATLAB

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

Wolfram

code[alpha_, beta_] := 1.0

Derivation

1. Initial program 73.7%

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

   1. +-commutative 73.7%

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

3. Simplified 73.7%

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

5. Taylor expanded in beta around inf 38.0%

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

6. Final simplification 38.0%

   \[\leadsto 1 \]
7. Add Preprocessing

Reproduce

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