
(FPCore (a b) :precision binary64 (- (+ (pow (+ (* a a) (* b b)) 2.0) (* 4.0 (+ (* (* a a) (- 1.0 a)) (* (* b b) (+ 3.0 a))))) 1.0))
double code(double a, double b) {
return (pow(((a * a) + (b * b)), 2.0) + (4.0 * (((a * a) * (1.0 - a)) + ((b * b) * (3.0 + a))))) - 1.0;
}
real(8) function code(a, b)
real(8), intent (in) :: a
real(8), intent (in) :: b
code = ((((a * a) + (b * b)) ** 2.0d0) + (4.0d0 * (((a * a) * (1.0d0 - a)) + ((b * b) * (3.0d0 + a))))) - 1.0d0
end function
public static double code(double a, double b) {
return (Math.pow(((a * a) + (b * b)), 2.0) + (4.0 * (((a * a) * (1.0 - a)) + ((b * b) * (3.0 + a))))) - 1.0;
}
def code(a, b): return (math.pow(((a * a) + (b * b)), 2.0) + (4.0 * (((a * a) * (1.0 - a)) + ((b * b) * (3.0 + a))))) - 1.0
function code(a, b) return Float64(Float64((Float64(Float64(a * a) + Float64(b * b)) ^ 2.0) + Float64(4.0 * Float64(Float64(Float64(a * a) * Float64(1.0 - a)) + Float64(Float64(b * b) * Float64(3.0 + a))))) - 1.0) end
function tmp = code(a, b) tmp = ((((a * a) + (b * b)) ^ 2.0) + (4.0 * (((a * a) * (1.0 - a)) + ((b * b) * (3.0 + a))))) - 1.0; end
code[a_, b_] := N[(N[(N[Power[N[(N[(a * a), $MachinePrecision] + N[(b * b), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] + N[(4.0 * N[(N[(N[(a * a), $MachinePrecision] * N[(1.0 - a), $MachinePrecision]), $MachinePrecision] + N[(N[(b * b), $MachinePrecision] * N[(3.0 + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]
\begin{array}{l}
\\
\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(\left(a \cdot a\right) \cdot \left(1 - a\right) + \left(b \cdot b\right) \cdot \left(3 + a\right)\right)\right) - 1
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 16 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (a b) :precision binary64 (- (+ (pow (+ (* a a) (* b b)) 2.0) (* 4.0 (+ (* (* a a) (- 1.0 a)) (* (* b b) (+ 3.0 a))))) 1.0))
double code(double a, double b) {
return (pow(((a * a) + (b * b)), 2.0) + (4.0 * (((a * a) * (1.0 - a)) + ((b * b) * (3.0 + a))))) - 1.0;
}
real(8) function code(a, b)
real(8), intent (in) :: a
real(8), intent (in) :: b
code = ((((a * a) + (b * b)) ** 2.0d0) + (4.0d0 * (((a * a) * (1.0d0 - a)) + ((b * b) * (3.0d0 + a))))) - 1.0d0
end function
public static double code(double a, double b) {
return (Math.pow(((a * a) + (b * b)), 2.0) + (4.0 * (((a * a) * (1.0 - a)) + ((b * b) * (3.0 + a))))) - 1.0;
}
def code(a, b): return (math.pow(((a * a) + (b * b)), 2.0) + (4.0 * (((a * a) * (1.0 - a)) + ((b * b) * (3.0 + a))))) - 1.0
function code(a, b) return Float64(Float64((Float64(Float64(a * a) + Float64(b * b)) ^ 2.0) + Float64(4.0 * Float64(Float64(Float64(a * a) * Float64(1.0 - a)) + Float64(Float64(b * b) * Float64(3.0 + a))))) - 1.0) end
function tmp = code(a, b) tmp = ((((a * a) + (b * b)) ^ 2.0) + (4.0 * (((a * a) * (1.0 - a)) + ((b * b) * (3.0 + a))))) - 1.0; end
code[a_, b_] := N[(N[(N[Power[N[(N[(a * a), $MachinePrecision] + N[(b * b), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] + N[(4.0 * N[(N[(N[(a * a), $MachinePrecision] * N[(1.0 - a), $MachinePrecision]), $MachinePrecision] + N[(N[(b * b), $MachinePrecision] * N[(3.0 + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]
\begin{array}{l}
\\
\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(\left(a \cdot a\right) \cdot \left(1 - a\right) + \left(b \cdot b\right) \cdot \left(3 + a\right)\right)\right) - 1
\end{array}
(FPCore (a b) :precision binary64 (fma (* b (fma a (fma a 2.0 4.0) (fma b b 12.0))) b (fma (fma a a 0.0) (fma (- 1.0 a) 4.0 (fma a a 0.0)) -1.0)))
double code(double a, double b) {
return fma((b * fma(a, fma(a, 2.0, 4.0), fma(b, b, 12.0))), b, fma(fma(a, a, 0.0), fma((1.0 - a), 4.0, fma(a, a, 0.0)), -1.0));
}
function code(a, b) return fma(Float64(b * fma(a, fma(a, 2.0, 4.0), fma(b, b, 12.0))), b, fma(fma(a, a, 0.0), fma(Float64(1.0 - a), 4.0, fma(a, a, 0.0)), -1.0)) end
code[a_, b_] := N[(N[(b * N[(a * N[(a * 2.0 + 4.0), $MachinePrecision] + N[(b * b + 12.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * b + N[(N[(a * a + 0.0), $MachinePrecision] * N[(N[(1.0 - a), $MachinePrecision] * 4.0 + N[(a * a + 0.0), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(b \cdot \mathsf{fma}\left(a, \mathsf{fma}\left(a, 2, 4\right), \mathsf{fma}\left(b, b, 12\right)\right), b, \mathsf{fma}\left(\mathsf{fma}\left(a, a, 0\right), \mathsf{fma}\left(1 - a, 4, \mathsf{fma}\left(a, a, 0\right)\right), -1\right)\right)
\end{array}
Initial program 77.6%
Taylor expanded in b around 0
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
Simplified94.4%
associate--l+N/A
associate-*l*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
accelerator-lowering-fma.f64N/A
Applied egg-rr99.9%
(FPCore (a b) :precision binary64 (let* ((t_0 (fma b b (fma a a 0.0)))) (fma t_0 t_0 (fma b (* b 12.0) -1.0))))
double code(double a, double b) {
double t_0 = fma(b, b, fma(a, a, 0.0));
return fma(t_0, t_0, fma(b, (b * 12.0), -1.0));
}
function code(a, b) t_0 = fma(b, b, fma(a, a, 0.0)) return fma(t_0, t_0, fma(b, Float64(b * 12.0), -1.0)) end
code[a_, b_] := Block[{t$95$0 = N[(b * b + N[(a * a + 0.0), $MachinePrecision]), $MachinePrecision]}, N[(t$95$0 * t$95$0 + N[(b * N[(b * 12.0), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(b, b, \mathsf{fma}\left(a, a, 0\right)\right)\\
\mathsf{fma}\left(t\_0, t\_0, \mathsf{fma}\left(b, b \cdot 12, -1\right)\right)
\end{array}
\end{array}
Initial program 77.6%
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
Applied egg-rr78.4%
Taylor expanded in a around 0
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6499.6
Simplified99.6%
sub-negN/A
+-commutativeN/A
metadata-evalN/A
associate-+l+N/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
associate-*l*N/A
metadata-evalN/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6499.6
Applied egg-rr99.6%
(FPCore (a b) :precision binary64 (if (<= (* b b) 1e-9) (fma a (* a (fma a (+ a -4.0) 4.0)) -1.0) (fma (* b (fma a (fma a 2.0 4.0) (fma b b 12.0))) b -1.0)))
double code(double a, double b) {
double tmp;
if ((b * b) <= 1e-9) {
tmp = fma(a, (a * fma(a, (a + -4.0), 4.0)), -1.0);
} else {
tmp = fma((b * fma(a, fma(a, 2.0, 4.0), fma(b, b, 12.0))), b, -1.0);
}
return tmp;
}
function code(a, b) tmp = 0.0 if (Float64(b * b) <= 1e-9) tmp = fma(a, Float64(a * fma(a, Float64(a + -4.0), 4.0)), -1.0); else tmp = fma(Float64(b * fma(a, fma(a, 2.0, 4.0), fma(b, b, 12.0))), b, -1.0); end return tmp end
code[a_, b_] := If[LessEqual[N[(b * b), $MachinePrecision], 1e-9], N[(a * N[(a * N[(a * N[(a + -4.0), $MachinePrecision] + 4.0), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision], N[(N[(b * N[(a * N[(a * 2.0 + 4.0), $MachinePrecision] + N[(b * b + 12.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * b + -1.0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b \cdot b \leq 10^{-9}:\\
\;\;\;\;\mathsf{fma}\left(a, a \cdot \mathsf{fma}\left(a, a + -4, 4\right), -1\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(b \cdot \mathsf{fma}\left(a, \mathsf{fma}\left(a, 2, 4\right), \mathsf{fma}\left(b, b, 12\right)\right), b, -1\right)\\
\end{array}
\end{array}
if (*.f64 b b) < 1.00000000000000006e-9Initial program 85.2%
Taylor expanded in b around 0
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
Simplified89.6%
Taylor expanded in b around 0
sub-negN/A
metadata-evalN/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
Simplified99.7%
if 1.00000000000000006e-9 < (*.f64 b b) Initial program 69.1%
Taylor expanded in b around 0
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
Simplified99.9%
associate--l+N/A
associate-*l*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
accelerator-lowering-fma.f64N/A
Applied egg-rr99.9%
Taylor expanded in a around 0
Simplified95.6%
(FPCore (a b) :precision binary64 (if (<= (* b b) 1e-9) (fma a (* a (fma a (+ a -4.0) 4.0)) -1.0) (fma (* b (fma a (* a 2.0) (fma b b 12.0))) b -1.0)))
double code(double a, double b) {
double tmp;
if ((b * b) <= 1e-9) {
tmp = fma(a, (a * fma(a, (a + -4.0), 4.0)), -1.0);
} else {
tmp = fma((b * fma(a, (a * 2.0), fma(b, b, 12.0))), b, -1.0);
}
return tmp;
}
function code(a, b) tmp = 0.0 if (Float64(b * b) <= 1e-9) tmp = fma(a, Float64(a * fma(a, Float64(a + -4.0), 4.0)), -1.0); else tmp = fma(Float64(b * fma(a, Float64(a * 2.0), fma(b, b, 12.0))), b, -1.0); end return tmp end
code[a_, b_] := If[LessEqual[N[(b * b), $MachinePrecision], 1e-9], N[(a * N[(a * N[(a * N[(a + -4.0), $MachinePrecision] + 4.0), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision], N[(N[(b * N[(a * N[(a * 2.0), $MachinePrecision] + N[(b * b + 12.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * b + -1.0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b \cdot b \leq 10^{-9}:\\
\;\;\;\;\mathsf{fma}\left(a, a \cdot \mathsf{fma}\left(a, a + -4, 4\right), -1\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(b \cdot \mathsf{fma}\left(a, a \cdot 2, \mathsf{fma}\left(b, b, 12\right)\right), b, -1\right)\\
\end{array}
\end{array}
if (*.f64 b b) < 1.00000000000000006e-9Initial program 85.2%
Taylor expanded in b around 0
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
Simplified89.6%
Taylor expanded in b around 0
sub-negN/A
metadata-evalN/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
Simplified99.7%
if 1.00000000000000006e-9 < (*.f64 b b) Initial program 69.1%
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
Applied egg-rr70.7%
Taylor expanded in a around 0
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6499.7
Simplified99.7%
Taylor expanded in a around 0
associate-+r+N/A
associate-*r*N/A
distribute-rgt-inN/A
+-commutativeN/A
metadata-evalN/A
pow-sqrN/A
distribute-lft-inN/A
associate-+r+N/A
sub-negN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
Simplified95.5%
associate-*l*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
accelerator-lowering-fma.f6495.5
Applied egg-rr95.5%
(FPCore (a b) :precision binary64 (if (<= (* b b) 1e-9) (fma a (* a (fma a (+ a -4.0) 4.0)) -1.0) (fma (* b b) (fma 2.0 (* a a) (fma b b 12.0)) -1.0)))
double code(double a, double b) {
double tmp;
if ((b * b) <= 1e-9) {
tmp = fma(a, (a * fma(a, (a + -4.0), 4.0)), -1.0);
} else {
tmp = fma((b * b), fma(2.0, (a * a), fma(b, b, 12.0)), -1.0);
}
return tmp;
}
function code(a, b) tmp = 0.0 if (Float64(b * b) <= 1e-9) tmp = fma(a, Float64(a * fma(a, Float64(a + -4.0), 4.0)), -1.0); else tmp = fma(Float64(b * b), fma(2.0, Float64(a * a), fma(b, b, 12.0)), -1.0); end return tmp end
code[a_, b_] := If[LessEqual[N[(b * b), $MachinePrecision], 1e-9], N[(a * N[(a * N[(a * N[(a + -4.0), $MachinePrecision] + 4.0), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision], N[(N[(b * b), $MachinePrecision] * N[(2.0 * N[(a * a), $MachinePrecision] + N[(b * b + 12.0), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b \cdot b \leq 10^{-9}:\\
\;\;\;\;\mathsf{fma}\left(a, a \cdot \mathsf{fma}\left(a, a + -4, 4\right), -1\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(b \cdot b, \mathsf{fma}\left(2, a \cdot a, \mathsf{fma}\left(b, b, 12\right)\right), -1\right)\\
\end{array}
\end{array}
if (*.f64 b b) < 1.00000000000000006e-9Initial program 85.2%
Taylor expanded in b around 0
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
Simplified89.6%
Taylor expanded in b around 0
sub-negN/A
metadata-evalN/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
Simplified99.7%
if 1.00000000000000006e-9 < (*.f64 b b) Initial program 69.1%
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
Applied egg-rr70.7%
Taylor expanded in a around 0
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6499.7
Simplified99.7%
Taylor expanded in a around 0
associate-+r+N/A
associate-*r*N/A
distribute-rgt-inN/A
+-commutativeN/A
metadata-evalN/A
pow-sqrN/A
distribute-lft-inN/A
associate-+r+N/A
sub-negN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
Simplified95.5%
(FPCore (a b) :precision binary64 (if (<= (* b b) 1e+19) (fma a (* a (fma a (+ a -4.0) 4.0)) -1.0) (fma (* b b) (fma 2.0 (* a a) (* b b)) -1.0)))
double code(double a, double b) {
double tmp;
if ((b * b) <= 1e+19) {
tmp = fma(a, (a * fma(a, (a + -4.0), 4.0)), -1.0);
} else {
tmp = fma((b * b), fma(2.0, (a * a), (b * b)), -1.0);
}
return tmp;
}
function code(a, b) tmp = 0.0 if (Float64(b * b) <= 1e+19) tmp = fma(a, Float64(a * fma(a, Float64(a + -4.0), 4.0)), -1.0); else tmp = fma(Float64(b * b), fma(2.0, Float64(a * a), Float64(b * b)), -1.0); end return tmp end
code[a_, b_] := If[LessEqual[N[(b * b), $MachinePrecision], 1e+19], N[(a * N[(a * N[(a * N[(a + -4.0), $MachinePrecision] + 4.0), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision], N[(N[(b * b), $MachinePrecision] * N[(2.0 * N[(a * a), $MachinePrecision] + N[(b * b), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b \cdot b \leq 10^{+19}:\\
\;\;\;\;\mathsf{fma}\left(a, a \cdot \mathsf{fma}\left(a, a + -4, 4\right), -1\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(b \cdot b, \mathsf{fma}\left(2, a \cdot a, b \cdot b\right), -1\right)\\
\end{array}
\end{array}
if (*.f64 b b) < 1e19Initial program 84.9%
Taylor expanded in b around 0
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
Simplified89.9%
Taylor expanded in b around 0
sub-negN/A
metadata-evalN/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
Simplified98.8%
if 1e19 < (*.f64 b b) Initial program 68.8%
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
Applied egg-rr70.6%
Taylor expanded in a around 0
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6499.9
Simplified99.9%
Taylor expanded in a around 0
associate-+r+N/A
associate-*r*N/A
distribute-rgt-inN/A
+-commutativeN/A
metadata-evalN/A
pow-sqrN/A
distribute-lft-inN/A
associate-+r+N/A
sub-negN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
Simplified96.4%
Taylor expanded in b around inf
unpow2N/A
*-lowering-*.f6496.4
Simplified96.4%
(FPCore (a b) :precision binary64 (if (<= (* b b) 2e+62) (fma a (* a (fma a (+ a -4.0) 4.0)) -1.0) (* b (* b (* b b)))))
double code(double a, double b) {
double tmp;
if ((b * b) <= 2e+62) {
tmp = fma(a, (a * fma(a, (a + -4.0), 4.0)), -1.0);
} else {
tmp = b * (b * (b * b));
}
return tmp;
}
function code(a, b) tmp = 0.0 if (Float64(b * b) <= 2e+62) tmp = fma(a, Float64(a * fma(a, Float64(a + -4.0), 4.0)), -1.0); else tmp = Float64(b * Float64(b * Float64(b * b))); end return tmp end
code[a_, b_] := If[LessEqual[N[(b * b), $MachinePrecision], 2e+62], N[(a * N[(a * N[(a * N[(a + -4.0), $MachinePrecision] + 4.0), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision], N[(b * N[(b * N[(b * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b \cdot b \leq 2 \cdot 10^{+62}:\\
\;\;\;\;\mathsf{fma}\left(a, a \cdot \mathsf{fma}\left(a, a + -4, 4\right), -1\right)\\
\mathbf{else}:\\
\;\;\;\;b \cdot \left(b \cdot \left(b \cdot b\right)\right)\\
\end{array}
\end{array}
if (*.f64 b b) < 2.00000000000000007e62Initial program 85.5%
Taylor expanded in b around 0
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
Simplified90.3%
Taylor expanded in b around 0
sub-negN/A
metadata-evalN/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
Simplified97.5%
if 2.00000000000000007e62 < (*.f64 b b) Initial program 67.2%
Taylor expanded in b around 0
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
Simplified99.9%
Taylor expanded in b around inf
metadata-evalN/A
pow-plusN/A
*-commutativeN/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6492.3
Simplified92.3%
(FPCore (a b) :precision binary64 (if (<= (* b b) 2e+62) (+ -1.0 (* a (* a (fma a a 0.0)))) (* b (* b (* b b)))))
double code(double a, double b) {
double tmp;
if ((b * b) <= 2e+62) {
tmp = -1.0 + (a * (a * fma(a, a, 0.0)));
} else {
tmp = b * (b * (b * b));
}
return tmp;
}
function code(a, b) tmp = 0.0 if (Float64(b * b) <= 2e+62) tmp = Float64(-1.0 + Float64(a * Float64(a * fma(a, a, 0.0)))); else tmp = Float64(b * Float64(b * Float64(b * b))); end return tmp end
code[a_, b_] := If[LessEqual[N[(b * b), $MachinePrecision], 2e+62], N[(-1.0 + N[(a * N[(a * N[(a * a + 0.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(b * N[(b * N[(b * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b \cdot b \leq 2 \cdot 10^{+62}:\\
\;\;\;\;-1 + a \cdot \left(a \cdot \mathsf{fma}\left(a, a, 0\right)\right)\\
\mathbf{else}:\\
\;\;\;\;b \cdot \left(b \cdot \left(b \cdot b\right)\right)\\
\end{array}
\end{array}
if (*.f64 b b) < 2.00000000000000007e62Initial program 85.5%
Taylor expanded in a around inf
metadata-evalN/A
pow-plusN/A
*-commutativeN/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
+-rgt-identityN/A
unpow2N/A
accelerator-lowering-fma.f6497.1
Simplified97.1%
if 2.00000000000000007e62 < (*.f64 b b) Initial program 67.2%
Taylor expanded in b around 0
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
Simplified99.9%
Taylor expanded in b around inf
metadata-evalN/A
pow-plusN/A
*-commutativeN/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6492.3
Simplified92.3%
Final simplification95.1%
(FPCore (a b) :precision binary64 (let* ((t_0 (fma b b (fma a a 0.0)))) (fma t_0 t_0 -1.0)))
double code(double a, double b) {
double t_0 = fma(b, b, fma(a, a, 0.0));
return fma(t_0, t_0, -1.0);
}
function code(a, b) t_0 = fma(b, b, fma(a, a, 0.0)) return fma(t_0, t_0, -1.0) end
code[a_, b_] := Block[{t$95$0 = N[(b * b + N[(a * a + 0.0), $MachinePrecision]), $MachinePrecision]}, N[(t$95$0 * t$95$0 + -1.0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(b, b, \mathsf{fma}\left(a, a, 0\right)\right)\\
\mathsf{fma}\left(t\_0, t\_0, -1\right)
\end{array}
\end{array}
Initial program 77.6%
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
Applied egg-rr78.4%
Taylor expanded in a around 0
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6499.6
Simplified99.6%
sub-negN/A
+-commutativeN/A
metadata-evalN/A
associate-+l+N/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
associate-*l*N/A
metadata-evalN/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6499.6
Applied egg-rr99.6%
Taylor expanded in b around 0
Simplified99.1%
(FPCore (a b) :precision binary64 (let* ((t_0 (* a (* a (* a a))))) (if (<= a -380000.0) t_0 (if (<= a 8.5e+27) (fma b (* b 12.0) -1.0) t_0))))
double code(double a, double b) {
double t_0 = a * (a * (a * a));
double tmp;
if (a <= -380000.0) {
tmp = t_0;
} else if (a <= 8.5e+27) {
tmp = fma(b, (b * 12.0), -1.0);
} else {
tmp = t_0;
}
return tmp;
}
function code(a, b) t_0 = Float64(a * Float64(a * Float64(a * a))) tmp = 0.0 if (a <= -380000.0) tmp = t_0; elseif (a <= 8.5e+27) tmp = fma(b, Float64(b * 12.0), -1.0); else tmp = t_0; end return tmp end
code[a_, b_] := Block[{t$95$0 = N[(a * N[(a * N[(a * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[a, -380000.0], t$95$0, If[LessEqual[a, 8.5e+27], N[(b * N[(b * 12.0), $MachinePrecision] + -1.0), $MachinePrecision], t$95$0]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := a \cdot \left(a \cdot \left(a \cdot a\right)\right)\\
\mathbf{if}\;a \leq -380000:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;a \leq 8.5 \cdot 10^{+27}:\\
\;\;\;\;\mathsf{fma}\left(b, b \cdot 12, -1\right)\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if a < -3.8e5 or 8.5e27 < a Initial program 47.1%
Taylor expanded in b around 0
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
Simplified86.9%
Taylor expanded in a around inf
metadata-evalN/A
pow-plusN/A
*-commutativeN/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6490.9
Simplified90.9%
if -3.8e5 < a < 8.5e27Initial program 100.0%
Taylor expanded in a around 0
+-commutativeN/A
metadata-evalN/A
pow-plusN/A
cube-unmultN/A
unpow2N/A
unpow2N/A
associate-*r*N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-lft-outN/A
*-lowering-*.f64N/A
unpow2N/A
accelerator-lowering-fma.f6499.2
Simplified99.2%
Taylor expanded in b around 0
sub-negN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f6482.5
Simplified82.5%
(FPCore (a b) :precision binary64 (if (<= (* b b) 2e+62) (fma (* a a) (* a a) -1.0) (* b (* b (* b b)))))
double code(double a, double b) {
double tmp;
if ((b * b) <= 2e+62) {
tmp = fma((a * a), (a * a), -1.0);
} else {
tmp = b * (b * (b * b));
}
return tmp;
}
function code(a, b) tmp = 0.0 if (Float64(b * b) <= 2e+62) tmp = fma(Float64(a * a), Float64(a * a), -1.0); else tmp = Float64(b * Float64(b * Float64(b * b))); end return tmp end
code[a_, b_] := If[LessEqual[N[(b * b), $MachinePrecision], 2e+62], N[(N[(a * a), $MachinePrecision] * N[(a * a), $MachinePrecision] + -1.0), $MachinePrecision], N[(b * N[(b * N[(b * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b \cdot b \leq 2 \cdot 10^{+62}:\\
\;\;\;\;\mathsf{fma}\left(a \cdot a, a \cdot a, -1\right)\\
\mathbf{else}:\\
\;\;\;\;b \cdot \left(b \cdot \left(b \cdot b\right)\right)\\
\end{array}
\end{array}
if (*.f64 b b) < 2.00000000000000007e62Initial program 85.5%
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
Applied egg-rr85.5%
Taylor expanded in a around 0
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6499.4
Simplified99.4%
Taylor expanded in b around 0
sub-negN/A
metadata-evalN/A
pow-sqrN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6497.1
Simplified97.1%
if 2.00000000000000007e62 < (*.f64 b b) Initial program 67.2%
Taylor expanded in b around 0
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
Simplified99.9%
Taylor expanded in b around inf
metadata-evalN/A
pow-plusN/A
*-commutativeN/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6492.3
Simplified92.3%
(FPCore (a b) :precision binary64 (if (<= (* b b) 1e+19) (fma a (* a 4.0) -1.0) (* b (* b (* b b)))))
double code(double a, double b) {
double tmp;
if ((b * b) <= 1e+19) {
tmp = fma(a, (a * 4.0), -1.0);
} else {
tmp = b * (b * (b * b));
}
return tmp;
}
function code(a, b) tmp = 0.0 if (Float64(b * b) <= 1e+19) tmp = fma(a, Float64(a * 4.0), -1.0); else tmp = Float64(b * Float64(b * Float64(b * b))); end return tmp end
code[a_, b_] := If[LessEqual[N[(b * b), $MachinePrecision], 1e+19], N[(a * N[(a * 4.0), $MachinePrecision] + -1.0), $MachinePrecision], N[(b * N[(b * N[(b * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b \cdot b \leq 10^{+19}:\\
\;\;\;\;\mathsf{fma}\left(a, a \cdot 4, -1\right)\\
\mathbf{else}:\\
\;\;\;\;b \cdot \left(b \cdot \left(b \cdot b\right)\right)\\
\end{array}
\end{array}
if (*.f64 b b) < 1e19Initial program 84.9%
Taylor expanded in b around 0
+-commutativeN/A
metadata-evalN/A
pow-sqrN/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-rgt-identityN/A
unpow2N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
accelerator-lowering-fma.f64N/A
sub-negN/A
mul-1-negN/A
+-commutativeN/A
distribute-lft-inN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
mul-1-negN/A
neg-sub0N/A
--lowering--.f6498.8
Simplified98.8%
Taylor expanded in a around 0
sub-negN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f6481.5
Simplified81.5%
if 1e19 < (*.f64 b b) Initial program 68.8%
Taylor expanded in b around 0
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
Simplified99.9%
Taylor expanded in b around inf
metadata-evalN/A
pow-plusN/A
*-commutativeN/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6489.4
Simplified89.4%
(FPCore (a b) :precision binary64 (let* ((t_0 (* 4.0 (* a a)))) (if (<= a -1.16e-7) t_0 (if (<= a 2.4) -1.0 t_0))))
double code(double a, double b) {
double t_0 = 4.0 * (a * a);
double tmp;
if (a <= -1.16e-7) {
tmp = t_0;
} else if (a <= 2.4) {
tmp = -1.0;
} else {
tmp = t_0;
}
return tmp;
}
real(8) function code(a, b)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8) :: t_0
real(8) :: tmp
t_0 = 4.0d0 * (a * a)
if (a <= (-1.16d-7)) then
tmp = t_0
else if (a <= 2.4d0) then
tmp = -1.0d0
else
tmp = t_0
end if
code = tmp
end function
public static double code(double a, double b) {
double t_0 = 4.0 * (a * a);
double tmp;
if (a <= -1.16e-7) {
tmp = t_0;
} else if (a <= 2.4) {
tmp = -1.0;
} else {
tmp = t_0;
}
return tmp;
}
def code(a, b): t_0 = 4.0 * (a * a) tmp = 0 if a <= -1.16e-7: tmp = t_0 elif a <= 2.4: tmp = -1.0 else: tmp = t_0 return tmp
function code(a, b) t_0 = Float64(4.0 * Float64(a * a)) tmp = 0.0 if (a <= -1.16e-7) tmp = t_0; elseif (a <= 2.4) tmp = -1.0; else tmp = t_0; end return tmp end
function tmp_2 = code(a, b) t_0 = 4.0 * (a * a); tmp = 0.0; if (a <= -1.16e-7) tmp = t_0; elseif (a <= 2.4) tmp = -1.0; else tmp = t_0; end tmp_2 = tmp; end
code[a_, b_] := Block[{t$95$0 = N[(4.0 * N[(a * a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[a, -1.16e-7], t$95$0, If[LessEqual[a, 2.4], -1.0, t$95$0]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := 4 \cdot \left(a \cdot a\right)\\
\mathbf{if}\;a \leq -1.16 \cdot 10^{-7}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;a \leq 2.4:\\
\;\;\;\;-1\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if a < -1.1600000000000001e-7 or 2.39999999999999991 < a Initial program 49.0%
Taylor expanded in b around 0
+-commutativeN/A
metadata-evalN/A
pow-sqrN/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-rgt-identityN/A
unpow2N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
accelerator-lowering-fma.f64N/A
sub-negN/A
mul-1-negN/A
+-commutativeN/A
distribute-lft-inN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
mul-1-negN/A
neg-sub0N/A
--lowering--.f6489.0
Simplified89.0%
Taylor expanded in a around 0
sub-negN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f6457.1
Simplified57.1%
Taylor expanded in a around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6457.2
Simplified57.2%
if -1.1600000000000001e-7 < a < 2.39999999999999991Initial program 100.0%
Taylor expanded in b around inf
metadata-evalN/A
pow-sqrN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6498.9
Simplified98.9%
Taylor expanded in b around 0
Simplified56.2%
(FPCore (a b) :precision binary64 (if (<= b 1.1e+140) (fma a (* a 4.0) -1.0) (fma b (* b 12.0) -1.0)))
double code(double a, double b) {
double tmp;
if (b <= 1.1e+140) {
tmp = fma(a, (a * 4.0), -1.0);
} else {
tmp = fma(b, (b * 12.0), -1.0);
}
return tmp;
}
function code(a, b) tmp = 0.0 if (b <= 1.1e+140) tmp = fma(a, Float64(a * 4.0), -1.0); else tmp = fma(b, Float64(b * 12.0), -1.0); end return tmp end
code[a_, b_] := If[LessEqual[b, 1.1e+140], N[(a * N[(a * 4.0), $MachinePrecision] + -1.0), $MachinePrecision], N[(b * N[(b * 12.0), $MachinePrecision] + -1.0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b \leq 1.1 \cdot 10^{+140}:\\
\;\;\;\;\mathsf{fma}\left(a, a \cdot 4, -1\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(b, b \cdot 12, -1\right)\\
\end{array}
\end{array}
if b < 1.0999999999999999e140Initial program 78.5%
Taylor expanded in b around 0
+-commutativeN/A
metadata-evalN/A
pow-sqrN/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-rgt-identityN/A
unpow2N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
accelerator-lowering-fma.f64N/A
sub-negN/A
mul-1-negN/A
+-commutativeN/A
distribute-lft-inN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
mul-1-negN/A
neg-sub0N/A
--lowering--.f6476.5
Simplified76.5%
Taylor expanded in a around 0
sub-negN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f6461.0
Simplified61.0%
if 1.0999999999999999e140 < b Initial program 71.9%
Taylor expanded in a around 0
+-commutativeN/A
metadata-evalN/A
pow-plusN/A
cube-unmultN/A
unpow2N/A
unpow2N/A
associate-*r*N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-lft-outN/A
*-lowering-*.f64N/A
unpow2N/A
accelerator-lowering-fma.f64100.0
Simplified100.0%
Taylor expanded in b around 0
sub-negN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f6497.2
Simplified97.2%
(FPCore (a b) :precision binary64 (fma a (* a 4.0) -1.0))
double code(double a, double b) {
return fma(a, (a * 4.0), -1.0);
}
function code(a, b) return fma(a, Float64(a * 4.0), -1.0) end
code[a_, b_] := N[(a * N[(a * 4.0), $MachinePrecision] + -1.0), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(a, a \cdot 4, -1\right)
\end{array}
Initial program 77.6%
Taylor expanded in b around 0
+-commutativeN/A
metadata-evalN/A
pow-sqrN/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-rgt-identityN/A
unpow2N/A
accelerator-lowering-fma.f64N/A
unpow2N/A
accelerator-lowering-fma.f64N/A
sub-negN/A
mul-1-negN/A
+-commutativeN/A
distribute-lft-inN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
mul-1-negN/A
neg-sub0N/A
--lowering--.f6470.5
Simplified70.5%
Taylor expanded in a around 0
sub-negN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f6456.6
Simplified56.6%
(FPCore (a b) :precision binary64 -1.0)
double code(double a, double b) {
return -1.0;
}
real(8) function code(a, b)
real(8), intent (in) :: a
real(8), intent (in) :: b
code = -1.0d0
end function
public static double code(double a, double b) {
return -1.0;
}
def code(a, b): return -1.0
function code(a, b) return -1.0 end
function tmp = code(a, b) tmp = -1.0; end
code[a_, b_] := -1.0
\begin{array}{l}
\\
-1
\end{array}
Initial program 77.6%
Taylor expanded in b around inf
metadata-evalN/A
pow-sqrN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6472.1
Simplified72.1%
Taylor expanded in b around 0
Simplified31.9%
herbie shell --seed 2024196
(FPCore (a b)
:name "Bouland and Aaronson, Equation (24)"
:precision binary64
(- (+ (pow (+ (* a a) (* b b)) 2.0) (* 4.0 (+ (* (* a a) (- 1.0 a)) (* (* b b) (+ 3.0 a))))) 1.0))