Octave 3.8, jcobi/1

Percentage Accurate: 74.4% → 99.7%

Time: 10.2s

Alternatives: 10

Speedup: 1.2×

Specification

\[\alpha > -1 \land \beta > -1\]

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 74.4% 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 := \beta + \left(\alpha + 2\right)\\ \mathbf{if}\;\frac{\beta - \alpha}{\left(\beta + \alpha\right) + 2} \leq -0.99:\\ \;\;\;\;\frac{\frac{\beta + 2}{{\alpha}^{2}} \cdot \left(\left(-2 - \beta\right) - \beta\right) + \frac{\beta + \left(\beta - -2\right)}{\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.99)
     (/
      (+
       (* (/ (+ beta 2.0) (pow alpha 2.0)) (- (- -2.0 beta) beta))
       (/ (+ beta (- 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.99) {
		tmp = ((((beta + 2.0) / pow(alpha, 2.0)) * ((-2.0 - beta) - beta)) + ((beta + (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.99d0)) then
        tmp = ((((beta + 2.0d0) / (alpha ** 2.0d0)) * (((-2.0d0) - beta) - beta)) + ((beta + (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.99) {
		tmp = ((((beta + 2.0) / Math.pow(alpha, 2.0)) * ((-2.0 - beta) - beta)) + ((beta + (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.99:
		tmp = ((((beta + 2.0) / math.pow(alpha, 2.0)) * ((-2.0 - beta) - beta)) + ((beta + (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.99)
		tmp = Float64(Float64(Float64(Float64(Float64(beta + 2.0) / (alpha ^ 2.0)) * Float64(Float64(-2.0 - beta) - beta)) + Float64(Float64(beta + 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.99)
		tmp = ((((beta + 2.0) / (alpha ^ 2.0)) * ((-2.0 - beta) - beta)) + ((beta + (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.99], N[(N[(N[(N[(N[(beta + 2.0), $MachinePrecision] / N[Power[alpha, 2.0], $MachinePrecision]), $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 / 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.98999999999999999

   1. Initial program 9.7%

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

   2. Taylor expanded in alpha around -inf 92.6%

      \[\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} \]

   4. Simplified 99.2%

      \[\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} \]

   if -0.98999999999999999 < (/.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. 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} \]

   3. 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 99.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\beta - \alpha}{\left(\beta + \alpha\right) + 2} \leq -0.99:\\ \;\;\;\;\frac{\frac{\beta + 2}{{\alpha}^{2}} \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{\alpha}{\beta + \left(\alpha + 2\right)}\right)}{2}\\ \end{array} \]

Alternative 2: 99.7% 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.99999998:\\ \;\;\;\;\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.99999998)
     (/ (/ (+ 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.99999998) {
		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.99999998d0)) 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.99999998) {
		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.99999998:
		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.99999998)
		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.99999998)
		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.99999998], 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.999999980000000011

   1. Initial program 8.0%

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

   2. Taylor expanded in alpha around inf 98.4%

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

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

   1. Initial program 99.6%

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

      1. div-sub 99.6%

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

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

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

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

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

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

   3. Applied egg-rr 99.6%

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

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\beta - \alpha}{\left(\beta + \alpha\right) + 2} \leq -0.99999998:\\ \;\;\;\;\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} \]

Alternative 3: 99.7% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Python

def code(alpha, beta):
	t_0 = (beta + alpha) + 2.0
	tmp = 0
	if ((beta - alpha) / t_0) <= -0.99999998:
		tmp = ((2.0 + (beta * 2.0)) / alpha) / 2.0
	else:
		tmp = (1.0 - ((alpha - beta) / t_0)) / 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.99999998)
		tmp = Float64(Float64(Float64(2.0 + Float64(beta * 2.0)) / alpha) / 2.0);
	else
		tmp = Float64(Float64(1.0 - Float64(Float64(alpha - beta) / 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) / t_0) <= -0.99999998)
		tmp = ((2.0 + (beta * 2.0)) / alpha) / 2.0;
	else
		tmp = (1.0 - ((alpha - beta) / t_0)) / 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.99999998], N[(N[(N[(2.0 + N[(beta * 2.0), $MachinePrecision]), $MachinePrecision] / alpha), $MachinePrecision] / 2.0), $MachinePrecision], N[(N[(1.0 - N[(N[(alpha - beta), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 8.0%

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

   2. Taylor expanded in alpha around inf 98.4%

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

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

   1. Initial program 99.6%

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

4. Final simplification 99.3%

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

Alternative 4: 93.7% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if alpha < 2.35e7

   1. Initial program 100.0%

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

   2. Taylor expanded in alpha around 0 99.3%

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

   if 2.35e7 < alpha

   1. Initial program 27.4%

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

   2. Taylor expanded in alpha around inf 79.6%

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

   3. Taylor expanded in beta around 0 79.5%

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

      1. +-commutative 79.5%

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

   5. Simplified 79.5%

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

4. Final simplification 92.7%

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

Alternative 5: 93.5% accurate, 1.2× speedup

Math

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

   1. Initial program 100.0%

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

   2. Taylor expanded in alpha around 0 99.3%

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

   if 31500 < alpha

   1. Initial program 27.4%

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

   2. Taylor expanded in alpha around inf 79.6%

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

4. Final simplification 92.7%

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

Alternative 6: 74.0% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if alpha < 29.5

   1. Initial program 100.0%

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

   2. Taylor expanded in beta around 0 70.8%

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

      1. +-commutative 70.8%

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

   4. Simplified 70.8%

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

   5. Taylor expanded in alpha around 0 70.1%

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

   if 29.5 < alpha

   1. Initial program 27.4%

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

   2. Taylor expanded in alpha around inf 79.6%

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

   3. Taylor expanded in beta around 0 79.5%

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

      1. +-commutative 79.5%

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

   5. Simplified 79.5%

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

4. Final simplification 73.3%

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

Alternative 7: 74.4% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if alpha < 2

   1. Initial program 100.0%

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

   2. Taylor expanded in beta around 0 71.5%

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

      1. +-commutative 71.5%

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

   4. Simplified 71.5%

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

   5. Taylor expanded in alpha around 0 71.1%

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

      1. *-commutative 71.1%

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

   7. Simplified 71.1%

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

   if 2 < alpha

   1. Initial program 29.1%

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

   2. Taylor expanded in alpha around inf 77.9%

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

   3. Taylor expanded in beta around 0 77.8%

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

      1. +-commutative 77.8%

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

   5. Simplified 77.8%

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

4. Final simplification 73.4%

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

Alternative 8: 68.6% accurate, 2.6× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if alpha < 24

   1. Initial program 100.0%

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

   2. Taylor expanded in beta around 0 70.8%

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

      1. +-commutative 70.8%

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

   4. Simplified 70.8%

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

   5. Taylor expanded in alpha around 0 70.1%

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

   if 24 < alpha

   1. Initial program 27.4%

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

   2. Taylor expanded in alpha around inf 79.6%

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

   3. Taylor expanded in beta around 0 64.3%

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

4. Final simplification 68.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\alpha \leq 24:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\alpha}\\ \end{array} \]

Alternative 9: 71.0% accurate, 4.2× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 2

   1. Initial program 70.2%

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

   2. Taylor expanded in beta around 0 68.8%

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

      1. +-commutative 68.8%

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

   4. Simplified 68.8%

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

   5. Taylor expanded in alpha around 0 66.7%

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

   if 2 < beta

   1. Initial program 85.7%

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

   2. Taylor expanded in beta around inf 82.2%

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

4. Final simplification 72.1%

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

Alternative 10: 48.8% 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 75.6%

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

2. Taylor expanded in beta around 0 49.5%

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

   1. +-commutative 49.5%

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

4. Simplified 49.5%

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

5. Taylor expanded in alpha around 0 49.4%

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

6. Final simplification 49.4%

   \[\leadsto 0.5 \]

Reproduce

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