Octave 3.8, jcobi/1

Percentage Accurate: 75.2% → 99.6%

Time: 7.9s

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: 75.2% 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.6% accurate, 0.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

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

      1. +-commutative 6.8%

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

      2. sub-neg 6.8%

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

      3. +-commutative 6.8%

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

      4. neg-sub0 6.8%

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

      5. associate-+l- 6.8%

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

      6. sub0-neg 6.8%

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

      7. distribute-frac-neg 6.8%

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

      8. +-commutative 6.8%

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

      9. sub-neg 6.8%

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

      10. div-sub 6.8%

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

      11. sub-neg 6.8%

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

      12. metadata-eval 6.8%

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

      13. neg-mul-1 6.8%

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

      14. *-commutative 6.8%

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

      15. +-commutative 6.8%

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

      16. associate-/l/ 6.8%

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

      17. associate-*l/ 6.8%

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

   3. Simplified 6.9%

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

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

      1. mul-1-neg 92.3%

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

      2. fma-define 92.3%

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

      3. associate-/l* 100.0%

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

      4. +-commutative 100.0%

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

      5. neg-mul-1 100.0%

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

      6. +-commutative 100.0%

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

      7. neg-mul-1 100.0%

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

      8. +-commutative 100.0%

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

   7. Simplified 100.0%

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

   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. 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
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{\mathsf{fma}\left(-0.5, \left(\beta + 2\right) \cdot \frac{\left(\left(-\beta\right) - 2\right) - \beta}{\alpha}, \left(\left(\left(-\beta\right) - 2\right) - \beta\right) \cdot 0.5\right)}{-\alpha}\\ \mathbf{else}:\\ \;\;\;\;0.5 + \left(\alpha - \beta\right) \cdot \frac{-0.5}{\beta + \left(\alpha + 2\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 99.2% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[alpha_, beta_] := If[LessEqual[N[(N[(beta - alpha), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision], -0.5], N[(N[(beta + 1.0), $MachinePrecision] / alpha), $MachinePrecision], N[(0.5 + N[(N[(alpha - beta), $MachinePrecision] * N[(-0.5 / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $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 6.8%

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

      1. +-commutative 6.8%

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

   3. Simplified 6.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 99.1%

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

      1. *-commutative 99.1%

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

   7. Simplified 99.1%

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

   8. Taylor expanded in alpha around 0 99.1%

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

      1. associate-*r/ 99.1%

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

      2. +-commutative 99.1%

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

      3. metadata-eval 99.1%

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

      4. distribute-lft-in 99.1%

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

      5. associate-*r* 99.1%

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

      6. metadata-eval 99.1%

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

      7. associate-*l/ 98.9%

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

      8. metadata-eval 98.9%

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

      9. associate-/r* 98.9%

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

      10. associate-*l/ 99.1%

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

      11. times-frac 99.1%

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

      12. metadata-eval 99.1%

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

   10. Simplified 99.1%

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

       1. *-un-lft-identity 99.1%

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

   12. Applied egg-rr 99.1%

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

   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. 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
3. Recombined 2 regimes into one program.

4. Final simplification 99.7%

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

Alternative 3: 73.2% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\alpha \leq 5 \cdot 10^{-39}:\\ \;\;\;\;0.5 + \alpha \cdot -0.25\\ \mathbf{elif}\;\alpha \leq 58000000000:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;\frac{\beta + 1}{\alpha}\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta)
 :precision binary64
 (if (<= alpha 5e-39)
   (+ 0.5 (* alpha -0.25))
   (if (<= alpha 58000000000.0) 1.0 (/ (+ beta 1.0) alpha))))

C

double code(double alpha, double beta) {
	double tmp;
	if (alpha <= 5e-39) {
		tmp = 0.5 + (alpha * -0.25);
	} else if (alpha <= 58000000000.0) {
		tmp = 1.0;
	} else {
		tmp = (beta + 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 <= 5d-39) then
        tmp = 0.5d0 + (alpha * (-0.25d0))
    else if (alpha <= 58000000000.0d0) then
        tmp = 1.0d0
    else
        tmp = (beta + 1.0d0) / alpha
    end if
    code = tmp
end function

Java

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

Python

def code(alpha, beta):
	tmp = 0
	if alpha <= 5e-39:
		tmp = 0.5 + (alpha * -0.25)
	elif alpha <= 58000000000.0:
		tmp = 1.0
	else:
		tmp = (beta + 1.0) / alpha
	return tmp

Julia

function code(alpha, beta)
	tmp = 0.0
	if (alpha <= 5e-39)
		tmp = Float64(0.5 + Float64(alpha * -0.25));
	elseif (alpha <= 58000000000.0)
		tmp = 1.0;
	else
		tmp = Float64(Float64(beta + 1.0) / alpha);
	end
	return tmp
end

MATLAB

function tmp_2 = code(alpha, beta)
	tmp = 0.0;
	if (alpha <= 5e-39)
		tmp = 0.5 + (alpha * -0.25);
	elseif (alpha <= 58000000000.0)
		tmp = 1.0;
	else
		tmp = (beta + 1.0) / alpha;
	end
	tmp_2 = tmp;
end

Wolfram

code[alpha_, beta_] := If[LessEqual[alpha, 5e-39], N[(0.5 + N[(alpha * -0.25), $MachinePrecision]), $MachinePrecision], If[LessEqual[alpha, 58000000000.0], 1.0, N[(N[(beta + 1.0), $MachinePrecision] / alpha), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if alpha < 4.9999999999999998e-39

   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 beta around 0 74.6%

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

      1. +-commutative 74.6%

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

   7. Simplified 74.6%

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

   8. Taylor expanded in alpha around 0 74.5%

      \[\leadsto \color{blue}{0.5 + -0.25 \cdot \alpha} \]

   if 4.9999999999999998e-39 < alpha < 5.8e10

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

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

      1. +-commutative 97.1%

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

   7. Simplified 97.1%

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

   8. Taylor expanded in beta around inf 77.4%

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

   if 5.8e10 < alpha

   1. Initial program 22.7%

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

      1. +-commutative 22.7%

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

   3. Simplified 22.7%

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

   5. Taylor expanded in alpha around inf 83.2%

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

      1. *-commutative 83.2%

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

   7. Simplified 83.2%

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

   8. Taylor expanded in alpha around 0 83.2%

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

      1. associate-*r/ 83.2%

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

      2. +-commutative 83.2%

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

      3. metadata-eval 83.2%

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

      4. distribute-lft-in 83.2%

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

      5. associate-*r* 83.2%

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

      6. metadata-eval 83.2%

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

      7. associate-*l/ 83.0%

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

      8. metadata-eval 83.0%

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

      9. associate-/r* 83.0%

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

      10. associate-*l/ 83.2%

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

      11. times-frac 83.2%

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

      12. metadata-eval 83.2%

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

   10. Simplified 83.2%

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

       1. *-un-lft-identity 83.2%

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

   12. Applied egg-rr 83.2%

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

4. Final simplification 77.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\alpha \leq 5 \cdot 10^{-39}:\\ \;\;\;\;0.5 + \alpha \cdot -0.25\\ \mathbf{elif}\;\alpha \leq 58000000000:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;\frac{\beta + 1}{\alpha}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 93.1% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if alpha < 1.2e11

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

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

      1. +-commutative 99.3%

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

   7. Simplified 99.3%

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

   if 1.2e11 < alpha

   1. Initial program 22.7%

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

      1. +-commutative 22.7%

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

   3. Simplified 22.7%

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

   5. Taylor expanded in alpha around inf 83.2%

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

      1. *-commutative 83.2%

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

   7. Simplified 83.2%

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

   8. Taylor expanded in alpha around 0 83.2%

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

      1. associate-*r/ 83.2%

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

      2. +-commutative 83.2%

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

      3. metadata-eval 83.2%

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

      4. distribute-lft-in 83.2%

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

      5. associate-*r* 83.2%

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

      6. metadata-eval 83.2%

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

      7. associate-*l/ 83.0%

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

      8. metadata-eval 83.0%

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

      9. associate-/r* 83.0%

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

      10. associate-*l/ 83.2%

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

      11. times-frac 83.2%

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

      12. metadata-eval 83.2%

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

   10. Simplified 83.2%

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

       1. *-un-lft-identity 83.2%

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

   12. Applied egg-rr 83.2%

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

4. Final simplification 93.4%

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

Alternative 5: 72.4% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 2

   1. Initial program 66.7%

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

      1. +-commutative 66.7%

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

   3. Simplified 66.7%

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

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

      1. +-commutative 65.4%

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

   7. Simplified 65.4%

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

   8. Taylor expanded in beta around 0 64.8%

      \[\leadsto \color{blue}{0.5 + 0.25 \cdot \beta} \]

   if 2 < beta

   1. Initial program 80.5%

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

      1. +-commutative 80.5%

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

   3. Simplified 80.5%

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

   5. Taylor expanded in alpha around 0 80.4%

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

      1. +-commutative 80.4%

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

   7. Simplified 80.4%

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

   8. Taylor expanded in beta around inf 79.7%

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

4. Final simplification 70.1%

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

Alternative 6: 72.1% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 2

   1. Initial program 66.7%

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

      1. +-commutative 66.7%

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

   3. Simplified 66.7%

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

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

      1. +-commutative 65.4%

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

   7. Simplified 65.4%

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

   8. Taylor expanded in beta around 0 64.8%

      \[\leadsto \color{blue}{0.5 + 0.25 \cdot \beta} \]

   if 2 < beta

   1. Initial program 80.5%

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

      1. +-commutative 80.5%

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

   3. Simplified 80.5%

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

   5. Taylor expanded in alpha around 0 80.4%

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

      1. +-commutative 80.4%

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

   7. Simplified 80.4%

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

   8. Taylor expanded in beta around inf 79.6%

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

4. Final simplification 70.1%

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

Alternative 7: 71.6% accurate, 2.2× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 2

   1. Initial program 66.7%

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

      1. +-commutative 66.7%

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

   3. Simplified 66.7%

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

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

      1. +-commutative 65.4%

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

   7. Simplified 65.4%

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

   8. Taylor expanded in beta around 0 64.4%

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

   if 2 < beta

   1. Initial program 80.5%

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

      1. +-commutative 80.5%

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

   3. Simplified 80.5%

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

   5. Taylor expanded in alpha around 0 80.4%

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

      1. +-commutative 80.4%

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

   7. Simplified 80.4%

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

   8. Taylor expanded in beta around inf 79.6%

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

Alternative 8: 49.4% 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 71.6%

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

   1. +-commutative 71.6%

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

3. Simplified 71.6%

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

5. Taylor expanded in alpha around 0 70.7%

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

   1. +-commutative 70.7%

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

7. Simplified 70.7%

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

8. Taylor expanded in beta around 0 47.3%

   \[\leadsto \color{blue}{0.5} \]
9. Add Preprocessing

Alternative 9: 3.7% accurate, 13.0× speedup

Math

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

FPCore

(FPCore (alpha beta) :precision binary64 0.0)

C

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

Fortran

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

Java

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

Python

def code(alpha, beta):
	return 0.0

Julia

function code(alpha, beta)
	return 0.0
end

MATLAB

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

Wolfram

code[alpha_, beta_] := 0.0

Derivation

1. Initial program 71.6%

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

   1. +-commutative 71.6%

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

   2. sub-neg 71.6%

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

   3. +-commutative 71.6%

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

   4. neg-sub0 71.6%

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

   5. associate-+l- 71.6%

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

   6. sub0-neg 71.6%

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

   7. distribute-frac-neg 71.6%

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

   8. +-commutative 71.6%

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

   9. sub-neg 71.6%

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

   10. div-sub 71.6%

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

   11. sub-neg 71.6%

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

   12. metadata-eval 71.6%

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

   13. neg-mul-1 71.6%

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

   14. *-commutative 71.6%

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

   15. +-commutative 71.6%

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

   16. associate-/l/ 71.6%

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

   17. associate-*l/ 71.6%

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

3. Simplified 71.6%

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

   \[\leadsto 0.5 + \color{blue}{-0.5} \]
6. Step-by-step derivation

   1. metadata-eval 3.6%

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

7. Applied egg-rr 3.6%

   \[\leadsto \color{blue}{0} \]
8. Add Preprocessing

Reproduce

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