
(FPCore (a b) :precision binary64 (- (+ (pow (+ (* a a) (* b b)) 2.0) (* 4.0 (* b b))) 1.0))
double code(double a, double b) {
return (pow(((a * a) + (b * b)), 2.0) + (4.0 * (b * b))) - 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 * (b * b))) - 1.0d0
end function
public static double code(double a, double b) {
return (Math.pow(((a * a) + (b * b)), 2.0) + (4.0 * (b * b))) - 1.0;
}
def code(a, b): return (math.pow(((a * a) + (b * b)), 2.0) + (4.0 * (b * b))) - 1.0
function code(a, b) return Float64(Float64((Float64(Float64(a * a) + Float64(b * b)) ^ 2.0) + Float64(4.0 * Float64(b * b))) - 1.0) end
function tmp = code(a, b) tmp = ((((a * a) + (b * b)) ^ 2.0) + (4.0 * (b * b))) - 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[(b * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]
\begin{array}{l}
\\
\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 10 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (a b) :precision binary64 (- (+ (pow (+ (* a a) (* b b)) 2.0) (* 4.0 (* b b))) 1.0))
double code(double a, double b) {
return (pow(((a * a) + (b * b)), 2.0) + (4.0 * (b * b))) - 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 * (b * b))) - 1.0d0
end function
public static double code(double a, double b) {
return (Math.pow(((a * a) + (b * b)), 2.0) + (4.0 * (b * b))) - 1.0;
}
def code(a, b): return (math.pow(((a * a) + (b * b)), 2.0) + (4.0 * (b * b))) - 1.0
function code(a, b) return Float64(Float64((Float64(Float64(a * a) + Float64(b * b)) ^ 2.0) + Float64(4.0 * Float64(b * b))) - 1.0) end
function tmp = code(a, b) tmp = ((((a * a) + (b * b)) ^ 2.0) + (4.0 * (b * b))) - 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[(b * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]
\begin{array}{l}
\\
\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1
\end{array}
(FPCore (a b) :precision binary64 (let* ((t_0 (fma a a (* b b)))) (fma t_0 t_0 (fma b (* b 4.0) -1.0))))
double code(double a, double b) {
double t_0 = fma(a, a, (b * b));
return fma(t_0, t_0, fma(b, (b * 4.0), -1.0));
}
function code(a, b) t_0 = fma(a, a, Float64(b * b)) return fma(t_0, t_0, fma(b, Float64(b * 4.0), -1.0)) end
code[a_, b_] := Block[{t$95$0 = N[(a * a + N[(b * b), $MachinePrecision]), $MachinePrecision]}, N[(t$95$0 * t$95$0 + N[(b * N[(b * 4.0), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(a, a, b \cdot b\right)\\
\mathsf{fma}\left(t\_0, t\_0, \mathsf{fma}\left(b, b \cdot 4, -1\right)\right)
\end{array}
\end{array}
Initial program 99.9%
lift-*.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate--l+N/A
lift-pow.f64N/A
unpow2N/A
lower-fma.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lower-fma.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lower-fma.f64N/A
sub-negN/A
Applied egg-rr99.9%
(FPCore (a b) :precision binary64 (let* ((t_0 (* (* b b) 4.0))) (if (<= (+ (pow (fma a a (* b b)) 2.0) t_0) 2e-9) -1.0 t_0)))
double code(double a, double b) {
double t_0 = (b * b) * 4.0;
double tmp;
if ((pow(fma(a, a, (b * b)), 2.0) + t_0) <= 2e-9) {
tmp = -1.0;
} else {
tmp = t_0;
}
return tmp;
}
function code(a, b) t_0 = Float64(Float64(b * b) * 4.0) tmp = 0.0 if (Float64((fma(a, a, Float64(b * b)) ^ 2.0) + t_0) <= 2e-9) tmp = -1.0; else tmp = t_0; end return tmp end
code[a_, b_] := Block[{t$95$0 = N[(N[(b * b), $MachinePrecision] * 4.0), $MachinePrecision]}, If[LessEqual[N[(N[Power[N[(a * a + N[(b * b), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] + t$95$0), $MachinePrecision], 2e-9], -1.0, t$95$0]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(b \cdot b\right) \cdot 4\\
\mathbf{if}\;{\left(\mathsf{fma}\left(a, a, b \cdot b\right)\right)}^{2} + t\_0 \leq 2 \cdot 10^{-9}:\\
\;\;\;\;-1\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\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 b b))) < 2.00000000000000012e-9Initial program 100.0%
Taylor expanded in a around 0
sub-negN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
metadata-evalN/A
pow-sqrN/A
unpow2N/A
associate-*l*N/A
distribute-lft-outN/A
distribute-lft-outN/A
lower-fma.f64N/A
lower-*.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
metadata-eval99.5
Simplified99.5%
Taylor expanded in b around 0
Simplified99.3%
if 2.00000000000000012e-9 < (+.f64 (pow.f64 (+.f64 (*.f64 a a) (*.f64 b b)) #s(literal 2 binary64)) (*.f64 #s(literal 4 binary64) (*.f64 b b))) Initial program 99.8%
Taylor expanded in a around 0
sub-negN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
metadata-evalN/A
pow-sqrN/A
unpow2N/A
associate-*l*N/A
distribute-lft-outN/A
distribute-lft-outN/A
lower-fma.f64N/A
lower-*.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
metadata-eval62.4
Simplified62.4%
Taylor expanded in b around inf
distribute-lft-inN/A
*-rgt-identityN/A
metadata-evalN/A
pow-sqrN/A
*-commutativeN/A
associate-*r*N/A
metadata-evalN/A
pow-sqrN/A
associate-*l*N/A
rgt-mult-inverseN/A
*-rgt-identityN/A
distribute-lft-inN/A
+-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f6462.5
Simplified62.5%
Taylor expanded in b around 0
Simplified36.3%
Final simplification52.8%
(FPCore (a b) :precision binary64 (if (<= (fma a a 0.0) 2e+48) (fma (* b b) (fma b b (fma 2.0 (fma a a 0.0) 4.0)) -1.0) (* a (* a (fma b (* b 2.0) (fma a a 0.0))))))
double code(double a, double b) {
double tmp;
if (fma(a, a, 0.0) <= 2e+48) {
tmp = fma((b * b), fma(b, b, fma(2.0, fma(a, a, 0.0), 4.0)), -1.0);
} else {
tmp = a * (a * fma(b, (b * 2.0), fma(a, a, 0.0)));
}
return tmp;
}
function code(a, b) tmp = 0.0 if (fma(a, a, 0.0) <= 2e+48) tmp = fma(Float64(b * b), fma(b, b, fma(2.0, fma(a, a, 0.0), 4.0)), -1.0); else tmp = Float64(a * Float64(a * fma(b, Float64(b * 2.0), fma(a, a, 0.0)))); end return tmp end
code[a_, b_] := If[LessEqual[N[(a * a + 0.0), $MachinePrecision], 2e+48], N[(N[(b * b), $MachinePrecision] * N[(b * b + N[(2.0 * N[(a * a + 0.0), $MachinePrecision] + 4.0), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision], N[(a * N[(a * N[(b * N[(b * 2.0), $MachinePrecision] + N[(a * a + 0.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\mathsf{fma}\left(a, a, 0\right) \leq 2 \cdot 10^{+48}:\\
\;\;\;\;\mathsf{fma}\left(b \cdot b, \mathsf{fma}\left(b, b, \mathsf{fma}\left(2, \mathsf{fma}\left(a, a, 0\right), 4\right)\right), -1\right)\\
\mathbf{else}:\\
\;\;\;\;a \cdot \left(a \cdot \mathsf{fma}\left(b, b \cdot 2, \mathsf{fma}\left(a, a, 0\right)\right)\right)\\
\end{array}
\end{array}
if (*.f64 a a) < 2.00000000000000009e48Initial program 99.9%
Taylor expanded in a around 0
associate-+r-N/A
associate--l+N/A
associate-+r+N/A
associate-*r*N/A
distribute-rgt-inN/A
+-commutativeN/A
sub-negN/A
associate-+l+N/A
metadata-evalN/A
pow-sqrN/A
distribute-lft-inN/A
associate-+r+N/A
lower-fma.f64N/A
Simplified97.9%
if 2.00000000000000009e48 < (*.f64 a a) Initial program 99.9%
Taylor expanded in a around inf
distribute-lft-inN/A
*-rgt-identityN/A
metadata-evalN/A
pow-sqrN/A
*-commutativeN/A
associate-*r/N/A
associate-*l/N/A
associate-/l*N/A
metadata-evalN/A
pow-sqrN/A
associate-/l*N/A
*-inversesN/A
*-rgt-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
unpow2N/A
associate-*l*N/A
Simplified98.4%
Final simplification98.1%
(FPCore (a b) :precision binary64 (if (<= (fma a a 0.0) 2e+48) (fma b (* b (fma b b 4.0)) -1.0) (* a (* a (fma b (* b 2.0) (fma a a 0.0))))))
double code(double a, double b) {
double tmp;
if (fma(a, a, 0.0) <= 2e+48) {
tmp = fma(b, (b * fma(b, b, 4.0)), -1.0);
} else {
tmp = a * (a * fma(b, (b * 2.0), fma(a, a, 0.0)));
}
return tmp;
}
function code(a, b) tmp = 0.0 if (fma(a, a, 0.0) <= 2e+48) tmp = fma(b, Float64(b * fma(b, b, 4.0)), -1.0); else tmp = Float64(a * Float64(a * fma(b, Float64(b * 2.0), fma(a, a, 0.0)))); end return tmp end
code[a_, b_] := If[LessEqual[N[(a * a + 0.0), $MachinePrecision], 2e+48], N[(b * N[(b * N[(b * b + 4.0), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision], N[(a * N[(a * N[(b * N[(b * 2.0), $MachinePrecision] + N[(a * a + 0.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\mathsf{fma}\left(a, a, 0\right) \leq 2 \cdot 10^{+48}:\\
\;\;\;\;\mathsf{fma}\left(b, b \cdot \mathsf{fma}\left(b, b, 4\right), -1\right)\\
\mathbf{else}:\\
\;\;\;\;a \cdot \left(a \cdot \mathsf{fma}\left(b, b \cdot 2, \mathsf{fma}\left(a, a, 0\right)\right)\right)\\
\end{array}
\end{array}
if (*.f64 a a) < 2.00000000000000009e48Initial program 99.9%
Taylor expanded in a around 0
metadata-evalN/A
pow-sqrN/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6497.7
Simplified97.7%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate--l+N/A
lift-*.f64N/A
*-commutativeN/A
lower-fma.f64N/A
sub-negN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
metadata-evalN/A
lower-fma.f64N/A
lower-*.f6497.8
Applied egg-rr97.8%
if 2.00000000000000009e48 < (*.f64 a a) Initial program 99.9%
Taylor expanded in a around inf
distribute-lft-inN/A
*-rgt-identityN/A
metadata-evalN/A
pow-sqrN/A
*-commutativeN/A
associate-*r/N/A
associate-*l/N/A
associate-/l*N/A
metadata-evalN/A
pow-sqrN/A
associate-/l*N/A
*-inversesN/A
*-rgt-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
unpow2N/A
associate-*l*N/A
Simplified98.4%
Final simplification98.1%
(FPCore (a b) :precision binary64 (if (<= (fma a a 0.0) 2e+48) (fma b (* b (fma b b 4.0)) -1.0) (* a (* a (fma a a (* b b))))))
double code(double a, double b) {
double tmp;
if (fma(a, a, 0.0) <= 2e+48) {
tmp = fma(b, (b * fma(b, b, 4.0)), -1.0);
} else {
tmp = a * (a * fma(a, a, (b * b)));
}
return tmp;
}
function code(a, b) tmp = 0.0 if (fma(a, a, 0.0) <= 2e+48) tmp = fma(b, Float64(b * fma(b, b, 4.0)), -1.0); else tmp = Float64(a * Float64(a * fma(a, a, Float64(b * b)))); end return tmp end
code[a_, b_] := If[LessEqual[N[(a * a + 0.0), $MachinePrecision], 2e+48], N[(b * N[(b * N[(b * b + 4.0), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision], N[(a * N[(a * N[(a * a + N[(b * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\mathsf{fma}\left(a, a, 0\right) \leq 2 \cdot 10^{+48}:\\
\;\;\;\;\mathsf{fma}\left(b, b \cdot \mathsf{fma}\left(b, b, 4\right), -1\right)\\
\mathbf{else}:\\
\;\;\;\;a \cdot \left(a \cdot \mathsf{fma}\left(a, a, b \cdot b\right)\right)\\
\end{array}
\end{array}
if (*.f64 a a) < 2.00000000000000009e48Initial program 99.9%
Taylor expanded in a around 0
sub-negN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
metadata-evalN/A
pow-sqrN/A
unpow2N/A
associate-*l*N/A
distribute-lft-outN/A
distribute-lft-outN/A
lower-fma.f64N/A
lower-*.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
metadata-eval97.7
Simplified97.7%
if 2.00000000000000009e48 < (*.f64 a a) Initial program 99.9%
lift-*.f64N/A
lift-*.f64N/A
lift-+.f64N/A
unpow2N/A
lift-+.f64N/A
flip-+N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lower-fma.f64N/A
clear-numN/A
flip-+N/A
lift-+.f64N/A
Applied egg-rr99.9%
Taylor expanded in a around inf
unpow2N/A
lower-*.f6498.2
Simplified98.2%
Taylor expanded in a around inf
distribute-rgt-inN/A
*-lft-identityN/A
metadata-evalN/A
pow-sqrN/A
metadata-evalN/A
pow-sqrN/A
associate-*r*N/A
associate-*l/N/A
associate-/l*N/A
*-inversesN/A
*-rgt-identityN/A
distribute-rgt-inN/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
*-rgt-identityN/A
*-lft-identityN/A
*-inversesN/A
associate-*l/N/A
associate-*r/N/A
Simplified98.3%
Final simplification98.0%
(FPCore (a b) :precision binary64 (if (<= (* b b) 5e+74) (fma a (* a (fma a a 0.0)) -1.0) (* b (* b (* b b)))))
double code(double a, double b) {
double tmp;
if ((b * b) <= 5e+74) {
tmp = fma(a, (a * fma(a, a, 0.0)), -1.0);
} else {
tmp = b * (b * (b * b));
}
return tmp;
}
function code(a, b) tmp = 0.0 if (Float64(b * b) <= 5e+74) tmp = fma(a, Float64(a * fma(a, a, 0.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], 5e+74], N[(a * N[(a * N[(a * a + 0.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 5 \cdot 10^{+74}:\\
\;\;\;\;\mathsf{fma}\left(a, a \cdot \mathsf{fma}\left(a, a, 0\right), -1\right)\\
\mathbf{else}:\\
\;\;\;\;b \cdot \left(b \cdot \left(b \cdot b\right)\right)\\
\end{array}
\end{array}
if (*.f64 b b) < 4.99999999999999963e74Initial program 99.8%
Taylor expanded in b around 0
sub-negN/A
metadata-evalN/A
pow-sqrN/A
unpow2N/A
associate-*l*N/A
lower-fma.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
metadata-eval94.3
Simplified94.3%
if 4.99999999999999963e74 < (*.f64 b b) Initial program 99.9%
Taylor expanded in b around inf
metadata-evalN/A
pow-sqrN/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6497.1
Simplified97.1%
Final simplification95.5%
(FPCore (a b) :precision binary64 (if (<= (fma a a 0.0) 1e+22) (fma b (* b 4.0) -1.0) (* a (* a (fma a a 0.0)))))
double code(double a, double b) {
double tmp;
if (fma(a, a, 0.0) <= 1e+22) {
tmp = fma(b, (b * 4.0), -1.0);
} else {
tmp = a * (a * fma(a, a, 0.0));
}
return tmp;
}
function code(a, b) tmp = 0.0 if (fma(a, a, 0.0) <= 1e+22) tmp = fma(b, Float64(b * 4.0), -1.0); else tmp = Float64(a * Float64(a * fma(a, a, 0.0))); end return tmp end
code[a_, b_] := If[LessEqual[N[(a * a + 0.0), $MachinePrecision], 1e+22], N[(b * N[(b * 4.0), $MachinePrecision] + -1.0), $MachinePrecision], N[(a * N[(a * N[(a * a + 0.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\mathsf{fma}\left(a, a, 0\right) \leq 10^{+22}:\\
\;\;\;\;\mathsf{fma}\left(b, b \cdot 4, -1\right)\\
\mathbf{else}:\\
\;\;\;\;a \cdot \left(a \cdot \mathsf{fma}\left(a, a, 0\right)\right)\\
\end{array}
\end{array}
if (*.f64 a a) < 1e22Initial program 99.9%
Taylor expanded in a around 0
sub-negN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
metadata-evalN/A
pow-sqrN/A
unpow2N/A
associate-*l*N/A
distribute-lft-outN/A
distribute-lft-outN/A
lower-fma.f64N/A
lower-*.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
metadata-eval98.2
Simplified98.2%
Taylor expanded in b around 0
Simplified77.6%
if 1e22 < (*.f64 a a) Initial program 99.8%
Taylor expanded in a around inf
metadata-evalN/A
pow-sqrN/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6488.6
Simplified88.6%
Final simplification83.0%
(FPCore (a b) :precision binary64 (let* ((t_0 (fma a a (* b b)))) (fma t_0 t_0 -1.0)))
double code(double a, double b) {
double t_0 = fma(a, a, (b * b));
return fma(t_0, t_0, -1.0);
}
function code(a, b) t_0 = fma(a, a, Float64(b * b)) return fma(t_0, t_0, -1.0) end
code[a_, b_] := Block[{t$95$0 = N[(a * a + N[(b * b), $MachinePrecision]), $MachinePrecision]}, N[(t$95$0 * t$95$0 + -1.0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(a, a, b \cdot b\right)\\
\mathsf{fma}\left(t\_0, t\_0, -1\right)
\end{array}
\end{array}
Initial program 99.9%
lift-*.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate--l+N/A
lift-pow.f64N/A
unpow2N/A
lower-fma.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lower-fma.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lower-fma.f64N/A
sub-negN/A
Applied egg-rr99.9%
Taylor expanded in b around 0
Simplified99.4%
(FPCore (a b) :precision binary64 (fma b (* b 4.0) -1.0))
double code(double a, double b) {
return fma(b, (b * 4.0), -1.0);
}
function code(a, b) return fma(b, Float64(b * 4.0), -1.0) end
code[a_, b_] := N[(b * N[(b * 4.0), $MachinePrecision] + -1.0), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(b, b \cdot 4, -1\right)
\end{array}
Initial program 99.9%
Taylor expanded in a around 0
sub-negN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
metadata-evalN/A
pow-sqrN/A
unpow2N/A
associate-*l*N/A
distribute-lft-outN/A
distribute-lft-outN/A
lower-fma.f64N/A
lower-*.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
metadata-eval72.1
Simplified72.1%
Taylor expanded in b around 0
Simplified52.5%
(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 99.9%
Taylor expanded in a around 0
sub-negN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
metadata-evalN/A
pow-sqrN/A
unpow2N/A
associate-*l*N/A
distribute-lft-outN/A
distribute-lft-outN/A
lower-fma.f64N/A
lower-*.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
metadata-eval72.1
Simplified72.1%
Taylor expanded in b around 0
Simplified26.5%
herbie shell --seed 2024199
(FPCore (a b)
:name "Bouland and Aaronson, Equation (26)"
:precision binary64
(- (+ (pow (+ (* a a) (* b b)) 2.0) (* 4.0 (* b b))) 1.0))