
(FPCore (a b) :precision binary64 (- (+ (pow (+ (* a a) (* b b)) 2.0) (* 4.0 (+ (* (* a a) (+ 1.0 a)) (* (* b b) (- 1.0 (* 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) * (1.0 - (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) * (1.0d0 - (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) * (1.0 - (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) * (1.0 - (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(1.0 - 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) * (1.0 - (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[(1.0 - N[(3.0 * a), $MachinePrecision]), $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(1 - 3 \cdot a\right)\right)\right) - 1
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 12 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) (- 1.0 (* 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) * (1.0 - (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) * (1.0d0 - (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) * (1.0 - (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) * (1.0 - (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(1.0 - 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) * (1.0 - (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[(1.0 - N[(3.0 * a), $MachinePrecision]), $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(1 - 3 \cdot a\right)\right)\right) - 1
\end{array}
(FPCore (a b) :precision binary64 (- (fma (* (fma b b (fma (fma -3.0 a 1.0) 4.0 (* (* a a) 2.0))) b) b (* (fma a a (fma a 4.0 4.0)) (* a a))) 1.0))
double code(double a, double b) {
return fma((fma(b, b, fma(fma(-3.0, a, 1.0), 4.0, ((a * a) * 2.0))) * b), b, (fma(a, a, fma(a, 4.0, 4.0)) * (a * a))) - 1.0;
}
function code(a, b) return Float64(fma(Float64(fma(b, b, fma(fma(-3.0, a, 1.0), 4.0, Float64(Float64(a * a) * 2.0))) * b), b, Float64(fma(a, a, fma(a, 4.0, 4.0)) * Float64(a * a))) - 1.0) end
code[a_, b_] := N[(N[(N[(N[(b * b + N[(N[(-3.0 * a + 1.0), $MachinePrecision] * 4.0 + N[(N[(a * a), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * b), $MachinePrecision] * b + N[(N[(a * a + N[(a * 4.0 + 4.0), $MachinePrecision]), $MachinePrecision] * N[(a * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(\mathsf{fma}\left(b, b, \mathsf{fma}\left(\mathsf{fma}\left(-3, a, 1\right), 4, \left(a \cdot a\right) \cdot 2\right)\right) \cdot b, b, \mathsf{fma}\left(a, a, \mathsf{fma}\left(a, 4, 4\right)\right) \cdot \left(a \cdot a\right)\right) - 1
\end{array}
Initial program 77.2%
Taylor expanded in b around 0
+-commutativeN/A
associate-+l+N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
+-commutativeN/A
lower-fma.f64N/A
Applied rewrites99.9%
Final simplification99.9%
(FPCore (a b)
:precision binary64
(if (<= (* b b) 2e-32)
(fma (fma (+ 4.0 a) a 4.0) (* a a) -1.0)
(-
(fma
(* (fma b b (fma (fma -3.0 a 1.0) 4.0 (* (* a a) 2.0))) b)
b
(* 4.0 (* a a)))
1.0)))
double code(double a, double b) {
double tmp;
if ((b * b) <= 2e-32) {
tmp = fma(fma((4.0 + a), a, 4.0), (a * a), -1.0);
} else {
tmp = fma((fma(b, b, fma(fma(-3.0, a, 1.0), 4.0, ((a * a) * 2.0))) * b), b, (4.0 * (a * a))) - 1.0;
}
return tmp;
}
function code(a, b) tmp = 0.0 if (Float64(b * b) <= 2e-32) tmp = fma(fma(Float64(4.0 + a), a, 4.0), Float64(a * a), -1.0); else tmp = Float64(fma(Float64(fma(b, b, fma(fma(-3.0, a, 1.0), 4.0, Float64(Float64(a * a) * 2.0))) * b), b, Float64(4.0 * Float64(a * a))) - 1.0); end return tmp end
code[a_, b_] := If[LessEqual[N[(b * b), $MachinePrecision], 2e-32], N[(N[(N[(4.0 + a), $MachinePrecision] * a + 4.0), $MachinePrecision] * N[(a * a), $MachinePrecision] + -1.0), $MachinePrecision], N[(N[(N[(N[(b * b + N[(N[(-3.0 * a + 1.0), $MachinePrecision] * 4.0 + N[(N[(a * a), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * b), $MachinePrecision] * b + N[(4.0 * N[(a * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b \cdot b \leq 2 \cdot 10^{-32}:\\
\;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(4 + a, a, 4\right), a \cdot a, -1\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(b, b, \mathsf{fma}\left(\mathsf{fma}\left(-3, a, 1\right), 4, \left(a \cdot a\right) \cdot 2\right)\right) \cdot b, b, 4 \cdot \left(a \cdot a\right)\right) - 1\\
\end{array}
\end{array}
if (*.f64 b b) < 2.00000000000000011e-32Initial program 84.8%
Taylor expanded in b around 0
+-commutativeN/A
associate-+l+N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
+-commutativeN/A
lower-fma.f64N/A
Applied rewrites99.9%
Taylor expanded in a around 0
Applied rewrites73.6%
Taylor expanded in b around 0
sub-negN/A
*-commutativeN/A
associate-*l*N/A
+-commutativeN/A
distribute-rgt1-inN/A
*-commutativeN/A
metadata-evalN/A
pow-sqrN/A
distribute-lft-inN/A
associate-+r+N/A
*-commutativeN/A
unpow2N/A
distribute-rgt-inN/A
metadata-evalN/A
lower-fma.f64N/A
Applied rewrites99.9%
if 2.00000000000000011e-32 < (*.f64 b b) Initial program 70.6%
Taylor expanded in b around 0
+-commutativeN/A
associate-+l+N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
+-commutativeN/A
lower-fma.f64N/A
Applied rewrites99.9%
Taylor expanded in a around 0
Applied rewrites99.9%
Final simplification99.9%
(FPCore (a b)
:precision binary64
(if (<= (* b b) 2e-32)
(fma (fma (+ 4.0 a) a 4.0) (* a a) -1.0)
(-
(fma (* (fma (fma 2.0 a -12.0) a (fma b b 4.0)) b) b (* (* 4.0 a) a))
1.0)))
double code(double a, double b) {
double tmp;
if ((b * b) <= 2e-32) {
tmp = fma(fma((4.0 + a), a, 4.0), (a * a), -1.0);
} else {
tmp = fma((fma(fma(2.0, a, -12.0), a, fma(b, b, 4.0)) * b), b, ((4.0 * a) * a)) - 1.0;
}
return tmp;
}
function code(a, b) tmp = 0.0 if (Float64(b * b) <= 2e-32) tmp = fma(fma(Float64(4.0 + a), a, 4.0), Float64(a * a), -1.0); else tmp = Float64(fma(Float64(fma(fma(2.0, a, -12.0), a, fma(b, b, 4.0)) * b), b, Float64(Float64(4.0 * a) * a)) - 1.0); end return tmp end
code[a_, b_] := If[LessEqual[N[(b * b), $MachinePrecision], 2e-32], N[(N[(N[(4.0 + a), $MachinePrecision] * a + 4.0), $MachinePrecision] * N[(a * a), $MachinePrecision] + -1.0), $MachinePrecision], N[(N[(N[(N[(N[(2.0 * a + -12.0), $MachinePrecision] * a + N[(b * b + 4.0), $MachinePrecision]), $MachinePrecision] * b), $MachinePrecision] * b + N[(N[(4.0 * a), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b \cdot b \leq 2 \cdot 10^{-32}:\\
\;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(4 + a, a, 4\right), a \cdot a, -1\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(2, a, -12\right), a, \mathsf{fma}\left(b, b, 4\right)\right) \cdot b, b, \left(4 \cdot a\right) \cdot a\right) - 1\\
\end{array}
\end{array}
if (*.f64 b b) < 2.00000000000000011e-32Initial program 84.8%
Taylor expanded in b around 0
+-commutativeN/A
associate-+l+N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
+-commutativeN/A
lower-fma.f64N/A
Applied rewrites99.9%
Taylor expanded in a around 0
Applied rewrites73.6%
Taylor expanded in b around 0
sub-negN/A
*-commutativeN/A
associate-*l*N/A
+-commutativeN/A
distribute-rgt1-inN/A
*-commutativeN/A
metadata-evalN/A
pow-sqrN/A
distribute-lft-inN/A
associate-+r+N/A
*-commutativeN/A
unpow2N/A
distribute-rgt-inN/A
metadata-evalN/A
lower-fma.f64N/A
Applied rewrites99.9%
if 2.00000000000000011e-32 < (*.f64 b b) Initial program 70.6%
Taylor expanded in b around 0
+-commutativeN/A
associate-+l+N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
+-commutativeN/A
lower-fma.f64N/A
Applied rewrites99.9%
Taylor expanded in a around 0
Applied rewrites99.9%
Final simplification99.9%
(FPCore (a b) :precision binary64 (if (<= (* b b) 2e-32) (fma (fma (+ 4.0 a) a 4.0) (* a a) -1.0) (- (fma (* (fma b b (* (* a a) 2.0)) b) b (* 4.0 (* a a))) 1.0)))
double code(double a, double b) {
double tmp;
if ((b * b) <= 2e-32) {
tmp = fma(fma((4.0 + a), a, 4.0), (a * a), -1.0);
} else {
tmp = fma((fma(b, b, ((a * a) * 2.0)) * b), b, (4.0 * (a * a))) - 1.0;
}
return tmp;
}
function code(a, b) tmp = 0.0 if (Float64(b * b) <= 2e-32) tmp = fma(fma(Float64(4.0 + a), a, 4.0), Float64(a * a), -1.0); else tmp = Float64(fma(Float64(fma(b, b, Float64(Float64(a * a) * 2.0)) * b), b, Float64(4.0 * Float64(a * a))) - 1.0); end return tmp end
code[a_, b_] := If[LessEqual[N[(b * b), $MachinePrecision], 2e-32], N[(N[(N[(4.0 + a), $MachinePrecision] * a + 4.0), $MachinePrecision] * N[(a * a), $MachinePrecision] + -1.0), $MachinePrecision], N[(N[(N[(N[(b * b + N[(N[(a * a), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision] * b), $MachinePrecision] * b + N[(4.0 * N[(a * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b \cdot b \leq 2 \cdot 10^{-32}:\\
\;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(4 + a, a, 4\right), a \cdot a, -1\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(b, b, \left(a \cdot a\right) \cdot 2\right) \cdot b, b, 4 \cdot \left(a \cdot a\right)\right) - 1\\
\end{array}
\end{array}
if (*.f64 b b) < 2.00000000000000011e-32Initial program 84.8%
Taylor expanded in b around 0
+-commutativeN/A
associate-+l+N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
+-commutativeN/A
lower-fma.f64N/A
Applied rewrites99.9%
Taylor expanded in a around 0
Applied rewrites73.6%
Taylor expanded in b around 0
sub-negN/A
*-commutativeN/A
associate-*l*N/A
+-commutativeN/A
distribute-rgt1-inN/A
*-commutativeN/A
metadata-evalN/A
pow-sqrN/A
distribute-lft-inN/A
associate-+r+N/A
*-commutativeN/A
unpow2N/A
distribute-rgt-inN/A
metadata-evalN/A
lower-fma.f64N/A
Applied rewrites99.9%
if 2.00000000000000011e-32 < (*.f64 b b) Initial program 70.6%
Taylor expanded in b around 0
+-commutativeN/A
associate-+l+N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
+-commutativeN/A
lower-fma.f64N/A
Applied rewrites99.9%
Taylor expanded in a around 0
Applied rewrites99.9%
Taylor expanded in a around inf
Applied rewrites98.6%
Final simplification99.2%
(FPCore (a b) :precision binary64 (if (<= (* b b) 2e-32) (fma (fma (+ 4.0 a) a 4.0) (* a a) -1.0) (- (* (fma b b (fma -12.0 a 4.0)) (* b b)) 1.0)))
double code(double a, double b) {
double tmp;
if ((b * b) <= 2e-32) {
tmp = fma(fma((4.0 + a), a, 4.0), (a * a), -1.0);
} else {
tmp = (fma(b, b, fma(-12.0, a, 4.0)) * (b * b)) - 1.0;
}
return tmp;
}
function code(a, b) tmp = 0.0 if (Float64(b * b) <= 2e-32) tmp = fma(fma(Float64(4.0 + a), a, 4.0), Float64(a * a), -1.0); else tmp = Float64(Float64(fma(b, b, fma(-12.0, a, 4.0)) * Float64(b * b)) - 1.0); end return tmp end
code[a_, b_] := If[LessEqual[N[(b * b), $MachinePrecision], 2e-32], N[(N[(N[(4.0 + a), $MachinePrecision] * a + 4.0), $MachinePrecision] * N[(a * a), $MachinePrecision] + -1.0), $MachinePrecision], N[(N[(N[(b * b + N[(-12.0 * a + 4.0), $MachinePrecision]), $MachinePrecision] * N[(b * b), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b \cdot b \leq 2 \cdot 10^{-32}:\\
\;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(4 + a, a, 4\right), a \cdot a, -1\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(b, b, \mathsf{fma}\left(-12, a, 4\right)\right) \cdot \left(b \cdot b\right) - 1\\
\end{array}
\end{array}
if (*.f64 b b) < 2.00000000000000011e-32Initial program 84.8%
Taylor expanded in b around 0
+-commutativeN/A
associate-+l+N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
+-commutativeN/A
lower-fma.f64N/A
Applied rewrites99.9%
Taylor expanded in a around 0
Applied rewrites73.6%
Taylor expanded in b around 0
sub-negN/A
*-commutativeN/A
associate-*l*N/A
+-commutativeN/A
distribute-rgt1-inN/A
*-commutativeN/A
metadata-evalN/A
pow-sqrN/A
distribute-lft-inN/A
associate-+r+N/A
*-commutativeN/A
unpow2N/A
distribute-rgt-inN/A
metadata-evalN/A
lower-fma.f64N/A
Applied rewrites99.9%
if 2.00000000000000011e-32 < (*.f64 b b) Initial program 70.6%
Taylor expanded in a around 0
associate-+r+N/A
+-commutativeN/A
metadata-evalN/A
pow-sqrN/A
associate-*r*N/A
distribute-rgt-outN/A
distribute-lft-outN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-fma.f64N/A
lower-fma.f6496.0
Applied rewrites96.0%
Final simplification97.8%
(FPCore (a b) :precision binary64 (if (<= (* b b) 2e-32) (fma (fma (+ 4.0 a) a 4.0) (* a a) -1.0) (fma (* (fma b b 4.0) b) b -1.0)))
double code(double a, double b) {
double tmp;
if ((b * b) <= 2e-32) {
tmp = fma(fma((4.0 + a), a, 4.0), (a * a), -1.0);
} else {
tmp = fma((fma(b, b, 4.0) * b), b, -1.0);
}
return tmp;
}
function code(a, b) tmp = 0.0 if (Float64(b * b) <= 2e-32) tmp = fma(fma(Float64(4.0 + a), a, 4.0), Float64(a * a), -1.0); else tmp = fma(Float64(fma(b, b, 4.0) * b), b, -1.0); end return tmp end
code[a_, b_] := If[LessEqual[N[(b * b), $MachinePrecision], 2e-32], N[(N[(N[(4.0 + a), $MachinePrecision] * a + 4.0), $MachinePrecision] * N[(a * a), $MachinePrecision] + -1.0), $MachinePrecision], N[(N[(N[(b * b + 4.0), $MachinePrecision] * b), $MachinePrecision] * b + -1.0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b \cdot b \leq 2 \cdot 10^{-32}:\\
\;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(4 + a, a, 4\right), a \cdot a, -1\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(b, b, 4\right) \cdot b, b, -1\right)\\
\end{array}
\end{array}
if (*.f64 b b) < 2.00000000000000011e-32Initial program 84.8%
Taylor expanded in b around 0
+-commutativeN/A
associate-+l+N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
+-commutativeN/A
lower-fma.f64N/A
Applied rewrites99.9%
Taylor expanded in a around 0
Applied rewrites73.6%
Taylor expanded in b around 0
sub-negN/A
*-commutativeN/A
associate-*l*N/A
+-commutativeN/A
distribute-rgt1-inN/A
*-commutativeN/A
metadata-evalN/A
pow-sqrN/A
distribute-lft-inN/A
associate-+r+N/A
*-commutativeN/A
unpow2N/A
distribute-rgt-inN/A
metadata-evalN/A
lower-fma.f64N/A
Applied rewrites99.9%
if 2.00000000000000011e-32 < (*.f64 b b) Initial program 70.6%
Taylor expanded in b around 0
+-commutativeN/A
associate-+l+N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
+-commutativeN/A
lower-fma.f64N/A
Applied rewrites99.9%
Taylor expanded in a around 0
sub-negN/A
metadata-evalN/A
pow-sqrN/A
distribute-rgt-inN/A
*-commutativeN/A
metadata-evalN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f6493.5
Applied rewrites93.5%
Final simplification96.5%
(FPCore (a b) :precision binary64 (if (<= (* b b) 2e-32) (fma (* (fma (+ 4.0 a) a 4.0) a) a -1.0) (fma (* (fma b b 4.0) b) b -1.0)))
double code(double a, double b) {
double tmp;
if ((b * b) <= 2e-32) {
tmp = fma((fma((4.0 + a), a, 4.0) * a), a, -1.0);
} else {
tmp = fma((fma(b, b, 4.0) * b), b, -1.0);
}
return tmp;
}
function code(a, b) tmp = 0.0 if (Float64(b * b) <= 2e-32) tmp = fma(Float64(fma(Float64(4.0 + a), a, 4.0) * a), a, -1.0); else tmp = fma(Float64(fma(b, b, 4.0) * b), b, -1.0); end return tmp end
code[a_, b_] := If[LessEqual[N[(b * b), $MachinePrecision], 2e-32], N[(N[(N[(N[(4.0 + a), $MachinePrecision] * a + 4.0), $MachinePrecision] * a), $MachinePrecision] * a + -1.0), $MachinePrecision], N[(N[(N[(b * b + 4.0), $MachinePrecision] * b), $MachinePrecision] * b + -1.0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b \cdot b \leq 2 \cdot 10^{-32}:\\
\;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(4 + a, a, 4\right) \cdot a, a, -1\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(b, b, 4\right) \cdot b, b, -1\right)\\
\end{array}
\end{array}
if (*.f64 b b) < 2.00000000000000011e-32Initial program 84.8%
Taylor expanded in b around 0
+-commutativeN/A
associate-+l+N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
+-commutativeN/A
lower-fma.f64N/A
Applied rewrites99.9%
Taylor expanded in b around 0
sub-negN/A
*-commutativeN/A
associate-*l*N/A
+-commutativeN/A
distribute-rgt1-inN/A
*-commutativeN/A
metadata-evalN/A
pow-sqrN/A
distribute-lft-inN/A
associate-+r+N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
metadata-evalN/A
lower-fma.f64N/A
Applied rewrites99.9%
if 2.00000000000000011e-32 < (*.f64 b b) Initial program 70.6%
Taylor expanded in b around 0
+-commutativeN/A
associate-+l+N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
+-commutativeN/A
lower-fma.f64N/A
Applied rewrites99.9%
Taylor expanded in a around 0
sub-negN/A
metadata-evalN/A
pow-sqrN/A
distribute-rgt-inN/A
*-commutativeN/A
metadata-evalN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f6493.5
Applied rewrites93.5%
Final simplification96.4%
(FPCore (a b) :precision binary64 (if (<= (* b b) 2e-32) (fma (* (+ 4.0 a) a) (* a a) -1.0) (fma (* (fma b b 4.0) b) b -1.0)))
double code(double a, double b) {
double tmp;
if ((b * b) <= 2e-32) {
tmp = fma(((4.0 + a) * a), (a * a), -1.0);
} else {
tmp = fma((fma(b, b, 4.0) * b), b, -1.0);
}
return tmp;
}
function code(a, b) tmp = 0.0 if (Float64(b * b) <= 2e-32) tmp = fma(Float64(Float64(4.0 + a) * a), Float64(a * a), -1.0); else tmp = fma(Float64(fma(b, b, 4.0) * b), b, -1.0); end return tmp end
code[a_, b_] := If[LessEqual[N[(b * b), $MachinePrecision], 2e-32], N[(N[(N[(4.0 + a), $MachinePrecision] * a), $MachinePrecision] * N[(a * a), $MachinePrecision] + -1.0), $MachinePrecision], N[(N[(N[(b * b + 4.0), $MachinePrecision] * b), $MachinePrecision] * b + -1.0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b \cdot b \leq 2 \cdot 10^{-32}:\\
\;\;\;\;\mathsf{fma}\left(\left(4 + a\right) \cdot a, a \cdot a, -1\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(b, b, 4\right) \cdot b, b, -1\right)\\
\end{array}
\end{array}
if (*.f64 b b) < 2.00000000000000011e-32Initial program 84.8%
Taylor expanded in b around 0
+-commutativeN/A
associate-+l+N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
+-commutativeN/A
lower-fma.f64N/A
Applied rewrites99.9%
Taylor expanded in a around 0
Applied rewrites73.6%
Taylor expanded in b around 0
sub-negN/A
*-commutativeN/A
associate-*l*N/A
+-commutativeN/A
distribute-rgt1-inN/A
*-commutativeN/A
metadata-evalN/A
pow-sqrN/A
distribute-lft-inN/A
associate-+r+N/A
*-commutativeN/A
unpow2N/A
distribute-rgt-inN/A
metadata-evalN/A
lower-fma.f64N/A
Applied rewrites99.9%
Taylor expanded in a around inf
Applied rewrites97.8%
if 2.00000000000000011e-32 < (*.f64 b b) Initial program 70.6%
Taylor expanded in b around 0
+-commutativeN/A
associate-+l+N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
+-commutativeN/A
lower-fma.f64N/A
Applied rewrites99.9%
Taylor expanded in a around 0
sub-negN/A
metadata-evalN/A
pow-sqrN/A
distribute-rgt-inN/A
*-commutativeN/A
metadata-evalN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f6493.5
Applied rewrites93.5%
Final simplification95.5%
(FPCore (a b) :precision binary64 (if (<= (* b b) 2e-32) (fma (* a a) (* a a) -1.0) (fma (* (fma b b 4.0) b) b -1.0)))
double code(double a, double b) {
double tmp;
if ((b * b) <= 2e-32) {
tmp = fma((a * a), (a * a), -1.0);
} else {
tmp = fma((fma(b, b, 4.0) * b), b, -1.0);
}
return tmp;
}
function code(a, b) tmp = 0.0 if (Float64(b * b) <= 2e-32) tmp = fma(Float64(a * a), Float64(a * a), -1.0); else tmp = fma(Float64(fma(b, b, 4.0) * b), b, -1.0); end return tmp end
code[a_, b_] := If[LessEqual[N[(b * b), $MachinePrecision], 2e-32], N[(N[(a * a), $MachinePrecision] * N[(a * a), $MachinePrecision] + -1.0), $MachinePrecision], N[(N[(N[(b * b + 4.0), $MachinePrecision] * b), $MachinePrecision] * b + -1.0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b \cdot b \leq 2 \cdot 10^{-32}:\\
\;\;\;\;\mathsf{fma}\left(a \cdot a, a \cdot a, -1\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(b, b, 4\right) \cdot b, b, -1\right)\\
\end{array}
\end{array}
if (*.f64 b b) < 2.00000000000000011e-32Initial program 84.8%
Taylor expanded in b around 0
+-commutativeN/A
associate-+l+N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
+-commutativeN/A
lower-fma.f64N/A
Applied rewrites99.9%
Taylor expanded in b around 0
sub-negN/A
*-commutativeN/A
associate-*l*N/A
+-commutativeN/A
distribute-rgt1-inN/A
*-commutativeN/A
metadata-evalN/A
pow-sqrN/A
distribute-lft-inN/A
associate-+r+N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
metadata-evalN/A
lower-fma.f64N/A
Applied rewrites99.9%
Taylor expanded in a around inf
Applied rewrites96.9%
Applied rewrites96.9%
if 2.00000000000000011e-32 < (*.f64 b b) Initial program 70.6%
Taylor expanded in b around 0
+-commutativeN/A
associate-+l+N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
+-commutativeN/A
lower-fma.f64N/A
Applied rewrites99.9%
Taylor expanded in a around 0
sub-negN/A
metadata-evalN/A
pow-sqrN/A
distribute-rgt-inN/A
*-commutativeN/A
metadata-evalN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f6493.5
Applied rewrites93.5%
(FPCore (a b) :precision binary64 (fma (* a a) (* a a) -1.0))
double code(double a, double b) {
return fma((a * a), (a * a), -1.0);
}
function code(a, b) return fma(Float64(a * a), Float64(a * a), -1.0) end
code[a_, b_] := N[(N[(a * a), $MachinePrecision] * N[(a * a), $MachinePrecision] + -1.0), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(a \cdot a, a \cdot a, -1\right)
\end{array}
Initial program 77.2%
Taylor expanded in b around 0
+-commutativeN/A
associate-+l+N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
+-commutativeN/A
lower-fma.f64N/A
Applied rewrites99.9%
Taylor expanded in b around 0
sub-negN/A
*-commutativeN/A
associate-*l*N/A
+-commutativeN/A
distribute-rgt1-inN/A
*-commutativeN/A
metadata-evalN/A
pow-sqrN/A
distribute-lft-inN/A
associate-+r+N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
metadata-evalN/A
lower-fma.f64N/A
Applied rewrites64.2%
Taylor expanded in a around inf
Applied rewrites62.8%
Applied rewrites62.8%
(FPCore (a b) :precision binary64 (fma (* 4.0 a) a -1.0))
double code(double a, double b) {
return fma((4.0 * a), a, -1.0);
}
function code(a, b) return fma(Float64(4.0 * a), a, -1.0) end
code[a_, b_] := N[(N[(4.0 * a), $MachinePrecision] * a + -1.0), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(4 \cdot a, a, -1\right)
\end{array}
Initial program 77.2%
Taylor expanded in b around 0
+-commutativeN/A
associate-+l+N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
+-commutativeN/A
lower-fma.f64N/A
Applied rewrites99.9%
Taylor expanded in b around 0
sub-negN/A
*-commutativeN/A
associate-*l*N/A
+-commutativeN/A
distribute-rgt1-inN/A
*-commutativeN/A
metadata-evalN/A
pow-sqrN/A
distribute-lft-inN/A
associate-+r+N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
metadata-evalN/A
lower-fma.f64N/A
Applied rewrites64.2%
Taylor expanded in a around 0
Applied rewrites47.2%
(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.2%
Taylor expanded in b around 0
+-commutativeN/A
associate-+l+N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
+-commutativeN/A
lower-fma.f64N/A
Applied rewrites99.9%
Taylor expanded in b around 0
sub-negN/A
*-commutativeN/A
associate-*l*N/A
+-commutativeN/A
distribute-rgt1-inN/A
*-commutativeN/A
metadata-evalN/A
pow-sqrN/A
distribute-lft-inN/A
associate-+r+N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
metadata-evalN/A
lower-fma.f64N/A
Applied rewrites64.2%
Taylor expanded in a around 0
Applied rewrites24.1%
herbie shell --seed 2024250
(FPCore (a b)
:name "Bouland and Aaronson, Equation (25)"
:precision binary64
(- (+ (pow (+ (* a a) (* b b)) 2.0) (* 4.0 (+ (* (* a a) (+ 1.0 a)) (* (* b b) (- 1.0 (* 3.0 a)))))) 1.0))