Octave 3.8, jcobi/4

Percentage Accurate: 16.4% → 84.2%

Time: 23.3s

Alternatives: 8

Speedup: 8.8×

Specification

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

Math

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

FPCore

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

C

double code(double alpha, double beta, double i) {
	double t_0 = i * ((alpha + beta) + i);
	double t_1 = (alpha + beta) + (2.0 * i);
	double t_2 = t_1 * t_1;
	return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.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
    real(8) :: t_1
    real(8) :: t_2
    t_0 = i * ((alpha + beta) + i)
    t_1 = (alpha + beta) + (2.0d0 * i)
    t_2 = t_1 * t_1
    code = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0d0)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 16.4% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double alpha, double beta, double i) {
	double t_0 = i * ((alpha + beta) + i);
	double t_1 = (alpha + beta) + (2.0 * i);
	double t_2 = t_1 * t_1;
	return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.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
    real(8) :: t_1
    real(8) :: t_2
    t_0 = i * ((alpha + beta) + i)
    t_1 = (alpha + beta) + (2.0d0 * i)
    t_2 = t_1 * t_1
    code = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0d0)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 84.2% accurate, 0.1× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} t_0 := \left(\alpha + \beta\right) + i \cdot 2\\ t_1 := t\_0 \cdot t\_0\\ t_2 := t\_1 + -1\\ t_3 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\ t_4 := \beta + \left(i + \alpha\right)\\ \mathbf{if}\;\frac{\frac{t\_3 \cdot \left(t\_3 + \alpha \cdot \beta\right)}{t\_1}}{t\_2} \leq \infty:\\ \;\;\;\;\frac{\left(i \cdot t\_4\right) \cdot \frac{\mathsf{fma}\left(i, t\_4, \alpha \cdot \beta\right)}{{\left(\mathsf{fma}\left(i, 2, \alpha + \beta\right)\right)}^{2}}}{t\_2}\\ \mathbf{else}:\\ \;\;\;\;\frac{i \cdot 0.0625 + \left(\alpha + \beta\right) \cdot 0.125}{i} - 0.125 \cdot \frac{\beta}{i}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* i 2.0)))
        (t_1 (* t_0 t_0))
        (t_2 (+ t_1 -1.0))
        (t_3 (* i (+ i (+ alpha beta))))
        (t_4 (+ beta (+ i alpha))))
   (if (<= (/ (/ (* t_3 (+ t_3 (* alpha beta))) t_1) t_2) INFINITY)
     (/
      (*
       (* i t_4)
       (/ (fma i t_4 (* alpha beta)) (pow (fma i 2.0 (+ alpha beta)) 2.0)))
      t_2)
     (-
      (/ (+ (* i 0.0625) (* (+ alpha beta) 0.125)) i)
      (* 0.125 (/ beta i))))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (i * 2.0);
	double t_1 = t_0 * t_0;
	double t_2 = t_1 + -1.0;
	double t_3 = i * (i + (alpha + beta));
	double t_4 = beta + (i + alpha);
	double tmp;
	if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= ((double) INFINITY)) {
		tmp = ((i * t_4) * (fma(i, t_4, (alpha * beta)) / pow(fma(i, 2.0, (alpha + beta)), 2.0))) / t_2;
	} else {
		tmp = (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - (0.125 * (beta / i));
	}
	return tmp;
}

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) + Float64(i * 2.0))
	t_1 = Float64(t_0 * t_0)
	t_2 = Float64(t_1 + -1.0)
	t_3 = Float64(i * Float64(i + Float64(alpha + beta)))
	t_4 = Float64(beta + Float64(i + alpha))
	tmp = 0.0
	if (Float64(Float64(Float64(t_3 * Float64(t_3 + Float64(alpha * beta))) / t_1) / t_2) <= Inf)
		tmp = Float64(Float64(Float64(i * t_4) * Float64(fma(i, t_4, Float64(alpha * beta)) / (fma(i, 2.0, Float64(alpha + beta)) ^ 2.0))) / t_2);
	else
		tmp = Float64(Float64(Float64(Float64(i * 0.0625) + Float64(Float64(alpha + beta) * 0.125)) / i) - Float64(0.125 * Float64(beta / i)));
	end
	return tmp
end

Wolfram

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 + -1.0), $MachinePrecision]}, Block[{t$95$3 = N[(i * N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(beta + N[(i + alpha), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$3 * N[(t$95$3 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$2), $MachinePrecision], Infinity], N[(N[(N[(i * t$95$4), $MachinePrecision] * N[(N[(i * t$95$4 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision] / N[Power[N[(i * 2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[(N[(N[(i * 0.0625), $MachinePrecision] + N[(N[(alpha + beta), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision] - N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 53.4%

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

      1. associate-/l* 99.7%

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

      2. +-commutative 99.7%

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

      3. associate-+r+ 99.7%

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

      4. +-commutative 99.7%

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

      5. +-commutative 99.7%

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

      6. +-commutative 99.7%

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

      7. associate-+r+ 99.7%

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

      8. +-commutative 99.7%

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

      9. *-commutative 99.7%

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

      10. fma-undefine 99.7%

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

      11. pow2 99.7%

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

      12. +-commutative 99.7%

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

      13. *-commutative 99.7%

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

      14. fma-undefine 99.7%

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

   4. Applied egg-rr 99.7%

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

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

   1. Initial program 0.0%

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

   3. Simplified 5.7%

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

   5. Taylor expanded in i around inf 73.4%

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

      1. expm1-log1p-u 61.6%

         \[\leadsto \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(0.0625 + 0.0625 \cdot \frac{2 \cdot \alpha + 2 \cdot \beta}{i}\right)\right)} - 0.125 \cdot \frac{\alpha + \beta}{i} \]

      2. expm1-undefine 61.6%

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

      3. +-commutative 61.6%

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

      4. fma-define 61.6%

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

      5. distribute-lft-out 61.6%

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

   7. Applied egg-rr 61.6%

      \[\leadsto \color{blue}{\left(e^{\mathsf{log1p}\left(\mathsf{fma}\left(0.0625, \frac{2 \cdot \left(\alpha + \beta\right)}{i}, 0.0625\right)\right)} - 1\right)} - 0.125 \cdot \frac{\alpha + \beta}{i} \]
   8. Step-by-step derivation

      1. expm1-define 61.6%

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

      2. fma-undefine 61.6%

         \[\leadsto \mathsf{expm1}\left(\mathsf{log1p}\left(\color{blue}{0.0625 \cdot \frac{2 \cdot \left(\alpha + \beta\right)}{i} + 0.0625}\right)\right) - 0.125 \cdot \frac{\alpha + \beta}{i} \]

      3. associate-*r/ 61.6%

         \[\leadsto \mathsf{expm1}\left(\mathsf{log1p}\left(\color{blue}{\frac{0.0625 \cdot \left(2 \cdot \left(\alpha + \beta\right)\right)}{i}} + 0.0625\right)\right) - 0.125 \cdot \frac{\alpha + \beta}{i} \]

      4. associate-*r* 61.6%

         \[\leadsto \mathsf{expm1}\left(\mathsf{log1p}\left(\frac{\color{blue}{\left(0.0625 \cdot 2\right) \cdot \left(\alpha + \beta\right)}}{i} + 0.0625\right)\right) - 0.125 \cdot \frac{\alpha + \beta}{i} \]

      5. metadata-eval 61.6%

         \[\leadsto \mathsf{expm1}\left(\mathsf{log1p}\left(\frac{\color{blue}{0.125} \cdot \left(\alpha + \beta\right)}{i} + 0.0625\right)\right) - 0.125 \cdot \frac{\alpha + \beta}{i} \]

      6. associate-*r/ 61.6%

         \[\leadsto \mathsf{expm1}\left(\mathsf{log1p}\left(\color{blue}{0.125 \cdot \frac{\alpha + \beta}{i}} + 0.0625\right)\right) - 0.125 \cdot \frac{\alpha + \beta}{i} \]

   9. Simplified 61.6%

      \[\leadsto \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(0.125 \cdot \frac{\alpha + \beta}{i} + 0.0625\right)\right)} - 0.125 \cdot \frac{\alpha + \beta}{i} \]

   10. Taylor expanded in i around 0 73.4%

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

   11. Taylor expanded in alpha around 0 67.1%

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

4. Final simplification 78.3%

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

Alternative 2: 83.5% accurate, 0.1× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} t_0 := i + \left(\alpha + \beta\right)\\ t_1 := i \cdot t\_0\\ t_2 := \left(\alpha + \beta\right) + i \cdot 2\\ t_3 := t\_2 \cdot t\_2\\ t_4 := \alpha + \mathsf{fma}\left(i, 2, \beta\right)\\ \mathbf{if}\;\frac{\frac{t\_1 \cdot \left(t\_1 + \alpha \cdot \beta\right)}{t\_3}}{t\_3 + -1} \leq \infty:\\ \;\;\;\;i \cdot \left(\frac{i \cdot \left(i + \beta\right)}{{\left(\beta + i \cdot 2\right)}^{2} + -1} \cdot \frac{t\_0}{t\_4 \cdot t\_4}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{i \cdot 0.0625 + \left(\alpha + \beta\right) \cdot 0.125}{i} - 0.125 \cdot \frac{\beta}{i}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ i (+ alpha beta)))
        (t_1 (* i t_0))
        (t_2 (+ (+ alpha beta) (* i 2.0)))
        (t_3 (* t_2 t_2))
        (t_4 (+ alpha (fma i 2.0 beta))))
   (if (<= (/ (/ (* t_1 (+ t_1 (* alpha beta))) t_3) (+ t_3 -1.0)) INFINITY)
     (*
      i
      (*
       (/ (* i (+ i beta)) (+ (pow (+ beta (* i 2.0)) 2.0) -1.0))
       (/ t_0 (* t_4 t_4))))
     (-
      (/ (+ (* i 0.0625) (* (+ alpha beta) 0.125)) i)
      (* 0.125 (/ beta i))))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double t_0 = i + (alpha + beta);
	double t_1 = i * t_0;
	double t_2 = (alpha + beta) + (i * 2.0);
	double t_3 = t_2 * t_2;
	double t_4 = alpha + fma(i, 2.0, beta);
	double tmp;
	if ((((t_1 * (t_1 + (alpha * beta))) / t_3) / (t_3 + -1.0)) <= ((double) INFINITY)) {
		tmp = i * (((i * (i + beta)) / (pow((beta + (i * 2.0)), 2.0) + -1.0)) * (t_0 / (t_4 * t_4)));
	} else {
		tmp = (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - (0.125 * (beta / i));
	}
	return tmp;
}

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	t_0 = Float64(i + Float64(alpha + beta))
	t_1 = Float64(i * t_0)
	t_2 = Float64(Float64(alpha + beta) + Float64(i * 2.0))
	t_3 = Float64(t_2 * t_2)
	t_4 = Float64(alpha + fma(i, 2.0, beta))
	tmp = 0.0
	if (Float64(Float64(Float64(t_1 * Float64(t_1 + Float64(alpha * beta))) / t_3) / Float64(t_3 + -1.0)) <= Inf)
		tmp = Float64(i * Float64(Float64(Float64(i * Float64(i + beta)) / Float64((Float64(beta + Float64(i * 2.0)) ^ 2.0) + -1.0)) * Float64(t_0 / Float64(t_4 * t_4))));
	else
		tmp = Float64(Float64(Float64(Float64(i * 0.0625) + Float64(Float64(alpha + beta) * 0.125)) / i) - Float64(0.125 * Float64(beta / i)));
	end
	return tmp
end

Wolfram

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(i * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(alpha + beta), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$2 * t$95$2), $MachinePrecision]}, Block[{t$95$4 = N[(alpha + N[(i * 2.0 + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$1 * N[(t$95$1 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision] / N[(t$95$3 + -1.0), $MachinePrecision]), $MachinePrecision], Infinity], N[(i * N[(N[(N[(i * N[(i + beta), $MachinePrecision]), $MachinePrecision] / N[(N[Power[N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision] * N[(t$95$0 / N[(t$95$4 * t$95$4), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(i * 0.0625), $MachinePrecision] + N[(N[(alpha + beta), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision] - N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 53.4%

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

   3. Simplified 99.4%

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

   5. Taylor expanded in alpha around 0 90.6%

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

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

   1. Initial program 0.0%

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

   3. Simplified 5.7%

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

   5. Taylor expanded in i around inf 73.4%

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

      1. expm1-log1p-u 61.6%

         \[\leadsto \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(0.0625 + 0.0625 \cdot \frac{2 \cdot \alpha + 2 \cdot \beta}{i}\right)\right)} - 0.125 \cdot \frac{\alpha + \beta}{i} \]

      2. expm1-undefine 61.6%

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

      3. +-commutative 61.6%

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

      4. fma-define 61.6%

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

      5. distribute-lft-out 61.6%

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

   7. Applied egg-rr 61.6%

      \[\leadsto \color{blue}{\left(e^{\mathsf{log1p}\left(\mathsf{fma}\left(0.0625, \frac{2 \cdot \left(\alpha + \beta\right)}{i}, 0.0625\right)\right)} - 1\right)} - 0.125 \cdot \frac{\alpha + \beta}{i} \]
   8. Step-by-step derivation

      1. expm1-define 61.6%

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

      2. fma-undefine 61.6%

         \[\leadsto \mathsf{expm1}\left(\mathsf{log1p}\left(\color{blue}{0.0625 \cdot \frac{2 \cdot \left(\alpha + \beta\right)}{i} + 0.0625}\right)\right) - 0.125 \cdot \frac{\alpha + \beta}{i} \]

      3. associate-*r/ 61.6%

         \[\leadsto \mathsf{expm1}\left(\mathsf{log1p}\left(\color{blue}{\frac{0.0625 \cdot \left(2 \cdot \left(\alpha + \beta\right)\right)}{i}} + 0.0625\right)\right) - 0.125 \cdot \frac{\alpha + \beta}{i} \]

      4. associate-*r* 61.6%

         \[\leadsto \mathsf{expm1}\left(\mathsf{log1p}\left(\frac{\color{blue}{\left(0.0625 \cdot 2\right) \cdot \left(\alpha + \beta\right)}}{i} + 0.0625\right)\right) - 0.125 \cdot \frac{\alpha + \beta}{i} \]

      5. metadata-eval 61.6%

         \[\leadsto \mathsf{expm1}\left(\mathsf{log1p}\left(\frac{\color{blue}{0.125} \cdot \left(\alpha + \beta\right)}{i} + 0.0625\right)\right) - 0.125 \cdot \frac{\alpha + \beta}{i} \]

      6. associate-*r/ 61.6%

         \[\leadsto \mathsf{expm1}\left(\mathsf{log1p}\left(\color{blue}{0.125 \cdot \frac{\alpha + \beta}{i}} + 0.0625\right)\right) - 0.125 \cdot \frac{\alpha + \beta}{i} \]

   9. Simplified 61.6%

      \[\leadsto \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(0.125 \cdot \frac{\alpha + \beta}{i} + 0.0625\right)\right)} - 0.125 \cdot \frac{\alpha + \beta}{i} \]

   10. Taylor expanded in i around 0 73.4%

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

   11. Taylor expanded in alpha around 0 67.1%

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

4. Final simplification 75.2%

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

Alternative 3: 80.7% accurate, 0.5× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} t_0 := \left(\alpha + \beta\right) + i \cdot 2\\ t_1 := t\_0 \cdot t\_0\\ t_2 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\ t_3 := \frac{\frac{t\_2 \cdot \left(t\_2 + \alpha \cdot \beta\right)}{t\_1}}{t\_1 + -1}\\ \mathbf{if}\;t\_3 \leq 0.1:\\ \;\;\;\;t\_3\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(i \cdot 0.0625 + \beta \cdot 0.125\right) - \left(\alpha + \beta\right) \cdot 0.125}{i}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* i 2.0)))
        (t_1 (* t_0 t_0))
        (t_2 (* i (+ i (+ alpha beta))))
        (t_3 (/ (/ (* t_2 (+ t_2 (* alpha beta))) t_1) (+ t_1 -1.0))))
   (if (<= t_3 0.1)
     t_3
     (/ (- (+ (* i 0.0625) (* beta 0.125)) (* (+ alpha beta) 0.125)) i))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (i * 2.0);
	double t_1 = t_0 * t_0;
	double t_2 = i * (i + (alpha + beta));
	double t_3 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0);
	double tmp;
	if (t_3 <= 0.1) {
		tmp = t_3;
	} else {
		tmp = (((i * 0.0625) + (beta * 0.125)) - ((alpha + beta) * 0.125)) / i;
	}
	return tmp;
}

Fortran

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
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
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: tmp
    t_0 = (alpha + beta) + (i * 2.0d0)
    t_1 = t_0 * t_0
    t_2 = i * (i + (alpha + beta))
    t_3 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + (-1.0d0))
    if (t_3 <= 0.1d0) then
        tmp = t_3
    else
        tmp = (((i * 0.0625d0) + (beta * 0.125d0)) - ((alpha + beta) * 0.125d0)) / i
    end if
    code = tmp
end function

Java

assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (i * 2.0);
	double t_1 = t_0 * t_0;
	double t_2 = i * (i + (alpha + beta));
	double t_3 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0);
	double tmp;
	if (t_3 <= 0.1) {
		tmp = t_3;
	} else {
		tmp = (((i * 0.0625) + (beta * 0.125)) - ((alpha + beta) * 0.125)) / i;
	}
	return tmp;
}

Python

[alpha, beta, i] = sort([alpha, beta, i])
def code(alpha, beta, i):
	t_0 = (alpha + beta) + (i * 2.0)
	t_1 = t_0 * t_0
	t_2 = i * (i + (alpha + beta))
	t_3 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0)
	tmp = 0
	if t_3 <= 0.1:
		tmp = t_3
	else:
		tmp = (((i * 0.0625) + (beta * 0.125)) - ((alpha + beta) * 0.125)) / i
	return tmp

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) + Float64(i * 2.0))
	t_1 = Float64(t_0 * t_0)
	t_2 = Float64(i * Float64(i + Float64(alpha + beta)))
	t_3 = Float64(Float64(Float64(t_2 * Float64(t_2 + Float64(alpha * beta))) / t_1) / Float64(t_1 + -1.0))
	tmp = 0.0
	if (t_3 <= 0.1)
		tmp = t_3;
	else
		tmp = Float64(Float64(Float64(Float64(i * 0.0625) + Float64(beta * 0.125)) - Float64(Float64(alpha + beta) * 0.125)) / i);
	end
	return tmp
end

MATLAB

alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
	t_0 = (alpha + beta) + (i * 2.0);
	t_1 = t_0 * t_0;
	t_2 = i * (i + (alpha + beta));
	t_3 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0);
	tmp = 0.0;
	if (t_3 <= 0.1)
		tmp = t_3;
	else
		tmp = (((i * 0.0625) + (beta * 0.125)) - ((alpha + beta) * 0.125)) / i;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(i * N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(N[(t$95$2 * N[(t$95$2 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 + -1.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, 0.1], t$95$3, N[(N[(N[(N[(i * 0.0625), $MachinePrecision] + N[(beta * 0.125), $MachinePrecision]), $MachinePrecision] - N[(N[(alpha + beta), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]]]]]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 99.5%

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

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

   1. Initial program 0.6%

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

   3. Simplified 24.4%

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

   5. Taylor expanded in i around inf 73.7%

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

   6. Taylor expanded in i around 0 73.7%

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

   7. Taylor expanded in alpha around 0 68.0%

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

      1. *-commutative 68.0%

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

   9. Simplified 68.0%

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

4. Final simplification 73.7%

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

Alternative 4: 77.4% accurate, 2.5× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \frac{\left(i \cdot 0.0625 + 0.0625 \cdot \left(\alpha \cdot 2 + \beta \cdot 2\right)\right) - \left(\alpha + \beta\right) \cdot 0.125}{i} \end{array} \]

FPCore

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
 :precision binary64
 (/
  (-
   (+ (* i 0.0625) (* 0.0625 (+ (* alpha 2.0) (* beta 2.0))))
   (* (+ alpha beta) 0.125))
  i))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	return (((i * 0.0625) + (0.0625 * ((alpha * 2.0) + (beta * 2.0)))) - ((alpha + beta) * 0.125)) / i;
}

Fortran

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    code = (((i * 0.0625d0) + (0.0625d0 * ((alpha * 2.0d0) + (beta * 2.0d0)))) - ((alpha + beta) * 0.125d0)) / i
end function

Java

assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
	return (((i * 0.0625) + (0.0625 * ((alpha * 2.0) + (beta * 2.0)))) - ((alpha + beta) * 0.125)) / i;
}

Python

[alpha, beta, i] = sort([alpha, beta, i])
def code(alpha, beta, i):
	return (((i * 0.0625) + (0.0625 * ((alpha * 2.0) + (beta * 2.0)))) - ((alpha + beta) * 0.125)) / i

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	return Float64(Float64(Float64(Float64(i * 0.0625) + Float64(0.0625 * Float64(Float64(alpha * 2.0) + Float64(beta * 2.0)))) - Float64(Float64(alpha + beta) * 0.125)) / i)
end

MATLAB

alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
	tmp = (((i * 0.0625) + (0.0625 * ((alpha * 2.0) + (beta * 2.0)))) - ((alpha + beta) * 0.125)) / i;
end

Wolfram

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := N[(N[(N[(N[(i * 0.0625), $MachinePrecision] + N[(0.0625 * N[(N[(alpha * 2.0), $MachinePrecision] + N[(beta * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(alpha + beta), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]

Derivation

1. Initial program 18.4%

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

3. Simplified 37.9%

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

5. Taylor expanded in i around inf 74.6%

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

6. Taylor expanded in i around 0 74.6%

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

7. Final simplification 74.6%

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

Alternative 5: 77.4% accurate, 2.8× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \frac{i \cdot 0.0625 + \left(\alpha + \beta\right) \cdot 0.125}{i} - 0.125 \cdot \frac{\alpha + \beta}{i} \end{array} \]

FPCore

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
 :precision binary64
 (-
  (/ (+ (* i 0.0625) (* (+ alpha beta) 0.125)) i)
  (* 0.125 (/ (+ alpha beta) i))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	return (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - (0.125 * ((alpha + beta) / i));
}

Fortran

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    code = (((i * 0.0625d0) + ((alpha + beta) * 0.125d0)) / i) - (0.125d0 * ((alpha + beta) / i))
end function

Java

assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
	return (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - (0.125 * ((alpha + beta) / i));
}

Python

[alpha, beta, i] = sort([alpha, beta, i])
def code(alpha, beta, i):
	return (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - (0.125 * ((alpha + beta) / i))

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	return Float64(Float64(Float64(Float64(i * 0.0625) + Float64(Float64(alpha + beta) * 0.125)) / i) - Float64(0.125 * Float64(Float64(alpha + beta) / i)))
end

MATLAB

alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
	tmp = (((i * 0.0625) + ((alpha + beta) * 0.125)) / i) - (0.125 * ((alpha + beta) / i));
end

Wolfram

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := N[(N[(N[(N[(i * 0.0625), $MachinePrecision] + N[(N[(alpha + beta), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision] - N[(0.125 * N[(N[(alpha + beta), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 18.4%

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

3. Simplified 37.9%

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

5. Taylor expanded in i around inf 74.6%

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

   1. expm1-log1p-u 66.8%

      \[\leadsto \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(0.0625 + 0.0625 \cdot \frac{2 \cdot \alpha + 2 \cdot \beta}{i}\right)\right)} - 0.125 \cdot \frac{\alpha + \beta}{i} \]

   2. expm1-undefine 66.8%

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

   3. +-commutative 66.8%

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

   4. fma-define 66.8%

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

   5. distribute-lft-out 66.8%

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

7. Applied egg-rr 66.8%

   \[\leadsto \color{blue}{\left(e^{\mathsf{log1p}\left(\mathsf{fma}\left(0.0625, \frac{2 \cdot \left(\alpha + \beta\right)}{i}, 0.0625\right)\right)} - 1\right)} - 0.125 \cdot \frac{\alpha + \beta}{i} \]
8. Step-by-step derivation

   1. expm1-define 66.8%

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

   2. fma-undefine 66.8%

      \[\leadsto \mathsf{expm1}\left(\mathsf{log1p}\left(\color{blue}{0.0625 \cdot \frac{2 \cdot \left(\alpha + \beta\right)}{i} + 0.0625}\right)\right) - 0.125 \cdot \frac{\alpha + \beta}{i} \]

   3. associate-*r/ 66.8%

      \[\leadsto \mathsf{expm1}\left(\mathsf{log1p}\left(\color{blue}{\frac{0.0625 \cdot \left(2 \cdot \left(\alpha + \beta\right)\right)}{i}} + 0.0625\right)\right) - 0.125 \cdot \frac{\alpha + \beta}{i} \]

   4. associate-*r* 66.8%

      \[\leadsto \mathsf{expm1}\left(\mathsf{log1p}\left(\frac{\color{blue}{\left(0.0625 \cdot 2\right) \cdot \left(\alpha + \beta\right)}}{i} + 0.0625\right)\right) - 0.125 \cdot \frac{\alpha + \beta}{i} \]

   5. metadata-eval 66.8%

      \[\leadsto \mathsf{expm1}\left(\mathsf{log1p}\left(\frac{\color{blue}{0.125} \cdot \left(\alpha + \beta\right)}{i} + 0.0625\right)\right) - 0.125 \cdot \frac{\alpha + \beta}{i} \]

   6. associate-*r/ 66.8%

      \[\leadsto \mathsf{expm1}\left(\mathsf{log1p}\left(\color{blue}{0.125 \cdot \frac{\alpha + \beta}{i}} + 0.0625\right)\right) - 0.125 \cdot \frac{\alpha + \beta}{i} \]

9. Simplified 66.8%

   \[\leadsto \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(0.125 \cdot \frac{\alpha + \beta}{i} + 0.0625\right)\right)} - 0.125 \cdot \frac{\alpha + \beta}{i} \]

10. Taylor expanded in i around 0 74.6%

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

11. Final simplification 74.6%

    \[\leadsto \frac{i \cdot 0.0625 + \left(\alpha + \beta\right) \cdot 0.125}{i} - 0.125 \cdot \frac{\alpha + \beta}{i} \]
12. Add Preprocessing

Alternative 6: 77.4% accurate, 3.5× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \frac{\left(i \cdot 0.0625 + \beta \cdot 0.125\right) - \left(\alpha + \beta\right) \cdot 0.125}{i} \end{array} \]

FPCore

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
 :precision binary64
 (/ (- (+ (* i 0.0625) (* beta 0.125)) (* (+ alpha beta) 0.125)) i))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	return (((i * 0.0625) + (beta * 0.125)) - ((alpha + beta) * 0.125)) / i;
}

Fortran

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    code = (((i * 0.0625d0) + (beta * 0.125d0)) - ((alpha + beta) * 0.125d0)) / i
end function

Java

assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
	return (((i * 0.0625) + (beta * 0.125)) - ((alpha + beta) * 0.125)) / i;
}

Python

[alpha, beta, i] = sort([alpha, beta, i])
def code(alpha, beta, i):
	return (((i * 0.0625) + (beta * 0.125)) - ((alpha + beta) * 0.125)) / i

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	return Float64(Float64(Float64(Float64(i * 0.0625) + Float64(beta * 0.125)) - Float64(Float64(alpha + beta) * 0.125)) / i)
end

MATLAB

alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
	tmp = (((i * 0.0625) + (beta * 0.125)) - ((alpha + beta) * 0.125)) / i;
end

Wolfram

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := N[(N[(N[(N[(i * 0.0625), $MachinePrecision] + N[(beta * 0.125), $MachinePrecision]), $MachinePrecision] - N[(N[(alpha + beta), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]

Derivation

1. Initial program 18.4%

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

3. Simplified 37.9%

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

5. Taylor expanded in i around inf 74.6%

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

6. Taylor expanded in i around 0 74.6%

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

7. Taylor expanded in alpha around 0 69.9%

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

   1. *-commutative 69.9%

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

9. Simplified 69.9%

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

10. Final simplification 69.9%

    \[\leadsto \frac{\left(i \cdot 0.0625 + \beta \cdot 0.125\right) - \left(\alpha + \beta\right) \cdot 0.125}{i} \]
11. Add Preprocessing

Alternative 7: 74.5% accurate, 8.8× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 3.9 \cdot 10^{+243}:\\ \;\;\;\;0.0625\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \end{array} \]

FPCore

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i) :precision binary64 (if (<= beta 3.9e+243) 0.0625 0.0))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 3.9e+243) {
		tmp = 0.0625;
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Fortran

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: tmp
    if (beta <= 3.9d+243) then
        tmp = 0.0625d0
    else
        tmp = 0.0d0
    end if
    code = tmp
end function

Java

assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 3.9e+243) {
		tmp = 0.0625;
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

[alpha, beta, i] = sort([alpha, beta, i])
def code(alpha, beta, i):
	tmp = 0
	if beta <= 3.9e+243:
		tmp = 0.0625
	else:
		tmp = 0.0
	return tmp

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	tmp = 0.0
	if (beta <= 3.9e+243)
		tmp = 0.0625;
	else
		tmp = 0.0;
	end
	return tmp
end

MATLAB

alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
	tmp = 0.0;
	if (beta <= 3.9e+243)
		tmp = 0.0625;
	else
		tmp = 0.0;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := If[LessEqual[beta, 3.9e+243], 0.0625, 0.0]

Derivation

1. Split input into 2 regimes

2. if beta < 3.8999999999999998e243

   1. Initial program 19.9%

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

   3. Simplified 40.7%

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

   5. Taylor expanded in i around inf 72.3%

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

   if 3.8999999999999998e243 < beta

   1. Initial program 0.0%

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

   3. Simplified 5.0%

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

   5. Taylor expanded in i around inf 38.3%

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

   6. Taylor expanded in i around 0 38.3%

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

   7. Taylor expanded in i around 0 38.0%

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

      1. div-sub 38.0%

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

      2. distribute-lft-in 38.0%

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

      3. associate-*r* 38.0%

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

      4. metadata-eval 38.0%

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

      5. associate-*r/ 38.0%

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

      6. associate-*r/ 38.0%

         \[\leadsto 0.125 \cdot \frac{\alpha + \beta}{i} - \color{blue}{0.125 \cdot \frac{\alpha + \beta}{i}} \]

      7. +-inverses 38.0%

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

   9. Simplified 38.0%

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

Alternative 8: 9.5% accurate, 53.0× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ 0 \end{array} \]

FPCore

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i) :precision binary64 0.0)

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	return 0.0;
}

Fortran

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    code = 0.0d0
end function

Java

assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
	return 0.0;
}

Python

[alpha, beta, i] = sort([alpha, beta, i])
def code(alpha, beta, i):
	return 0.0

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	return 0.0
end

MATLAB

alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
	tmp = 0.0;
end

Wolfram

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := 0.0

Derivation

1. Initial program 18.4%

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

3. Simplified 37.9%

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

5. Taylor expanded in i around inf 74.6%

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

6. Taylor expanded in i around 0 74.6%

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

7. Taylor expanded in i around 0 11.2%

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

   1. div-sub 11.2%

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

   2. distribute-lft-in 11.2%

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

   3. associate-*r* 11.2%

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

   4. metadata-eval 11.2%

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

   5. associate-*r/ 11.2%

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

   6. associate-*r/ 11.2%

      \[\leadsto 0.125 \cdot \frac{\alpha + \beta}{i} - \color{blue}{0.125 \cdot \frac{\alpha + \beta}{i}} \]

   7. +-inverses 11.2%

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

9. Simplified 11.2%

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

Reproduce

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