Octave 3.8, jcobi/1

Percentage Accurate: 74.1% → 99.8%

Time: 7.4s

Alternatives: 12

Speedup: 1.2×

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.1% 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.8% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\beta - \alpha}{\left(\beta + \alpha\right) + 2}\\ \mathbf{if}\;t_0 \leq -0.998:\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{\left(-2 - \beta\right) - \beta}{\alpha}, \frac{\beta + 2}{\alpha}, \frac{\beta + \left(\beta + 2\right)}{\alpha}\right)}{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.998)
     (/
      (fma
       (/ (- (- -2.0 beta) beta) alpha)
       (/ (+ beta 2.0) alpha)
       (/ (+ beta (+ 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.998) {
		tmp = fma((((-2.0 - beta) - beta) / alpha), ((beta + 2.0) / alpha), ((beta + (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.998)
		tmp = Float64(fma(Float64(Float64(Float64(-2.0 - beta) - beta) / alpha), Float64(Float64(beta + 2.0) / alpha), Float64(Float64(beta + Float64(beta + 2.0)) / alpha)) / 2.0);
	else
		tmp = Float64(Float64(t_0 + 1.0) / 2.0);
	end
	return tmp
end

Wolfram

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

   1. Initial program 8.0%

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

      1. +-commutative 8.0%

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

   3. Simplified 8.0%

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

   4. Taylor expanded in alpha around -inf 94.2%

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

   6. Simplified 99.8%

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

   if -0.998 < (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) 2))

   1. Initial program 99.9%

      \[\frac{\frac{\beta - \alpha}{\left(\alpha + \beta\right) + 2} + 1}{2} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\beta - \alpha}{\left(\beta + \alpha\right) + 2} \leq -0.998:\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{\left(-2 - \beta\right) - \beta}{\alpha}, \frac{\beta + 2}{\alpha}, \frac{\beta + \left(\beta + 2\right)}{\alpha}\right)}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\beta - \alpha}{\left(\beta + \alpha\right) + 2} + 1}{2}\\ \end{array} \]

Alternative 2: 99.7% accurate, 0.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) 2)) < -0.999999949999999971

   1. Initial program 7.1%

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

      1. +-commutative 7.1%

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

   3. Simplified 7.1%

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

   4. Taylor expanded in alpha around -inf 99.0%

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

      1. associate-*r/ 99.0%

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

      2. sub-neg 99.0%

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

      3. mul-1-neg 99.0%

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

      4. distribute-lft-in 99.0%

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

      5. neg-mul-1 99.0%

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

      6. mul-1-neg 99.0%

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

      7. remove-double-neg 99.0%

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

      8. neg-mul-1 99.0%

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

      9. mul-1-neg 99.0%

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

      10. remove-double-neg 99.0%

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

      11. +-commutative 99.0%

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

   6. Simplified 99.0%

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

   7. Taylor expanded in beta around 0 99.0%

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

      1. distribute-lft-out 99.0%

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

   9. Applied egg-rr 99.0%

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

   if -0.999999949999999971 < (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) 2))

   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. Step-by-step derivation

      1. clear-num 99.8%

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

      2. associate-/r/ 99.7%

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

      3. fma-def 99.8%

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

      4. associate-+l+ 99.8%

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

   5. Applied egg-rr 99.8%

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

4. Final simplification 99.6%

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

Alternative 3: 99.7% accurate, 0.6× speedup

Math

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

   1. Initial program 7.1%

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

      1. +-commutative 7.1%

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

   3. Simplified 7.1%

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

   4. Taylor expanded in alpha around -inf 99.0%

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

      1. associate-*r/ 99.0%

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

      2. sub-neg 99.0%

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

      3. mul-1-neg 99.0%

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

      4. distribute-lft-in 99.0%

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

      5. neg-mul-1 99.0%

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

      6. mul-1-neg 99.0%

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

      7. remove-double-neg 99.0%

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

      8. neg-mul-1 99.0%

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

      9. mul-1-neg 99.0%

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

      10. remove-double-neg 99.0%

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

      11. +-commutative 99.0%

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

   6. Simplified 99.0%

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

   7. Taylor expanded in beta around 0 99.0%

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

      1. distribute-lft-out 99.0%

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

   9. Applied egg-rr 99.0%

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

   if -0.999999949999999971 < (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) 2))

   1. Initial program 99.7%

      \[\frac{\frac{\beta - \alpha}{\left(\alpha + \beta\right) + 2} + 1}{2} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.5%

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

Alternative 4: 69.4% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{1 + \beta \cdot 0.5}{2}\\ t_1 := \frac{\frac{2}{\alpha}}{2}\\ \mathbf{if}\;\beta \leq -9.8 \cdot 10^{-101}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;\beta \leq -1.6 \cdot 10^{-123}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;\beta \leq -5.2 \cdot 10^{-194}:\\ \;\;\;\;\frac{1 + \alpha \cdot -0.5}{2}\\ \mathbf{elif}\;\beta \leq -8.5 \cdot 10^{-213}:\\ \;\;\;\;t_1\\ \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)) (t_1 (/ (/ 2.0 alpha) 2.0)))
   (if (<= beta -9.8e-101)
     t_0
     (if (<= beta -1.6e-123)
       t_1
       (if (<= beta -5.2e-194)
         (/ (+ 1.0 (* alpha -0.5)) 2.0)
         (if (<= beta -8.5e-213) t_1 (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 t_1 = (2.0 / alpha) / 2.0;
	double tmp;
	if (beta <= -9.8e-101) {
		tmp = t_0;
	} else if (beta <= -1.6e-123) {
		tmp = t_1;
	} else if (beta <= -5.2e-194) {
		tmp = (1.0 + (alpha * -0.5)) / 2.0;
	} else if (beta <= -8.5e-213) {
		tmp = t_1;
	} 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) :: t_1
    real(8) :: tmp
    t_0 = (1.0d0 + (beta * 0.5d0)) / 2.0d0
    t_1 = (2.0d0 / alpha) / 2.0d0
    if (beta <= (-9.8d-101)) then
        tmp = t_0
    else if (beta <= (-1.6d-123)) then
        tmp = t_1
    else if (beta <= (-5.2d-194)) then
        tmp = (1.0d0 + (alpha * (-0.5d0))) / 2.0d0
    else if (beta <= (-8.5d-213)) then
        tmp = t_1
    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 t_1 = (2.0 / alpha) / 2.0;
	double tmp;
	if (beta <= -9.8e-101) {
		tmp = t_0;
	} else if (beta <= -1.6e-123) {
		tmp = t_1;
	} else if (beta <= -5.2e-194) {
		tmp = (1.0 + (alpha * -0.5)) / 2.0;
	} else if (beta <= -8.5e-213) {
		tmp = t_1;
	} 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
	t_1 = (2.0 / alpha) / 2.0
	tmp = 0
	if beta <= -9.8e-101:
		tmp = t_0
	elif beta <= -1.6e-123:
		tmp = t_1
	elif beta <= -5.2e-194:
		tmp = (1.0 + (alpha * -0.5)) / 2.0
	elif beta <= -8.5e-213:
		tmp = t_1
	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)
	t_1 = Float64(Float64(2.0 / alpha) / 2.0)
	tmp = 0.0
	if (beta <= -9.8e-101)
		tmp = t_0;
	elseif (beta <= -1.6e-123)
		tmp = t_1;
	elseif (beta <= -5.2e-194)
		tmp = Float64(Float64(1.0 + Float64(alpha * -0.5)) / 2.0);
	elseif (beta <= -8.5e-213)
		tmp = t_1;
	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;
	t_1 = (2.0 / alpha) / 2.0;
	tmp = 0.0;
	if (beta <= -9.8e-101)
		tmp = t_0;
	elseif (beta <= -1.6e-123)
		tmp = t_1;
	elseif (beta <= -5.2e-194)
		tmp = (1.0 + (alpha * -0.5)) / 2.0;
	elseif (beta <= -8.5e-213)
		tmp = t_1;
	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]}, Block[{t$95$1 = N[(N[(2.0 / alpha), $MachinePrecision] / 2.0), $MachinePrecision]}, If[LessEqual[beta, -9.8e-101], t$95$0, If[LessEqual[beta, -1.6e-123], t$95$1, If[LessEqual[beta, -5.2e-194], N[(N[(1.0 + N[(alpha * -0.5), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], If[LessEqual[beta, -8.5e-213], t$95$1, If[LessEqual[beta, 2.0], t$95$0, 1.0]]]]]]]

Derivation

1. Split input into 4 regimes

2. if beta < -9.8000000000000001e-101 or -8.49999999999999994e-213 < beta < 2

   1. Initial program 70.9%

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

      1. +-commutative 70.9%

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

   3. Simplified 70.9%

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

   4. Taylor expanded in alpha around 0 68.9%

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

   5. Taylor expanded in beta around 0 68.0%

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

      1. *-commutative 68.0%

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

   7. Simplified 68.0%

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

   if -9.8000000000000001e-101 < beta < -1.59999999999999989e-123 or -5.20000000000000003e-194 < beta < -8.49999999999999994e-213

   1. Initial program 21.2%

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

      1. +-commutative 21.2%

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

   3. Simplified 21.2%

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

   4. Taylor expanded in alpha around -inf 84.0%

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

      1. associate-*r/ 84.0%

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

      2. sub-neg 84.0%

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

      3. mul-1-neg 84.0%

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

      4. distribute-lft-in 84.0%

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

      5. neg-mul-1 84.0%

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

      6. mul-1-neg 84.0%

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

      7. remove-double-neg 84.0%

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

      8. neg-mul-1 84.0%

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

      9. mul-1-neg 84.0%

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

      10. remove-double-neg 84.0%

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

      11. +-commutative 84.0%

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

   6. Simplified 84.0%

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

   7. Taylor expanded in beta around 0 84.0%

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

   if -1.59999999999999989e-123 < beta < -5.20000000000000003e-194

   1. Initial program 77.8%

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

      1. +-commutative 77.8%

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

   3. Simplified 77.8%

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

      1. add-log-exp 77.7%

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

      2. associate-+l+ 77.7%

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

   5. Applied egg-rr 77.7%

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

   6. Taylor expanded in beta around 0 77.7%

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

      1. +-commutative 77.7%

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

   8. Simplified 77.7%

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

   9. Taylor expanded in alpha around 0 76.8%

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

       1. *-commutative 76.8%

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

   11. Simplified 76.8%

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

   if 2 < beta

   1. Initial program 89.9%

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

      1. +-commutative 89.9%

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

   3. Simplified 89.9%

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

   4. Taylor expanded in beta around inf 87.6%

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

4. Final simplification 76.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq -9.8 \cdot 10^{-101}:\\ \;\;\;\;\frac{1 + \beta \cdot 0.5}{2}\\ \mathbf{elif}\;\beta \leq -1.6 \cdot 10^{-123}:\\ \;\;\;\;\frac{\frac{2}{\alpha}}{2}\\ \mathbf{elif}\;\beta \leq -5.2 \cdot 10^{-194}:\\ \;\;\;\;\frac{1 + \alpha \cdot -0.5}{2}\\ \mathbf{elif}\;\beta \leq -8.5 \cdot 10^{-213}:\\ \;\;\;\;\frac{\frac{2}{\alpha}}{2}\\ \mathbf{elif}\;\beta \leq 2:\\ \;\;\;\;\frac{1 + \beta \cdot 0.5}{2}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]

Alternative 5: 69.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{1 + \beta \cdot 0.5}{2}\\ t_1 := \frac{\frac{2}{\alpha}}{2}\\ \mathbf{if}\;\beta \leq -3 \cdot 10^{-100}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;\beta \leq -7.4 \cdot 10^{-124}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;\beta \leq -5.8 \cdot 10^{-194}:\\ \;\;\;\;\frac{1 + \alpha \cdot -0.5}{2}\\ \mathbf{elif}\;\beta \leq -1.95 \cdot 10^{-207}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;\beta \leq 2:\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;\frac{2 - \frac{2}{\beta}}{2}\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta)
 :precision binary64
 (let* ((t_0 (/ (+ 1.0 (* beta 0.5)) 2.0)) (t_1 (/ (/ 2.0 alpha) 2.0)))
   (if (<= beta -3e-100)
     t_0
     (if (<= beta -7.4e-124)
       t_1
       (if (<= beta -5.8e-194)
         (/ (+ 1.0 (* alpha -0.5)) 2.0)
         (if (<= beta -1.95e-207)
           t_1
           (if (<= beta 2.0) t_0 (/ (- 2.0 (/ 2.0 beta)) 2.0))))))))

C

double code(double alpha, double beta) {
	double t_0 = (1.0 + (beta * 0.5)) / 2.0;
	double t_1 = (2.0 / alpha) / 2.0;
	double tmp;
	if (beta <= -3e-100) {
		tmp = t_0;
	} else if (beta <= -7.4e-124) {
		tmp = t_1;
	} else if (beta <= -5.8e-194) {
		tmp = (1.0 + (alpha * -0.5)) / 2.0;
	} else if (beta <= -1.95e-207) {
		tmp = t_1;
	} else if (beta <= 2.0) {
		tmp = t_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) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = (1.0d0 + (beta * 0.5d0)) / 2.0d0
    t_1 = (2.0d0 / alpha) / 2.0d0
    if (beta <= (-3d-100)) then
        tmp = t_0
    else if (beta <= (-7.4d-124)) then
        tmp = t_1
    else if (beta <= (-5.8d-194)) then
        tmp = (1.0d0 + (alpha * (-0.5d0))) / 2.0d0
    else if (beta <= (-1.95d-207)) then
        tmp = t_1
    else if (beta <= 2.0d0) then
        tmp = t_0
    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 t_0 = (1.0 + (beta * 0.5)) / 2.0;
	double t_1 = (2.0 / alpha) / 2.0;
	double tmp;
	if (beta <= -3e-100) {
		tmp = t_0;
	} else if (beta <= -7.4e-124) {
		tmp = t_1;
	} else if (beta <= -5.8e-194) {
		tmp = (1.0 + (alpha * -0.5)) / 2.0;
	} else if (beta <= -1.95e-207) {
		tmp = t_1;
	} else if (beta <= 2.0) {
		tmp = t_0;
	} else {
		tmp = (2.0 - (2.0 / beta)) / 2.0;
	}
	return tmp;
}

Python

def code(alpha, beta):
	t_0 = (1.0 + (beta * 0.5)) / 2.0
	t_1 = (2.0 / alpha) / 2.0
	tmp = 0
	if beta <= -3e-100:
		tmp = t_0
	elif beta <= -7.4e-124:
		tmp = t_1
	elif beta <= -5.8e-194:
		tmp = (1.0 + (alpha * -0.5)) / 2.0
	elif beta <= -1.95e-207:
		tmp = t_1
	elif beta <= 2.0:
		tmp = t_0
	else:
		tmp = (2.0 - (2.0 / beta)) / 2.0
	return tmp

Julia

function code(alpha, beta)
	t_0 = Float64(Float64(1.0 + Float64(beta * 0.5)) / 2.0)
	t_1 = Float64(Float64(2.0 / alpha) / 2.0)
	tmp = 0.0
	if (beta <= -3e-100)
		tmp = t_0;
	elseif (beta <= -7.4e-124)
		tmp = t_1;
	elseif (beta <= -5.8e-194)
		tmp = Float64(Float64(1.0 + Float64(alpha * -0.5)) / 2.0);
	elseif (beta <= -1.95e-207)
		tmp = t_1;
	elseif (beta <= 2.0)
		tmp = t_0;
	else
		tmp = Float64(Float64(2.0 - Float64(2.0 / beta)) / 2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(alpha, beta)
	t_0 = (1.0 + (beta * 0.5)) / 2.0;
	t_1 = (2.0 / alpha) / 2.0;
	tmp = 0.0;
	if (beta <= -3e-100)
		tmp = t_0;
	elseif (beta <= -7.4e-124)
		tmp = t_1;
	elseif (beta <= -5.8e-194)
		tmp = (1.0 + (alpha * -0.5)) / 2.0;
	elseif (beta <= -1.95e-207)
		tmp = t_1;
	elseif (beta <= 2.0)
		tmp = t_0;
	else
		tmp = (2.0 - (2.0 / beta)) / 2.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]}, Block[{t$95$1 = N[(N[(2.0 / alpha), $MachinePrecision] / 2.0), $MachinePrecision]}, If[LessEqual[beta, -3e-100], t$95$0, If[LessEqual[beta, -7.4e-124], t$95$1, If[LessEqual[beta, -5.8e-194], N[(N[(1.0 + N[(alpha * -0.5), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], If[LessEqual[beta, -1.95e-207], t$95$1, If[LessEqual[beta, 2.0], t$95$0, N[(N[(2.0 - N[(2.0 / beta), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision]]]]]]]]

Derivation

1. Split input into 4 regimes

2. if beta < -3.0000000000000001e-100 or -1.9500000000000001e-207 < beta < 2

   1. Initial program 70.9%

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

      1. +-commutative 70.9%

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

   3. Simplified 70.9%

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

   4. Taylor expanded in alpha around 0 68.9%

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

   5. Taylor expanded in beta around 0 68.0%

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

      1. *-commutative 68.0%

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

   7. Simplified 68.0%

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

   if -3.0000000000000001e-100 < beta < -7.3999999999999998e-124 or -5.7999999999999994e-194 < beta < -1.9500000000000001e-207

   1. Initial program 21.2%

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

      1. +-commutative 21.2%

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

   3. Simplified 21.2%

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

   4. Taylor expanded in alpha around -inf 84.0%

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

      1. associate-*r/ 84.0%

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

      2. sub-neg 84.0%

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

      3. mul-1-neg 84.0%

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

      4. distribute-lft-in 84.0%

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

      5. neg-mul-1 84.0%

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

      6. mul-1-neg 84.0%

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

      7. remove-double-neg 84.0%

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

      8. neg-mul-1 84.0%

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

      9. mul-1-neg 84.0%

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

      10. remove-double-neg 84.0%

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

      11. +-commutative 84.0%

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

   6. Simplified 84.0%

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

   7. Taylor expanded in beta around 0 84.0%

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

   if -7.3999999999999998e-124 < beta < -5.7999999999999994e-194

   1. Initial program 77.8%

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

      1. +-commutative 77.8%

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

   3. Simplified 77.8%

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

      1. add-log-exp 77.7%

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

      2. associate-+l+ 77.7%

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

   5. Applied egg-rr 77.7%

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

   6. Taylor expanded in beta around 0 77.7%

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

      1. +-commutative 77.7%

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

   8. Simplified 77.7%

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

   9. Taylor expanded in alpha around 0 76.8%

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

       1. *-commutative 76.8%

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

   11. Simplified 76.8%

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

   if 2 < beta

   1. Initial program 89.9%

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

      1. +-commutative 89.9%

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

   3. Simplified 89.9%

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

   4. Taylor expanded in alpha around 0 89.2%

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

   5. Taylor expanded in beta around inf 88.6%

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

      1. associate-*r/ 88.6%

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

      2. metadata-eval 88.6%

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

   7. Simplified 88.6%

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

4. Final simplification 76.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq -3 \cdot 10^{-100}:\\ \;\;\;\;\frac{1 + \beta \cdot 0.5}{2}\\ \mathbf{elif}\;\beta \leq -7.4 \cdot 10^{-124}:\\ \;\;\;\;\frac{\frac{2}{\alpha}}{2}\\ \mathbf{elif}\;\beta \leq -5.8 \cdot 10^{-194}:\\ \;\;\;\;\frac{1 + \alpha \cdot -0.5}{2}\\ \mathbf{elif}\;\beta \leq -1.95 \cdot 10^{-207}:\\ \;\;\;\;\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} \]

Alternative 6: 69.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\frac{2}{\alpha}}{2}\\ \mathbf{if}\;\beta \leq -1.2 \cdot 10^{-100}:\\ \;\;\;\;0.5\\ \mathbf{elif}\;\beta \leq -1.14 \cdot 10^{-123}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;\beta \leq -1.95 \cdot 10^{-192}:\\ \;\;\;\;0.5\\ \mathbf{elif}\;\beta \leq -1.95 \cdot 10^{-207}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;\beta \leq 2.1:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta)
 :precision binary64
 (let* ((t_0 (/ (/ 2.0 alpha) 2.0)))
   (if (<= beta -1.2e-100)
     0.5
     (if (<= beta -1.14e-123)
       t_0
       (if (<= beta -1.95e-192)
         0.5
         (if (<= beta -1.95e-207) t_0 (if (<= beta 2.1) 0.5 1.0)))))))

C

double code(double alpha, double beta) {
	double t_0 = (2.0 / alpha) / 2.0;
	double tmp;
	if (beta <= -1.2e-100) {
		tmp = 0.5;
	} else if (beta <= -1.14e-123) {
		tmp = t_0;
	} else if (beta <= -1.95e-192) {
		tmp = 0.5;
	} else if (beta <= -1.95e-207) {
		tmp = t_0;
	} else 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) :: t_0
    real(8) :: tmp
    t_0 = (2.0d0 / alpha) / 2.0d0
    if (beta <= (-1.2d-100)) then
        tmp = 0.5d0
    else if (beta <= (-1.14d-123)) then
        tmp = t_0
    else if (beta <= (-1.95d-192)) then
        tmp = 0.5d0
    else if (beta <= (-1.95d-207)) then
        tmp = t_0
    else 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 t_0 = (2.0 / alpha) / 2.0;
	double tmp;
	if (beta <= -1.2e-100) {
		tmp = 0.5;
	} else if (beta <= -1.14e-123) {
		tmp = t_0;
	} else if (beta <= -1.95e-192) {
		tmp = 0.5;
	} else if (beta <= -1.95e-207) {
		tmp = t_0;
	} else if (beta <= 2.1) {
		tmp = 0.5;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(alpha, beta):
	t_0 = (2.0 / alpha) / 2.0
	tmp = 0
	if beta <= -1.2e-100:
		tmp = 0.5
	elif beta <= -1.14e-123:
		tmp = t_0
	elif beta <= -1.95e-192:
		tmp = 0.5
	elif beta <= -1.95e-207:
		tmp = t_0
	elif beta <= 2.1:
		tmp = 0.5
	else:
		tmp = 1.0
	return tmp

Julia

function code(alpha, beta)
	t_0 = Float64(Float64(2.0 / alpha) / 2.0)
	tmp = 0.0
	if (beta <= -1.2e-100)
		tmp = 0.5;
	elseif (beta <= -1.14e-123)
		tmp = t_0;
	elseif (beta <= -1.95e-192)
		tmp = 0.5;
	elseif (beta <= -1.95e-207)
		tmp = t_0;
	elseif (beta <= 2.1)
		tmp = 0.5;
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(alpha, beta)
	t_0 = (2.0 / alpha) / 2.0;
	tmp = 0.0;
	if (beta <= -1.2e-100)
		tmp = 0.5;
	elseif (beta <= -1.14e-123)
		tmp = t_0;
	elseif (beta <= -1.95e-192)
		tmp = 0.5;
	elseif (beta <= -1.95e-207)
		tmp = t_0;
	elseif (beta <= 2.1)
		tmp = 0.5;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[alpha_, beta_] := Block[{t$95$0 = N[(N[(2.0 / alpha), $MachinePrecision] / 2.0), $MachinePrecision]}, If[LessEqual[beta, -1.2e-100], 0.5, If[LessEqual[beta, -1.14e-123], t$95$0, If[LessEqual[beta, -1.95e-192], 0.5, If[LessEqual[beta, -1.95e-207], t$95$0, If[LessEqual[beta, 2.1], 0.5, 1.0]]]]]]

Derivation

1. Split input into 3 regimes

2. if beta < -1.2000000000000001e-100 or -1.13999999999999995e-123 < beta < -1.9500000000000001e-192 or -1.9500000000000001e-207 < beta < 2.10000000000000009

   1. Initial program 71.6%

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

      1. +-commutative 71.6%

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

   3. Simplified 71.6%

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

      1. add-log-exp 71.6%

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

      2. associate-+l+ 71.6%

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

   5. Applied egg-rr 71.6%

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

   6. Taylor expanded in beta around 0 70.0%

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

      1. +-commutative 70.0%

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

   8. Simplified 70.0%

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

   9. Taylor expanded in alpha around 0 68.1%

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

   if -1.2000000000000001e-100 < beta < -1.13999999999999995e-123 or -1.9500000000000001e-192 < beta < -1.9500000000000001e-207

   1. Initial program 21.2%

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

      1. +-commutative 21.2%

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

   3. Simplified 21.2%

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

   4. Taylor expanded in alpha around -inf 84.0%

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

      1. associate-*r/ 84.0%

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

      2. sub-neg 84.0%

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

      3. mul-1-neg 84.0%

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

      4. distribute-lft-in 84.0%

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

      5. neg-mul-1 84.0%

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

      6. mul-1-neg 84.0%

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

      7. remove-double-neg 84.0%

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

      8. neg-mul-1 84.0%

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

      9. mul-1-neg 84.0%

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

      10. remove-double-neg 84.0%

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

      11. +-commutative 84.0%

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

   6. Simplified 84.0%

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

   7. Taylor expanded in beta around 0 84.0%

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

   if 2.10000000000000009 < beta

   1. Initial program 89.9%

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

      1. +-commutative 89.9%

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

   3. Simplified 89.9%

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

   4. Taylor expanded in beta around inf 87.6%

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

4. Final simplification 75.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq -1.2 \cdot 10^{-100}:\\ \;\;\;\;0.5\\ \mathbf{elif}\;\beta \leq -1.14 \cdot 10^{-123}:\\ \;\;\;\;\frac{\frac{2}{\alpha}}{2}\\ \mathbf{elif}\;\beta \leq -1.95 \cdot 10^{-192}:\\ \;\;\;\;0.5\\ \mathbf{elif}\;\beta \leq -1.95 \cdot 10^{-207}:\\ \;\;\;\;\frac{\frac{2}{\alpha}}{2}\\ \mathbf{elif}\;\beta \leq 2.1:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]

Alternative 7: 69.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\frac{2}{\alpha}}{2}\\ \mathbf{if}\;\beta \leq -9 \cdot 10^{-101}:\\ \;\;\;\;0.5\\ \mathbf{elif}\;\beta \leq -1.75 \cdot 10^{-123}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;\beta \leq -2.25 \cdot 10^{-192}:\\ \;\;\;\;\frac{1 + \alpha \cdot -0.5}{2}\\ \mathbf{elif}\;\beta \leq -9.2 \cdot 10^{-208}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;\beta \leq 2:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta)
 :precision binary64
 (let* ((t_0 (/ (/ 2.0 alpha) 2.0)))
   (if (<= beta -9e-101)
     0.5
     (if (<= beta -1.75e-123)
       t_0
       (if (<= beta -2.25e-192)
         (/ (+ 1.0 (* alpha -0.5)) 2.0)
         (if (<= beta -9.2e-208) t_0 (if (<= beta 2.0) 0.5 1.0)))))))

C

double code(double alpha, double beta) {
	double t_0 = (2.0 / alpha) / 2.0;
	double tmp;
	if (beta <= -9e-101) {
		tmp = 0.5;
	} else if (beta <= -1.75e-123) {
		tmp = t_0;
	} else if (beta <= -2.25e-192) {
		tmp = (1.0 + (alpha * -0.5)) / 2.0;
	} else if (beta <= -9.2e-208) {
		tmp = t_0;
	} else 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) :: t_0
    real(8) :: tmp
    t_0 = (2.0d0 / alpha) / 2.0d0
    if (beta <= (-9d-101)) then
        tmp = 0.5d0
    else if (beta <= (-1.75d-123)) then
        tmp = t_0
    else if (beta <= (-2.25d-192)) then
        tmp = (1.0d0 + (alpha * (-0.5d0))) / 2.0d0
    else if (beta <= (-9.2d-208)) then
        tmp = t_0
    else 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 t_0 = (2.0 / alpha) / 2.0;
	double tmp;
	if (beta <= -9e-101) {
		tmp = 0.5;
	} else if (beta <= -1.75e-123) {
		tmp = t_0;
	} else if (beta <= -2.25e-192) {
		tmp = (1.0 + (alpha * -0.5)) / 2.0;
	} else if (beta <= -9.2e-208) {
		tmp = t_0;
	} else if (beta <= 2.0) {
		tmp = 0.5;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(alpha, beta):
	t_0 = (2.0 / alpha) / 2.0
	tmp = 0
	if beta <= -9e-101:
		tmp = 0.5
	elif beta <= -1.75e-123:
		tmp = t_0
	elif beta <= -2.25e-192:
		tmp = (1.0 + (alpha * -0.5)) / 2.0
	elif beta <= -9.2e-208:
		tmp = t_0
	elif beta <= 2.0:
		tmp = 0.5
	else:
		tmp = 1.0
	return tmp

Julia

function code(alpha, beta)
	t_0 = Float64(Float64(2.0 / alpha) / 2.0)
	tmp = 0.0
	if (beta <= -9e-101)
		tmp = 0.5;
	elseif (beta <= -1.75e-123)
		tmp = t_0;
	elseif (beta <= -2.25e-192)
		tmp = Float64(Float64(1.0 + Float64(alpha * -0.5)) / 2.0);
	elseif (beta <= -9.2e-208)
		tmp = t_0;
	elseif (beta <= 2.0)
		tmp = 0.5;
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(alpha, beta)
	t_0 = (2.0 / alpha) / 2.0;
	tmp = 0.0;
	if (beta <= -9e-101)
		tmp = 0.5;
	elseif (beta <= -1.75e-123)
		tmp = t_0;
	elseif (beta <= -2.25e-192)
		tmp = (1.0 + (alpha * -0.5)) / 2.0;
	elseif (beta <= -9.2e-208)
		tmp = t_0;
	elseif (beta <= 2.0)
		tmp = 0.5;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[alpha_, beta_] := Block[{t$95$0 = N[(N[(2.0 / alpha), $MachinePrecision] / 2.0), $MachinePrecision]}, If[LessEqual[beta, -9e-101], 0.5, If[LessEqual[beta, -1.75e-123], t$95$0, If[LessEqual[beta, -2.25e-192], N[(N[(1.0 + N[(alpha * -0.5), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], If[LessEqual[beta, -9.2e-208], t$95$0, If[LessEqual[beta, 2.0], 0.5, 1.0]]]]]]

Derivation

1. Split input into 4 regimes

2. if beta < -8.9999999999999997e-101 or -9.19999999999999986e-208 < beta < 2

   1. Initial program 70.9%

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

      1. +-commutative 70.9%

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

   3. Simplified 70.9%

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

      1. add-log-exp 70.8%

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

      2. associate-+l+ 70.8%

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

   5. Applied egg-rr 70.8%

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

   6. Taylor expanded in beta around 0 69.0%

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

      1. +-commutative 69.0%

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

   8. Simplified 69.0%

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

   9. Taylor expanded in alpha around 0 67.1%

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

   if -8.9999999999999997e-101 < beta < -1.7499999999999999e-123 or -2.25000000000000012e-192 < beta < -9.19999999999999986e-208

   1. Initial program 21.2%

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

      1. +-commutative 21.2%

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

   3. Simplified 21.2%

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

   4. Taylor expanded in alpha around -inf 84.0%

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

      1. associate-*r/ 84.0%

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

      2. sub-neg 84.0%

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

      3. mul-1-neg 84.0%

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

      4. distribute-lft-in 84.0%

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

      5. neg-mul-1 84.0%

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

      6. mul-1-neg 84.0%

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

      7. remove-double-neg 84.0%

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

      8. neg-mul-1 84.0%

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

      9. mul-1-neg 84.0%

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

      10. remove-double-neg 84.0%

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

      11. +-commutative 84.0%

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

   6. Simplified 84.0%

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

   7. Taylor expanded in beta around 0 84.0%

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

   if -1.7499999999999999e-123 < beta < -2.25000000000000012e-192

   1. Initial program 77.8%

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

      1. +-commutative 77.8%

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

   3. Simplified 77.8%

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

      1. add-log-exp 77.7%

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

      2. associate-+l+ 77.7%

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

   5. Applied egg-rr 77.7%

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

   6. Taylor expanded in beta around 0 77.7%

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

      1. +-commutative 77.7%

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

   8. Simplified 77.7%

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

   9. Taylor expanded in alpha around 0 76.8%

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

       1. *-commutative 76.8%

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

   11. Simplified 76.8%

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

   if 2 < beta

   1. Initial program 89.9%

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

      1. +-commutative 89.9%

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

   3. Simplified 89.9%

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

   4. Taylor expanded in beta around inf 87.6%

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

4. Final simplification 75.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq -9 \cdot 10^{-101}:\\ \;\;\;\;0.5\\ \mathbf{elif}\;\beta \leq -1.75 \cdot 10^{-123}:\\ \;\;\;\;\frac{\frac{2}{\alpha}}{2}\\ \mathbf{elif}\;\beta \leq -2.25 \cdot 10^{-192}:\\ \;\;\;\;\frac{1 + \alpha \cdot -0.5}{2}\\ \mathbf{elif}\;\beta \leq -9.2 \cdot 10^{-208}:\\ \;\;\;\;\frac{\frac{2}{\alpha}}{2}\\ \mathbf{elif}\;\beta \leq 2:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]

Alternative 8: 92.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if alpha < 950

   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. Taylor expanded in alpha around 0 98.9%

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

   if 950 < alpha

   1. Initial program 24.8%

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

      1. +-commutative 24.8%

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

   3. Simplified 24.8%

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

   4. Taylor expanded in alpha around -inf 81.7%

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

      1. associate-*r/ 81.7%

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

      2. sub-neg 81.7%

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

      3. mul-1-neg 81.7%

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

      4. distribute-lft-in 81.7%

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

      5. neg-mul-1 81.7%

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

      6. mul-1-neg 81.7%

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

      7. remove-double-neg 81.7%

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

      8. neg-mul-1 81.7%

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

      9. mul-1-neg 81.7%

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

      10. remove-double-neg 81.7%

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

      11. +-commutative 81.7%

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

   6. Simplified 81.7%

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

   7. Taylor expanded in beta around 0 81.7%

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

      1. distribute-lft-out 81.7%

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

   9. Applied egg-rr 81.7%

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

4. Final simplification 93.1%

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

Alternative 9: 87.2% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\alpha \leq 950:\\ \;\;\;\;\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 950.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 <= 950.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 <= 950.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 <= 950.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 <= 950.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 <= 950.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 <= 950.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, 950.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 < 950

   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. Taylor expanded in alpha around 0 98.9%

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

   if 950 < alpha

   1. Initial program 24.8%

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

      1. +-commutative 24.8%

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

   3. Simplified 24.8%

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

   4. Taylor expanded in alpha around -inf 81.7%

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

      1. associate-*r/ 81.7%

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

      2. sub-neg 81.7%

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

      3. mul-1-neg 81.7%

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

      4. distribute-lft-in 81.7%

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

      5. neg-mul-1 81.7%

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

      6. mul-1-neg 81.7%

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

      7. remove-double-neg 81.7%

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

      8. neg-mul-1 81.7%

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

      9. mul-1-neg 81.7%

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

      10. remove-double-neg 81.7%

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

      11. +-commutative 81.7%

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

   6. Simplified 81.7%

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

   7. Taylor expanded in beta around 0 70.5%

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

4. Final simplification 89.2%

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

Alternative 10: 92.8% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if alpha < 900

   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. Taylor expanded in alpha around 0 98.9%

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

   if 900 < alpha

   1. Initial program 24.8%

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

      1. +-commutative 24.8%

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

   3. Simplified 24.8%

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

   4. Taylor expanded in alpha around -inf 81.7%

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

      1. associate-*r/ 81.7%

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

      2. sub-neg 81.7%

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

      3. mul-1-neg 81.7%

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

      4. distribute-lft-in 81.7%

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

      5. neg-mul-1 81.7%

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

      6. mul-1-neg 81.7%

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

      7. remove-double-neg 81.7%

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

      8. neg-mul-1 81.7%

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

      9. mul-1-neg 81.7%

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

      10. remove-double-neg 81.7%

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

      11. +-commutative 81.7%

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

   6. Simplified 81.7%

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

4. Final simplification 93.1%

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

Alternative 11: 70.6% accurate, 4.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 66.6%

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

      1. +-commutative 66.6%

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

   3. Simplified 66.6%

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

      1. add-log-exp 66.5%

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

      2. associate-+l+ 66.5%

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

   5. Applied egg-rr 66.5%

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

   6. Taylor expanded in beta around 0 65.1%

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

      1. +-commutative 65.1%

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

   8. Simplified 65.1%

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

   9. Taylor expanded in alpha around 0 63.0%

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

   if 2 < beta

   1. Initial program 89.9%

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

      1. +-commutative 89.9%

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

   3. Simplified 89.9%

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

   4. Taylor expanded in beta around inf 87.6%

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

4. Final simplification 71.3%

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

Alternative 12: 49.0% 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 74.4%

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

   1. +-commutative 74.4%

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

3. Simplified 74.4%

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

   1. add-log-exp 74.4%

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

   2. associate-+l+ 74.4%

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

5. Applied egg-rr 74.4%

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

6. Taylor expanded in beta around 0 48.0%

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

   1. +-commutative 48.0%

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

8. Simplified 48.0%

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

9. Taylor expanded in alpha around 0 47.7%

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

10. Final simplification 47.7%

    \[\leadsto 0.5 \]

Reproduce

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