Octave 3.8, jcobi/1

Percentage Accurate: 75.1% → 99.8%

Time: 8.2s

Alternatives: 13

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: 75.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}\\ t_1 := \frac{\beta + 2}{\alpha}\\ \mathbf{if}\;t_0 \leq -0.5:\\ \;\;\;\;\frac{\frac{\beta}{\beta + \left(\alpha + 2\right)} + \left(\frac{\beta - -2}{\alpha} - \left({t_1}^{2} - {t_1}^{3}\right)\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)))
        (t_1 (/ (+ beta 2.0) alpha)))
   (if (<= t_0 -0.5)
     (/
      (+
       (/ beta (+ beta (+ alpha 2.0)))
       (- (/ (- beta -2.0) alpha) (- (pow t_1 2.0) (pow t_1 3.0))))
      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 t_1 = (beta + 2.0) / alpha;
	double tmp;
	if (t_0 <= -0.5) {
		tmp = ((beta / (beta + (alpha + 2.0))) + (((beta - -2.0) / alpha) - (pow(t_1, 2.0) - pow(t_1, 3.0)))) / 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) :: t_1
    real(8) :: tmp
    t_0 = (beta - alpha) / ((beta + alpha) + 2.0d0)
    t_1 = (beta + 2.0d0) / alpha
    if (t_0 <= (-0.5d0)) then
        tmp = ((beta / (beta + (alpha + 2.0d0))) + (((beta - (-2.0d0)) / alpha) - ((t_1 ** 2.0d0) - (t_1 ** 3.0d0)))) / 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 t_1 = (beta + 2.0) / alpha;
	double tmp;
	if (t_0 <= -0.5) {
		tmp = ((beta / (beta + (alpha + 2.0))) + (((beta - -2.0) / alpha) - (Math.pow(t_1, 2.0) - Math.pow(t_1, 3.0)))) / 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)
	t_1 = (beta + 2.0) / alpha
	tmp = 0
	if t_0 <= -0.5:
		tmp = ((beta / (beta + (alpha + 2.0))) + (((beta - -2.0) / alpha) - (math.pow(t_1, 2.0) - math.pow(t_1, 3.0)))) / 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))
	t_1 = Float64(Float64(beta + 2.0) / alpha)
	tmp = 0.0
	if (t_0 <= -0.5)
		tmp = Float64(Float64(Float64(beta / Float64(beta + Float64(alpha + 2.0))) + Float64(Float64(Float64(beta - -2.0) / alpha) - Float64((t_1 ^ 2.0) - (t_1 ^ 3.0)))) / 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);
	t_1 = (beta + 2.0) / alpha;
	tmp = 0.0;
	if (t_0 <= -0.5)
		tmp = ((beta / (beta + (alpha + 2.0))) + (((beta - -2.0) / alpha) - ((t_1 ^ 2.0) - (t_1 ^ 3.0)))) / 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]}, Block[{t$95$1 = N[(N[(beta + 2.0), $MachinePrecision] / alpha), $MachinePrecision]}, If[LessEqual[t$95$0, -0.5], N[(N[(N[(beta / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(N[(beta - -2.0), $MachinePrecision] / alpha), $MachinePrecision] - N[(N[Power[t$95$1, 2.0], $MachinePrecision] - N[Power[t$95$1, 3.0], $MachinePrecision]), $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.5

   1. Initial program 7.8%

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

      1. +-commutative 7.8%

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

   3. Simplified 7.8%

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

      1. div-sub 7.8%

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

      2. associate-+l- 11.3%

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

      3. associate-+l+ 11.3%

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

      4. associate-+l+ 11.3%

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

   5. Applied egg-rr 11.3%

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

   6. Taylor expanded in alpha around inf 87.5%

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

      1. mul-1-neg 87.5%

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

      2. distribute-neg-frac 87.5%

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

      3. +-commutative 87.5%

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

      4. distribute-neg-in 87.5%

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

      5. metadata-eval 87.5%

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

      6. sub-neg 87.5%

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

      7. unpow2 87.5%

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

      8. unpow2 87.5%

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

      9. times-frac 87.5%

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

      10. unpow2 87.5%

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

      11. mul-1-neg 87.5%

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

      12. unsub-neg 87.5%

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

      13. cube-div 99.9%

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

   8. Simplified 99.9%

      \[\leadsto \frac{\frac{\beta}{\beta + \left(\alpha + 2\right)} - \color{blue}{\left(\frac{-2 - \beta}{\alpha} + \left({\left(\frac{\beta + 2}{\alpha}\right)}^{2} - {\left(\frac{\beta + 2}{\alpha}\right)}^{3}\right)\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} \]
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)}^{2} - {\left(\frac{\beta + 2}{\alpha}\right)}^{3}\right)\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} t_0 := \frac{\beta - \alpha}{\left(\beta + \alpha\right) + 2}\\ \mathbf{if}\;t_0 \leq -0.5:\\ \;\;\;\;\frac{\frac{\beta}{\beta + \left(\alpha + 2\right)} + \left(\frac{\beta - -2}{\alpha} - {\left(\frac{\beta + 2}{\alpha}\right)}^{2}\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.5)
     (/
      (+
       (/ beta (+ beta (+ alpha 2.0)))
       (- (/ (- beta -2.0) alpha) (pow (/ (+ beta 2.0) alpha) 2.0)))
      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.5) {
		tmp = ((beta / (beta + (alpha + 2.0))) + (((beta - -2.0) / alpha) - pow(((beta + 2.0) / alpha), 2.0))) / 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.5d0)) then
        tmp = ((beta / (beta + (alpha + 2.0d0))) + (((beta - (-2.0d0)) / alpha) - (((beta + 2.0d0) / alpha) ** 2.0d0))) / 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.5) {
		tmp = ((beta / (beta + (alpha + 2.0))) + (((beta - -2.0) / alpha) - Math.pow(((beta + 2.0) / alpha), 2.0))) / 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.5:
		tmp = ((beta / (beta + (alpha + 2.0))) + (((beta - -2.0) / alpha) - math.pow(((beta + 2.0) / alpha), 2.0))) / 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.5)
		tmp = Float64(Float64(Float64(beta / Float64(beta + Float64(alpha + 2.0))) + Float64(Float64(Float64(beta - -2.0) / alpha) - (Float64(Float64(beta + 2.0) / alpha) ^ 2.0))) / 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.5)
		tmp = ((beta / (beta + (alpha + 2.0))) + (((beta - -2.0) / alpha) - (((beta + 2.0) / alpha) ^ 2.0))) / 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.5], N[(N[(N[(beta / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(N[(beta - -2.0), $MachinePrecision] / alpha), $MachinePrecision] - N[Power[N[(N[(beta + 2.0), $MachinePrecision] / alpha), $MachinePrecision], 2.0], $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.5

   1. Initial program 7.8%

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

      1. +-commutative 7.8%

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

   3. Simplified 7.8%

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

      1. div-sub 7.8%

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

      2. associate-+l- 11.3%

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

      3. associate-+l+ 11.3%

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

      4. associate-+l+ 11.3%

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

   5. Applied egg-rr 11.3%

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

   6. Taylor expanded in alpha around inf 92.9%

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

      1. mul-1-neg 92.9%

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

      2. distribute-neg-frac 92.9%

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

      3. +-commutative 92.9%

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

      4. distribute-neg-in 92.9%

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

      5. metadata-eval 92.9%

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

      6. sub-neg 92.9%

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

      7. unpow2 92.9%

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

      8. unpow2 92.9%

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

      9. times-frac 99.6%

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

      10. unpow2 99.6%

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

   8. Simplified 99.6%

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

Alternative 3: 99.7% 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.5:\\ \;\;\;\;\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.5)
     (/
      (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.5) {
		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.5)
		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.5], 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.5

   1. Initial program 7.8%

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

      1. +-commutative 7.8%

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

   3. Simplified 7.8%

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

   4. Taylor expanded in alpha around -inf 92.9%

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

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

   1. Initial program 5.2%

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

      1. +-commutative 5.2%

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

   3. Simplified 5.2%

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

   4. Taylor expanded in alpha around -inf 100.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/ 100.0%

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

      2. sub-neg 100.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 100.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 100.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 100.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 100.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 100.0%

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

      8. neg-mul-1 100.0%

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

      9. mul-1-neg 100.0%

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

      10. remove-double-neg 100.0%

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

      11. +-commutative 100.0%

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

   6. Simplified 100.0%

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

   7. Taylor expanded in beta around 0 100.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 100.0%

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

      2. *-commutative 100.0%

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

   9. Applied egg-rr 100.0%

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

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

   1. Initial program 99.5%

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

      1. +-commutative 99.5%

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

   3. Simplified 99.5%

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

      1. div-sub 99.5%

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

      2. associate-+l- 99.5%

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

      3. associate-+l+ 99.5%

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

      4. associate-+l+ 99.5%

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

   5. Applied egg-rr 99.5%

      \[\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 -1:\\ \;\;\;\;\frac{2 \cdot \left(\frac{\beta}{\alpha} + \frac{1}{\alpha}\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} \]

Alternative 5: 99.3% 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 -1:\\ \;\;\;\;\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 -1.0)
     (/ (* 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 <= -1.0) {
		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 <= (-1.0d0)) 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 <= -1.0) {
		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 <= -1.0:
		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 <= -1.0)
		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 <= -1.0)
		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, -1.0], 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)) < -1

   1. Initial program 5.2%

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

      1. +-commutative 5.2%

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

   3. Simplified 5.2%

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

   4. Taylor expanded in alpha around -inf 100.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/ 100.0%

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

      2. sub-neg 100.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 100.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 100.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 100.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 100.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 100.0%

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

      8. neg-mul-1 100.0%

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

      9. mul-1-neg 100.0%

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

      10. remove-double-neg 100.0%

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

      11. +-commutative 100.0%

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

   6. Simplified 100.0%

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

   7. Taylor expanded in beta around 0 100.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 100.0%

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

      2. *-commutative 100.0%

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

   9. Applied egg-rr 100.0%

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

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

   1. Initial program 99.5%

      \[\frac{\frac{\beta - \alpha}{\left(\alpha + \beta\right) + 2} + 1}{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 -1:\\ \;\;\;\;\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 6: 93.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\alpha \leq 5.8 \cdot 10^{+31}:\\ \;\;\;\;\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 5.8e+31)
   (/ (+ 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 <= 5.8e+31) {
		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 <= 5.8d+31) 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 <= 5.8e+31) {
		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 <= 5.8e+31:
		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 <= 5.8e+31)
		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 <= 5.8e+31)
		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, 5.8e+31], 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 < 5.8000000000000001e31

   1. Initial program 99.1%

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

      1. +-commutative 99.1%

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

   3. Simplified 99.1%

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

   4. Taylor expanded in alpha around 0 97.9%

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

   if 5.8000000000000001e31 < alpha

   1. Initial program 13.6%

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

      1. +-commutative 13.6%

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

   3. Simplified 13.6%

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

   4. Taylor expanded in alpha around -inf 91.8%

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

      1. associate-*r/ 91.8%

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

      2. sub-neg 91.8%

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

      3. mul-1-neg 91.8%

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

      4. distribute-lft-in 91.8%

         \[\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 91.8%

         \[\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 91.8%

         \[\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 91.8%

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

      8. neg-mul-1 91.8%

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

      9. mul-1-neg 91.8%

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

      10. remove-double-neg 91.8%

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

      11. +-commutative 91.8%

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

   6. Simplified 91.8%

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

   7. Taylor expanded in beta around 0 91.8%

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

      1. distribute-lft-out 91.8%

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

      2. *-commutative 91.8%

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

   9. Applied egg-rr 91.8%

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

4. Final simplification 96.1%

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

Alternative 7: 93.0% accurate, 1.0× speedup

Math

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

C

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

Python

def code(alpha, beta):
	tmp = 0
	if alpha <= 1.2e+33:
		tmp = (1.0 + (1.0 / ((beta + 2.0) / beta))) / 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 <= 1.2e+33)
		tmp = Float64(Float64(1.0 + Float64(1.0 / Float64(Float64(beta + 2.0) / beta))) / 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 <= 1.2e+33)
		tmp = (1.0 + (1.0 / ((beta + 2.0) / beta))) / 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, 1.2e+33], N[(N[(1.0 + N[(1.0 / N[(N[(beta + 2.0), $MachinePrecision] / beta), $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 < 1.2e33

   1. Initial program 99.1%

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

      1. +-commutative 99.1%

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

   3. Simplified 99.1%

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

   4. Taylor expanded in alpha around 0 97.9%

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

      1. clear-num 97.9%

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

      2. inv-pow 97.9%

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

   6. Applied egg-rr 97.9%

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

      1. unpow-1 97.9%

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

   8. Simplified 97.9%

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

   if 1.2e33 < alpha

   1. Initial program 13.6%

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

      1. +-commutative 13.6%

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

   3. Simplified 13.6%

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

   4. Taylor expanded in alpha around -inf 91.8%

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

      1. associate-*r/ 91.8%

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

      2. sub-neg 91.8%

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

      3. mul-1-neg 91.8%

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

      4. distribute-lft-in 91.8%

         \[\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 91.8%

         \[\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 91.8%

         \[\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 91.8%

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

      8. neg-mul-1 91.8%

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

      9. mul-1-neg 91.8%

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

      10. remove-double-neg 91.8%

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

      11. +-commutative 91.8%

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

   6. Simplified 91.8%

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

   7. Taylor expanded in beta around 0 91.8%

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

      1. distribute-lft-out 91.8%

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

      2. *-commutative 91.8%

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

   9. Applied egg-rr 91.8%

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

4. Final simplification 96.1%

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

Alternative 8: 87.2% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\alpha \leq 5.8 \cdot 10^{+31}:\\ \;\;\;\;\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 5.8e+31)
   (/ (+ 1.0 (/ beta (+ beta 2.0))) 2.0)
   (/ (/ 2.0 alpha) 2.0)))

C

double code(double alpha, double beta) {
	double tmp;
	if (alpha <= 5.8e+31) {
		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 <= 5.8d+31) 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 <= 5.8e+31) {
		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 <= 5.8e+31:
		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 <= 5.8e+31)
		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 <= 5.8e+31)
		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, 5.8e+31], 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 < 5.8000000000000001e31

   1. Initial program 99.1%

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

      1. +-commutative 99.1%

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

   3. Simplified 99.1%

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

   4. Taylor expanded in alpha around 0 97.9%

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

   if 5.8000000000000001e31 < alpha

   1. Initial program 13.6%

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

      1. +-commutative 13.6%

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

   3. Simplified 13.6%

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

   4. Taylor expanded in alpha around -inf 91.8%

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

      1. associate-*r/ 91.8%

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

      2. sub-neg 91.8%

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

      3. mul-1-neg 91.8%

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

      4. distribute-lft-in 91.8%

         \[\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 91.8%

         \[\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 91.8%

         \[\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 91.8%

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

      8. neg-mul-1 91.8%

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

      9. mul-1-neg 91.8%

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

      10. remove-double-neg 91.8%

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

      11. +-commutative 91.8%

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

   6. Simplified 91.8%

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

   7. Taylor expanded in beta around 0 70.4%

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

4. Final simplification 89.9%

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

Alternative 9: 93.0% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\alpha \leq 3.2 \cdot 10^{+34}:\\ \;\;\;\;\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 3.2e+34)
   (/ (+ 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 <= 3.2e+34) {
		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 <= 3.2d+34) 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 <= 3.2e+34) {
		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 <= 3.2e+34:
		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 <= 3.2e+34)
		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 <= 3.2e+34)
		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, 3.2e+34], 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 < 3.1999999999999998e34

   1. Initial program 99.1%

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

      1. +-commutative 99.1%

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

   3. Simplified 99.1%

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

   4. Taylor expanded in alpha around 0 97.9%

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

   if 3.1999999999999998e34 < alpha

   1. Initial program 13.6%

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

      1. +-commutative 13.6%

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

   3. Simplified 13.6%

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

   4. Taylor expanded in alpha around -inf 91.8%

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

      1. associate-*r/ 91.8%

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

      2. sub-neg 91.8%

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

      3. mul-1-neg 91.8%

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

      4. distribute-lft-in 91.8%

         \[\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 91.8%

         \[\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 91.8%

         \[\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 91.8%

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

      8. neg-mul-1 91.8%

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

      9. mul-1-neg 91.8%

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

      10. remove-double-neg 91.8%

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

      11. +-commutative 91.8%

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

   6. Simplified 91.8%

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

4. Final simplification 96.1%

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

Alternative 10: 72.3% accurate, 1.4× 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 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 69.7%

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

   5. Taylor expanded in beta around 0 68.8%

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

      1. *-commutative 68.8%

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

   7. Simplified 68.8%

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

   if 2 < beta

   1. Initial program 80.8%

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

      1. +-commutative 80.8%

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

   3. Simplified 80.8%

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

   4. Taylor expanded in beta around inf 77.8%

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

4. Final simplification 71.7%

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

Alternative 11: 72.5% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 1.94999999999999996

   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 69.7%

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

   5. Taylor expanded in beta around 0 68.8%

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

      1. *-commutative 68.8%

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

   7. Simplified 68.8%

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

   if 1.94999999999999996 < beta

   1. Initial program 80.8%

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

      1. +-commutative 80.8%

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

   3. Simplified 80.8%

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

   4. Taylor expanded in alpha around 0 79.5%

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

   5. Taylor expanded in beta around inf 78.9%

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

      1. associate-*r/ 78.9%

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

      2. metadata-eval 78.9%

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

   7. Simplified 78.9%

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

4. Final simplification 72.0%

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

Alternative 12: 71.8% accurate, 4.2× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 95

   1. Initial program 70.6%

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

      1. +-commutative 70.6%

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

   3. Simplified 70.6%

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

   4. Taylor expanded in beta around 0 69.4%

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

      1. +-commutative 69.4%

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

   6. Simplified 69.4%

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

   7. Taylor expanded in alpha around 0 68.2%

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

   if 95 < beta

   1. Initial program 81.6%

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

      1. +-commutative 81.6%

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

   3. Simplified 81.6%

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

   4. Taylor expanded in beta around inf 78.8%

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

4. Final simplification 71.5%

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

Alternative 13: 49.7% 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.0%

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

   1. +-commutative 74.0%

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

3. Simplified 74.0%

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

4. Taylor expanded in beta around 0 52.1%

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

   1. +-commutative 52.1%

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

6. Simplified 52.1%

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

7. Taylor expanded in alpha around 0 52.0%

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

8. Final simplification 52.0%

   \[\leadsto 0.5 \]

Reproduce

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