
(FPCore (x y z) :precision binary64 (+ (+ (+ (* x y) (* z z)) (* z z)) (* z z)))
double code(double x, double y, double z) {
return (((x * y) + (z * z)) + (z * z)) + (z * z);
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = (((x * y) + (z * z)) + (z * z)) + (z * z)
end function
public static double code(double x, double y, double z) {
return (((x * y) + (z * z)) + (z * z)) + (z * z);
}
def code(x, y, z): return (((x * y) + (z * z)) + (z * z)) + (z * z)
function code(x, y, z) return Float64(Float64(Float64(Float64(x * y) + Float64(z * z)) + Float64(z * z)) + Float64(z * z)) end
function tmp = code(x, y, z) tmp = (((x * y) + (z * z)) + (z * z)) + (z * z); end
code[x_, y_, z_] := N[(N[(N[(N[(x * y), $MachinePrecision] + N[(z * z), $MachinePrecision]), $MachinePrecision] + N[(z * z), $MachinePrecision]), $MachinePrecision] + N[(z * z), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\left(x \cdot y + z \cdot z\right) + z \cdot z\right) + z \cdot z
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 7 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z) :precision binary64 (+ (+ (+ (* x y) (* z z)) (* z z)) (* z z)))
double code(double x, double y, double z) {
return (((x * y) + (z * z)) + (z * z)) + (z * z);
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = (((x * y) + (z * z)) + (z * z)) + (z * z)
end function
public static double code(double x, double y, double z) {
return (((x * y) + (z * z)) + (z * z)) + (z * z);
}
def code(x, y, z): return (((x * y) + (z * z)) + (z * z)) + (z * z)
function code(x, y, z) return Float64(Float64(Float64(Float64(x * y) + Float64(z * z)) + Float64(z * z)) + Float64(z * z)) end
function tmp = code(x, y, z) tmp = (((x * y) + (z * z)) + (z * z)) + (z * z); end
code[x_, y_, z_] := N[(N[(N[(N[(x * y), $MachinePrecision] + N[(z * z), $MachinePrecision]), $MachinePrecision] + N[(z * z), $MachinePrecision]), $MachinePrecision] + N[(z * z), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\left(x \cdot y + z \cdot z\right) + z \cdot z\right) + z \cdot z
\end{array}
(FPCore (x y z) :precision binary64 (fma z z (fma x y (* 2.0 (* z z)))))
double code(double x, double y, double z) {
return fma(z, z, fma(x, y, (2.0 * (z * z))));
}
function code(x, y, z) return fma(z, z, fma(x, y, Float64(2.0 * Float64(z * z)))) end
code[x_, y_, z_] := N[(z * z + N[(x * y + N[(2.0 * N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(z, z, \mathsf{fma}\left(x, y, 2 \cdot \left(z \cdot z\right)\right)\right)
\end{array}
Initial program 97.5%
+-commutative97.5%
fma-def97.6%
associate-+l+97.6%
fma-def99.5%
count-299.5%
Simplified99.5%
Final simplification99.5%
(FPCore (x y z) :precision binary64 (fma x y (* z (* z 3.0))))
double code(double x, double y, double z) {
return fma(x, y, (z * (z * 3.0)));
}
function code(x, y, z) return fma(x, y, Float64(z * Float64(z * 3.0))) end
code[x_, y_, z_] := N[(x * y + N[(z * N[(z * 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(x, y, z \cdot \left(z \cdot 3\right)\right)
\end{array}
Initial program 97.5%
associate-+l+97.5%
associate-+l+97.5%
fma-def99.4%
associate-+r+99.4%
distribute-lft-out99.4%
distribute-lft-out99.5%
remove-double-neg99.5%
unsub-neg99.5%
count-299.5%
neg-mul-199.5%
distribute-rgt-out--99.5%
metadata-eval99.5%
Simplified99.5%
Final simplification99.5%
(FPCore (x y z)
:precision binary64
(if (<= (* z z) 1e-90)
(+ (* z z) (* x y))
(if (or (<= (* z z) 2e-52) (not (<= (* z z) 1e-42)))
(* z (* z 3.0))
(* x y))))
double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 1e-90) {
tmp = (z * z) + (x * y);
} else if (((z * z) <= 2e-52) || !((z * z) <= 1e-42)) {
tmp = z * (z * 3.0);
} else {
tmp = x * y;
}
return tmp;
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if ((z * z) <= 1d-90) then
tmp = (z * z) + (x * y)
else if (((z * z) <= 2d-52) .or. (.not. ((z * z) <= 1d-42))) then
tmp = z * (z * 3.0d0)
else
tmp = x * y
end if
code = tmp
end function
public static double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 1e-90) {
tmp = (z * z) + (x * y);
} else if (((z * z) <= 2e-52) || !((z * z) <= 1e-42)) {
tmp = z * (z * 3.0);
} else {
tmp = x * y;
}
return tmp;
}
def code(x, y, z): tmp = 0 if (z * z) <= 1e-90: tmp = (z * z) + (x * y) elif ((z * z) <= 2e-52) or not ((z * z) <= 1e-42): tmp = z * (z * 3.0) else: tmp = x * y return tmp
function code(x, y, z) tmp = 0.0 if (Float64(z * z) <= 1e-90) tmp = Float64(Float64(z * z) + Float64(x * y)); elseif ((Float64(z * z) <= 2e-52) || !(Float64(z * z) <= 1e-42)) tmp = Float64(z * Float64(z * 3.0)); else tmp = Float64(x * y); end return tmp end
function tmp_2 = code(x, y, z) tmp = 0.0; if ((z * z) <= 1e-90) tmp = (z * z) + (x * y); elseif (((z * z) <= 2e-52) || ~(((z * z) <= 1e-42))) tmp = z * (z * 3.0); else tmp = x * y; end tmp_2 = tmp; end
code[x_, y_, z_] := If[LessEqual[N[(z * z), $MachinePrecision], 1e-90], N[(N[(z * z), $MachinePrecision] + N[(x * y), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[N[(z * z), $MachinePrecision], 2e-52], N[Not[LessEqual[N[(z * z), $MachinePrecision], 1e-42]], $MachinePrecision]], N[(z * N[(z * 3.0), $MachinePrecision]), $MachinePrecision], N[(x * y), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;z \cdot z \leq 10^{-90}:\\
\;\;\;\;z \cdot z + x \cdot y\\
\mathbf{elif}\;z \cdot z \leq 2 \cdot 10^{-52} \lor \neg \left(z \cdot z \leq 10^{-42}\right):\\
\;\;\;\;z \cdot \left(z \cdot 3\right)\\
\mathbf{else}:\\
\;\;\;\;x \cdot y\\
\end{array}
\end{array}
if (*.f64 z z) < 9.99999999999999995e-91Initial program 99.9%
Taylor expanded in x around inf 93.6%
Taylor expanded in x around inf 93.4%
if 9.99999999999999995e-91 < (*.f64 z z) < 2e-52 or 1.00000000000000004e-42 < (*.f64 z z) Initial program 95.3%
associate-+l+95.4%
associate-+l+95.4%
fma-def99.0%
associate-+r+99.0%
distribute-lft-out99.0%
distribute-lft-out99.1%
remove-double-neg99.1%
unsub-neg99.1%
count-299.1%
neg-mul-199.1%
distribute-rgt-out--99.1%
metadata-eval99.1%
Simplified99.1%
add-sqr-sqrt92.3%
pow292.3%
associate-*r*92.2%
pow292.2%
Applied egg-rr92.2%
Taylor expanded in x around 0 81.7%
unpow281.7%
*-commutative81.7%
*-commutative81.7%
swap-sqr81.6%
rem-square-sqrt82.0%
associate-*r*82.1%
Applied egg-rr82.1%
if 2e-52 < (*.f64 z z) < 1.00000000000000004e-42Initial program 100.0%
associate-+l+100.0%
associate-+l+100.0%
fma-def100.0%
associate-+r+100.0%
distribute-lft-out100.0%
distribute-lft-out100.0%
remove-double-neg100.0%
unsub-neg100.0%
count-2100.0%
neg-mul-1100.0%
distribute-rgt-out--100.0%
metadata-eval100.0%
Simplified100.0%
add-sqr-sqrt100.0%
pow2100.0%
associate-*r*100.0%
sqrt-prod100.0%
sqrt-prod20.0%
add-sqr-sqrt100.0%
Applied egg-rr100.0%
Taylor expanded in x around inf 100.0%
Final simplification87.5%
(FPCore (x y z)
:precision binary64
(if (<= (* z z) 1e-90)
(+ (* z z) (+ (* z z) (* x y)))
(if (or (<= (* z z) 2e-52) (not (<= (* z z) 1e-42)))
(* z (* z 3.0))
(* x y))))
double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 1e-90) {
tmp = (z * z) + ((z * z) + (x * y));
} else if (((z * z) <= 2e-52) || !((z * z) <= 1e-42)) {
tmp = z * (z * 3.0);
} else {
tmp = x * y;
}
return tmp;
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if ((z * z) <= 1d-90) then
tmp = (z * z) + ((z * z) + (x * y))
else if (((z * z) <= 2d-52) .or. (.not. ((z * z) <= 1d-42))) then
tmp = z * (z * 3.0d0)
else
tmp = x * y
end if
code = tmp
end function
public static double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 1e-90) {
tmp = (z * z) + ((z * z) + (x * y));
} else if (((z * z) <= 2e-52) || !((z * z) <= 1e-42)) {
tmp = z * (z * 3.0);
} else {
tmp = x * y;
}
return tmp;
}
def code(x, y, z): tmp = 0 if (z * z) <= 1e-90: tmp = (z * z) + ((z * z) + (x * y)) elif ((z * z) <= 2e-52) or not ((z * z) <= 1e-42): tmp = z * (z * 3.0) else: tmp = x * y return tmp
function code(x, y, z) tmp = 0.0 if (Float64(z * z) <= 1e-90) tmp = Float64(Float64(z * z) + Float64(Float64(z * z) + Float64(x * y))); elseif ((Float64(z * z) <= 2e-52) || !(Float64(z * z) <= 1e-42)) tmp = Float64(z * Float64(z * 3.0)); else tmp = Float64(x * y); end return tmp end
function tmp_2 = code(x, y, z) tmp = 0.0; if ((z * z) <= 1e-90) tmp = (z * z) + ((z * z) + (x * y)); elseif (((z * z) <= 2e-52) || ~(((z * z) <= 1e-42))) tmp = z * (z * 3.0); else tmp = x * y; end tmp_2 = tmp; end
code[x_, y_, z_] := If[LessEqual[N[(z * z), $MachinePrecision], 1e-90], N[(N[(z * z), $MachinePrecision] + N[(N[(z * z), $MachinePrecision] + N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[N[(z * z), $MachinePrecision], 2e-52], N[Not[LessEqual[N[(z * z), $MachinePrecision], 1e-42]], $MachinePrecision]], N[(z * N[(z * 3.0), $MachinePrecision]), $MachinePrecision], N[(x * y), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;z \cdot z \leq 10^{-90}:\\
\;\;\;\;z \cdot z + \left(z \cdot z + x \cdot y\right)\\
\mathbf{elif}\;z \cdot z \leq 2 \cdot 10^{-52} \lor \neg \left(z \cdot z \leq 10^{-42}\right):\\
\;\;\;\;z \cdot \left(z \cdot 3\right)\\
\mathbf{else}:\\
\;\;\;\;x \cdot y\\
\end{array}
\end{array}
if (*.f64 z z) < 9.99999999999999995e-91Initial program 99.9%
Taylor expanded in x around inf 93.6%
if 9.99999999999999995e-91 < (*.f64 z z) < 2e-52 or 1.00000000000000004e-42 < (*.f64 z z) Initial program 95.3%
associate-+l+95.4%
associate-+l+95.4%
fma-def99.0%
associate-+r+99.0%
distribute-lft-out99.0%
distribute-lft-out99.1%
remove-double-neg99.1%
unsub-neg99.1%
count-299.1%
neg-mul-199.1%
distribute-rgt-out--99.1%
metadata-eval99.1%
Simplified99.1%
add-sqr-sqrt92.3%
pow292.3%
associate-*r*92.2%
pow292.2%
Applied egg-rr92.2%
Taylor expanded in x around 0 81.7%
unpow281.7%
*-commutative81.7%
*-commutative81.7%
swap-sqr81.6%
rem-square-sqrt82.0%
associate-*r*82.1%
Applied egg-rr82.1%
if 2e-52 < (*.f64 z z) < 1.00000000000000004e-42Initial program 100.0%
associate-+l+100.0%
associate-+l+100.0%
fma-def100.0%
associate-+r+100.0%
distribute-lft-out100.0%
distribute-lft-out100.0%
remove-double-neg100.0%
unsub-neg100.0%
count-2100.0%
neg-mul-1100.0%
distribute-rgt-out--100.0%
metadata-eval100.0%
Simplified100.0%
add-sqr-sqrt100.0%
pow2100.0%
associate-*r*100.0%
sqrt-prod100.0%
sqrt-prod20.0%
add-sqr-sqrt100.0%
Applied egg-rr100.0%
Taylor expanded in x around inf 100.0%
Final simplification87.5%
(FPCore (x y z) :precision binary64 (if (<= (* z z) 5e+293) (+ (* z z) (+ (* z z) (+ (* z z) (* x y)))) (* z (* z 3.0))))
double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 5e+293) {
tmp = (z * z) + ((z * z) + ((z * z) + (x * y)));
} else {
tmp = z * (z * 3.0);
}
return tmp;
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if ((z * z) <= 5d+293) then
tmp = (z * z) + ((z * z) + ((z * z) + (x * y)))
else
tmp = z * (z * 3.0d0)
end if
code = tmp
end function
public static double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 5e+293) {
tmp = (z * z) + ((z * z) + ((z * z) + (x * y)));
} else {
tmp = z * (z * 3.0);
}
return tmp;
}
def code(x, y, z): tmp = 0 if (z * z) <= 5e+293: tmp = (z * z) + ((z * z) + ((z * z) + (x * y))) else: tmp = z * (z * 3.0) return tmp
function code(x, y, z) tmp = 0.0 if (Float64(z * z) <= 5e+293) tmp = Float64(Float64(z * z) + Float64(Float64(z * z) + Float64(Float64(z * z) + Float64(x * y)))); else tmp = Float64(z * Float64(z * 3.0)); end return tmp end
function tmp_2 = code(x, y, z) tmp = 0.0; if ((z * z) <= 5e+293) tmp = (z * z) + ((z * z) + ((z * z) + (x * y))); else tmp = z * (z * 3.0); end tmp_2 = tmp; end
code[x_, y_, z_] := If[LessEqual[N[(z * z), $MachinePrecision], 5e+293], N[(N[(z * z), $MachinePrecision] + N[(N[(z * z), $MachinePrecision] + N[(N[(z * z), $MachinePrecision] + N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(z * N[(z * 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;z \cdot z \leq 5 \cdot 10^{+293}:\\
\;\;\;\;z \cdot z + \left(z \cdot z + \left(z \cdot z + x \cdot y\right)\right)\\
\mathbf{else}:\\
\;\;\;\;z \cdot \left(z \cdot 3\right)\\
\end{array}
\end{array}
if (*.f64 z z) < 5.00000000000000033e293Initial program 99.8%
if 5.00000000000000033e293 < (*.f64 z z) Initial program 87.8%
associate-+l+87.8%
associate-+l+87.8%
fma-def98.0%
associate-+r+98.0%
distribute-lft-out98.0%
distribute-lft-out98.0%
remove-double-neg98.0%
unsub-neg98.0%
count-298.0%
neg-mul-198.0%
distribute-rgt-out--98.0%
metadata-eval98.0%
Simplified98.0%
add-sqr-sqrt98.0%
pow298.0%
associate-*r*98.0%
pow298.0%
Applied egg-rr98.0%
Taylor expanded in x around 0 98.0%
unpow298.0%
*-commutative98.0%
*-commutative98.0%
swap-sqr97.9%
rem-square-sqrt98.0%
associate-*r*98.0%
Applied egg-rr98.0%
Final simplification99.4%
(FPCore (x y z) :precision binary64 (if (or (<= z 2.75e-44) (and (not (<= z 1.2e-26)) (<= z 1.55e-16))) (* x y) (* z (* z 3.0))))
double code(double x, double y, double z) {
double tmp;
if ((z <= 2.75e-44) || (!(z <= 1.2e-26) && (z <= 1.55e-16))) {
tmp = x * y;
} else {
tmp = z * (z * 3.0);
}
return tmp;
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if ((z <= 2.75d-44) .or. (.not. (z <= 1.2d-26)) .and. (z <= 1.55d-16)) then
tmp = x * y
else
tmp = z * (z * 3.0d0)
end if
code = tmp
end function
public static double code(double x, double y, double z) {
double tmp;
if ((z <= 2.75e-44) || (!(z <= 1.2e-26) && (z <= 1.55e-16))) {
tmp = x * y;
} else {
tmp = z * (z * 3.0);
}
return tmp;
}
def code(x, y, z): tmp = 0 if (z <= 2.75e-44) or (not (z <= 1.2e-26) and (z <= 1.55e-16)): tmp = x * y else: tmp = z * (z * 3.0) return tmp
function code(x, y, z) tmp = 0.0 if ((z <= 2.75e-44) || (!(z <= 1.2e-26) && (z <= 1.55e-16))) tmp = Float64(x * y); else tmp = Float64(z * Float64(z * 3.0)); end return tmp end
function tmp_2 = code(x, y, z) tmp = 0.0; if ((z <= 2.75e-44) || (~((z <= 1.2e-26)) && (z <= 1.55e-16))) tmp = x * y; else tmp = z * (z * 3.0); end tmp_2 = tmp; end
code[x_, y_, z_] := If[Or[LessEqual[z, 2.75e-44], And[N[Not[LessEqual[z, 1.2e-26]], $MachinePrecision], LessEqual[z, 1.55e-16]]], N[(x * y), $MachinePrecision], N[(z * N[(z * 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;z \leq 2.75 \cdot 10^{-44} \lor \neg \left(z \leq 1.2 \cdot 10^{-26}\right) \land z \leq 1.55 \cdot 10^{-16}:\\
\;\;\;\;x \cdot y\\
\mathbf{else}:\\
\;\;\;\;z \cdot \left(z \cdot 3\right)\\
\end{array}
\end{array}
if z < 2.74999999999999996e-44 or 1.2e-26 < z < 1.55e-16Initial program 99.3%
associate-+l+99.4%
associate-+l+99.4%
fma-def99.9%
associate-+r+99.9%
distribute-lft-out99.9%
distribute-lft-out99.9%
remove-double-neg99.9%
unsub-neg99.9%
count-299.9%
neg-mul-199.9%
distribute-rgt-out--99.9%
metadata-eval99.9%
Simplified99.9%
add-sqr-sqrt99.8%
pow299.8%
associate-*r*99.8%
sqrt-prod99.7%
sqrt-prod31.0%
add-sqr-sqrt99.7%
Applied egg-rr99.7%
Taylor expanded in x around inf 67.9%
if 2.74999999999999996e-44 < z < 1.2e-26 or 1.55e-16 < z Initial program 92.7%
associate-+l+92.7%
associate-+l+92.7%
fma-def98.2%
associate-+r+98.2%
distribute-lft-out98.2%
distribute-lft-out98.4%
remove-double-neg98.4%
unsub-neg98.4%
count-298.4%
neg-mul-198.4%
distribute-rgt-out--98.4%
metadata-eval98.4%
Simplified98.4%
add-sqr-sqrt91.2%
pow291.2%
associate-*r*91.1%
pow291.1%
Applied egg-rr91.1%
Taylor expanded in x around 0 82.1%
unpow282.1%
*-commutative82.1%
*-commutative82.1%
swap-sqr82.1%
rem-square-sqrt82.3%
associate-*r*82.5%
Applied egg-rr82.5%
Final simplification72.0%
(FPCore (x y z) :precision binary64 (* x y))
double code(double x, double y, double z) {
return x * y;
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = x * y
end function
public static double code(double x, double y, double z) {
return x * y;
}
def code(x, y, z): return x * y
function code(x, y, z) return Float64(x * y) end
function tmp = code(x, y, z) tmp = x * y; end
code[x_, y_, z_] := N[(x * y), $MachinePrecision]
\begin{array}{l}
\\
x \cdot y
\end{array}
Initial program 97.5%
associate-+l+97.5%
associate-+l+97.5%
fma-def99.4%
associate-+r+99.4%
distribute-lft-out99.4%
distribute-lft-out99.5%
remove-double-neg99.5%
unsub-neg99.5%
count-299.5%
neg-mul-199.5%
distribute-rgt-out--99.5%
metadata-eval99.5%
Simplified99.5%
add-sqr-sqrt99.4%
pow299.4%
associate-*r*99.3%
sqrt-prod99.2%
sqrt-prod49.7%
add-sqr-sqrt99.2%
Applied egg-rr99.2%
Taylor expanded in x around inf 54.4%
Final simplification54.4%
(FPCore (x y z) :precision binary64 (+ (* (* 3.0 z) z) (* y x)))
double code(double x, double y, double z) {
return ((3.0 * z) * z) + (y * x);
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = ((3.0d0 * z) * z) + (y * x)
end function
public static double code(double x, double y, double z) {
return ((3.0 * z) * z) + (y * x);
}
def code(x, y, z): return ((3.0 * z) * z) + (y * x)
function code(x, y, z) return Float64(Float64(Float64(3.0 * z) * z) + Float64(y * x)) end
function tmp = code(x, y, z) tmp = ((3.0 * z) * z) + (y * x); end
code[x_, y_, z_] := N[(N[(N[(3.0 * z), $MachinePrecision] * z), $MachinePrecision] + N[(y * x), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(3 \cdot z\right) \cdot z + y \cdot x
\end{array}
herbie shell --seed 2024024
(FPCore (x y z)
:name "Linear.Quaternion:$c/ from linear-1.19.1.3, A"
:precision binary64
:herbie-target
(+ (* (* 3.0 z) z) (* y x))
(+ (+ (+ (* x y) (* z z)) (* z z)) (* z z)))