Octave 3.8, jcobi/2

Percentage Accurate: 63.7% → 97.8%

Time: 15.5s

Alternatives: 9

Speedup: 1.1×

Specification

\[\left(\alpha > -1 \land \beta > -1\right) \land i > 0\]

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\alpha + \beta\right) + 2 \cdot i\\ \frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{t\_0}}{t\_0 + 2} + 1}{2} \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* 2.0 i))))
   (/ (+ (/ (/ (* (+ alpha beta) (- beta alpha)) t_0) (+ t_0 2.0)) 1.0) 2.0)))

C

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

Fortran

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

Java

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

Python

def code(alpha, beta, i):
	t_0 = (alpha + beta) + (2.0 * i)
	return (((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0)) + 1.0) / 2.0

Julia

function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * i))
	return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) * Float64(beta - alpha)) / t_0) / Float64(t_0 + 2.0)) + 1.0) / 2.0)
end

MATLAB

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

Wolfram

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

Initial Program: 63.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\alpha + \beta\right) + 2 \cdot i\\ \frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{t\_0}}{t\_0 + 2} + 1}{2} \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* 2.0 i))))
   (/ (+ (/ (/ (* (+ alpha beta) (- beta alpha)) t_0) (+ t_0 2.0)) 1.0) 2.0)))

C

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

Fortran

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

Java

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

Python

def code(alpha, beta, i):
	t_0 = (alpha + beta) + (2.0 * i)
	return (((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0)) + 1.0) / 2.0

Julia

function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * i))
	return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) * Float64(beta - alpha)) / t_0) / Float64(t_0 + 2.0)) + 1.0) / 2.0)
end

MATLAB

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

Wolfram

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

Alternative 1: 97.8% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 2.9%

      \[\frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} + 1}{2} \]
   2. Add Preprocessing

   3. Taylor expanded in alpha around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. distribute-rgt1-in N/A

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

      5. metadata-eval N/A

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

      6. mul0-lft N/A

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

      7. neg-sub0 N/A

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

      8. mul-1-neg N/A

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

      9. remove-double-neg N/A

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

      10. lower-*.f64 N/A

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

      11. lower-+.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-fma.f64 N/A

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

      14. *-commutative N/A

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

      15. lower-*.f64 87.1

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

   5. Applied rewrites 87.1%

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

   6. Taylor expanded in beta around 0

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

   8. Applied rewrites 87.1%

      \[\leadsto \frac{\mathsf{fma}\left(0.5, \mathsf{fma}\left(i, 4, 2\right), \beta\right)}{\alpha} \]
   9. Step-by-step derivation

   10. Applied rewrites 87.1%

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

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

   1. Initial program 77.1%

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

      1. lift-+.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. associate-/l* N/A

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

      7. lower-fma.f64 N/A

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

   4. Applied rewrites 99.9%

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

4. Final simplification 97.5%

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

Alternative 2: 85.0% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Java

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

Python

def code(alpha, beta, i):
	t_0 = (alpha + beta) + (2.0 * i)
	t_1 = (((alpha + beta) * (beta - alpha)) / t_0) / (2.0 + t_0)
	tmp = 0
	if t_1 <= -math.inf:
		tmp = (2.0 * i) / alpha
	elif t_1 <= -0.5:
		tmp = (beta + 1.0) / alpha
	elif t_1 <= 0.2:
		tmp = 0.5
	else:
		tmp = 1.0
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 4 regimes

2. if (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) < -inf.0

   1. Initial program 1.1%

      \[\frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} + 1}{2} \]
   2. Add Preprocessing

   3. Taylor expanded in alpha around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. distribute-rgt1-in N/A

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

      5. metadata-eval N/A

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

      6. mul0-lft N/A

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

      7. neg-sub0 N/A

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

      8. mul-1-neg N/A

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

      9. remove-double-neg N/A

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

      10. lower-*.f64 N/A

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

      11. lower-+.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-fma.f64 N/A

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

      14. *-commutative N/A

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

      15. lower-*.f64 87.4

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

   5. Applied rewrites 87.4%

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

   6. Taylor expanded in i around inf

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

   8. Applied rewrites 33.2%

      \[\leadsto \frac{2 \cdot i}{\alpha} \]

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

   1. Initial program 11.3%

      \[\frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} + 1}{2} \]
   2. Add Preprocessing

   3. Taylor expanded in alpha around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. distribute-rgt1-in N/A

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

      5. metadata-eval N/A

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

      6. mul0-lft N/A

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

      7. neg-sub0 N/A

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

      8. mul-1-neg N/A

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

      9. remove-double-neg N/A

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

      10. lower-*.f64 N/A

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

      11. lower-+.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-fma.f64 N/A

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

      14. *-commutative N/A

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

      15. lower-*.f64 94.5

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

   5. Applied rewrites 94.5%

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

   6. Taylor expanded in beta around 0

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

   8. Applied rewrites 94.5%

      \[\leadsto \frac{\mathsf{fma}\left(0.5, \mathsf{fma}\left(i, 4, 2\right), \beta\right)}{\alpha} \]

   9. Taylor expanded in i around 0

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

   11. Applied rewrites 77.8%

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

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

   1. Initial program 100.0%

      \[\frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} + 1}{2} \]
   2. Add Preprocessing

   3. Taylor expanded in i around inf

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

   5. Applied rewrites 98.0%

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

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

   1. Initial program 37.8%

      \[\frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} + 1}{2} \]
   2. Add Preprocessing

   3. Taylor expanded in beta around inf

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

   5. Applied rewrites 90.8%

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

4. Final simplification 85.0%

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

Reproduce

herbie shell --seed 2024223 
(FPCore (alpha beta i)
  :name "Octave 3.8, jcobi/2"
  :precision binary64
  :pre (and (and (> alpha -1.0) (> beta -1.0)) (> i 0.0))
  (/ (+ (/ (/ (* (+ alpha beta) (- beta alpha)) (+ (+ alpha beta) (* 2.0 i))) (+ (+ (+ alpha beta) (* 2.0 i)) 2.0)) 1.0) 2.0))