Octave 3.8, jcobi/1

Percentage Accurate: 75.5% → 99.7%

Time: 10.4s

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: 75.5% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (alpha beta)
 :precision binary64
 (/ (+ (/ (- beta alpha) (+ (+ alpha beta) 2.0)) 1.0) 2.0))

C

double code(double alpha, double beta) {
	return (((beta - alpha) / ((alpha + beta) + 2.0)) + 1.0) / 2.0;
}

Fortran

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

Java

public static double code(double alpha, double beta) {
	return (((beta - alpha) / ((alpha + beta) + 2.0)) + 1.0) / 2.0;
}

Python

def code(alpha, beta):
	return (((beta - alpha) / ((alpha + beta) + 2.0)) + 1.0) / 2.0

Julia

function code(alpha, beta)
	return Float64(Float64(Float64(Float64(beta - alpha) / Float64(Float64(alpha + beta) + 2.0)) + 1.0) / 2.0)
end

MATLAB

function tmp = code(alpha, beta)
	tmp = (((beta - alpha) / ((alpha + beta) + 2.0)) + 1.0) / 2.0;
end

Wolfram

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

Alternative 1: 99.7% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\beta + 2}{\alpha}\\ t_1 := \beta + \left(\alpha + 2\right)\\ t_2 := \frac{\beta}{t_1}\\ \mathbf{if}\;\frac{\beta - \alpha}{\left(\beta + \alpha\right) + 2} \leq -0.5:\\ \;\;\;\;\frac{t_2 + \left(t_0 + \left({t_0}^{3} - {t_0}^{2}\right)\right)}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{t_2 + \left(1 - \frac{\alpha}{t_1}\right)}{2}\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta)
 :precision binary64
 (let* ((t_0 (/ (+ beta 2.0) alpha))
        (t_1 (+ beta (+ alpha 2.0)))
        (t_2 (/ beta t_1)))
   (if (<= (/ (- beta alpha) (+ (+ beta alpha) 2.0)) -0.5)
     (/ (+ t_2 (+ t_0 (- (pow t_0 3.0) (pow t_0 2.0)))) 2.0)
     (/ (+ t_2 (- 1.0 (/ alpha t_1))) 2.0))))

C

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

Java

public static double code(double alpha, double beta) {
	double t_0 = (beta + 2.0) / alpha;
	double t_1 = beta + (alpha + 2.0);
	double t_2 = beta / t_1;
	double tmp;
	if (((beta - alpha) / ((beta + alpha) + 2.0)) <= -0.5) {
		tmp = (t_2 + (t_0 + (Math.pow(t_0, 3.0) - Math.pow(t_0, 2.0)))) / 2.0;
	} else {
		tmp = (t_2 + (1.0 - (alpha / t_1))) / 2.0;
	}
	return tmp;
}

Python

def code(alpha, beta):
	t_0 = (beta + 2.0) / alpha
	t_1 = beta + (alpha + 2.0)
	t_2 = beta / t_1
	tmp = 0
	if ((beta - alpha) / ((beta + alpha) + 2.0)) <= -0.5:
		tmp = (t_2 + (t_0 + (math.pow(t_0, 3.0) - math.pow(t_0, 2.0)))) / 2.0
	else:
		tmp = (t_2 + (1.0 - (alpha / t_1))) / 2.0
	return tmp

Julia

function code(alpha, beta)
	t_0 = Float64(Float64(beta + 2.0) / alpha)
	t_1 = Float64(beta + Float64(alpha + 2.0))
	t_2 = Float64(beta / t_1)
	tmp = 0.0
	if (Float64(Float64(beta - alpha) / Float64(Float64(beta + alpha) + 2.0)) <= -0.5)
		tmp = Float64(Float64(t_2 + Float64(t_0 + Float64((t_0 ^ 3.0) - (t_0 ^ 2.0)))) / 2.0);
	else
		tmp = Float64(Float64(t_2 + Float64(1.0 - Float64(alpha / t_1))) / 2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(alpha, beta)
	t_0 = (beta + 2.0) / alpha;
	t_1 = beta + (alpha + 2.0);
	t_2 = beta / t_1;
	tmp = 0.0;
	if (((beta - alpha) / ((beta + alpha) + 2.0)) <= -0.5)
		tmp = (t_2 + (t_0 + ((t_0 ^ 3.0) - (t_0 ^ 2.0)))) / 2.0;
	else
		tmp = (t_2 + (1.0 - (alpha / t_1))) / 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[alpha_, beta_] := Block[{t$95$0 = N[(N[(beta + 2.0), $MachinePrecision] / alpha), $MachinePrecision]}, Block[{t$95$1 = N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(beta / t$95$1), $MachinePrecision]}, If[LessEqual[N[(N[(beta - alpha), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision], -0.5], N[(N[(t$95$2 + N[(t$95$0 + N[(N[Power[t$95$0, 3.0], $MachinePrecision] - N[Power[t$95$0, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], N[(N[(t$95$2 + N[(1.0 - N[(alpha / t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision]]]]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 7.8%

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

      1. div-sub 7.9%

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

      2. associate-+l- 10.7%

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

      3. +-commutative 10.7%

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

      4. associate-+l+ 10.7%

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

      5. +-commutative 10.7%

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

      6. associate-+l+ 10.7%

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

   4. Applied egg-rr 10.7%

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

      1. clear-num 10.6%

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

      2. inv-pow 10.6%

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

   6. Applied egg-rr 10.6%

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

      1. unpow-1 10.6%

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

      2. associate-+r+ 10.6%

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

   8. Simplified 10.6%

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

   9. Taylor expanded in alpha around inf 89.0%

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

       1. +-commutative 89.0%

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

       2. mul-1-neg 89.0%

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

       3. +-commutative 89.0%

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

       4. unsub-neg 89.0%

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

   11. Simplified 99.9%

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

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

   1. Initial program 100.0%

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

      1. div-sub 100.0%

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

      2. associate-+l- 100.0%

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

      3. +-commutative 100.0%

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

      4. associate-+l+ 100.0%

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

      5. +-commutative 100.0%

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

      6. associate-+l+ 100.0%

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

   4. Applied egg-rr 100.0%

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

Alternative 2: 99.9% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 6.8%

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

   3. Taylor expanded in alpha around -inf 95.2%

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

   5. Simplified 99.6%

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

      1. *-un-lft-identity 99.6%

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

      2. unpow2 99.6%

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

      3. times-frac 99.9%

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

      4. +-commutative 99.9%

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

   7. Applied egg-rr 99.9%

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

      1. associate-*l/ 99.9%

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

      2. +-commutative 99.9%

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

      3. *-lft-identity 99.9%

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

   9. Simplified 99.9%

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

   if -0.999990000000000046 < (/.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} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. div-sub 99.9%

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

      2. associate-+l- 99.9%

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

      3. +-commutative 99.9%

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

      4. associate-+l+ 99.9%

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

      5. +-commutative 99.9%

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

      6. associate-+l+ 99.9%

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

   4. Applied egg-rr 99.9%

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

      1. clear-num 99.9%

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

      2. inv-pow 99.9%

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

   6. Applied egg-rr 99.9%

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

      1. unpow-1 99.9%

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

      2. associate-+r+ 99.9%

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

   8. Simplified 99.9%

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

Alternative 3: 99.6% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 6.8%

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

   3. Taylor expanded in alpha around inf 98.9%

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

   if -0.999990000000000046 < (/.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} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. div-sub 99.9%

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

      2. associate-+l- 99.9%

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

      3. +-commutative 99.9%

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

      4. associate-+l+ 99.9%

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

      5. +-commutative 99.9%

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

      6. associate-+l+ 99.9%

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

   4. Applied egg-rr 99.9%

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

      1. clear-num 99.9%

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

      2. inv-pow 99.9%

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

   6. Applied egg-rr 99.9%

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

      1. unpow-1 99.9%

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

      2. associate-+r+ 99.9%

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

   8. Simplified 99.9%

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

4. Final simplification 99.7%

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

Alternative 4: 99.6% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 6.8%

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

   3. Taylor expanded in alpha around inf 98.9%

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

   if -0.999990000000000046 < (/.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} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. div-sub 99.9%

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

      2. associate-+l- 99.9%

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

      3. +-commutative 99.9%

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

      4. associate-+l+ 99.9%

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

      5. +-commutative 99.9%

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

      6. associate-+l+ 99.9%

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

   4. Applied egg-rr 99.9%

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

Alternative 5: 99.6% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 6.8%

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

   3. Taylor expanded in alpha around inf 98.9%

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

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

Alternative 6: 88.9% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if alpha < 4.2e9

   1. Initial program 100.0%

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

   3. Taylor expanded in alpha around 0 99.0%

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

   if 4.2e9 < alpha

   1. Initial program 23.4%

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

      1. div-sub 23.4%

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

      2. associate-+l- 25.8%

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

      3. +-commutative 25.8%

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

      4. associate-+l+ 25.8%

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

      5. +-commutative 25.8%

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

      6. associate-+l+ 25.8%

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

   4. Applied egg-rr 25.8%

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

   5. Taylor expanded in alpha around inf 82.8%

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

      1. associate-*r/ 82.8%

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

      2. distribute-lft-in 82.8%

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

      3. metadata-eval 82.8%

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

      4. neg-mul-1 82.8%

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

      5. sub-neg 82.8%

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

   7. Simplified 82.8%

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

   8. Taylor expanded in alpha around 0 67.9%

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

      1. +-commutative 67.9%

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

   10. Simplified 67.9%

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

4. Final simplification 89.6%

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

Alternative 7: 93.3% accurate, 0.9× speedup

Math

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

   1. Initial program 100.0%

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

   3. Taylor expanded in alpha around 0 99.0%

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

   if 3.2e5 < alpha

   1. Initial program 23.4%

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

   3. Taylor expanded in alpha around inf 82.7%

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

4. Final simplification 94.1%

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

Alternative 8: 71.7% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

function code(alpha, beta)
	tmp = 0.0
	if (beta <= 1.2)
		tmp = Float64(Float64(1.0 + Float64(alpha * -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.2)
		tmp = (1.0 + (alpha * -0.5)) / 2.0;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 1.19999999999999996

   1. Initial program 72.6%

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

   3. Taylor expanded in beta around 0 71.4%

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

      1. +-commutative 71.4%

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

   5. Simplified 71.4%

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

   6. Taylor expanded in alpha around 0 69.4%

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

      1. *-commutative 69.4%

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

   8. Simplified 69.4%

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

   if 1.19999999999999996 < beta

   1. Initial program 86.2%

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

   3. Taylor expanded in beta around inf 82.9%

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

4. Final simplification 73.7%

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

Alternative 9: 72.6% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 2

   1. Initial program 72.6%

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

   3. Taylor expanded in alpha around 0 71.3%

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

   4. Taylor expanded in beta around 0 70.7%

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

      1. *-commutative 70.7%

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

   6. Simplified 70.7%

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

   if 2 < beta

   1. Initial program 86.2%

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

   3. Taylor expanded in beta around inf 82.9%

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

4. Final simplification 74.6%

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

Alternative 10: 51.6% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

function code(alpha, beta)
	tmp = 0.0
	if (alpha <= 75000.0)
		tmp = 1.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 <= 75000.0)
		tmp = 1.0;
	else
		tmp = (2.0 / alpha) / 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if alpha < 75000

   1. Initial program 100.0%

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

   3. Taylor expanded in beta around inf 43.8%

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

   if 75000 < alpha

   1. Initial program 23.4%

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

   3. Taylor expanded in alpha around inf 82.7%

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

   4. Taylor expanded in beta around 0 65.4%

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

4. Final simplification 50.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\alpha \leq 75000:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{2}{\alpha}}{2}\\ \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 76.9%

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

3. Taylor expanded in beta around inf 36.7%

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

4. Final simplification 36.7%

   \[\leadsto 1 \]
5. Add Preprocessing

Reproduce

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