Octave 3.8, jcobi/1

Percentage Accurate: 74.3% → 99.4%

Time: 8.1s

Alternatives: 9

Speedup: 0.9×

Specification

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

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 74.3% 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.4% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) < -0.5

   1. Initial program 5.8%

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

      1. +-commutative 5.8%

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

   3. Simplified 5.8%

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

   5. Taylor expanded in alpha around inf 100.0%

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

      1. *-commutative 100.0%

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

   7. Simplified 100.0%

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

   8. Taylor expanded in beta around 0 100.0%

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

   if -0.5 < (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64)))

   1. Initial program 100.0%

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

4. Final simplification 100.0%

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

Alternative 2: 94.9% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if alpha < 3.2e15

   1. Initial program 100.0%

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

      1. +-commutative 100.0%

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

      2. sub-neg 100.0%

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

      3. +-commutative 100.0%

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

      4. neg-sub0 100.0%

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

      5. associate-+l- 100.0%

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

      6. sub0-neg 100.0%

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

      7. distribute-frac-neg 100.0%

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

      8. +-commutative 100.0%

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

      9. sub-neg 100.0%

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

      10. div-sub 100.0%

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

      11. sub-neg 100.0%

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

      12. metadata-eval 100.0%

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

      13. neg-mul-1 100.0%

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

      14. *-commutative 100.0%

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

      15. +-commutative 100.0%

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

      16. associate-/l/ 100.0%

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

      17. associate-*l/ 100.0%

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

   3. Simplified 100.0%

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

   if 3.2e15 < alpha

   1. Initial program 19.2%

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

      1. +-commutative 19.2%

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

   3. Simplified 19.2%

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

   5. Taylor expanded in alpha around inf 86.6%

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

      1. *-commutative 86.6%

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

   7. Simplified 86.6%

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

4. Final simplification 95.6%

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

Alternative 3: 95.0% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if alpha < 9e14

   1. Initial program 100.0%

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

      1. +-commutative 100.0%

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

      2. sub-neg 100.0%

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

      3. +-commutative 100.0%

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

      4. neg-sub0 100.0%

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

      5. associate-+l- 100.0%

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

      6. sub0-neg 100.0%

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

      7. distribute-frac-neg 100.0%

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

      8. +-commutative 100.0%

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

      9. sub-neg 100.0%

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

      10. div-sub 100.0%

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

      11. sub-neg 100.0%

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

      12. metadata-eval 100.0%

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

      13. neg-mul-1 100.0%

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

      14. *-commutative 100.0%

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

      15. +-commutative 100.0%

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

      16. associate-/l/ 100.0%

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

      17. associate-*l/ 100.0%

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

   3. Simplified 100.0%

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

   if 9e14 < alpha

   1. Initial program 19.2%

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

      1. +-commutative 19.2%

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

   3. Simplified 19.2%

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

   5. Taylor expanded in alpha around inf 86.6%

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

      1. *-commutative 86.6%

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

   7. Simplified 86.6%

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

   8. Taylor expanded in beta around 0 86.6%

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

4. Final simplification 95.6%

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

Alternative 4: 88.1% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if alpha < 1e15

   1. Initial program 100.0%

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

      1. +-commutative 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in alpha around 0 98.5%

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

      1. +-commutative 98.5%

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

      2. +-commutative 98.5%

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

   7. Simplified 98.5%

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

   if 1e15 < alpha

   1. Initial program 19.2%

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

      1. +-commutative 19.2%

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

      2. sub-neg 19.2%

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

      3. +-commutative 19.2%

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

      4. neg-sub0 19.2%

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

      5. associate-+l- 19.2%

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

      6. sub0-neg 19.2%

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

      7. distribute-frac-neg 19.2%

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

      8. +-commutative 19.2%

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

      9. sub-neg 19.2%

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

      10. div-sub 19.2%

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

      11. sub-neg 19.2%

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

      12. metadata-eval 19.2%

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

      13. neg-mul-1 19.2%

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

      14. *-commutative 19.2%

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

      15. +-commutative 19.2%

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

      16. associate-/l/ 19.2%

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

      17. associate-*l/ 19.2%

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

   3. Simplified 19.3%

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

   5. Taylor expanded in alpha around inf 81.1%

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

   6. Taylor expanded in beta around 0 71.7%

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

      1. associate-*r/ 71.7%

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

      2. metadata-eval 71.7%

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

   8. Simplified 71.7%

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

4. Final simplification 89.7%

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

Alternative 5: 93.8% accurate, 0.9× speedup

Math

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

   1. Initial program 100.0%

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

      1. +-commutative 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in alpha around 0 98.5%

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

      1. +-commutative 98.5%

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

      2. +-commutative 98.5%

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

   7. Simplified 98.5%

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

   if 1.02e15 < alpha

   1. Initial program 19.2%

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

      1. +-commutative 19.2%

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

   3. Simplified 19.2%

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

   5. Taylor expanded in alpha around inf 86.6%

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

      1. *-commutative 86.6%

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

   7. Simplified 86.6%

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

4. Final simplification 94.6%

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

Alternative 6: 71.6% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 2

   1. Initial program 67.0%

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

      1. +-commutative 67.0%

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

   3. Simplified 67.0%

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

   5. Taylor expanded in alpha around 0 65.1%

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

      1. +-commutative 65.1%

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

      2. +-commutative 65.1%

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

   7. Simplified 65.1%

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

   8. Taylor expanded in beta around 0 64.4%

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

   if 2 < beta

   1. Initial program 86.5%

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

      1. +-commutative 86.5%

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

      2. sub-neg 86.5%

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

      3. +-commutative 86.5%

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

      4. neg-sub0 86.5%

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

      5. associate-+l- 86.5%

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

      6. sub0-neg 86.5%

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

      7. distribute-frac-neg 86.5%

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

      8. +-commutative 86.5%

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

      9. sub-neg 86.5%

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

      10. div-sub 86.5%

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

      11. sub-neg 86.5%

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

      12. metadata-eval 86.5%

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

      13. neg-mul-1 86.5%

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

      14. *-commutative 86.5%

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

      15. +-commutative 86.5%

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

      16. associate-/l/ 86.5%

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

      17. associate-*l/ 86.5%

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

   3. Simplified 86.8%

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

   5. Taylor expanded in beta around inf 83.1%

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

4. Final simplification 70.7%

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

Alternative 7: 71.9% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\beta \leq 1.45:\\ \;\;\;\;\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.45) (/ (+ 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.45) {
		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.45d0) 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.45) {
		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.45:
		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.45)
		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.45)
		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.45], 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.44999999999999996

   1. Initial program 67.4%

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

      1. +-commutative 67.4%

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

   3. Simplified 67.4%

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

   5. Taylor expanded in alpha around 0 65.5%

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

      1. +-commutative 65.5%

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

      2. +-commutative 65.5%

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

   7. Simplified 65.5%

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

   8. Taylor expanded in beta around 0 64.8%

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

   if 1.44999999999999996 < beta

   1. Initial program 85.6%

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

      1. +-commutative 85.6%

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

   3. Simplified 85.6%

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

   5. Taylor expanded in alpha around 0 85.0%

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

      1. +-commutative 85.0%

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

      2. +-commutative 85.0%

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

   7. Simplified 85.0%

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

   8. Taylor expanded in beta around inf 83.2%

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

      1. associate-*r/ 83.2%

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

      2. metadata-eval 83.2%

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

   10. Simplified 83.2%

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

4. Final simplification 71.0%

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

Alternative 8: 71.2% accurate, 2.2× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 1.8999999999999999

   1. Initial program 67.0%

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

      1. +-commutative 67.0%

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

   3. Simplified 67.0%

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

   5. Taylor expanded in alpha around 0 65.1%

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

      1. +-commutative 65.1%

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

      2. +-commutative 65.1%

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

   7. Simplified 65.1%

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

   8. Taylor expanded in beta around 0 63.8%

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

   if 1.8999999999999999 < beta

   1. Initial program 86.5%

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

      1. +-commutative 86.5%

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

      2. sub-neg 86.5%

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

      3. +-commutative 86.5%

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

      4. neg-sub0 86.5%

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

      5. associate-+l- 86.5%

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

      6. sub0-neg 86.5%

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

      7. distribute-frac-neg 86.5%

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

      8. +-commutative 86.5%

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

      9. sub-neg 86.5%

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

      10. div-sub 86.5%

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

      11. sub-neg 86.5%

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

      12. metadata-eval 86.5%

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

      13. neg-mul-1 86.5%

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

      14. *-commutative 86.5%

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

      15. +-commutative 86.5%

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

      16. associate-/l/ 86.5%

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

      17. associate-*l/ 86.5%

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

   3. Simplified 86.8%

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

   5. Taylor expanded in beta around inf 83.1%

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

4. Final simplification 70.2%

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

Alternative 9: 35.9% accurate, 13.0× speedup

Math

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

FPCore

(FPCore (alpha beta) :precision binary64 1.0)

C

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

Fortran

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

Java

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

Python

def code(alpha, beta):
	return 1.0

Julia

function code(alpha, beta)
	return 1.0
end

MATLAB

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

Wolfram

code[alpha_, beta_] := 1.0

Derivation

1. Initial program 73.5%

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

   1. +-commutative 73.5%

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

   2. sub-neg 73.5%

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

   3. +-commutative 73.5%

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

   4. neg-sub0 73.5%

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

   5. associate-+l- 73.5%

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

   6. sub0-neg 73.5%

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

   7. distribute-frac-neg 73.5%

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

   8. +-commutative 73.5%

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

   9. sub-neg 73.5%

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

   10. div-sub 73.5%

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

   11. sub-neg 73.5%

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

   12. metadata-eval 73.5%

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

   13. neg-mul-1 73.5%

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

   14. *-commutative 73.5%

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

   15. +-commutative 73.5%

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

   16. associate-/l/ 73.5%

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

   17. associate-*l/ 73.5%

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

3. Simplified 73.5%

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

5. Taylor expanded in beta around inf 36.9%

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

6. Final simplification 36.9%

   \[\leadsto 1 \]
7. Add Preprocessing

Reproduce

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