
(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 13 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
(let* ((t_0
(+
(pow (+ (* a a) (* b b)) 2.0)
(* 4.0 (+ (* (* a a) (- 1.0 a)) (* (* b b) (+ a 3.0)))))))
(if (<= t_0 INFINITY)
(+ t_0 -1.0)
(fma (* a a) (fma a (+ a -4.0) 4.0) -1.0))))
double code(double a, double b) {
double t_0 = pow(((a * a) + (b * b)), 2.0) + (4.0 * (((a * a) * (1.0 - a)) + ((b * b) * (a + 3.0))));
double tmp;
if (t_0 <= ((double) INFINITY)) {
tmp = t_0 + -1.0;
} else {
tmp = fma((a * a), fma(a, (a + -4.0), 4.0), -1.0);
}
return tmp;
}
function code(a, b) t_0 = 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))))) tmp = 0.0 if (t_0 <= Inf) tmp = Float64(t_0 + -1.0); else tmp = fma(Float64(a * a), fma(a, Float64(a + -4.0), 4.0), -1.0); end return tmp end
code[a_, b_] := Block[{t$95$0 = 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]}, If[LessEqual[t$95$0, Infinity], N[(t$95$0 + -1.0), $MachinePrecision], N[(N[(a * a), $MachinePrecision] * N[(a * N[(a + -4.0), $MachinePrecision] + 4.0), $MachinePrecision] + -1.0), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {\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)\\
\mathbf{if}\;t\_0 \leq \infty:\\
\;\;\;\;t\_0 + -1\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a + -4, 4\right), -1\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))))) < +inf.0Initial program 99.9%
if +inf.0 < (+.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 0.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--.f6491.8%
Simplified91.8%
Taylor expanded in a around 0
sub-negN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
+-rgt-identityN/A
unpow2N/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
metadata-evalN/A
+-lowering-+.f6491.8%
Simplified91.8%
+-rgt-identityN/A
*-lowering-*.f6491.8%
Applied egg-rr91.8%
Final simplification97.7%
(FPCore (a b) :precision binary64 (if (<= (* b b) 1e+14) (fma (* a (fma a (+ a -4.0) 4.0)) a -1.0) (+ -1.0 (* b (* b (fma b b 12.0))))))
double code(double a, double b) {
double tmp;
if ((b * b) <= 1e+14) {
tmp = fma((a * fma(a, (a + -4.0), 4.0)), a, -1.0);
} else {
tmp = -1.0 + (b * (b * fma(b, b, 12.0)));
}
return tmp;
}
function code(a, b) tmp = 0.0 if (Float64(b * b) <= 1e+14) tmp = fma(Float64(a * fma(a, Float64(a + -4.0), 4.0)), a, -1.0); else tmp = Float64(-1.0 + Float64(b * Float64(b * fma(b, b, 12.0)))); end return tmp end
code[a_, b_] := If[LessEqual[N[(b * b), $MachinePrecision], 1e+14], N[(N[(a * N[(a * N[(a + -4.0), $MachinePrecision] + 4.0), $MachinePrecision]), $MachinePrecision] * a + -1.0), $MachinePrecision], N[(-1.0 + N[(b * N[(b * N[(b * b + 12.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b \cdot b \leq 10^{+14}:\\
\;\;\;\;\mathsf{fma}\left(a \cdot \mathsf{fma}\left(a, a + -4, 4\right), a, -1\right)\\
\mathbf{else}:\\
\;\;\;\;-1 + b \cdot \left(b \cdot \mathsf{fma}\left(b, b, 12\right)\right)\\
\end{array}
\end{array}
if (*.f64 b b) < 1e14Initial program 86.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--.f6499.5%
Simplified99.5%
Taylor expanded in a around 0
sub-negN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
+-rgt-identityN/A
unpow2N/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
metadata-evalN/A
+-lowering-+.f6499.5%
Simplified99.5%
*-commutativeN/A
+-rgt-identityN/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
+-lowering-+.f6499.5%
Applied egg-rr99.5%
if 1e14 < (*.f64 b b) Initial program 59.6%
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.f6493.4%
Simplified93.4%
Final simplification96.4%
(FPCore (a b) :precision binary64 (if (<= (* b b) 1e+14) (fma (* a a) (fma a (+ a -4.0) 4.0) -1.0) (+ -1.0 (* b (* b (fma b b 12.0))))))
double code(double a, double b) {
double tmp;
if ((b * b) <= 1e+14) {
tmp = fma((a * a), fma(a, (a + -4.0), 4.0), -1.0);
} else {
tmp = -1.0 + (b * (b * fma(b, b, 12.0)));
}
return tmp;
}
function code(a, b) tmp = 0.0 if (Float64(b * b) <= 1e+14) tmp = fma(Float64(a * a), fma(a, Float64(a + -4.0), 4.0), -1.0); else tmp = Float64(-1.0 + Float64(b * Float64(b * fma(b, b, 12.0)))); end return tmp end
code[a_, b_] := If[LessEqual[N[(b * b), $MachinePrecision], 1e+14], N[(N[(a * a), $MachinePrecision] * N[(a * N[(a + -4.0), $MachinePrecision] + 4.0), $MachinePrecision] + -1.0), $MachinePrecision], N[(-1.0 + N[(b * N[(b * N[(b * b + 12.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b \cdot b \leq 10^{+14}:\\
\;\;\;\;\mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a + -4, 4\right), -1\right)\\
\mathbf{else}:\\
\;\;\;\;-1 + b \cdot \left(b \cdot \mathsf{fma}\left(b, b, 12\right)\right)\\
\end{array}
\end{array}
if (*.f64 b b) < 1e14Initial program 86.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--.f6499.5%
Simplified99.5%
Taylor expanded in a around 0
sub-negN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
+-rgt-identityN/A
unpow2N/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
metadata-evalN/A
+-lowering-+.f6499.5%
Simplified99.5%
+-rgt-identityN/A
*-lowering-*.f6499.5%
Applied egg-rr99.5%
if 1e14 < (*.f64 b b) Initial program 59.6%
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.f6493.4%
Simplified93.4%
Final simplification96.4%
(FPCore (a b) :precision binary64 (if (<= (* b b) 1e+14) (fma (* a (* a (+ a -4.0))) a -1.0) (+ -1.0 (* b (* b (fma b b 12.0))))))
double code(double a, double b) {
double tmp;
if ((b * b) <= 1e+14) {
tmp = fma((a * (a * (a + -4.0))), a, -1.0);
} else {
tmp = -1.0 + (b * (b * fma(b, b, 12.0)));
}
return tmp;
}
function code(a, b) tmp = 0.0 if (Float64(b * b) <= 1e+14) tmp = fma(Float64(a * Float64(a * Float64(a + -4.0))), a, -1.0); else tmp = Float64(-1.0 + Float64(b * Float64(b * fma(b, b, 12.0)))); end return tmp end
code[a_, b_] := If[LessEqual[N[(b * b), $MachinePrecision], 1e+14], N[(N[(a * N[(a * N[(a + -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * a + -1.0), $MachinePrecision], N[(-1.0 + N[(b * N[(b * N[(b * b + 12.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b \cdot b \leq 10^{+14}:\\
\;\;\;\;\mathsf{fma}\left(a \cdot \left(a \cdot \left(a + -4\right)\right), a, -1\right)\\
\mathbf{else}:\\
\;\;\;\;-1 + b \cdot \left(b \cdot \mathsf{fma}\left(b, b, 12\right)\right)\\
\end{array}
\end{array}
if (*.f64 b b) < 1e14Initial program 86.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--.f6499.5%
Simplified99.5%
sub-negN/A
+-rgt-identityN/A
*-commutativeN/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
sub0-negN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
sub-negN/A
accelerator-lowering-fma.f64N/A
--lowering--.f64N/A
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
metadata-eval99.5%
Applied egg-rr99.5%
Taylor expanded in a around inf
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
distribute-lft-inN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
metadata-evalN/A
associate-*r*N/A
rgt-mult-inverseN/A
metadata-evalN/A
*-rgt-identityN/A
+-lowering-+.f6497.3%
Simplified97.3%
if 1e14 < (*.f64 b b) Initial program 59.6%
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.f6493.4%
Simplified93.4%
Final simplification95.3%
(FPCore (a b) :precision binary64 (if (<= (* b b) 1e+14) (fma (fma a a 0.0) (fma a a 4.0) -1.0) (+ -1.0 (* b (* b (fma b b 12.0))))))
double code(double a, double b) {
double tmp;
if ((b * b) <= 1e+14) {
tmp = fma(fma(a, a, 0.0), fma(a, a, 4.0), -1.0);
} else {
tmp = -1.0 + (b * (b * fma(b, b, 12.0)));
}
return tmp;
}
function code(a, b) tmp = 0.0 if (Float64(b * b) <= 1e+14) tmp = fma(fma(a, a, 0.0), fma(a, a, 4.0), -1.0); else tmp = Float64(-1.0 + Float64(b * Float64(b * fma(b, b, 12.0)))); end return tmp end
code[a_, b_] := If[LessEqual[N[(b * b), $MachinePrecision], 1e+14], N[(N[(a * a + 0.0), $MachinePrecision] * N[(a * a + 4.0), $MachinePrecision] + -1.0), $MachinePrecision], N[(-1.0 + N[(b * N[(b * N[(b * b + 12.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b \cdot b \leq 10^{+14}:\\
\;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(a, a, 0\right), \mathsf{fma}\left(a, a, 4\right), -1\right)\\
\mathbf{else}:\\
\;\;\;\;-1 + b \cdot \left(b \cdot \mathsf{fma}\left(b, b, 12\right)\right)\\
\end{array}
\end{array}
if (*.f64 b b) < 1e14Initial program 86.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--.f6499.5%
Simplified99.5%
Taylor expanded in a around 0
sub-negN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
+-rgt-identityN/A
unpow2N/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
metadata-evalN/A
+-lowering-+.f6499.5%
Simplified99.5%
Taylor expanded in a around inf
Simplified97.1%
if 1e14 < (*.f64 b b) Initial program 59.6%
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.f6493.4%
Simplified93.4%
Final simplification95.2%
(FPCore (a b) :precision binary64 (if (<= (* b b) 1e+14) (fma (fma a a 0.0) (fma a a 4.0) -1.0) (fma (fma b b 12.0) (* b b) -1.0)))
double code(double a, double b) {
double tmp;
if ((b * b) <= 1e+14) {
tmp = fma(fma(a, a, 0.0), fma(a, a, 4.0), -1.0);
} else {
tmp = fma(fma(b, b, 12.0), (b * b), -1.0);
}
return tmp;
}
function code(a, b) tmp = 0.0 if (Float64(b * b) <= 1e+14) tmp = fma(fma(a, a, 0.0), fma(a, a, 4.0), -1.0); else tmp = fma(fma(b, b, 12.0), Float64(b * b), -1.0); end return tmp end
code[a_, b_] := If[LessEqual[N[(b * b), $MachinePrecision], 1e+14], N[(N[(a * a + 0.0), $MachinePrecision] * N[(a * a + 4.0), $MachinePrecision] + -1.0), $MachinePrecision], N[(N[(b * b + 12.0), $MachinePrecision] * N[(b * b), $MachinePrecision] + -1.0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b \cdot b \leq 10^{+14}:\\
\;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(a, a, 0\right), \mathsf{fma}\left(a, a, 4\right), -1\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(b, b, 12\right), b \cdot b, -1\right)\\
\end{array}
\end{array}
if (*.f64 b b) < 1e14Initial program 86.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--.f6499.5%
Simplified99.5%
Taylor expanded in a around 0
sub-negN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
+-rgt-identityN/A
unpow2N/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
metadata-evalN/A
+-lowering-+.f6499.5%
Simplified99.5%
Taylor expanded in a around inf
Simplified97.1%
if 1e14 < (*.f64 b b) Initial program 59.6%
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.f6493.4%
Simplified93.4%
sub-negN/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
metadata-eval93.3%
Applied egg-rr93.3%
(FPCore (a b) :precision binary64 (if (<= (* b b) 1e+14) (fma (* a (* a a)) a -1.0) (fma (fma b b 12.0) (* b b) -1.0)))
double code(double a, double b) {
double tmp;
if ((b * b) <= 1e+14) {
tmp = fma((a * (a * a)), a, -1.0);
} else {
tmp = fma(fma(b, b, 12.0), (b * b), -1.0);
}
return tmp;
}
function code(a, b) tmp = 0.0 if (Float64(b * b) <= 1e+14) tmp = fma(Float64(a * Float64(a * a)), a, -1.0); else tmp = fma(fma(b, b, 12.0), Float64(b * b), -1.0); end return tmp end
code[a_, b_] := If[LessEqual[N[(b * b), $MachinePrecision], 1e+14], N[(N[(a * N[(a * a), $MachinePrecision]), $MachinePrecision] * a + -1.0), $MachinePrecision], N[(N[(b * b + 12.0), $MachinePrecision] * N[(b * b), $MachinePrecision] + -1.0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b \cdot b \leq 10^{+14}:\\
\;\;\;\;\mathsf{fma}\left(a \cdot \left(a \cdot a\right), a, -1\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(b, b, 12\right), b \cdot b, -1\right)\\
\end{array}
\end{array}
if (*.f64 b b) < 1e14Initial program 86.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.f6496.6%
Simplified96.6%
sub-negN/A
+-rgt-identityN/A
associate-*r*N/A
associate-*r*N/A
pow3N/A
accelerator-lowering-fma.f64N/A
cube-unmultN/A
+-rgt-identityN/A
distribute-lft-inN/A
mul0-rgtN/A
accelerator-lowering-fma.f64N/A
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
metadata-eval96.6%
Applied egg-rr96.6%
Taylor expanded in a around 0
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6496.6%
Simplified96.6%
if 1e14 < (*.f64 b b) Initial program 59.6%
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.f6493.4%
Simplified93.4%
sub-negN/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
metadata-eval93.3%
Applied egg-rr93.3%
(FPCore (a b) :precision binary64 (if (<= (* b b) 1e+14) (fma (* a (* a a)) a -1.0) (* b (* b (* b b)))))
double code(double a, double b) {
double tmp;
if ((b * b) <= 1e+14) {
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) <= 1e+14) tmp = fma(Float64(a * Float64(a * 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], 1e+14], N[(N[(a * N[(a * a), $MachinePrecision]), $MachinePrecision] * a + -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^{+14}:\\
\;\;\;\;\mathsf{fma}\left(a \cdot \left(a \cdot a\right), a, -1\right)\\
\mathbf{else}:\\
\;\;\;\;b \cdot \left(b \cdot \left(b \cdot b\right)\right)\\
\end{array}
\end{array}
if (*.f64 b b) < 1e14Initial program 86.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.f6496.6%
Simplified96.6%
sub-negN/A
+-rgt-identityN/A
associate-*r*N/A
associate-*r*N/A
pow3N/A
accelerator-lowering-fma.f64N/A
cube-unmultN/A
+-rgt-identityN/A
distribute-lft-inN/A
mul0-rgtN/A
accelerator-lowering-fma.f64N/A
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
metadata-eval96.6%
Applied egg-rr96.6%
Taylor expanded in a around 0
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6496.6%
Simplified96.6%
if 1e14 < (*.f64 b b) Initial program 59.6%
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.f6493.4%
Simplified93.4%
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-*.f6493.3%
Simplified93.3%
(FPCore (a b) :precision binary64 (if (<= b 9000000.0) (fma (* a 4.0) a -1.0) (* b (* b (* b b)))))
double code(double a, double b) {
double tmp;
if (b <= 9000000.0) {
tmp = fma((a * 4.0), a, -1.0);
} else {
tmp = b * (b * (b * b));
}
return tmp;
}
function code(a, b) tmp = 0.0 if (b <= 9000000.0) tmp = fma(Float64(a * 4.0), a, -1.0); else tmp = Float64(b * Float64(b * Float64(b * b))); end return tmp end
code[a_, b_] := If[LessEqual[b, 9000000.0], N[(N[(a * 4.0), $MachinePrecision] * a + -1.0), $MachinePrecision], N[(b * N[(b * N[(b * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b \leq 9000000:\\
\;\;\;\;\mathsf{fma}\left(a \cdot 4, a, -1\right)\\
\mathbf{else}:\\
\;\;\;\;b \cdot \left(b \cdot \left(b \cdot b\right)\right)\\
\end{array}
\end{array}
if b < 9e6Initial program 76.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--.f6480.8%
Simplified80.8%
sub-negN/A
+-rgt-identityN/A
*-commutativeN/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
sub0-negN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
sub-negN/A
accelerator-lowering-fma.f64N/A
--lowering--.f64N/A
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
metadata-eval80.8%
Applied egg-rr80.8%
Taylor expanded in a around 0
Simplified61.8%
if 9e6 < b Initial program 62.4%
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.f6489.6%
Simplified89.6%
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.6%
Simplified89.6%
Final simplification68.7%
(FPCore (a b) :precision binary64 (if (<= (* b b) 5e-7) -1.0 (* (* b b) 12.0)))
double code(double a, double b) {
double tmp;
if ((b * b) <= 5e-7) {
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 ((b * b) <= 5d-7) 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 ((b * b) <= 5e-7) {
tmp = -1.0;
} else {
tmp = (b * b) * 12.0;
}
return tmp;
}
def code(a, b): tmp = 0 if (b * b) <= 5e-7: tmp = -1.0 else: tmp = (b * b) * 12.0 return tmp
function code(a, b) tmp = 0.0 if (Float64(b * b) <= 5e-7) tmp = -1.0; else tmp = Float64(Float64(b * b) * 12.0); end return tmp end
function tmp_2 = code(a, b) tmp = 0.0; if ((b * b) <= 5e-7) tmp = -1.0; else tmp = (b * b) * 12.0; end tmp_2 = tmp; end
code[a_, b_] := If[LessEqual[N[(b * b), $MachinePrecision], 5e-7], -1.0, N[(N[(b * b), $MachinePrecision] * 12.0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b \cdot b \leq 5 \cdot 10^{-7}:\\
\;\;\;\;-1\\
\mathbf{else}:\\
\;\;\;\;\left(b \cdot b\right) \cdot 12\\
\end{array}
\end{array}
if (*.f64 b b) < 4.99999999999999977e-7Initial program 86.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.f6455.0%
Simplified55.0%
Taylor expanded in b around 0
Simplified54.6%
if 4.99999999999999977e-7 < (*.f64 b b) Initial program 60.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.f6490.7%
Simplified90.7%
Taylor expanded in b around 0
Simplified49.9%
sub-negN/A
*-commutativeN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6449.9%
Applied egg-rr49.9%
Taylor expanded in b around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6449.9%
Simplified49.9%
Final simplification52.1%
(FPCore (a b) :precision binary64 (if (<= b 1.38e+128) (fma (* a 4.0) a -1.0) (* (* b b) 12.0)))
double code(double a, double b) {
double tmp;
if (b <= 1.38e+128) {
tmp = fma((a * 4.0), a, -1.0);
} else {
tmp = (b * b) * 12.0;
}
return tmp;
}
function code(a, b) tmp = 0.0 if (b <= 1.38e+128) tmp = fma(Float64(a * 4.0), a, -1.0); else tmp = Float64(Float64(b * b) * 12.0); end return tmp end
code[a_, b_] := If[LessEqual[b, 1.38e+128], N[(N[(a * 4.0), $MachinePrecision] * a + -1.0), $MachinePrecision], N[(N[(b * b), $MachinePrecision] * 12.0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b \leq 1.38 \cdot 10^{+128}:\\
\;\;\;\;\mathsf{fma}\left(a \cdot 4, a, -1\right)\\
\mathbf{else}:\\
\;\;\;\;\left(b \cdot b\right) \cdot 12\\
\end{array}
\end{array}
if b < 1.3799999999999999e128Initial program 75.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--.f6475.8%
Simplified75.8%
sub-negN/A
+-rgt-identityN/A
*-commutativeN/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
sub0-negN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
sub-negN/A
accelerator-lowering-fma.f64N/A
--lowering--.f64N/A
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
metadata-eval75.8%
Applied egg-rr75.8%
Taylor expanded in a around 0
Simplified57.4%
if 1.3799999999999999e128 < b Initial program 57.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
Simplified85.9%
sub-negN/A
*-commutativeN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6485.9%
Applied egg-rr85.9%
Taylor expanded in b around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6485.9%
Simplified85.9%
Final simplification61.6%
(FPCore (a b) :precision binary64 (fma 12.0 (* b b) -1.0))
double code(double a, double b) {
return fma(12.0, (b * b), -1.0);
}
function code(a, b) return fma(12.0, Float64(b * b), -1.0) end
code[a_, b_] := N[(12.0 * N[(b * b), $MachinePrecision] + -1.0), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(12, b \cdot b, -1\right)
\end{array}
Initial program 73.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.f6473.5%
Simplified73.5%
Taylor expanded in b around 0
sub-negN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6452.3%
Simplified52.3%
(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 73.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.f6473.5%
Simplified73.5%
Taylor expanded in b around 0
Simplified26.6%
herbie shell --seed 2024193
(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))