
(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 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) (+ 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 (* b (fma b b (fma a (fma 2.0 a 4.0) 12.0))) (fma (* a a) (fma a a (fma 4.0 (- a) 4.0)) -1.0)))
double code(double a, double b) {
return fma(b, (b * fma(b, b, fma(a, fma(2.0, a, 4.0), 12.0))), fma((a * a), fma(a, a, fma(4.0, -a, 4.0)), -1.0));
}
function code(a, b) return fma(b, Float64(b * fma(b, b, fma(a, fma(2.0, a, 4.0), 12.0))), fma(Float64(a * a), fma(a, a, fma(4.0, Float64(-a), 4.0)), -1.0)) end
code[a_, b_] := N[(b * N[(b * N[(b * b + N[(a * N[(2.0 * a + 4.0), $MachinePrecision] + 12.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(a * a), $MachinePrecision] * N[(a * a + N[(4.0 * (-a) + 4.0), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(b, b \cdot \mathsf{fma}\left(b, b, \mathsf{fma}\left(a, \mathsf{fma}\left(2, a, 4\right), 12\right)\right), \mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, \mathsf{fma}\left(4, -a, 4\right)\right), -1\right)\right)
\end{array}
Initial program 68.3%
Taylor expanded in b around 0
Simplified99.9%
(FPCore (a b)
:precision binary64
(if (<=
(+
(pow (+ (* a a) (* b b)) 2.0)
(* 4.0 (+ (* (* a a) (- 1.0 a)) (* (* b b) (+ a 3.0)))))
0.0001)
-1.0
(* b (* b 12.0))))
double code(double a, double b) {
double tmp;
if ((pow(((a * a) + (b * b)), 2.0) + (4.0 * (((a * a) * (1.0 - a)) + ((b * b) * (a + 3.0))))) <= 0.0001) {
tmp = -1.0;
} else {
tmp = b * (b * 12.0);
}
return tmp;
}
real(8) function code(a, b)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8) :: tmp
if (((((a * a) + (b * b)) ** 2.0d0) + (4.0d0 * (((a * a) * (1.0d0 - a)) + ((b * b) * (a + 3.0d0))))) <= 0.0001d0) then
tmp = -1.0d0
else
tmp = b * (b * 12.0d0)
end if
code = tmp
end function
public static double code(double a, double b) {
double tmp;
if ((Math.pow(((a * a) + (b * b)), 2.0) + (4.0 * (((a * a) * (1.0 - a)) + ((b * b) * (a + 3.0))))) <= 0.0001) {
tmp = -1.0;
} else {
tmp = b * (b * 12.0);
}
return tmp;
}
def code(a, b): tmp = 0 if (math.pow(((a * a) + (b * b)), 2.0) + (4.0 * (((a * a) * (1.0 - a)) + ((b * b) * (a + 3.0))))) <= 0.0001: tmp = -1.0 else: tmp = b * (b * 12.0) return tmp
function code(a, b) tmp = 0.0 if (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(a + 3.0))))) <= 0.0001) tmp = -1.0; else tmp = Float64(b * Float64(b * 12.0)); end return tmp end
function tmp_2 = code(a, b) tmp = 0.0; if (((((a * a) + (b * b)) ^ 2.0) + (4.0 * (((a * a) * (1.0 - a)) + ((b * b) * (a + 3.0))))) <= 0.0001) tmp = -1.0; else tmp = b * (b * 12.0); end tmp_2 = tmp; end
code[a_, b_] := If[LessEqual[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[(a + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.0001], -1.0, N[(b * N[(b * 12.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;{\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(a + 3\right)\right) \leq 0.0001:\\
\;\;\;\;-1\\
\mathbf{else}:\\
\;\;\;\;b \cdot \left(b \cdot 12\right)\\
\end{array}
\end{array}
if (+.f64 (pow.f64 (+.f64 (*.f64 a a) (*.f64 b b)) #s(literal 2 binary64)) (*.f64 #s(literal 4 binary64) (+.f64 (*.f64 (*.f64 a a) (-.f64 #s(literal 1 binary64) a)) (*.f64 (*.f64 b b) (+.f64 #s(literal 3 binary64) a))))) < 1.00000000000000005e-4Initial program 100.0%
Taylor expanded in a around 0
sub-negN/A
metadata-evalN/A
pow-sqrN/A
distribute-rgt-outN/A
+-commutativeN/A
metadata-evalN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-fma.f6498.0
Simplified98.0%
Taylor expanded in b around 0
Simplified96.7%
if 1.00000000000000005e-4 < (+.f64 (pow.f64 (+.f64 (*.f64 a a) (*.f64 b b)) #s(literal 2 binary64)) (*.f64 #s(literal 4 binary64) (+.f64 (*.f64 (*.f64 a a) (-.f64 #s(literal 1 binary64) a)) (*.f64 (*.f64 b b) (+.f64 #s(literal 3 binary64) a))))) Initial program 57.7%
Taylor expanded in a around 0
sub-negN/A
metadata-evalN/A
pow-sqrN/A
distribute-rgt-outN/A
+-commutativeN/A
metadata-evalN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-fma.f6457.5
Simplified57.5%
Taylor expanded in b around 0
sub-negN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
metadata-evalN/A
lower-fma.f64N/A
lower-*.f6436.5
Simplified36.5%
Taylor expanded in b around inf
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6437.1
Simplified37.1%
Final simplification52.0%
(FPCore (a b) :precision binary64 (if (<= (* b b) 1e-5) (fma (* a a) (fma a (+ a -4.0) 4.0) -1.0) (fma b (* b (* b b)) (* a (* a (* a a))))))
double code(double a, double b) {
double tmp;
if ((b * b) <= 1e-5) {
tmp = fma((a * a), fma(a, (a + -4.0), 4.0), -1.0);
} else {
tmp = fma(b, (b * (b * b)), (a * (a * (a * a))));
}
return tmp;
}
function code(a, b) tmp = 0.0 if (Float64(b * b) <= 1e-5) tmp = fma(Float64(a * a), fma(a, Float64(a + -4.0), 4.0), -1.0); else tmp = fma(b, Float64(b * Float64(b * b)), Float64(a * Float64(a * Float64(a * a)))); end return tmp end
code[a_, b_] := If[LessEqual[N[(b * b), $MachinePrecision], 1e-5], N[(N[(a * a), $MachinePrecision] * N[(a * N[(a + -4.0), $MachinePrecision] + 4.0), $MachinePrecision] + -1.0), $MachinePrecision], N[(b * N[(b * N[(b * b), $MachinePrecision]), $MachinePrecision] + N[(a * N[(a * N[(a * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b \cdot b \leq 10^{-5}:\\
\;\;\;\;\mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a + -4, 4\right), -1\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(b, b \cdot \left(b \cdot b\right), a \cdot \left(a \cdot \left(a \cdot a\right)\right)\right)\\
\end{array}
\end{array}
if (*.f64 b b) < 1.00000000000000008e-5Initial program 79.1%
Taylor expanded in b around 0
sub-negN/A
+-commutativeN/A
metadata-evalN/A
pow-sqrN/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt-outN/A
metadata-evalN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-fma.f64N/A
sub-negN/A
mul-1-negN/A
+-commutativeN/A
distribute-lft-inN/A
metadata-evalN/A
lower-fma.f64N/A
mul-1-negN/A
lower-neg.f6499.2
Simplified99.2%
Taylor expanded in a around 0
+-commutativeN/A
lower-fma.f64N/A
sub-negN/A
metadata-evalN/A
+-commutativeN/A
lower-+.f6499.2
Simplified99.2%
if 1.00000000000000008e-5 < (*.f64 b b) Initial program 57.1%
Taylor expanded in b around 0
Simplified100.0%
Taylor expanded in b around inf
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6499.2
Simplified99.2%
Taylor expanded in a around inf
metadata-evalN/A
pow-plusN/A
*-commutativeN/A
lower-*.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6499.2
Simplified99.2%
Final simplification99.2%
(FPCore (a b) :precision binary64 (fma b (* b (* b b)) (fma (* a a) (fma a a (fma 4.0 (- a) 4.0)) -1.0)))
double code(double a, double b) {
return fma(b, (b * (b * b)), fma((a * a), fma(a, a, fma(4.0, -a, 4.0)), -1.0));
}
function code(a, b) return fma(b, Float64(b * Float64(b * b)), fma(Float64(a * a), fma(a, a, fma(4.0, Float64(-a), 4.0)), -1.0)) end
code[a_, b_] := N[(b * N[(b * N[(b * b), $MachinePrecision]), $MachinePrecision] + N[(N[(a * a), $MachinePrecision] * N[(a * a + N[(4.0 * (-a) + 4.0), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(b, b \cdot \left(b \cdot b\right), \mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, \mathsf{fma}\left(4, -a, 4\right)\right), -1\right)\right)
\end{array}
Initial program 68.3%
Taylor expanded in b around 0
Simplified99.9%
Taylor expanded in b around inf
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6499.2
Simplified99.2%
(FPCore (a b)
:precision binary64
(let* ((t_0 (* a (* a (fma a a (* 2.0 (* b b)))))))
(if (<= a -49000.0)
t_0
(if (<= a 520.0) (fma (* b (fma b b 12.0)) b -1.0) t_0))))
double code(double a, double b) {
double t_0 = a * (a * fma(a, a, (2.0 * (b * b))));
double tmp;
if (a <= -49000.0) {
tmp = t_0;
} else if (a <= 520.0) {
tmp = fma((b * fma(b, b, 12.0)), b, -1.0);
} else {
tmp = t_0;
}
return tmp;
}
function code(a, b) t_0 = Float64(a * Float64(a * fma(a, a, Float64(2.0 * Float64(b * b))))) tmp = 0.0 if (a <= -49000.0) tmp = t_0; elseif (a <= 520.0) tmp = fma(Float64(b * fma(b, b, 12.0)), b, -1.0); else tmp = t_0; end return tmp end
code[a_, b_] := Block[{t$95$0 = N[(a * N[(a * N[(a * a + N[(2.0 * N[(b * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[a, -49000.0], t$95$0, If[LessEqual[a, 520.0], N[(N[(b * N[(b * b + 12.0), $MachinePrecision]), $MachinePrecision] * b + -1.0), $MachinePrecision], t$95$0]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := a \cdot \left(a \cdot \mathsf{fma}\left(a, a, 2 \cdot \left(b \cdot b\right)\right)\right)\\
\mathbf{if}\;a \leq -49000:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;a \leq 520:\\
\;\;\;\;\mathsf{fma}\left(b \cdot \mathsf{fma}\left(b, b, 12\right), b, -1\right)\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if a < -49000 or 520 < a Initial program 39.4%
Taylor expanded in b around 0
Simplified99.9%
Taylor expanded in a around inf
metadata-evalN/A
pow-sqrN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6499.5
Simplified99.5%
Taylor expanded in a around inf
lower-*.f64N/A
unpow2N/A
lower-*.f6499.5
Simplified99.5%
Taylor expanded in b around 0
*-commutativeN/A
associate-*r*N/A
metadata-evalN/A
pow-sqrN/A
distribute-rgt-inN/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6497.9
Simplified97.9%
if -49000 < a < 520Initial program 100.0%
Taylor expanded in a around 0
sub-negN/A
metadata-evalN/A
pow-sqrN/A
distribute-rgt-outN/A
+-commutativeN/A
metadata-evalN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-fma.f6498.9
Simplified98.9%
lift-*.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f6498.9
Applied egg-rr98.9%
(FPCore (a b) :precision binary64 (if (<= (* b b) 1e+86) (fma (* a a) (fma a (+ a -4.0) 4.0) -1.0) (* b (* b (fma b b 12.0)))))
double code(double a, double b) {
double tmp;
if ((b * b) <= 1e+86) {
tmp = fma((a * a), fma(a, (a + -4.0), 4.0), -1.0);
} else {
tmp = b * (b * fma(b, b, 12.0));
}
return tmp;
}
function code(a, b) tmp = 0.0 if (Float64(b * b) <= 1e+86) tmp = fma(Float64(a * a), fma(a, Float64(a + -4.0), 4.0), -1.0); else tmp = Float64(b * Float64(b * fma(b, b, 12.0))); end return tmp end
code[a_, b_] := If[LessEqual[N[(b * b), $MachinePrecision], 1e+86], N[(N[(a * a), $MachinePrecision] * N[(a * N[(a + -4.0), $MachinePrecision] + 4.0), $MachinePrecision] + -1.0), $MachinePrecision], N[(b * N[(b * N[(b * b + 12.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b \cdot b \leq 10^{+86}:\\
\;\;\;\;\mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a + -4, 4\right), -1\right)\\
\mathbf{else}:\\
\;\;\;\;b \cdot \left(b \cdot \mathsf{fma}\left(b, b, 12\right)\right)\\
\end{array}
\end{array}
if (*.f64 b b) < 1e86Initial program 75.4%
Taylor expanded in b around 0
sub-negN/A
+-commutativeN/A
metadata-evalN/A
pow-sqrN/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt-outN/A
metadata-evalN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-fma.f64N/A
sub-negN/A
mul-1-negN/A
+-commutativeN/A
distribute-lft-inN/A
metadata-evalN/A
lower-fma.f64N/A
mul-1-negN/A
lower-neg.f6495.3
Simplified95.3%
Taylor expanded in a around 0
+-commutativeN/A
lower-fma.f64N/A
sub-negN/A
metadata-evalN/A
+-commutativeN/A
lower-+.f6495.3
Simplified95.3%
if 1e86 < (*.f64 b b) Initial program 58.7%
Taylor expanded in b around 0
Simplified100.0%
Taylor expanded in a around inf
metadata-evalN/A
pow-sqrN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64100.0
Simplified100.0%
Taylor expanded in a around 0
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f6495.0
Simplified95.0%
Final simplification95.2%
(FPCore (a b) :precision binary64 (if (<= (* b b) 1e+86) (fma (* a a) (fma a a 4.0) -1.0) (* b (* b (fma b b 12.0)))))
double code(double a, double b) {
double tmp;
if ((b * b) <= 1e+86) {
tmp = fma((a * a), fma(a, a, 4.0), -1.0);
} else {
tmp = b * (b * fma(b, b, 12.0));
}
return tmp;
}
function code(a, b) tmp = 0.0 if (Float64(b * b) <= 1e+86) tmp = fma(Float64(a * a), fma(a, a, 4.0), -1.0); else tmp = Float64(b * Float64(b * fma(b, b, 12.0))); end return tmp end
code[a_, b_] := If[LessEqual[N[(b * b), $MachinePrecision], 1e+86], N[(N[(a * a), $MachinePrecision] * N[(a * a + 4.0), $MachinePrecision] + -1.0), $MachinePrecision], N[(b * N[(b * N[(b * b + 12.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b \cdot b \leq 10^{+86}:\\
\;\;\;\;\mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, 4\right), -1\right)\\
\mathbf{else}:\\
\;\;\;\;b \cdot \left(b \cdot \mathsf{fma}\left(b, b, 12\right)\right)\\
\end{array}
\end{array}
if (*.f64 b b) < 1e86Initial program 75.4%
Taylor expanded in b around 0
sub-negN/A
+-commutativeN/A
metadata-evalN/A
pow-sqrN/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt-outN/A
metadata-evalN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-fma.f64N/A
sub-negN/A
mul-1-negN/A
+-commutativeN/A
distribute-lft-inN/A
metadata-evalN/A
lower-fma.f64N/A
mul-1-negN/A
lower-neg.f6495.3
Simplified95.3%
Taylor expanded in a around 0
Simplified94.7%
if 1e86 < (*.f64 b b) Initial program 58.7%
Taylor expanded in b around 0
Simplified100.0%
Taylor expanded in a around inf
metadata-evalN/A
pow-sqrN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64100.0
Simplified100.0%
Taylor expanded in a around 0
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f6495.0
Simplified95.0%
(FPCore (a b) :precision binary64 (if (<= a -2.1e+27) (* a (* a (* a a))) (if (<= a 31000000000000.0) (fma b (* b 12.0) -1.0) (* (* a a) (* a a)))))
double code(double a, double b) {
double tmp;
if (a <= -2.1e+27) {
tmp = a * (a * (a * a));
} else if (a <= 31000000000000.0) {
tmp = fma(b, (b * 12.0), -1.0);
} else {
tmp = (a * a) * (a * a);
}
return tmp;
}
function code(a, b) tmp = 0.0 if (a <= -2.1e+27) tmp = Float64(a * Float64(a * Float64(a * a))); elseif (a <= 31000000000000.0) tmp = fma(b, Float64(b * 12.0), -1.0); else tmp = Float64(Float64(a * a) * Float64(a * a)); end return tmp end
code[a_, b_] := If[LessEqual[a, -2.1e+27], N[(a * N[(a * N[(a * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 31000000000000.0], N[(b * N[(b * 12.0), $MachinePrecision] + -1.0), $MachinePrecision], N[(N[(a * a), $MachinePrecision] * N[(a * a), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;a \leq -2.1 \cdot 10^{+27}:\\
\;\;\;\;a \cdot \left(a \cdot \left(a \cdot a\right)\right)\\
\mathbf{elif}\;a \leq 31000000000000:\\
\;\;\;\;\mathsf{fma}\left(b, b \cdot 12, -1\right)\\
\mathbf{else}:\\
\;\;\;\;\left(a \cdot a\right) \cdot \left(a \cdot a\right)\\
\end{array}
\end{array}
if a < -2.09999999999999995e27Initial program 55.5%
Taylor expanded in a around inf
metadata-evalN/A
pow-plusN/A
*-commutativeN/A
lower-*.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6491.3
Simplified91.3%
if -2.09999999999999995e27 < a < 3.1e13Initial program 98.4%
Taylor expanded in a around 0
sub-negN/A
metadata-evalN/A
pow-sqrN/A
distribute-rgt-outN/A
+-commutativeN/A
metadata-evalN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-fma.f6498.2
Simplified98.2%
Taylor expanded in b around 0
sub-negN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
metadata-evalN/A
lower-fma.f64N/A
lower-*.f6480.6
Simplified80.6%
if 3.1e13 < a Initial program 25.5%
Taylor expanded in a around inf
metadata-evalN/A
pow-plusN/A
*-commutativeN/A
lower-*.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6494.0
Simplified94.0%
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lower-*.f6494.0
Applied egg-rr94.0%
(FPCore (a b)
:precision binary64
(let* ((t_0 (* a (* a (* a a)))))
(if (<= a -2.1e+27)
t_0
(if (<= a 31000000000000.0) (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 <= -2.1e+27) {
tmp = t_0;
} else if (a <= 31000000000000.0) {
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 <= -2.1e+27) tmp = t_0; elseif (a <= 31000000000000.0) 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, -2.1e+27], t$95$0, If[LessEqual[a, 31000000000000.0], 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 -2.1 \cdot 10^{+27}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;a \leq 31000000000000:\\
\;\;\;\;\mathsf{fma}\left(b, b \cdot 12, -1\right)\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if a < -2.09999999999999995e27 or 3.1e13 < a Initial program 38.2%
Taylor expanded in a around inf
metadata-evalN/A
pow-plusN/A
*-commutativeN/A
lower-*.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6492.9
Simplified92.9%
if -2.09999999999999995e27 < a < 3.1e13Initial program 98.4%
Taylor expanded in a around 0
sub-negN/A
metadata-evalN/A
pow-sqrN/A
distribute-rgt-outN/A
+-commutativeN/A
metadata-evalN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-fma.f6498.2
Simplified98.2%
Taylor expanded in b around 0
sub-negN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
metadata-evalN/A
lower-fma.f64N/A
lower-*.f6480.6
Simplified80.6%
(FPCore (a b) :precision binary64 (if (<= (* b b) 5e+291) (fma (* a a) 4.0 -1.0) (* b (* b 12.0))))
double code(double a, double b) {
double tmp;
if ((b * b) <= 5e+291) {
tmp = fma((a * a), 4.0, -1.0);
} else {
tmp = b * (b * 12.0);
}
return tmp;
}
function code(a, b) tmp = 0.0 if (Float64(b * b) <= 5e+291) tmp = fma(Float64(a * a), 4.0, -1.0); else tmp = Float64(b * Float64(b * 12.0)); end return tmp end
code[a_, b_] := If[LessEqual[N[(b * b), $MachinePrecision], 5e+291], N[(N[(a * a), $MachinePrecision] * 4.0 + -1.0), $MachinePrecision], N[(b * N[(b * 12.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b \cdot b \leq 5 \cdot 10^{+291}:\\
\;\;\;\;\mathsf{fma}\left(a \cdot a, 4, -1\right)\\
\mathbf{else}:\\
\;\;\;\;b \cdot \left(b \cdot 12\right)\\
\end{array}
\end{array}
if (*.f64 b b) < 5.0000000000000001e291Initial program 71.7%
Taylor expanded in b around 0
sub-negN/A
+-commutativeN/A
metadata-evalN/A
pow-sqrN/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt-outN/A
metadata-evalN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-fma.f64N/A
sub-negN/A
mul-1-negN/A
+-commutativeN/A
distribute-lft-inN/A
metadata-evalN/A
lower-fma.f64N/A
mul-1-negN/A
lower-neg.f6485.1
Simplified85.1%
Taylor expanded in a around 0
Simplified65.9%
if 5.0000000000000001e291 < (*.f64 b b) Initial program 58.8%
Taylor expanded in a around 0
sub-negN/A
metadata-evalN/A
pow-sqrN/A
distribute-rgt-outN/A
+-commutativeN/A
metadata-evalN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-fma.f64100.0
Simplified100.0%
Taylor expanded in b around 0
sub-negN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
metadata-evalN/A
lower-fma.f64N/A
lower-*.f6497.5
Simplified97.5%
Taylor expanded in b around inf
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6497.5
Simplified97.5%
(FPCore (a b) :precision binary64 (fma b (* b 12.0) -1.0))
double code(double a, double b) {
return fma(b, (b * 12.0), -1.0);
}
function code(a, b) return fma(b, Float64(b * 12.0), -1.0) end
code[a_, b_] := N[(b * N[(b * 12.0), $MachinePrecision] + -1.0), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(b, b \cdot 12, -1\right)
\end{array}
Initial program 68.3%
Taylor expanded in a around 0
sub-negN/A
metadata-evalN/A
pow-sqrN/A
distribute-rgt-outN/A
+-commutativeN/A
metadata-evalN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-fma.f6467.6
Simplified67.6%
Taylor expanded in b around 0
sub-negN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
metadata-evalN/A
lower-fma.f64N/A
lower-*.f6451.8
Simplified51.8%
(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 68.3%
Taylor expanded in a around 0
sub-negN/A
metadata-evalN/A
pow-sqrN/A
distribute-rgt-outN/A
+-commutativeN/A
metadata-evalN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-fma.f6467.6
Simplified67.6%
Taylor expanded in b around 0
Simplified24.7%
herbie shell --seed 2024210
(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))