Octave 3.8, jcobi/1

Percentage Accurate: 75.2% → 99.4%

Time: 6.9s

Alternatives: 9

Speedup: 1.2×

Specification

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

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

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

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

function code(alpha, beta)
	tmp = 0.0
	if (Float64(Float64(beta - alpha) / Float64(Float64(beta + alpha) + 2.0)) <= -1.0)
		tmp = Float64(Float64(Float64(2.0 + Float64(beta * 2.0)) / alpha) / 2.0);
	else
		tmp = Float64(exp(log1p(Float64(Float64(beta - alpha) / Float64(beta + Float64(alpha + 2.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], -1.0], N[(N[(N[(2.0 + N[(beta * 2.0), $MachinePrecision]), $MachinePrecision] / alpha), $MachinePrecision] / 2.0), $MachinePrecision], N[(N[Exp[N[Log[1 + N[(N[(beta - alpha), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision] / 2.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 5.5%

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

      1. +-commutative 5.5%

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

   3. Simplified 5.5%

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

   4. Taylor expanded in alpha around inf 100.0%

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

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

   1. Initial program 100.0%

      \[\frac{\frac{\beta - \alpha}{\left(\alpha + \beta\right) + 2} + 1}{2} \]
   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. Step-by-step derivation

      1. flip3-+ 99.9%

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

      2. add-exp-log 99.9%

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

      3. flip3-+ 100.0%

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

      4. +-commutative 100.0%

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

      5. log1p-udef 100.0%

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

      6. div-inv 99.9%

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

      7. div-inv 100.0%

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

      8. associate-+l+ 100.0%

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

   5. Applied egg-rr 100.0%

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

      1. +-commutative 100.0%

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

      2. +-commutative 100.0%

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

      3. +-commutative 100.0%

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

   7. Simplified 100.0%

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

4. Final simplification 100.0%

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

Alternative 2: 99.4% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\beta - \alpha}{\left(\beta + \alpha\right) + 2}\\ \mathbf{if}\;t_0 \leq -1:\\ \;\;\;\;\frac{\frac{2 + \beta \cdot 2}{\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 -1.0)
     (/ (/ (+ 2.0 (* 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 <= -1.0) {
		tmp = ((2.0 + (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 <= (-1.0d0)) then
        tmp = ((2.0d0 + (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 <= -1.0) {
		tmp = ((2.0 + (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 <= -1.0:
		tmp = ((2.0 + (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 <= -1.0)
		tmp = Float64(Float64(Float64(2.0 + 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 <= -1.0)
		tmp = ((2.0 + (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, -1.0], N[(N[(N[(2.0 + 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)) < -1

   1. Initial program 5.5%

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

      1. +-commutative 5.5%

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

   3. Simplified 5.5%

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

   4. Taylor expanded in alpha around inf 100.0%

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

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

   1. Initial program 100.0%

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

4. Final simplification 100.0%

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

Alternative 3: 70.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{1 + \beta \cdot 0.5}{2}\\ \mathbf{if}\;\beta \leq -3 \cdot 10^{-207}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;\beta \leq -2.5 \cdot 10^{-266}:\\ \;\;\;\;\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 -3e-207)
     t_0
     (if (<= beta -2.5e-266)
       (/ (/ 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 <= -3e-207) {
		tmp = t_0;
	} else if (beta <= -2.5e-266) {
		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 <= (-3d-207)) then
        tmp = t_0
    else if (beta <= (-2.5d-266)) 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 <= -3e-207) {
		tmp = t_0;
	} else if (beta <= -2.5e-266) {
		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 <= -3e-207:
		tmp = t_0
	elif beta <= -2.5e-266:
		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 <= -3e-207)
		tmp = t_0;
	elseif (beta <= -2.5e-266)
		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 <= -3e-207)
		tmp = t_0;
	elseif (beta <= -2.5e-266)
		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, -3e-207], t$95$0, If[LessEqual[beta, -2.5e-266], 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 < -2.9999999999999999e-207 or -2.49999999999999996e-266 < beta < 2

   1. Initial program 68.9%

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

      1. +-commutative 68.9%

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

   3. Simplified 68.9%

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

   4. Taylor expanded in alpha around 0 67.5%

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

   5. Taylor expanded in beta around 0 67.1%

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

      1. *-commutative 67.1%

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

   7. Simplified 67.1%

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

   if -2.9999999999999999e-207 < beta < -2.49999999999999996e-266

   1. Initial program 32.8%

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

      1. +-commutative 32.8%

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

   3. Simplified 32.8%

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

   4. Taylor expanded in alpha around inf 73.0%

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

   5. Taylor expanded in beta around 0 73.0%

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

   if 2 < beta

   1. Initial program 93.2%

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

      1. +-commutative 93.2%

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

   3. Simplified 93.2%

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

   4. Taylor expanded in beta around inf 90.4%

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

4. Final simplification 75.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq -3 \cdot 10^{-207}:\\ \;\;\;\;\frac{1 + \beta \cdot 0.5}{2}\\ \mathbf{elif}\;\beta \leq -2.5 \cdot 10^{-266}:\\ \;\;\;\;\frac{\frac{2}{\alpha}}{2}\\ \mathbf{elif}\;\beta \leq 2:\\ \;\;\;\;\frac{1 + \beta \cdot 0.5}{2}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]

Alternative 4: 70.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{1 + \beta \cdot 0.5}{2}\\ \mathbf{if}\;\beta \leq -3 \cdot 10^{-207}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;\beta \leq -2.05 \cdot 10^{-266}:\\ \;\;\;\;\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 -3e-207)
     t_0
     (if (<= beta -2.05e-266)
       (/ (/ 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 <= -3e-207) {
		tmp = t_0;
	} else if (beta <= -2.05e-266) {
		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 <= (-3d-207)) then
        tmp = t_0
    else if (beta <= (-2.05d-266)) 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 <= -3e-207) {
		tmp = t_0;
	} else if (beta <= -2.05e-266) {
		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 <= -3e-207:
		tmp = t_0
	elif beta <= -2.05e-266:
		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 <= -3e-207)
		tmp = t_0;
	elseif (beta <= -2.05e-266)
		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 <= -3e-207)
		tmp = t_0;
	elseif (beta <= -2.05e-266)
		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, -3e-207], t$95$0, If[LessEqual[beta, -2.05e-266], 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 < -2.9999999999999999e-207 or -2.0500000000000001e-266 < beta < 2

   1. Initial program 68.9%

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

      1. +-commutative 68.9%

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

   3. Simplified 68.9%

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

   4. Taylor expanded in alpha around 0 67.5%

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

   5. Taylor expanded in beta around 0 67.1%

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

      1. *-commutative 67.1%

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

   7. Simplified 67.1%

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

   if -2.9999999999999999e-207 < beta < -2.0500000000000001e-266

   1. Initial program 32.8%

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

      1. +-commutative 32.8%

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

   3. Simplified 32.8%

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

   4. Taylor expanded in alpha around inf 73.0%

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

   5. Taylor expanded in beta around 0 73.0%

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

   if 2 < beta

   1. Initial program 93.2%

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

      1. +-commutative 93.2%

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

   3. Simplified 93.2%

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

   4. Taylor expanded in alpha around 0 93.3%

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

   5. Taylor expanded in beta around inf 91.9%

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

      1. associate-*r/ 91.9%

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

      2. metadata-eval 91.9%

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

   7. Simplified 91.9%

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

4. Final simplification 75.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq -3 \cdot 10^{-207}:\\ \;\;\;\;\frac{1 + \beta \cdot 0.5}{2}\\ \mathbf{elif}\;\beta \leq -2.05 \cdot 10^{-266}:\\ \;\;\;\;\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} \]

Alternative 5: 87.3% accurate, 1.2× speedup

Math

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

C

double code(double alpha, double beta) {
	double tmp;
	if (alpha <= 8.8e+23) {
		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 <= 8.8d+23) 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 <= 8.8e+23) {
		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 <= 8.8e+23:
		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 <= 8.8e+23)
		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 <= 8.8e+23)
		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, 8.8e+23], 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 < 8.80000000000000034e23

   1. Initial program 99.4%

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

      1. +-commutative 99.4%

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

   3. Simplified 99.4%

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

   4. Taylor expanded in alpha around 0 98.3%

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

   if 8.80000000000000034e23 < alpha

   1. Initial program 20.9%

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

      1. +-commutative 20.9%

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

   3. Simplified 20.9%

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

   4. Taylor expanded in alpha around inf 84.7%

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

   5. Taylor expanded in beta around 0 76.1%

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

4. Final simplification 91.4%

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

Alternative 6: 92.9% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if alpha < 3.30000000000000029e23

   1. Initial program 99.4%

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

      1. +-commutative 99.4%

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

   3. Simplified 99.4%

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

   4. Taylor expanded in alpha around 0 98.3%

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

   if 3.30000000000000029e23 < alpha

   1. Initial program 20.9%

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

      1. +-commutative 20.9%

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

   3. Simplified 20.9%

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

   4. Taylor expanded in alpha around inf 84.7%

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

4. Final simplification 94.1%

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

Alternative 7: 70.1% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\beta \leq -3 \cdot 10^{-207}:\\ \;\;\;\;0.5\\ \mathbf{elif}\;\beta \leq -2.45 \cdot 10^{-266}:\\ \;\;\;\;\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 -3e-207)
   0.5
   (if (<= beta -2.45e-266) (/ (/ 2.0 alpha) 2.0) (if (<= beta 2.0) 0.5 1.0))))

C

double code(double alpha, double beta) {
	double tmp;
	if (beta <= -3e-207) {
		tmp = 0.5;
	} else if (beta <= -2.45e-266) {
		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 <= (-3d-207)) then
        tmp = 0.5d0
    else if (beta <= (-2.45d-266)) 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 <= -3e-207) {
		tmp = 0.5;
	} else if (beta <= -2.45e-266) {
		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 <= -3e-207:
		tmp = 0.5
	elif beta <= -2.45e-266:
		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 <= -3e-207)
		tmp = 0.5;
	elseif (beta <= -2.45e-266)
		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 <= -3e-207)
		tmp = 0.5;
	elseif (beta <= -2.45e-266)
		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, -3e-207], 0.5, If[LessEqual[beta, -2.45e-266], 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 < -2.9999999999999999e-207 or -2.4500000000000001e-266 < beta < 2

   1. Initial program 68.9%

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

      1. +-commutative 68.9%

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

   3. Simplified 68.9%

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

      1. flip3-+ 68.8%

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

      2. add-exp-log 68.8%

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

      3. flip3-+ 68.9%

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

      4. +-commutative 68.9%

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

      5. log1p-udef 68.9%

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

      6. div-inv 68.8%

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

      7. div-inv 68.9%

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

      8. associate-+l+ 68.9%

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

   5. Applied egg-rr 68.9%

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

      1. +-commutative 68.9%

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

      2. +-commutative 68.9%

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

      3. +-commutative 68.9%

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

   7. Simplified 68.9%

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

   8. Taylor expanded in beta around 0 67.3%

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

      1. log1p-def 67.3%

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

      2. associate-*r/ 67.3%

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

      3. neg-mul-1 67.3%

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

      4. +-commutative 67.3%

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

   10. Simplified 67.3%

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

   11. Taylor expanded in alpha around 0 66.0%

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

   if -2.9999999999999999e-207 < beta < -2.4500000000000001e-266

   1. Initial program 32.8%

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

      1. +-commutative 32.8%

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

   3. Simplified 32.8%

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

   4. Taylor expanded in alpha around inf 73.0%

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

   5. Taylor expanded in beta around 0 73.0%

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

   if 2 < beta

   1. Initial program 93.2%

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

      1. +-commutative 93.2%

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

   3. Simplified 93.2%

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

   4. Taylor expanded in beta around inf 90.4%

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

4. Final simplification 74.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq -3 \cdot 10^{-207}:\\ \;\;\;\;0.5\\ \mathbf{elif}\;\beta \leq -2.45 \cdot 10^{-266}:\\ \;\;\;\;\frac{\frac{2}{\alpha}}{2}\\ \mathbf{elif}\;\beta \leq 2:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]

Alternative 8: 71.9% accurate, 4.2× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 2

   1. Initial program 66.0%

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

      1. +-commutative 66.0%

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

   3. Simplified 66.0%

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

      1. flip3-+ 65.9%

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

      2. add-exp-log 65.9%

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

      3. flip3-+ 66.0%

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

      4. +-commutative 66.0%

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

      5. log1p-udef 66.0%

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

      6. div-inv 65.9%

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

      7. div-inv 66.0%

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

      8. associate-+l+ 66.0%

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

   5. Applied egg-rr 66.0%

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

      1. +-commutative 66.0%

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

      2. +-commutative 66.0%

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

      3. +-commutative 66.0%

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

   7. Simplified 66.0%

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

   8. Taylor expanded in beta around 0 64.5%

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

      1. log1p-def 64.5%

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

      2. associate-*r/ 64.5%

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

      3. neg-mul-1 64.5%

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

      4. +-commutative 64.5%

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

   10. Simplified 64.5%

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

   11. Taylor expanded in alpha around 0 63.1%

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

   if 2 < beta

   1. Initial program 93.2%

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

      1. +-commutative 93.2%

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

   3. Simplified 93.2%

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

   4. Taylor expanded in beta around inf 90.4%

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

4. Final simplification 72.0%

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

Alternative 9: 49.3% accurate, 13.0× speedup

Math

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

FPCore

(FPCore (alpha beta) :precision binary64 0.5)

C

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

Fortran

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

Java

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

Python

def code(alpha, beta):
	return 0.5

Julia

function code(alpha, beta)
	return 0.5
end

MATLAB

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

Wolfram

code[alpha_, beta_] := 0.5

Derivation

1. Initial program 74.9%

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

   1. +-commutative 74.9%

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

3. Simplified 74.9%

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

   1. flip3-+ 74.8%

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

   2. add-exp-log 74.8%

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

   3. flip3-+ 74.9%

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

   4. +-commutative 74.9%

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

   5. log1p-udef 74.9%

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

   6. div-inv 74.8%

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

   7. div-inv 74.9%

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

   8. associate-+l+ 74.9%

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

5. Applied egg-rr 74.9%

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

   1. +-commutative 74.9%

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

   2. +-commutative 74.9%

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

   3. +-commutative 74.9%

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

7. Simplified 74.9%

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

8. Taylor expanded in beta around 0 48.1%

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

   1. log1p-def 48.1%

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

   2. associate-*r/ 48.1%

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

   3. neg-mul-1 48.1%

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

   4. +-commutative 48.1%

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

10. Simplified 48.1%

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

11. Taylor expanded in alpha around 0 48.2%

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

12. Final simplification 48.2%

    \[\leadsto 0.5 \]

Reproduce

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