
(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))))
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);
}
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
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);
}
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)
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
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
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]]]]
\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}
Sampling outcomes in binary64 precision:
Herbie found 9 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(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))))
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);
}
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
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);
}
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)
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
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
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]]]]
\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}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (* 0.125 (/ beta i))) (t_1 (+ alpha (* i 2.0))) (t_2 (* 2.0 t_1)))
(if (<= beta 2.4e+136)
0.0625
(if (<= beta 9.5e+165)
(*
i
(*
(/
(+
alpha
(+ i (/ (+ (* i (+ i alpha)) (* -2.0 (* (+ i alpha) t_1))) beta)))
beta)
(/
(+
1.0
(/
(-
(+
alpha
(+
i
(-
(* -2.0 (/ (* t_1 (- (+ i alpha) t_2)) beta))
(/ (pow t_1 2.0) beta))))
t_2)
beta))
beta)))
(if (<= beta 6.2e+244)
(- (+ t_0 0.0625) t_0)
(* (/ i beta) (/ (+ i alpha) beta)))))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = 0.125 * (beta / i);
double t_1 = alpha + (i * 2.0);
double t_2 = 2.0 * t_1;
double tmp;
if (beta <= 2.4e+136) {
tmp = 0.0625;
} else if (beta <= 9.5e+165) {
tmp = i * (((alpha + (i + (((i * (i + alpha)) + (-2.0 * ((i + alpha) * t_1))) / beta))) / beta) * ((1.0 + (((alpha + (i + ((-2.0 * ((t_1 * ((i + alpha) - t_2)) / beta)) - (pow(t_1, 2.0) / beta)))) - t_2) / beta)) / beta));
} else if (beta <= 6.2e+244) {
tmp = (t_0 + 0.0625) - t_0;
} else {
tmp = (i / beta) * ((i + alpha) / beta);
}
return tmp;
}
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) :: tmp
t_0 = 0.125d0 * (beta / i)
t_1 = alpha + (i * 2.0d0)
t_2 = 2.0d0 * t_1
if (beta <= 2.4d+136) then
tmp = 0.0625d0
else if (beta <= 9.5d+165) then
tmp = i * (((alpha + (i + (((i * (i + alpha)) + ((-2.0d0) * ((i + alpha) * t_1))) / beta))) / beta) * ((1.0d0 + (((alpha + (i + (((-2.0d0) * ((t_1 * ((i + alpha) - t_2)) / beta)) - ((t_1 ** 2.0d0) / beta)))) - t_2) / beta)) / beta))
else if (beta <= 6.2d+244) then
tmp = (t_0 + 0.0625d0) - t_0
else
tmp = (i / beta) * ((i + alpha) / beta)
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double t_0 = 0.125 * (beta / i);
double t_1 = alpha + (i * 2.0);
double t_2 = 2.0 * t_1;
double tmp;
if (beta <= 2.4e+136) {
tmp = 0.0625;
} else if (beta <= 9.5e+165) {
tmp = i * (((alpha + (i + (((i * (i + alpha)) + (-2.0 * ((i + alpha) * t_1))) / beta))) / beta) * ((1.0 + (((alpha + (i + ((-2.0 * ((t_1 * ((i + alpha) - t_2)) / beta)) - (Math.pow(t_1, 2.0) / beta)))) - t_2) / beta)) / beta));
} else if (beta <= 6.2e+244) {
tmp = (t_0 + 0.0625) - t_0;
} else {
tmp = (i / beta) * ((i + alpha) / beta);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): t_0 = 0.125 * (beta / i) t_1 = alpha + (i * 2.0) t_2 = 2.0 * t_1 tmp = 0 if beta <= 2.4e+136: tmp = 0.0625 elif beta <= 9.5e+165: tmp = i * (((alpha + (i + (((i * (i + alpha)) + (-2.0 * ((i + alpha) * t_1))) / beta))) / beta) * ((1.0 + (((alpha + (i + ((-2.0 * ((t_1 * ((i + alpha) - t_2)) / beta)) - (math.pow(t_1, 2.0) / beta)))) - t_2) / beta)) / beta)) elif beta <= 6.2e+244: tmp = (t_0 + 0.0625) - t_0 else: tmp = (i / beta) * ((i + alpha) / beta) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(0.125 * Float64(beta / i)) t_1 = Float64(alpha + Float64(i * 2.0)) t_2 = Float64(2.0 * t_1) tmp = 0.0 if (beta <= 2.4e+136) tmp = 0.0625; elseif (beta <= 9.5e+165) tmp = Float64(i * Float64(Float64(Float64(alpha + Float64(i + Float64(Float64(Float64(i * Float64(i + alpha)) + Float64(-2.0 * Float64(Float64(i + alpha) * t_1))) / beta))) / beta) * Float64(Float64(1.0 + Float64(Float64(Float64(alpha + Float64(i + Float64(Float64(-2.0 * Float64(Float64(t_1 * Float64(Float64(i + alpha) - t_2)) / beta)) - Float64((t_1 ^ 2.0) / beta)))) - t_2) / beta)) / beta))); elseif (beta <= 6.2e+244) tmp = Float64(Float64(t_0 + 0.0625) - t_0); else tmp = Float64(Float64(i / beta) * Float64(Float64(i + alpha) / beta)); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = 0.125 * (beta / i);
t_1 = alpha + (i * 2.0);
t_2 = 2.0 * t_1;
tmp = 0.0;
if (beta <= 2.4e+136)
tmp = 0.0625;
elseif (beta <= 9.5e+165)
tmp = i * (((alpha + (i + (((i * (i + alpha)) + (-2.0 * ((i + alpha) * t_1))) / beta))) / beta) * ((1.0 + (((alpha + (i + ((-2.0 * ((t_1 * ((i + alpha) - t_2)) / beta)) - ((t_1 ^ 2.0) / beta)))) - t_2) / beta)) / beta));
elseif (beta <= 6.2e+244)
tmp = (t_0 + 0.0625) - t_0;
else
tmp = (i / beta) * ((i + alpha) / beta);
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(alpha + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(2.0 * t$95$1), $MachinePrecision]}, If[LessEqual[beta, 2.4e+136], 0.0625, If[LessEqual[beta, 9.5e+165], N[(i * N[(N[(N[(alpha + N[(i + N[(N[(N[(i * N[(i + alpha), $MachinePrecision]), $MachinePrecision] + N[(-2.0 * N[(N[(i + alpha), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision] * N[(N[(1.0 + N[(N[(N[(alpha + N[(i + N[(N[(-2.0 * N[(N[(t$95$1 * N[(N[(i + alpha), $MachinePrecision] - t$95$2), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] - N[(N[Power[t$95$1, 2.0], $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$2), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 6.2e+244], N[(N[(t$95$0 + 0.0625), $MachinePrecision] - t$95$0), $MachinePrecision], N[(N[(i / beta), $MachinePrecision] * N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := 0.125 \cdot \frac{\beta}{i}\\
t_1 := \alpha + i \cdot 2\\
t_2 := 2 \cdot t\_1\\
\mathbf{if}\;\beta \leq 2.4 \cdot 10^{+136}:\\
\;\;\;\;0.0625\\
\mathbf{elif}\;\beta \leq 9.5 \cdot 10^{+165}:\\
\;\;\;\;i \cdot \left(\frac{\alpha + \left(i + \frac{i \cdot \left(i + \alpha\right) + -2 \cdot \left(\left(i + \alpha\right) \cdot t\_1\right)}{\beta}\right)}{\beta} \cdot \frac{1 + \frac{\left(\alpha + \left(i + \left(-2 \cdot \frac{t\_1 \cdot \left(\left(i + \alpha\right) - t\_2\right)}{\beta} - \frac{{t\_1}^{2}}{\beta}\right)\right)\right) - t\_2}{\beta}}{\beta}\right)\\
\mathbf{elif}\;\beta \leq 6.2 \cdot 10^{+244}:\\
\;\;\;\;\left(t\_0 + 0.0625\right) - t\_0\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i + \alpha}{\beta}\\
\end{array}
\end{array}
if beta < 2.4e136Initial program 20.7%
associate-/l/17.4%
associate-*l*17.3%
associate-/l*17.5%
Simplified37.9%
Taylor expanded in i around inf 83.0%
if 2.4e136 < beta < 9.50000000000000017e165Initial program 9.9%
associate-/l/0.7%
associate-*l*0.7%
associate-/l*0.7%
Simplified45.1%
Taylor expanded in beta around -inf 41.4%
Taylor expanded in beta around -inf 41.1%
if 9.50000000000000017e165 < beta < 6.20000000000000001e244Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
associate-/l*0.0%
Simplified15.2%
Taylor expanded in i around inf 61.9%
sub-neg61.9%
+-commutative61.9%
fma-define61.9%
distribute-lft-out61.9%
associate-*r/61.9%
Applied egg-rr61.9%
unsub-neg61.9%
fma-undefine61.9%
associate-/l*61.9%
associate-*r*62.1%
metadata-eval62.1%
associate-/l*62.1%
associate-/l*62.1%
Simplified62.1%
Taylor expanded in alpha around 0 57.4%
Taylor expanded in alpha around 0 62.1%
if 6.20000000000000001e244 < beta Initial program 0.0%
associate-/l/0.0%
times-frac14.3%
Simplified14.3%
Taylor expanded in beta around inf 16.0%
Taylor expanded in beta around inf 95.1%
+-commutative95.1%
Simplified95.1%
Final simplification80.4%
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 (* 0.125 (/ beta i)))
(t_3 (* i (+ i (+ alpha beta))))
(t_4 (+ beta (+ i alpha)))
(t_5 (fma i 2.0 (+ alpha beta))))
(if (<= (/ (/ (* t_3 (+ t_3 (* alpha beta))) t_1) (+ t_1 -1.0)) INFINITY)
(*
(/ (* i t_4) (fma t_5 t_5 -1.0))
(/ (/ (fma i t_4 (* alpha beta)) t_5) t_5))
(- (+ t_2 0.0625) t_2))))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 = 0.125 * (beta / i);
double t_3 = i * (i + (alpha + beta));
double t_4 = beta + (i + alpha);
double t_5 = fma(i, 2.0, (alpha + beta));
double tmp;
if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= ((double) INFINITY)) {
tmp = ((i * t_4) / fma(t_5, t_5, -1.0)) * ((fma(i, t_4, (alpha * beta)) / t_5) / t_5);
} else {
tmp = (t_2 + 0.0625) - t_2;
}
return tmp;
}
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(0.125 * Float64(beta / i)) t_3 = Float64(i * Float64(i + Float64(alpha + beta))) t_4 = Float64(beta + Float64(i + alpha)) t_5 = fma(i, 2.0, Float64(alpha + beta)) tmp = 0.0 if (Float64(Float64(Float64(t_3 * Float64(t_3 + Float64(alpha * beta))) / t_1) / Float64(t_1 + -1.0)) <= Inf) tmp = Float64(Float64(Float64(i * t_4) / fma(t_5, t_5, -1.0)) * Float64(Float64(fma(i, t_4, Float64(alpha * beta)) / t_5) / t_5)); else tmp = Float64(Float64(t_2 + 0.0625) - t_2); end return tmp end
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[(0.125 * N[(beta / i), $MachinePrecision]), $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]}, Block[{t$95$5 = N[(i * 2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$3 * N[(t$95$3 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 + -1.0), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(N[(i * t$95$4), $MachinePrecision] / N[(t$95$5 * t$95$5 + -1.0), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(i * t$95$4 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision] / t$95$5), $MachinePrecision] / t$95$5), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$2 + 0.0625), $MachinePrecision] - t$95$2), $MachinePrecision]]]]]]]]
\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 := 0.125 \cdot \frac{\beta}{i}\\
t_3 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\
t_4 := \beta + \left(i + \alpha\right)\\
t_5 := \mathsf{fma}\left(i, 2, \alpha + \beta\right)\\
\mathbf{if}\;\frac{\frac{t\_3 \cdot \left(t\_3 + \alpha \cdot \beta\right)}{t\_1}}{t\_1 + -1} \leq \infty:\\
\;\;\;\;\frac{i \cdot t\_4}{\mathsf{fma}\left(t\_5, t\_5, -1\right)} \cdot \frac{\frac{\mathsf{fma}\left(i, t\_4, \alpha \cdot \beta\right)}{t\_5}}{t\_5}\\
\mathbf{else}:\\
\;\;\;\;\left(t\_2 + 0.0625\right) - t\_2\\
\end{array}
\end{array}
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 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) 1)) < +inf.0Initial program 52.4%
associate-/l/42.9%
times-frac99.5%
Simplified99.5%
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 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) 1)) Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
associate-/l*0.0%
Simplified3.7%
Taylor expanded in i around inf 80.9%
sub-neg80.9%
+-commutative80.9%
fma-define80.9%
distribute-lft-out80.9%
associate-*r/80.9%
Applied egg-rr80.9%
unsub-neg80.9%
fma-undefine80.9%
associate-/l*80.9%
associate-*r*80.9%
metadata-eval80.9%
associate-/l*80.9%
associate-/l*80.9%
Simplified80.9%
Taylor expanded in alpha around 0 78.3%
Taylor expanded in alpha around 0 79.2%
Final simplification85.7%
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 (* 0.125 (/ beta i)))
(t_3 (+ i (+ alpha beta)))
(t_4 (* i t_3))
(t_5 (+ alpha (fma i 2.0 beta))))
(if (<= (/ (/ (* t_4 (+ t_4 (* alpha beta))) t_1) (+ t_1 -1.0)) INFINITY)
(*
i
(*
(/ (fma i t_3 (* alpha beta)) (fma t_5 t_5 -1.0))
(/ t_3 (* t_5 t_5))))
(- (+ t_2 0.0625) t_2))))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 = 0.125 * (beta / i);
double t_3 = i + (alpha + beta);
double t_4 = i * t_3;
double t_5 = alpha + fma(i, 2.0, beta);
double tmp;
if ((((t_4 * (t_4 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= ((double) INFINITY)) {
tmp = i * ((fma(i, t_3, (alpha * beta)) / fma(t_5, t_5, -1.0)) * (t_3 / (t_5 * t_5)));
} else {
tmp = (t_2 + 0.0625) - t_2;
}
return tmp;
}
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(0.125 * Float64(beta / i)) t_3 = Float64(i + Float64(alpha + beta)) t_4 = Float64(i * t_3) t_5 = Float64(alpha + fma(i, 2.0, beta)) tmp = 0.0 if (Float64(Float64(Float64(t_4 * Float64(t_4 + Float64(alpha * beta))) / t_1) / Float64(t_1 + -1.0)) <= Inf) tmp = Float64(i * Float64(Float64(fma(i, t_3, Float64(alpha * beta)) / fma(t_5, t_5, -1.0)) * Float64(t_3 / Float64(t_5 * t_5)))); else tmp = Float64(Float64(t_2 + 0.0625) - t_2); end return tmp end
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[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(i * t$95$3), $MachinePrecision]}, Block[{t$95$5 = N[(alpha + N[(i * 2.0 + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$4 * N[(t$95$4 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 + -1.0), $MachinePrecision]), $MachinePrecision], Infinity], N[(i * N[(N[(N[(i * t$95$3 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision] / N[(t$95$5 * t$95$5 + -1.0), $MachinePrecision]), $MachinePrecision] * N[(t$95$3 / N[(t$95$5 * t$95$5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$2 + 0.0625), $MachinePrecision] - t$95$2), $MachinePrecision]]]]]]]]
\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 := 0.125 \cdot \frac{\beta}{i}\\
t_3 := i + \left(\alpha + \beta\right)\\
t_4 := i \cdot t\_3\\
t_5 := \alpha + \mathsf{fma}\left(i, 2, \beta\right)\\
\mathbf{if}\;\frac{\frac{t\_4 \cdot \left(t\_4 + \alpha \cdot \beta\right)}{t\_1}}{t\_1 + -1} \leq \infty:\\
\;\;\;\;i \cdot \left(\frac{\mathsf{fma}\left(i, t\_3, \alpha \cdot \beta\right)}{\mathsf{fma}\left(t\_5, t\_5, -1\right)} \cdot \frac{t\_3}{t\_5 \cdot t\_5}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(t\_2 + 0.0625\right) - t\_2\\
\end{array}
\end{array}
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 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) 1)) < +inf.0Initial program 52.4%
associate-/l/42.9%
associate-*l*42.8%
associate-/l*43.3%
Simplified99.2%
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 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) 1)) Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
associate-/l*0.0%
Simplified3.7%
Taylor expanded in i around inf 80.9%
sub-neg80.9%
+-commutative80.9%
fma-define80.9%
distribute-lft-out80.9%
associate-*r/80.9%
Applied egg-rr80.9%
unsub-neg80.9%
fma-undefine80.9%
associate-/l*80.9%
associate-*r*80.9%
metadata-eval80.9%
associate-/l*80.9%
associate-/l*80.9%
Simplified80.9%
Taylor expanded in alpha around 0 78.3%
Taylor expanded in alpha around 0 79.2%
Final simplification85.6%
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 (+ i (+ alpha beta))))
(t_1 (+ (+ alpha beta) (* i 2.0)))
(t_2 (* t_1 t_1))
(t_3 (+ t_2 -1.0))
(t_4 (* 0.125 (/ beta i))))
(if (<= (/ (/ (* t_0 (+ t_0 (* alpha beta))) t_2) t_3) INFINITY)
(/
(* (pow i 2.0) (/ (pow (+ i beta) 2.0) (pow (+ beta (* i 2.0)) 2.0)))
t_3)
(- (+ t_4 0.0625) t_4))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = i * (i + (alpha + beta));
double t_1 = (alpha + beta) + (i * 2.0);
double t_2 = t_1 * t_1;
double t_3 = t_2 + -1.0;
double t_4 = 0.125 * (beta / i);
double tmp;
if ((((t_0 * (t_0 + (alpha * beta))) / t_2) / t_3) <= ((double) INFINITY)) {
tmp = (pow(i, 2.0) * (pow((i + beta), 2.0) / pow((beta + (i * 2.0)), 2.0))) / t_3;
} else {
tmp = (t_4 + 0.0625) - t_4;
}
return tmp;
}
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double t_0 = i * (i + (alpha + beta));
double t_1 = (alpha + beta) + (i * 2.0);
double t_2 = t_1 * t_1;
double t_3 = t_2 + -1.0;
double t_4 = 0.125 * (beta / i);
double tmp;
if ((((t_0 * (t_0 + (alpha * beta))) / t_2) / t_3) <= Double.POSITIVE_INFINITY) {
tmp = (Math.pow(i, 2.0) * (Math.pow((i + beta), 2.0) / Math.pow((beta + (i * 2.0)), 2.0))) / t_3;
} else {
tmp = (t_4 + 0.0625) - t_4;
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): t_0 = i * (i + (alpha + beta)) t_1 = (alpha + beta) + (i * 2.0) t_2 = t_1 * t_1 t_3 = t_2 + -1.0 t_4 = 0.125 * (beta / i) tmp = 0 if (((t_0 * (t_0 + (alpha * beta))) / t_2) / t_3) <= math.inf: tmp = (math.pow(i, 2.0) * (math.pow((i + beta), 2.0) / math.pow((beta + (i * 2.0)), 2.0))) / t_3 else: tmp = (t_4 + 0.0625) - t_4 return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(i * Float64(i + Float64(alpha + beta))) t_1 = Float64(Float64(alpha + beta) + Float64(i * 2.0)) t_2 = Float64(t_1 * t_1) t_3 = Float64(t_2 + -1.0) t_4 = Float64(0.125 * Float64(beta / i)) tmp = 0.0 if (Float64(Float64(Float64(t_0 * Float64(t_0 + Float64(alpha * beta))) / t_2) / t_3) <= Inf) tmp = Float64(Float64((i ^ 2.0) * Float64((Float64(i + beta) ^ 2.0) / (Float64(beta + Float64(i * 2.0)) ^ 2.0))) / t_3); else tmp = Float64(Float64(t_4 + 0.0625) - t_4); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = i * (i + (alpha + beta));
t_1 = (alpha + beta) + (i * 2.0);
t_2 = t_1 * t_1;
t_3 = t_2 + -1.0;
t_4 = 0.125 * (beta / i);
tmp = 0.0;
if ((((t_0 * (t_0 + (alpha * beta))) / t_2) / t_3) <= Inf)
tmp = ((i ^ 2.0) * (((i + beta) ^ 2.0) / ((beta + (i * 2.0)) ^ 2.0))) / t_3;
else
tmp = (t_4 + 0.0625) - t_4;
end
tmp_2 = tmp;
end
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[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(alpha + beta), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$2 + -1.0), $MachinePrecision]}, Block[{t$95$4 = N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$0 * N[(t$95$0 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision] / t$95$3), $MachinePrecision], Infinity], N[(N[(N[Power[i, 2.0], $MachinePrecision] * N[(N[Power[N[(i + beta), $MachinePrecision], 2.0], $MachinePrecision] / N[Power[N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision], N[(N[(t$95$4 + 0.0625), $MachinePrecision] - t$95$4), $MachinePrecision]]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\
t_1 := \left(\alpha + \beta\right) + i \cdot 2\\
t_2 := t\_1 \cdot t\_1\\
t_3 := t\_2 + -1\\
t_4 := 0.125 \cdot \frac{\beta}{i}\\
\mathbf{if}\;\frac{\frac{t\_0 \cdot \left(t\_0 + \alpha \cdot \beta\right)}{t\_2}}{t\_3} \leq \infty:\\
\;\;\;\;\frac{{i}^{2} \cdot \frac{{\left(i + \beta\right)}^{2}}{{\left(\beta + i \cdot 2\right)}^{2}}}{t\_3}\\
\mathbf{else}:\\
\;\;\;\;\left(t\_4 + 0.0625\right) - t\_4\\
\end{array}
\end{array}
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 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) 1)) < +inf.0Initial program 52.4%
Taylor expanded in alpha around 0 48.0%
associate-/l*90.7%
Simplified90.7%
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 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) 1)) Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
associate-/l*0.0%
Simplified3.7%
Taylor expanded in i around inf 80.9%
sub-neg80.9%
+-commutative80.9%
fma-define80.9%
distribute-lft-out80.9%
associate-*r/80.9%
Applied egg-rr80.9%
unsub-neg80.9%
fma-undefine80.9%
associate-/l*80.9%
associate-*r*80.9%
metadata-eval80.9%
associate-/l*80.9%
associate-/l*80.9%
Simplified80.9%
Taylor expanded in alpha around 0 78.3%
Taylor expanded in alpha around 0 79.2%
Final simplification82.9%
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 (* 0.125 (/ beta i)))
(t_3 (* i (+ i (+ alpha beta))))
(t_4 (pow (+ beta (* i 2.0)) 2.0)))
(if (<= (/ (/ (* t_3 (+ t_3 (* alpha beta))) t_1) (+ t_1 -1.0)) INFINITY)
(* i (* (/ (* i (+ i beta)) (+ -1.0 t_4)) (/ (+ i beta) t_4)))
(- (+ t_2 0.0625) t_2))))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 = 0.125 * (beta / i);
double t_3 = i * (i + (alpha + beta));
double t_4 = pow((beta + (i * 2.0)), 2.0);
double tmp;
if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= ((double) INFINITY)) {
tmp = i * (((i * (i + beta)) / (-1.0 + t_4)) * ((i + beta) / t_4));
} else {
tmp = (t_2 + 0.0625) - t_2;
}
return tmp;
}
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 = 0.125 * (beta / i);
double t_3 = i * (i + (alpha + beta));
double t_4 = Math.pow((beta + (i * 2.0)), 2.0);
double tmp;
if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= Double.POSITIVE_INFINITY) {
tmp = i * (((i * (i + beta)) / (-1.0 + t_4)) * ((i + beta) / t_4));
} else {
tmp = (t_2 + 0.0625) - t_2;
}
return tmp;
}
[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 = 0.125 * (beta / i) t_3 = i * (i + (alpha + beta)) t_4 = math.pow((beta + (i * 2.0)), 2.0) tmp = 0 if (((t_3 * (t_3 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= math.inf: tmp = i * (((i * (i + beta)) / (-1.0 + t_4)) * ((i + beta) / t_4)) else: tmp = (t_2 + 0.0625) - t_2 return tmp
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(0.125 * Float64(beta / i)) t_3 = Float64(i * Float64(i + Float64(alpha + beta))) t_4 = Float64(beta + Float64(i * 2.0)) ^ 2.0 tmp = 0.0 if (Float64(Float64(Float64(t_3 * Float64(t_3 + Float64(alpha * beta))) / t_1) / Float64(t_1 + -1.0)) <= Inf) tmp = Float64(i * Float64(Float64(Float64(i * Float64(i + beta)) / Float64(-1.0 + t_4)) * Float64(Float64(i + beta) / t_4))); else tmp = Float64(Float64(t_2 + 0.0625) - t_2); end return tmp end
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 = 0.125 * (beta / i);
t_3 = i * (i + (alpha + beta));
t_4 = (beta + (i * 2.0)) ^ 2.0;
tmp = 0.0;
if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= Inf)
tmp = i * (((i * (i + beta)) / (-1.0 + t_4)) * ((i + beta) / t_4));
else
tmp = (t_2 + 0.0625) - t_2;
end
tmp_2 = tmp;
end
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[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(i * N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[Power[N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$3 * N[(t$95$3 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 + -1.0), $MachinePrecision]), $MachinePrecision], Infinity], N[(i * N[(N[(N[(i * N[(i + beta), $MachinePrecision]), $MachinePrecision] / N[(-1.0 + t$95$4), $MachinePrecision]), $MachinePrecision] * N[(N[(i + beta), $MachinePrecision] / t$95$4), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$2 + 0.0625), $MachinePrecision] - t$95$2), $MachinePrecision]]]]]]]
\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 := 0.125 \cdot \frac{\beta}{i}\\
t_3 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\
t_4 := {\left(\beta + i \cdot 2\right)}^{2}\\
\mathbf{if}\;\frac{\frac{t\_3 \cdot \left(t\_3 + \alpha \cdot \beta\right)}{t\_1}}{t\_1 + -1} \leq \infty:\\
\;\;\;\;i \cdot \left(\frac{i \cdot \left(i + \beta\right)}{-1 + t\_4} \cdot \frac{i + \beta}{t\_4}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(t\_2 + 0.0625\right) - t\_2\\
\end{array}
\end{array}
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 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) 1)) < +inf.0Initial program 52.4%
associate-/l/42.9%
associate-*l*42.8%
associate-/l*43.3%
Simplified99.2%
Taylor expanded in alpha around 0 89.2%
Taylor expanded in alpha around 0 89.0%
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 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) 1)) Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
associate-/l*0.0%
Simplified3.7%
Taylor expanded in i around inf 80.9%
sub-neg80.9%
+-commutative80.9%
fma-define80.9%
distribute-lft-out80.9%
associate-*r/80.9%
Applied egg-rr80.9%
unsub-neg80.9%
fma-undefine80.9%
associate-/l*80.9%
associate-*r*80.9%
metadata-eval80.9%
associate-/l*80.9%
associate-/l*80.9%
Simplified80.9%
Taylor expanded in alpha around 0 78.3%
Taylor expanded in alpha around 0 79.2%
Final simplification82.3%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (* 0.125 (/ beta i))) (t_1 (+ alpha (* i 2.0))))
(if (<= beta 2.6e+136)
0.0625
(if (<= beta 3.1e+167)
(*
i
(*
(/
(+
alpha
(+ i (/ (+ (* i (+ i alpha)) (* -2.0 (* (+ i alpha) t_1))) beta)))
beta)
(/ (- 1.0 (/ (- (* 2.0 t_1) (+ i alpha)) beta)) beta)))
(if (<= beta 3.2e+245)
(- (+ t_0 0.0625) t_0)
(* (/ i beta) (/ (+ i alpha) beta)))))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = 0.125 * (beta / i);
double t_1 = alpha + (i * 2.0);
double tmp;
if (beta <= 2.6e+136) {
tmp = 0.0625;
} else if (beta <= 3.1e+167) {
tmp = i * (((alpha + (i + (((i * (i + alpha)) + (-2.0 * ((i + alpha) * t_1))) / beta))) / beta) * ((1.0 - (((2.0 * t_1) - (i + alpha)) / beta)) / beta));
} else if (beta <= 3.2e+245) {
tmp = (t_0 + 0.0625) - t_0;
} else {
tmp = (i / beta) * ((i + alpha) / beta);
}
return tmp;
}
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) :: tmp
t_0 = 0.125d0 * (beta / i)
t_1 = alpha + (i * 2.0d0)
if (beta <= 2.6d+136) then
tmp = 0.0625d0
else if (beta <= 3.1d+167) then
tmp = i * (((alpha + (i + (((i * (i + alpha)) + ((-2.0d0) * ((i + alpha) * t_1))) / beta))) / beta) * ((1.0d0 - (((2.0d0 * t_1) - (i + alpha)) / beta)) / beta))
else if (beta <= 3.2d+245) then
tmp = (t_0 + 0.0625d0) - t_0
else
tmp = (i / beta) * ((i + alpha) / beta)
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double t_0 = 0.125 * (beta / i);
double t_1 = alpha + (i * 2.0);
double tmp;
if (beta <= 2.6e+136) {
tmp = 0.0625;
} else if (beta <= 3.1e+167) {
tmp = i * (((alpha + (i + (((i * (i + alpha)) + (-2.0 * ((i + alpha) * t_1))) / beta))) / beta) * ((1.0 - (((2.0 * t_1) - (i + alpha)) / beta)) / beta));
} else if (beta <= 3.2e+245) {
tmp = (t_0 + 0.0625) - t_0;
} else {
tmp = (i / beta) * ((i + alpha) / beta);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): t_0 = 0.125 * (beta / i) t_1 = alpha + (i * 2.0) tmp = 0 if beta <= 2.6e+136: tmp = 0.0625 elif beta <= 3.1e+167: tmp = i * (((alpha + (i + (((i * (i + alpha)) + (-2.0 * ((i + alpha) * t_1))) / beta))) / beta) * ((1.0 - (((2.0 * t_1) - (i + alpha)) / beta)) / beta)) elif beta <= 3.2e+245: tmp = (t_0 + 0.0625) - t_0 else: tmp = (i / beta) * ((i + alpha) / beta) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(0.125 * Float64(beta / i)) t_1 = Float64(alpha + Float64(i * 2.0)) tmp = 0.0 if (beta <= 2.6e+136) tmp = 0.0625; elseif (beta <= 3.1e+167) tmp = Float64(i * Float64(Float64(Float64(alpha + Float64(i + Float64(Float64(Float64(i * Float64(i + alpha)) + Float64(-2.0 * Float64(Float64(i + alpha) * t_1))) / beta))) / beta) * Float64(Float64(1.0 - Float64(Float64(Float64(2.0 * t_1) - Float64(i + alpha)) / beta)) / beta))); elseif (beta <= 3.2e+245) tmp = Float64(Float64(t_0 + 0.0625) - t_0); else tmp = Float64(Float64(i / beta) * Float64(Float64(i + alpha) / beta)); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = 0.125 * (beta / i);
t_1 = alpha + (i * 2.0);
tmp = 0.0;
if (beta <= 2.6e+136)
tmp = 0.0625;
elseif (beta <= 3.1e+167)
tmp = i * (((alpha + (i + (((i * (i + alpha)) + (-2.0 * ((i + alpha) * t_1))) / beta))) / beta) * ((1.0 - (((2.0 * t_1) - (i + alpha)) / beta)) / beta));
elseif (beta <= 3.2e+245)
tmp = (t_0 + 0.0625) - t_0;
else
tmp = (i / beta) * ((i + alpha) / beta);
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(alpha + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 2.6e+136], 0.0625, If[LessEqual[beta, 3.1e+167], N[(i * N[(N[(N[(alpha + N[(i + N[(N[(N[(i * N[(i + alpha), $MachinePrecision]), $MachinePrecision] + N[(-2.0 * N[(N[(i + alpha), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision] * N[(N[(1.0 - N[(N[(N[(2.0 * t$95$1), $MachinePrecision] - N[(i + alpha), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 3.2e+245], N[(N[(t$95$0 + 0.0625), $MachinePrecision] - t$95$0), $MachinePrecision], N[(N[(i / beta), $MachinePrecision] * N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := 0.125 \cdot \frac{\beta}{i}\\
t_1 := \alpha + i \cdot 2\\
\mathbf{if}\;\beta \leq 2.6 \cdot 10^{+136}:\\
\;\;\;\;0.0625\\
\mathbf{elif}\;\beta \leq 3.1 \cdot 10^{+167}:\\
\;\;\;\;i \cdot \left(\frac{\alpha + \left(i + \frac{i \cdot \left(i + \alpha\right) + -2 \cdot \left(\left(i + \alpha\right) \cdot t\_1\right)}{\beta}\right)}{\beta} \cdot \frac{1 - \frac{2 \cdot t\_1 - \left(i + \alpha\right)}{\beta}}{\beta}\right)\\
\mathbf{elif}\;\beta \leq 3.2 \cdot 10^{+245}:\\
\;\;\;\;\left(t\_0 + 0.0625\right) - t\_0\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i + \alpha}{\beta}\\
\end{array}
\end{array}
if beta < 2.6000000000000001e136Initial program 20.7%
associate-/l/17.4%
associate-*l*17.3%
associate-/l*17.5%
Simplified37.9%
Taylor expanded in i around inf 83.0%
if 2.6000000000000001e136 < beta < 3.1e167Initial program 9.1%
associate-/l/0.6%
associate-*l*0.6%
associate-/l*0.6%
Simplified41.3%
Taylor expanded in beta around -inf 37.9%
Taylor expanded in beta around -inf 37.5%
if 3.1e167 < beta < 3.20000000000000024e245Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
associate-/l*0.0%
Simplified15.9%
Taylor expanded in i around inf 60.0%
sub-neg60.0%
+-commutative60.0%
fma-define60.0%
distribute-lft-out60.0%
associate-*r/60.0%
Applied egg-rr60.0%
unsub-neg60.0%
fma-undefine60.0%
associate-/l*60.0%
associate-*r*60.3%
metadata-eval60.3%
associate-/l*60.3%
associate-/l*60.3%
Simplified60.3%
Taylor expanded in alpha around 0 60.1%
Taylor expanded in alpha around 0 60.3%
if 3.20000000000000024e245 < beta Initial program 0.0%
associate-/l/0.0%
times-frac14.3%
Simplified14.3%
Taylor expanded in beta around inf 16.0%
Taylor expanded in beta around inf 95.1%
+-commutative95.1%
Simplified95.1%
Final simplification80.0%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (* 0.125 (/ beta i))))
(if (<= beta 2e+136)
0.0625
(if (or (<= beta 1.85e+149) (not (<= beta 9.8e+244)))
(* (/ i beta) (/ (+ i alpha) beta))
(- (+ t_0 0.0625) t_0)))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = 0.125 * (beta / i);
double tmp;
if (beta <= 2e+136) {
tmp = 0.0625;
} else if ((beta <= 1.85e+149) || !(beta <= 9.8e+244)) {
tmp = (i / beta) * ((i + alpha) / beta);
} else {
tmp = (t_0 + 0.0625) - t_0;
}
return tmp;
}
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) :: tmp
t_0 = 0.125d0 * (beta / i)
if (beta <= 2d+136) then
tmp = 0.0625d0
else if ((beta <= 1.85d+149) .or. (.not. (beta <= 9.8d+244))) then
tmp = (i / beta) * ((i + alpha) / beta)
else
tmp = (t_0 + 0.0625d0) - t_0
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double t_0 = 0.125 * (beta / i);
double tmp;
if (beta <= 2e+136) {
tmp = 0.0625;
} else if ((beta <= 1.85e+149) || !(beta <= 9.8e+244)) {
tmp = (i / beta) * ((i + alpha) / beta);
} else {
tmp = (t_0 + 0.0625) - t_0;
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): t_0 = 0.125 * (beta / i) tmp = 0 if beta <= 2e+136: tmp = 0.0625 elif (beta <= 1.85e+149) or not (beta <= 9.8e+244): tmp = (i / beta) * ((i + alpha) / beta) else: tmp = (t_0 + 0.0625) - t_0 return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(0.125 * Float64(beta / i)) tmp = 0.0 if (beta <= 2e+136) tmp = 0.0625; elseif ((beta <= 1.85e+149) || !(beta <= 9.8e+244)) tmp = Float64(Float64(i / beta) * Float64(Float64(i + alpha) / beta)); else tmp = Float64(Float64(t_0 + 0.0625) - t_0); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = 0.125 * (beta / i);
tmp = 0.0;
if (beta <= 2e+136)
tmp = 0.0625;
elseif ((beta <= 1.85e+149) || ~((beta <= 9.8e+244)))
tmp = (i / beta) * ((i + alpha) / beta);
else
tmp = (t_0 + 0.0625) - t_0;
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 2e+136], 0.0625, If[Or[LessEqual[beta, 1.85e+149], N[Not[LessEqual[beta, 9.8e+244]], $MachinePrecision]], N[(N[(i / beta), $MachinePrecision] * N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$0 + 0.0625), $MachinePrecision] - t$95$0), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := 0.125 \cdot \frac{\beta}{i}\\
\mathbf{if}\;\beta \leq 2 \cdot 10^{+136}:\\
\;\;\;\;0.0625\\
\mathbf{elif}\;\beta \leq 1.85 \cdot 10^{+149} \lor \neg \left(\beta \leq 9.8 \cdot 10^{+244}\right):\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i + \alpha}{\beta}\\
\mathbf{else}:\\
\;\;\;\;\left(t\_0 + 0.0625\right) - t\_0\\
\end{array}
\end{array}
if beta < 2.00000000000000012e136Initial program 20.7%
associate-/l/17.4%
associate-*l*17.3%
associate-/l*17.5%
Simplified37.9%
Taylor expanded in i around inf 83.0%
if 2.00000000000000012e136 < beta < 1.84999999999999989e149 or 9.8e244 < beta Initial program 4.1%
associate-/l/0.3%
times-frac26.7%
Simplified26.8%
Taylor expanded in beta around inf 25.9%
Taylor expanded in beta around inf 89.8%
+-commutative89.8%
Simplified89.8%
if 1.84999999999999989e149 < beta < 9.8e244Initial program 0.1%
associate-/l/0.0%
associate-*l*0.0%
associate-/l*0.0%
Simplified15.5%
Taylor expanded in i around inf 66.6%
sub-neg66.6%
+-commutative66.6%
fma-define66.6%
distribute-lft-out66.6%
associate-*r/66.6%
Applied egg-rr66.6%
unsub-neg66.6%
fma-undefine66.6%
associate-/l*66.6%
associate-*r*66.8%
metadata-eval66.8%
associate-/l*66.8%
associate-/l*66.8%
Simplified66.8%
Taylor expanded in alpha around 0 63.1%
Taylor expanded in alpha around 0 66.8%
Final simplification81.9%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(if (<= beta 2.6e+136)
0.0625
(if (or (<= beta 2.3e+149) (not (<= beta 2.3e+205)))
(* (/ i beta) (/ (+ i alpha) beta))
0.0625)))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 2.6e+136) {
tmp = 0.0625;
} else if ((beta <= 2.3e+149) || !(beta <= 2.3e+205)) {
tmp = (i / beta) * ((i + alpha) / beta);
} else {
tmp = 0.0625;
}
return tmp;
}
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 <= 2.6d+136) then
tmp = 0.0625d0
else if ((beta <= 2.3d+149) .or. (.not. (beta <= 2.3d+205))) then
tmp = (i / beta) * ((i + alpha) / beta)
else
tmp = 0.0625d0
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 2.6e+136) {
tmp = 0.0625;
} else if ((beta <= 2.3e+149) || !(beta <= 2.3e+205)) {
tmp = (i / beta) * ((i + alpha) / beta);
} else {
tmp = 0.0625;
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 2.6e+136: tmp = 0.0625 elif (beta <= 2.3e+149) or not (beta <= 2.3e+205): tmp = (i / beta) * ((i + alpha) / beta) else: tmp = 0.0625 return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 2.6e+136) tmp = 0.0625; elseif ((beta <= 2.3e+149) || !(beta <= 2.3e+205)) tmp = Float64(Float64(i / beta) * Float64(Float64(i + alpha) / beta)); else tmp = 0.0625; end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 2.6e+136)
tmp = 0.0625;
elseif ((beta <= 2.3e+149) || ~((beta <= 2.3e+205)))
tmp = (i / beta) * ((i + alpha) / beta);
else
tmp = 0.0625;
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 2.6e+136], 0.0625, If[Or[LessEqual[beta, 2.3e+149], N[Not[LessEqual[beta, 2.3e+205]], $MachinePrecision]], N[(N[(i / beta), $MachinePrecision] * N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision], 0.0625]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.6 \cdot 10^{+136}:\\
\;\;\;\;0.0625\\
\mathbf{elif}\;\beta \leq 2.3 \cdot 10^{+149} \lor \neg \left(\beta \leq 2.3 \cdot 10^{+205}\right):\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i + \alpha}{\beta}\\
\mathbf{else}:\\
\;\;\;\;0.0625\\
\end{array}
\end{array}
if beta < 2.6000000000000001e136 or 2.2999999999999998e149 < beta < 2.30000000000000007e205Initial program 19.2%
associate-/l/16.1%
associate-*l*16.1%
associate-/l*16.2%
Simplified35.7%
Taylor expanded in i around inf 82.1%
if 2.6000000000000001e136 < beta < 2.2999999999999998e149 or 2.30000000000000007e205 < beta Initial program 2.8%
associate-/l/0.2%
times-frac26.5%
Simplified26.5%
Taylor expanded in beta around inf 28.7%
Taylor expanded in beta around inf 82.9%
+-commutative82.9%
Simplified82.9%
Final simplification82.2%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 0.0625)
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
return 0.0625;
}
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.0625d0
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
return 0.0625;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): return 0.0625
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) return 0.0625 end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
tmp = 0.0625;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := 0.0625
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
0.0625
\end{array}
Initial program 16.8%
associate-/l/13.8%
associate-*l*13.7%
associate-/l*13.9%
Simplified34.3%
Taylor expanded in i around inf 72.4%
Final simplification72.4%
herbie shell --seed 2024080
(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)))