Octave 3.8, jcobi/1

Percentage Accurate: 74.5% → 99.9%

Time: 12.7s

Alternatives: 10

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.5% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 0.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 7.9%

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

      1. +-commutative 7.9%

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

   3. Simplified 7.9%

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

   5. Taylor expanded in alpha around -inf 95.9%

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

   7. Simplified 99.5%

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

      1. *-un-lft-identity 99.5%

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

      2. unpow2 99.5%

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

      3. times-frac 100.0%

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

   9. Applied egg-rr 100.0%

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

       1. associate-*l/ 100.0%

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

       2. *-lft-identity 100.0%

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

   11. Simplified 100.0%

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

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

   1. Initial program 99.9%

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

      1. +-commutative 99.9%

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

   3. Simplified 99.9%

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

      1. div-inv 99.9%

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

      2. fma-define 99.9%

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

      3. associate-+l+ 99.9%

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

   6. Applied egg-rr 99.9%

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

4. Final simplification 99.9%

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

Alternative 2: 99.9% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 7.9%

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

      1. +-commutative 7.9%

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

   3. Simplified 7.9%

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

   5. Taylor expanded in alpha around -inf 95.9%

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

   7. Simplified 99.5%

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

      1. *-un-lft-identity 99.5%

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

      2. unpow2 99.5%

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

      3. times-frac 100.0%

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

   9. Applied egg-rr 100.0%

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

       1. associate-*l/ 100.0%

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

       2. *-lft-identity 100.0%

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

   11. Simplified 100.0%

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

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

   1. Initial program 99.9%

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

4. Final simplification 99.9%

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

Alternative 3: 99.6% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 7.9%

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

      1. +-commutative 7.9%

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

   3. Simplified 7.9%

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

   5. Taylor expanded in alpha around -inf 98.4%

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

      1. associate-*r/ 98.4%

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

      2. sub-neg 98.4%

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

      3. mul-1-neg 98.4%

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

      4. distribute-lft-in 98.4%

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

      5. neg-mul-1 98.4%

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

      6. neg-mul-1 98.4%

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

      7. mul-1-neg 98.4%

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

      8. remove-double-neg 98.4%

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

      9. mul-1-neg 98.4%

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

      10. remove-double-neg 98.4%

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

   7. Simplified 98.4%

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

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

   1. Initial program 99.9%

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

4. Final simplification 99.4%

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

Alternative 4: 70.7% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{1 + \beta \cdot 0.5}{2}\\ \mathbf{if}\;\beta \leq 4.5 \cdot 10^{-142}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;\beta \leq 5.2 \cdot 10^{-118}:\\ \;\;\;\;\frac{\frac{2}{\alpha}}{2}\\ \mathbf{elif}\;\beta \leq 2:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

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

C

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

Java

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

Python

def code(alpha, beta):
	t_0 = (1.0 + (beta * 0.5)) / 2.0
	tmp = 0
	if beta <= 4.5e-142:
		tmp = t_0
	elif beta <= 5.2e-118:
		tmp = (2.0 / alpha) / 2.0
	elif beta <= 2.0:
		tmp = t_0
	else:
		tmp = 1.0
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if beta < 4.50000000000000019e-142 or 5.2e-118 < beta < 2

   1. Initial program 70.3%

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

      1. +-commutative 70.3%

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

   3. Simplified 70.3%

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

   5. Taylor expanded in alpha around 0 67.8%

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

   6. Taylor expanded in beta around 0 67.7%

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

      1. *-commutative 67.7%

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

   8. Simplified 67.7%

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

   if 4.50000000000000019e-142 < beta < 5.2e-118

   1. Initial program 30.9%

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

      1. +-commutative 30.9%

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

   3. Simplified 30.9%

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

   5. Taylor expanded in alpha around -inf 75.6%

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

      1. associate-*r/ 75.6%

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

      2. sub-neg 75.6%

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

      3. mul-1-neg 75.6%

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

      4. distribute-lft-in 75.6%

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

      5. neg-mul-1 75.6%

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

      6. neg-mul-1 75.6%

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

      7. mul-1-neg 75.6%

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

      8. remove-double-neg 75.6%

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

      9. mul-1-neg 75.6%

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

      10. remove-double-neg 75.6%

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

   7. Simplified 75.6%

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

   8. Taylor expanded in beta around 0 75.6%

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

   if 2 < beta

   1. Initial program 83.0%

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

      1. +-commutative 83.0%

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

   3. Simplified 83.0%

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

   5. Taylor expanded in beta around inf 80.6%

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

4. Final simplification 72.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 4.5 \cdot 10^{-142}:\\ \;\;\;\;\frac{1 + \beta \cdot 0.5}{2}\\ \mathbf{elif}\;\beta \leq 5.2 \cdot 10^{-118}:\\ \;\;\;\;\frac{\frac{2}{\alpha}}{2}\\ \mathbf{elif}\;\beta \leq 2:\\ \;\;\;\;\frac{1 + \beta \cdot 0.5}{2}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 70.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{1 + \beta \cdot 0.5}{2}\\ \mathbf{if}\;\beta \leq 4.5 \cdot 10^{-142}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;\beta \leq 5.2 \cdot 10^{-118}:\\ \;\;\;\;\frac{\frac{2}{\alpha}}{2}\\ \mathbf{elif}\;\beta \leq 2:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;\frac{2 - \frac{2}{\beta}}{2}\\ \end{array} \end{array} \]

FPCore

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

C

double code(double alpha, double beta) {
	double t_0 = (1.0 + (beta * 0.5)) / 2.0;
	double tmp;
	if (beta <= 4.5e-142) {
		tmp = t_0;
	} else if (beta <= 5.2e-118) {
		tmp = (2.0 / alpha) / 2.0;
	} else if (beta <= 2.0) {
		tmp = t_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) :: t_0
    real(8) :: tmp
    t_0 = (1.0d0 + (beta * 0.5d0)) / 2.0d0
    if (beta <= 4.5d-142) then
        tmp = t_0
    else if (beta <= 5.2d-118) then
        tmp = (2.0d0 / alpha) / 2.0d0
    else if (beta <= 2.0d0) then
        tmp = t_0
    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 t_0 = (1.0 + (beta * 0.5)) / 2.0;
	double tmp;
	if (beta <= 4.5e-142) {
		tmp = t_0;
	} else if (beta <= 5.2e-118) {
		tmp = (2.0 / alpha) / 2.0;
	} else if (beta <= 2.0) {
		tmp = t_0;
	} else {
		tmp = (2.0 - (2.0 / beta)) / 2.0;
	}
	return tmp;
}

Python

def code(alpha, beta):
	t_0 = (1.0 + (beta * 0.5)) / 2.0
	tmp = 0
	if beta <= 4.5e-142:
		tmp = t_0
	elif beta <= 5.2e-118:
		tmp = (2.0 / alpha) / 2.0
	elif beta <= 2.0:
		tmp = t_0
	else:
		tmp = (2.0 - (2.0 / beta)) / 2.0
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if beta < 4.50000000000000019e-142 or 5.2e-118 < beta < 2

   1. Initial program 70.3%

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

      1. +-commutative 70.3%

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

   3. Simplified 70.3%

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

   5. Taylor expanded in alpha around 0 67.8%

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

   6. Taylor expanded in beta around 0 67.7%

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

      1. *-commutative 67.7%

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

   8. Simplified 67.7%

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

   if 4.50000000000000019e-142 < beta < 5.2e-118

   1. Initial program 30.9%

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

      1. +-commutative 30.9%

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

   3. Simplified 30.9%

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

   5. Taylor expanded in alpha around -inf 75.6%

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

      1. associate-*r/ 75.6%

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

      2. sub-neg 75.6%

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

      3. mul-1-neg 75.6%

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

      4. distribute-lft-in 75.6%

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

      5. neg-mul-1 75.6%

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

      6. neg-mul-1 75.6%

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

      7. mul-1-neg 75.6%

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

      8. remove-double-neg 75.6%

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

      9. mul-1-neg 75.6%

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

      10. remove-double-neg 75.6%

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

   7. Simplified 75.6%

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

   8. Taylor expanded in beta around 0 75.6%

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

   if 2 < beta

   1. Initial program 83.0%

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

      1. +-commutative 83.0%

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

   3. Simplified 83.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 81.7%

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

   6. Taylor expanded in beta around inf 81.7%

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

      1. associate-*r/ 81.7%

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

      2. metadata-eval 81.7%

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

   8. Simplified 81.7%

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

4. Final simplification 72.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 4.5 \cdot 10^{-142}:\\ \;\;\;\;\frac{1 + \beta \cdot 0.5}{2}\\ \mathbf{elif}\;\beta \leq 5.2 \cdot 10^{-118}:\\ \;\;\;\;\frac{\frac{2}{\alpha}}{2}\\ \mathbf{elif}\;\beta \leq 2:\\ \;\;\;\;\frac{1 + \beta \cdot 0.5}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 - \frac{2}{\beta}}{2}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 70.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\beta \leq 4.5 \cdot 10^{-142}:\\ \;\;\;\;0.5\\ \mathbf{elif}\;\beta \leq 5.2 \cdot 10^{-118}:\\ \;\;\;\;\frac{\frac{2}{\alpha}}{2}\\ \mathbf{elif}\;\beta \leq 2:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta)
 :precision binary64
 (if (<= beta 4.5e-142)
   0.5
   (if (<= beta 5.2e-118) (/ (/ 2.0 alpha) 2.0) (if (<= beta 2.0) 0.5 1.0))))

C

double code(double alpha, double beta) {
	double tmp;
	if (beta <= 4.5e-142) {
		tmp = 0.5;
	} else if (beta <= 5.2e-118) {
		tmp = (2.0 / alpha) / 2.0;
	} else 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 <= 4.5d-142) then
        tmp = 0.5d0
    else if (beta <= 5.2d-118) then
        tmp = (2.0d0 / alpha) / 2.0d0
    else 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 <= 4.5e-142) {
		tmp = 0.5;
	} else if (beta <= 5.2e-118) {
		tmp = (2.0 / alpha) / 2.0;
	} else if (beta <= 2.0) {
		tmp = 0.5;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(alpha, beta):
	tmp = 0
	if beta <= 4.5e-142:
		tmp = 0.5
	elif beta <= 5.2e-118:
		tmp = (2.0 / alpha) / 2.0
	elif beta <= 2.0:
		tmp = 0.5
	else:
		tmp = 1.0
	return tmp

Julia

function code(alpha, beta)
	tmp = 0.0
	if (beta <= 4.5e-142)
		tmp = 0.5;
	elseif (beta <= 5.2e-118)
		tmp = Float64(Float64(2.0 / alpha) / 2.0);
	elseif (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 <= 4.5e-142)
		tmp = 0.5;
	elseif (beta <= 5.2e-118)
		tmp = (2.0 / alpha) / 2.0;
	elseif (beta <= 2.0)
		tmp = 0.5;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[alpha_, beta_] := If[LessEqual[beta, 4.5e-142], 0.5, If[LessEqual[beta, 5.2e-118], N[(N[(2.0 / alpha), $MachinePrecision] / 2.0), $MachinePrecision], If[LessEqual[beta, 2.0], 0.5, 1.0]]]

Derivation

1. Split input into 3 regimes

2. if beta < 4.50000000000000019e-142 or 5.2e-118 < beta < 2

   1. Initial program 70.3%

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

      1. +-commutative 70.3%

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

   3. Simplified 70.3%

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

   5. Taylor expanded in beta around 0 70.0%

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

      1. +-commutative 70.0%

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

   7. Simplified 70.0%

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

   8. Taylor expanded in alpha around 0 67.4%

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

   if 4.50000000000000019e-142 < beta < 5.2e-118

   1. Initial program 30.9%

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

      1. +-commutative 30.9%

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

   3. Simplified 30.9%

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

   5. Taylor expanded in alpha around -inf 75.6%

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

      1. associate-*r/ 75.6%

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

      2. sub-neg 75.6%

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

      3. mul-1-neg 75.6%

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

      4. distribute-lft-in 75.6%

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

      5. neg-mul-1 75.6%

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

      6. neg-mul-1 75.6%

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

      7. mul-1-neg 75.6%

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

      8. remove-double-neg 75.6%

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

      9. mul-1-neg 75.6%

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

      10. remove-double-neg 75.6%

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

   7. Simplified 75.6%

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

   8. Taylor expanded in beta around 0 75.6%

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

   if 2 < beta

   1. Initial program 83.0%

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

      1. +-commutative 83.0%

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

   3. Simplified 83.0%

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

   5. Taylor expanded in beta around inf 80.6%

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

4. Final simplification 72.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 4.5 \cdot 10^{-142}:\\ \;\;\;\;0.5\\ \mathbf{elif}\;\beta \leq 5.2 \cdot 10^{-118}:\\ \;\;\;\;\frac{\frac{2}{\alpha}}{2}\\ \mathbf{elif}\;\beta \leq 2:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 87.7% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if alpha < 2500

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

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

   if 2500 < alpha

   1. Initial program 19.5%

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

      1. +-commutative 19.5%

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

   3. Simplified 19.5%

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

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

      1. associate-*r/ 86.9%

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

      2. sub-neg 86.9%

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

      3. mul-1-neg 86.9%

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

      4. distribute-lft-in 86.9%

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

      5. neg-mul-1 86.9%

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

      6. neg-mul-1 86.9%

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

      7. mul-1-neg 86.9%

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

      8. remove-double-neg 86.9%

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

      9. mul-1-neg 86.9%

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

      10. remove-double-neg 86.9%

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

   7. Simplified 86.9%

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

   8. Taylor expanded in beta around 0 69.1%

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

4. Final simplification 88.8%

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

Alternative 8: 93.1% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if alpha < 1.5e5

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

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

   if 1.5e5 < alpha

   1. Initial program 19.5%

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

      1. +-commutative 19.5%

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

   3. Simplified 19.5%

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

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

      1. associate-*r/ 86.9%

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

      2. sub-neg 86.9%

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

      3. mul-1-neg 86.9%

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

      4. distribute-lft-in 86.9%

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

      5. neg-mul-1 86.9%

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

      6. neg-mul-1 86.9%

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

      7. mul-1-neg 86.9%

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

      8. remove-double-neg 86.9%

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

      9. mul-1-neg 86.9%

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

      10. remove-double-neg 86.9%

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

   7. Simplified 86.9%

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

4. Final simplification 94.7%

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

Alternative 9: 71.0% 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 68.2%

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

      1. +-commutative 68.2%

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

   3. Simplified 68.2%

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

   5. Taylor expanded in beta around 0 67.9%

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

      1. +-commutative 67.9%

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

   7. Simplified 67.9%

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

   8. Taylor expanded in alpha around 0 65.2%

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

   if 2 < beta

   1. Initial program 83.0%

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

      1. +-commutative 83.0%

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

   3. Simplified 83.0%

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

   5. Taylor expanded in beta around inf 80.6%

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

4. Final simplification 70.5%

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

Alternative 10: 49.6% 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 73.3%

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

   1. +-commutative 73.3%

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

3. Simplified 73.3%

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

5. Taylor expanded in beta around 0 49.7%

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

   1. +-commutative 49.7%

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

7. Simplified 49.7%

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

8. Taylor expanded in alpha around 0 48.6%

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

9. Final simplification 48.6%

   \[\leadsto 0.5 \]
10. Add Preprocessing

Reproduce

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