
(FPCore (x y z t) :precision binary64 (* (* (- (* x 0.5) y) (sqrt (* z 2.0))) (exp (/ (* t t) 2.0))))
double code(double x, double y, double z, double t) {
return (((x * 0.5) - y) * sqrt((z * 2.0))) * exp(((t * t) / 2.0));
}
real(8) function code(x, y, z, t)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
code = (((x * 0.5d0) - y) * sqrt((z * 2.0d0))) * exp(((t * t) / 2.0d0))
end function
public static double code(double x, double y, double z, double t) {
return (((x * 0.5) - y) * Math.sqrt((z * 2.0))) * Math.exp(((t * t) / 2.0));
}
def code(x, y, z, t): return (((x * 0.5) - y) * math.sqrt((z * 2.0))) * math.exp(((t * t) / 2.0))
function code(x, y, z, t) return Float64(Float64(Float64(Float64(x * 0.5) - y) * sqrt(Float64(z * 2.0))) * exp(Float64(Float64(t * t) / 2.0))) end
function tmp = code(x, y, z, t) tmp = (((x * 0.5) - y) * sqrt((z * 2.0))) * exp(((t * t) / 2.0)); end
code[x_, y_, z_, t_] := N[(N[(N[(N[(x * 0.5), $MachinePrecision] - y), $MachinePrecision] * N[Sqrt[N[(z * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Exp[N[(N[(t * t), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\left(x \cdot 0.5 - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot e^{\frac{t \cdot t}{2}}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 14 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t) :precision binary64 (* (* (- (* x 0.5) y) (sqrt (* z 2.0))) (exp (/ (* t t) 2.0))))
double code(double x, double y, double z, double t) {
return (((x * 0.5) - y) * sqrt((z * 2.0))) * exp(((t * t) / 2.0));
}
real(8) function code(x, y, z, t)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
code = (((x * 0.5d0) - y) * sqrt((z * 2.0d0))) * exp(((t * t) / 2.0d0))
end function
public static double code(double x, double y, double z, double t) {
return (((x * 0.5) - y) * Math.sqrt((z * 2.0))) * Math.exp(((t * t) / 2.0));
}
def code(x, y, z, t): return (((x * 0.5) - y) * math.sqrt((z * 2.0))) * math.exp(((t * t) / 2.0))
function code(x, y, z, t) return Float64(Float64(Float64(Float64(x * 0.5) - y) * sqrt(Float64(z * 2.0))) * exp(Float64(Float64(t * t) / 2.0))) end
function tmp = code(x, y, z, t) tmp = (((x * 0.5) - y) * sqrt((z * 2.0))) * exp(((t * t) / 2.0)); end
code[x_, y_, z_, t_] := N[(N[(N[(N[(x * 0.5), $MachinePrecision] - y), $MachinePrecision] * N[Sqrt[N[(z * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Exp[N[(N[(t * t), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\left(x \cdot 0.5 - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot e^{\frac{t \cdot t}{2}}
\end{array}
(FPCore (x y z t) :precision binary64 (* (- (* x 0.5) y) (sqrt (* 2.0 (* z (exp (* t t)))))))
double code(double x, double y, double z, double t) {
return ((x * 0.5) - y) * sqrt((2.0 * (z * exp((t * t)))));
}
real(8) function code(x, y, z, t)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
code = ((x * 0.5d0) - y) * sqrt((2.0d0 * (z * exp((t * t)))))
end function
public static double code(double x, double y, double z, double t) {
return ((x * 0.5) - y) * Math.sqrt((2.0 * (z * Math.exp((t * t)))));
}
def code(x, y, z, t): return ((x * 0.5) - y) * math.sqrt((2.0 * (z * math.exp((t * t)))))
function code(x, y, z, t) return Float64(Float64(Float64(x * 0.5) - y) * sqrt(Float64(2.0 * Float64(z * exp(Float64(t * t)))))) end
function tmp = code(x, y, z, t) tmp = ((x * 0.5) - y) * sqrt((2.0 * (z * exp((t * t))))); end
code[x_, y_, z_, t_] := N[(N[(N[(x * 0.5), $MachinePrecision] - y), $MachinePrecision] * N[Sqrt[N[(2.0 * N[(z * N[Exp[N[(t * t), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(x \cdot 0.5 - y\right) \cdot \sqrt{2 \cdot \left(z \cdot e^{t \cdot t}\right)}
\end{array}
Initial program 99.8%
associate-*l*N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
exp-sqrtN/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
exp-lowering-exp.f64N/A
*-lowering-*.f6499.8
Applied egg-rr99.8%
(FPCore (x y z t)
:precision binary64
(let* ((t_1 (- (* x 0.5) y)))
(if (<= (exp (/ (* t t) 2.0)) 1.0004)
(* (* t_1 (sqrt (* 2.0 z))) (fma (* t t) (fma t (* t 0.125) 0.5) 1.0))
(* (sqrt z) (* (* t_1 (sqrt 2.0)) (* 0.125 (* (* t t) (* t t))))))))
double code(double x, double y, double z, double t) {
double t_1 = (x * 0.5) - y;
double tmp;
if (exp(((t * t) / 2.0)) <= 1.0004) {
tmp = (t_1 * sqrt((2.0 * z))) * fma((t * t), fma(t, (t * 0.125), 0.5), 1.0);
} else {
tmp = sqrt(z) * ((t_1 * sqrt(2.0)) * (0.125 * ((t * t) * (t * t))));
}
return tmp;
}
function code(x, y, z, t) t_1 = Float64(Float64(x * 0.5) - y) tmp = 0.0 if (exp(Float64(Float64(t * t) / 2.0)) <= 1.0004) tmp = Float64(Float64(t_1 * sqrt(Float64(2.0 * z))) * fma(Float64(t * t), fma(t, Float64(t * 0.125), 0.5), 1.0)); else tmp = Float64(sqrt(z) * Float64(Float64(t_1 * sqrt(2.0)) * Float64(0.125 * Float64(Float64(t * t) * Float64(t * t))))); end return tmp end
code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(x * 0.5), $MachinePrecision] - y), $MachinePrecision]}, If[LessEqual[N[Exp[N[(N[(t * t), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision], 1.0004], N[(N[(t$95$1 * N[Sqrt[N[(2.0 * z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(t * t), $MachinePrecision] * N[(t * N[(t * 0.125), $MachinePrecision] + 0.5), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[z], $MachinePrecision] * N[(N[(t$95$1 * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[(0.125 * N[(N[(t * t), $MachinePrecision] * N[(t * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := x \cdot 0.5 - y\\
\mathbf{if}\;e^{\frac{t \cdot t}{2}} \leq 1.0004:\\
\;\;\;\;\left(t\_1 \cdot \sqrt{2 \cdot z}\right) \cdot \mathsf{fma}\left(t \cdot t, \mathsf{fma}\left(t, t \cdot 0.125, 0.5\right), 1\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{z} \cdot \left(\left(t\_1 \cdot \sqrt{2}\right) \cdot \left(0.125 \cdot \left(\left(t \cdot t\right) \cdot \left(t \cdot t\right)\right)\right)\right)\\
\end{array}
\end{array}
if (exp.f64 (/.f64 (*.f64 t t) #s(literal 2 binary64))) < 1.0004Initial program 99.6%
Taylor expanded in t around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f6499.3
Simplified99.3%
if 1.0004 < (exp.f64 (/.f64 (*.f64 t t) #s(literal 2 binary64))) Initial program 100.0%
Taylor expanded in t around 0
Simplified88.5%
Taylor expanded in t around inf
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
pow-sqrN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6489.2
Simplified89.2%
Final simplification94.1%
(FPCore (x y z t)
:precision binary64
(*
(sqrt 2.0)
(*
(sqrt z)
(*
(fma
(* t t)
(fma (* t t) (fma (* t t) 0.020833333333333332 0.125) 0.5)
1.0)
(fma 0.5 x (- y))))))
double code(double x, double y, double z, double t) {
return sqrt(2.0) * (sqrt(z) * (fma((t * t), fma((t * t), fma((t * t), 0.020833333333333332, 0.125), 0.5), 1.0) * fma(0.5, x, -y)));
}
function code(x, y, z, t) return Float64(sqrt(2.0) * Float64(sqrt(z) * Float64(fma(Float64(t * t), fma(Float64(t * t), fma(Float64(t * t), 0.020833333333333332, 0.125), 0.5), 1.0) * fma(0.5, x, Float64(-y))))) end
code[x_, y_, z_, t_] := N[(N[Sqrt[2.0], $MachinePrecision] * N[(N[Sqrt[z], $MachinePrecision] * N[(N[(N[(t * t), $MachinePrecision] * N[(N[(t * t), $MachinePrecision] * N[(N[(t * t), $MachinePrecision] * 0.020833333333333332 + 0.125), $MachinePrecision] + 0.5), $MachinePrecision] + 1.0), $MachinePrecision] * N[(0.5 * x + (-y)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{2} \cdot \left(\sqrt{z} \cdot \left(\mathsf{fma}\left(t \cdot t, \mathsf{fma}\left(t \cdot t, \mathsf{fma}\left(t \cdot t, 0.020833333333333332, 0.125\right), 0.5\right), 1\right) \cdot \mathsf{fma}\left(0.5, x, -y\right)\right)\right)
\end{array}
Initial program 99.8%
Taylor expanded in t around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6495.4
Simplified95.4%
Taylor expanded in x around 0
associate-*r*N/A
associate-*r*N/A
distribute-rgt-outN/A
associate-*r*N/A
Simplified96.7%
(FPCore (x y z t)
:precision binary64
(let* ((t_1 (- (* x 0.5) y)))
(if (<= t_1 5e+128)
(* t_1 (sqrt (fma (* t t) (* z (fma t t 2.0)) (* 2.0 z))))
(* (sqrt z) (* (* t_1 (sqrt 2.0)) (fma 0.5 (* t t) 1.0))))))
double code(double x, double y, double z, double t) {
double t_1 = (x * 0.5) - y;
double tmp;
if (t_1 <= 5e+128) {
tmp = t_1 * sqrt(fma((t * t), (z * fma(t, t, 2.0)), (2.0 * z)));
} else {
tmp = sqrt(z) * ((t_1 * sqrt(2.0)) * fma(0.5, (t * t), 1.0));
}
return tmp;
}
function code(x, y, z, t) t_1 = Float64(Float64(x * 0.5) - y) tmp = 0.0 if (t_1 <= 5e+128) tmp = Float64(t_1 * sqrt(fma(Float64(t * t), Float64(z * fma(t, t, 2.0)), Float64(2.0 * z)))); else tmp = Float64(sqrt(z) * Float64(Float64(t_1 * sqrt(2.0)) * fma(0.5, Float64(t * t), 1.0))); end return tmp end
code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(x * 0.5), $MachinePrecision] - y), $MachinePrecision]}, If[LessEqual[t$95$1, 5e+128], N[(t$95$1 * N[Sqrt[N[(N[(t * t), $MachinePrecision] * N[(z * N[(t * t + 2.0), $MachinePrecision]), $MachinePrecision] + N[(2.0 * z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[z], $MachinePrecision] * N[(N[(t$95$1 * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[(0.5 * N[(t * t), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := x \cdot 0.5 - y\\
\mathbf{if}\;t\_1 \leq 5 \cdot 10^{+128}:\\
\;\;\;\;t\_1 \cdot \sqrt{\mathsf{fma}\left(t \cdot t, z \cdot \mathsf{fma}\left(t, t, 2\right), 2 \cdot z\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{z} \cdot \left(\left(t\_1 \cdot \sqrt{2}\right) \cdot \mathsf{fma}\left(0.5, t \cdot t, 1\right)\right)\\
\end{array}
\end{array}
if (-.f64 (*.f64 x #s(literal 1/2 binary64)) y) < 5e128Initial program 99.8%
associate-*l*N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
exp-sqrtN/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
exp-lowering-exp.f64N/A
*-lowering-*.f6499.8
Applied egg-rr99.8%
Taylor expanded in t around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
unpow2N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6490.6
Simplified90.6%
if 5e128 < (-.f64 (*.f64 x #s(literal 1/2 binary64)) y) Initial program 99.9%
Taylor expanded in t around 0
+-commutativeN/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r*N/A
distribute-rgt1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
Simplified92.7%
Final simplification91.1%
(FPCore (x y z t) :precision binary64 (* (- (* x 0.5) y) (* (fma t (* t (fma (* t t) (fma (* t t) 0.020833333333333332 0.125) 0.5)) 1.0) (sqrt (* 2.0 z)))))
double code(double x, double y, double z, double t) {
return ((x * 0.5) - y) * (fma(t, (t * fma((t * t), fma((t * t), 0.020833333333333332, 0.125), 0.5)), 1.0) * sqrt((2.0 * z)));
}
function code(x, y, z, t) return Float64(Float64(Float64(x * 0.5) - y) * Float64(fma(t, Float64(t * fma(Float64(t * t), fma(Float64(t * t), 0.020833333333333332, 0.125), 0.5)), 1.0) * sqrt(Float64(2.0 * z)))) end
code[x_, y_, z_, t_] := N[(N[(N[(x * 0.5), $MachinePrecision] - y), $MachinePrecision] * N[(N[(t * N[(t * N[(N[(t * t), $MachinePrecision] * N[(N[(t * t), $MachinePrecision] * 0.020833333333333332 + 0.125), $MachinePrecision] + 0.5), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] * N[Sqrt[N[(2.0 * z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(x \cdot 0.5 - y\right) \cdot \left(\mathsf{fma}\left(t, t \cdot \mathsf{fma}\left(t \cdot t, \mathsf{fma}\left(t \cdot t, 0.020833333333333332, 0.125\right), 0.5\right), 1\right) \cdot \sqrt{2 \cdot z}\right)
\end{array}
Initial program 99.8%
Taylor expanded in t around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6495.4
Simplified95.4%
associate-*l*N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-commutativeN/A
*-lowering-*.f64N/A
Applied egg-rr95.8%
Final simplification95.8%
(FPCore (x y z t) :precision binary64 (* (fma (* t t) (fma (* t t) (fma (* t t) 0.020833333333333332 0.125) 0.5) 1.0) (* (- (* x 0.5) y) (sqrt (* 2.0 z)))))
double code(double x, double y, double z, double t) {
return fma((t * t), fma((t * t), fma((t * t), 0.020833333333333332, 0.125), 0.5), 1.0) * (((x * 0.5) - y) * sqrt((2.0 * z)));
}
function code(x, y, z, t) return Float64(fma(Float64(t * t), fma(Float64(t * t), fma(Float64(t * t), 0.020833333333333332, 0.125), 0.5), 1.0) * Float64(Float64(Float64(x * 0.5) - y) * sqrt(Float64(2.0 * z)))) end
code[x_, y_, z_, t_] := N[(N[(N[(t * t), $MachinePrecision] * N[(N[(t * t), $MachinePrecision] * N[(N[(t * t), $MachinePrecision] * 0.020833333333333332 + 0.125), $MachinePrecision] + 0.5), $MachinePrecision] + 1.0), $MachinePrecision] * N[(N[(N[(x * 0.5), $MachinePrecision] - y), $MachinePrecision] * N[Sqrt[N[(2.0 * z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(t \cdot t, \mathsf{fma}\left(t \cdot t, \mathsf{fma}\left(t \cdot t, 0.020833333333333332, 0.125\right), 0.5\right), 1\right) \cdot \left(\left(x \cdot 0.5 - y\right) \cdot \sqrt{2 \cdot z}\right)
\end{array}
Initial program 99.8%
Taylor expanded in t around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6495.4
Simplified95.4%
Final simplification95.4%
(FPCore (x y z t)
:precision binary64
(let* ((t_1 (sqrt (* 2.0 z))))
(if (<= (* t t) 2.45e+14)
(* (- (* x 0.5) y) t_1)
(if (<= (* t t) 3.9e+167)
(* t_1 (/ (* y (- y)) y))
(* y (* (fma 0.5 (* t t) 1.0) (- t_1)))))))
double code(double x, double y, double z, double t) {
double t_1 = sqrt((2.0 * z));
double tmp;
if ((t * t) <= 2.45e+14) {
tmp = ((x * 0.5) - y) * t_1;
} else if ((t * t) <= 3.9e+167) {
tmp = t_1 * ((y * -y) / y);
} else {
tmp = y * (fma(0.5, (t * t), 1.0) * -t_1);
}
return tmp;
}
function code(x, y, z, t) t_1 = sqrt(Float64(2.0 * z)) tmp = 0.0 if (Float64(t * t) <= 2.45e+14) tmp = Float64(Float64(Float64(x * 0.5) - y) * t_1); elseif (Float64(t * t) <= 3.9e+167) tmp = Float64(t_1 * Float64(Float64(y * Float64(-y)) / y)); else tmp = Float64(y * Float64(fma(0.5, Float64(t * t), 1.0) * Float64(-t_1))); end return tmp end
code[x_, y_, z_, t_] := Block[{t$95$1 = N[Sqrt[N[(2.0 * z), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[N[(t * t), $MachinePrecision], 2.45e+14], N[(N[(N[(x * 0.5), $MachinePrecision] - y), $MachinePrecision] * t$95$1), $MachinePrecision], If[LessEqual[N[(t * t), $MachinePrecision], 3.9e+167], N[(t$95$1 * N[(N[(y * (-y)), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], N[(y * N[(N[(0.5 * N[(t * t), $MachinePrecision] + 1.0), $MachinePrecision] * (-t$95$1)), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \sqrt{2 \cdot z}\\
\mathbf{if}\;t \cdot t \leq 2.45 \cdot 10^{+14}:\\
\;\;\;\;\left(x \cdot 0.5 - y\right) \cdot t\_1\\
\mathbf{elif}\;t \cdot t \leq 3.9 \cdot 10^{+167}:\\
\;\;\;\;t\_1 \cdot \frac{y \cdot \left(-y\right)}{y}\\
\mathbf{else}:\\
\;\;\;\;y \cdot \left(\mathsf{fma}\left(0.5, t \cdot t, 1\right) \cdot \left(-t\_1\right)\right)\\
\end{array}
\end{array}
if (*.f64 t t) < 2.45e14Initial program 99.7%
Taylor expanded in t around 0
Simplified96.6%
*-rgt-identityN/A
*-lowering-*.f64N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f6496.6
Applied egg-rr96.6%
if 2.45e14 < (*.f64 t t) < 3.8999999999999998e167Initial program 100.0%
Taylor expanded in t around 0
Simplified4.4%
Taylor expanded in x around 0
mul-1-negN/A
neg-lowering-neg.f643.5
Simplified3.5%
*-rgt-identityN/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
neg-lowering-neg.f643.5
Applied egg-rr3.5%
neg-sub0N/A
flip--N/A
metadata-evalN/A
neg-sub0N/A
+-lft-identityN/A
/-lowering-/.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
neg-lowering-neg.f6433.3
Applied egg-rr33.3%
if 3.8999999999999998e167 < (*.f64 t t) Initial program 100.0%
Taylor expanded in t around 0
+-commutativeN/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r*N/A
distribute-rgt1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
Simplified83.3%
Taylor expanded in x around 0
mul-1-negN/A
neg-lowering-neg.f64N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6457.9
Simplified57.9%
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-lowering-neg.f6457.9
Applied egg-rr57.9%
Final simplification74.1%
(FPCore (x y z t) :precision binary64 (* (* (- (* x 0.5) y) (sqrt (* 2.0 z))) (fma (* t t) (fma t (* t 0.125) 0.5) 1.0)))
double code(double x, double y, double z, double t) {
return (((x * 0.5) - y) * sqrt((2.0 * z))) * fma((t * t), fma(t, (t * 0.125), 0.5), 1.0);
}
function code(x, y, z, t) return Float64(Float64(Float64(Float64(x * 0.5) - y) * sqrt(Float64(2.0 * z))) * fma(Float64(t * t), fma(t, Float64(t * 0.125), 0.5), 1.0)) end
code[x_, y_, z_, t_] := N[(N[(N[(N[(x * 0.5), $MachinePrecision] - y), $MachinePrecision] * N[Sqrt[N[(2.0 * z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(t * t), $MachinePrecision] * N[(t * N[(t * 0.125), $MachinePrecision] + 0.5), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\left(x \cdot 0.5 - y\right) \cdot \sqrt{2 \cdot z}\right) \cdot \mathsf{fma}\left(t \cdot t, \mathsf{fma}\left(t, t \cdot 0.125, 0.5\right), 1\right)
\end{array}
Initial program 99.8%
Taylor expanded in t around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f6492.3
Simplified92.3%
Final simplification92.3%
(FPCore (x y z t) :precision binary64 (* (- (* x 0.5) y) (sqrt (fma (* t t) (* z (fma t t 2.0)) (* 2.0 z)))))
double code(double x, double y, double z, double t) {
return ((x * 0.5) - y) * sqrt(fma((t * t), (z * fma(t, t, 2.0)), (2.0 * z)));
}
function code(x, y, z, t) return Float64(Float64(Float64(x * 0.5) - y) * sqrt(fma(Float64(t * t), Float64(z * fma(t, t, 2.0)), Float64(2.0 * z)))) end
code[x_, y_, z_, t_] := N[(N[(N[(x * 0.5), $MachinePrecision] - y), $MachinePrecision] * N[Sqrt[N[(N[(t * t), $MachinePrecision] * N[(z * N[(t * t + 2.0), $MachinePrecision]), $MachinePrecision] + N[(2.0 * z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(x \cdot 0.5 - y\right) \cdot \sqrt{\mathsf{fma}\left(t \cdot t, z \cdot \mathsf{fma}\left(t, t, 2\right), 2 \cdot z\right)}
\end{array}
Initial program 99.8%
associate-*l*N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
exp-sqrtN/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
exp-lowering-exp.f64N/A
*-lowering-*.f6499.8
Applied egg-rr99.8%
Taylor expanded in t around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
unpow2N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6488.6
Simplified88.6%
(FPCore (x y z t)
:precision binary64
(let* ((t_1 (sqrt (* 2.0 z))))
(if (<= (* t t) 0.00049)
(* (- (* x 0.5) y) t_1)
(* t_1 (* (- y) (fma 0.5 (* t t) 1.0))))))
double code(double x, double y, double z, double t) {
double t_1 = sqrt((2.0 * z));
double tmp;
if ((t * t) <= 0.00049) {
tmp = ((x * 0.5) - y) * t_1;
} else {
tmp = t_1 * (-y * fma(0.5, (t * t), 1.0));
}
return tmp;
}
function code(x, y, z, t) t_1 = sqrt(Float64(2.0 * z)) tmp = 0.0 if (Float64(t * t) <= 0.00049) tmp = Float64(Float64(Float64(x * 0.5) - y) * t_1); else tmp = Float64(t_1 * Float64(Float64(-y) * fma(0.5, Float64(t * t), 1.0))); end return tmp end
code[x_, y_, z_, t_] := Block[{t$95$1 = N[Sqrt[N[(2.0 * z), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[N[(t * t), $MachinePrecision], 0.00049], N[(N[(N[(x * 0.5), $MachinePrecision] - y), $MachinePrecision] * t$95$1), $MachinePrecision], N[(t$95$1 * N[((-y) * N[(0.5 * N[(t * t), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \sqrt{2 \cdot z}\\
\mathbf{if}\;t \cdot t \leq 0.00049:\\
\;\;\;\;\left(x \cdot 0.5 - y\right) \cdot t\_1\\
\mathbf{else}:\\
\;\;\;\;t\_1 \cdot \left(\left(-y\right) \cdot \mathsf{fma}\left(0.5, t \cdot t, 1\right)\right)\\
\end{array}
\end{array}
if (*.f64 t t) < 4.8999999999999998e-4Initial program 99.6%
Taylor expanded in t around 0
Simplified98.5%
*-rgt-identityN/A
*-lowering-*.f64N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f6498.5
Applied egg-rr98.5%
if 4.8999999999999998e-4 < (*.f64 t t) Initial program 100.0%
Taylor expanded in t around 0
+-commutativeN/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r*N/A
distribute-rgt1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
Simplified70.3%
Taylor expanded in x around 0
mul-1-negN/A
neg-lowering-neg.f64N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6445.9
Simplified45.9%
neg-lowering-neg.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
sqrt-prodN/A
associate-*l*N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6445.9
Applied egg-rr45.9%
Final simplification71.4%
(FPCore (x y z t) :precision binary64 (* (- (* x 0.5) y) (sqrt (* 2.0 (fma z (* t t) z)))))
double code(double x, double y, double z, double t) {
return ((x * 0.5) - y) * sqrt((2.0 * fma(z, (t * t), z)));
}
function code(x, y, z, t) return Float64(Float64(Float64(x * 0.5) - y) * sqrt(Float64(2.0 * fma(z, Float64(t * t), z)))) end
code[x_, y_, z_, t_] := N[(N[(N[(x * 0.5), $MachinePrecision] - y), $MachinePrecision] * N[Sqrt[N[(2.0 * N[(z * N[(t * t), $MachinePrecision] + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(x \cdot 0.5 - y\right) \cdot \sqrt{2 \cdot \mathsf{fma}\left(z, t \cdot t, z\right)}
\end{array}
Initial program 99.8%
associate-*l*N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
exp-sqrtN/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
exp-lowering-exp.f64N/A
*-lowering-*.f6499.8
Applied egg-rr99.8%
Taylor expanded in t around 0
distribute-lft-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6484.1
Simplified84.1%
(FPCore (x y z t) :precision binary64 (let* ((t_1 (sqrt (* 2.0 z))) (t_2 (* (- y) t_1))) (if (<= y -1.65e-131) t_2 (if (<= y 1.15e-86) (* t_1 (fma x 0.5 y)) t_2))))
double code(double x, double y, double z, double t) {
double t_1 = sqrt((2.0 * z));
double t_2 = -y * t_1;
double tmp;
if (y <= -1.65e-131) {
tmp = t_2;
} else if (y <= 1.15e-86) {
tmp = t_1 * fma(x, 0.5, y);
} else {
tmp = t_2;
}
return tmp;
}
function code(x, y, z, t) t_1 = sqrt(Float64(2.0 * z)) t_2 = Float64(Float64(-y) * t_1) tmp = 0.0 if (y <= -1.65e-131) tmp = t_2; elseif (y <= 1.15e-86) tmp = Float64(t_1 * fma(x, 0.5, y)); else tmp = t_2; end return tmp end
code[x_, y_, z_, t_] := Block[{t$95$1 = N[Sqrt[N[(2.0 * z), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[((-y) * t$95$1), $MachinePrecision]}, If[LessEqual[y, -1.65e-131], t$95$2, If[LessEqual[y, 1.15e-86], N[(t$95$1 * N[(x * 0.5 + y), $MachinePrecision]), $MachinePrecision], t$95$2]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \sqrt{2 \cdot z}\\
t_2 := \left(-y\right) \cdot t\_1\\
\mathbf{if}\;y \leq -1.65 \cdot 10^{-131}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;y \leq 1.15 \cdot 10^{-86}:\\
\;\;\;\;t\_1 \cdot \mathsf{fma}\left(x, 0.5, y\right)\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if y < -1.6500000000000001e-131 or 1.14999999999999998e-86 < y Initial program 99.8%
Taylor expanded in t around 0
Simplified57.4%
Taylor expanded in x around 0
mul-1-negN/A
neg-lowering-neg.f6446.9
Simplified46.9%
*-rgt-identityN/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
neg-lowering-neg.f6446.9
Applied egg-rr46.9%
if -1.6500000000000001e-131 < y < 1.14999999999999998e-86Initial program 99.8%
associate-*l*N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
exp-sqrtN/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
exp-lowering-exp.f64N/A
*-lowering-*.f6499.8
Applied egg-rr99.8%
Taylor expanded in t around 0
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f6449.4
Simplified49.4%
Applied egg-rr46.7%
Final simplification46.8%
(FPCore (x y z t) :precision binary64 (* (- (* x 0.5) y) (sqrt (* 2.0 z))))
double code(double x, double y, double z, double t) {
return ((x * 0.5) - y) * sqrt((2.0 * z));
}
real(8) function code(x, y, z, t)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
code = ((x * 0.5d0) - y) * sqrt((2.0d0 * z))
end function
public static double code(double x, double y, double z, double t) {
return ((x * 0.5) - y) * Math.sqrt((2.0 * z));
}
def code(x, y, z, t): return ((x * 0.5) - y) * math.sqrt((2.0 * z))
function code(x, y, z, t) return Float64(Float64(Float64(x * 0.5) - y) * sqrt(Float64(2.0 * z))) end
function tmp = code(x, y, z, t) tmp = ((x * 0.5) - y) * sqrt((2.0 * z)); end
code[x_, y_, z_, t_] := N[(N[(N[(x * 0.5), $MachinePrecision] - y), $MachinePrecision] * N[Sqrt[N[(2.0 * z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(x \cdot 0.5 - y\right) \cdot \sqrt{2 \cdot z}
\end{array}
Initial program 99.8%
Taylor expanded in t around 0
Simplified54.5%
*-rgt-identityN/A
*-lowering-*.f64N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f6454.5
Applied egg-rr54.5%
(FPCore (x y z t) :precision binary64 (* (- y) (sqrt (* 2.0 z))))
double code(double x, double y, double z, double t) {
return -y * sqrt((2.0 * z));
}
real(8) function code(x, y, z, t)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
code = -y * sqrt((2.0d0 * z))
end function
public static double code(double x, double y, double z, double t) {
return -y * Math.sqrt((2.0 * z));
}
def code(x, y, z, t): return -y * math.sqrt((2.0 * z))
function code(x, y, z, t) return Float64(Float64(-y) * sqrt(Float64(2.0 * z))) end
function tmp = code(x, y, z, t) tmp = -y * sqrt((2.0 * z)); end
code[x_, y_, z_, t_] := N[((-y) * N[Sqrt[N[(2.0 * z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(-y\right) \cdot \sqrt{2 \cdot z}
\end{array}
Initial program 99.8%
Taylor expanded in t around 0
Simplified54.5%
Taylor expanded in x around 0
mul-1-negN/A
neg-lowering-neg.f6432.2
Simplified32.2%
*-rgt-identityN/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
neg-lowering-neg.f6432.2
Applied egg-rr32.2%
Final simplification32.2%
(FPCore (x y z t) :precision binary64 (* (* (- (* x 0.5) y) (sqrt (* z 2.0))) (pow (exp 1.0) (/ (* t t) 2.0))))
double code(double x, double y, double z, double t) {
return (((x * 0.5) - y) * sqrt((z * 2.0))) * pow(exp(1.0), ((t * t) / 2.0));
}
real(8) function code(x, y, z, t)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
code = (((x * 0.5d0) - y) * sqrt((z * 2.0d0))) * (exp(1.0d0) ** ((t * t) / 2.0d0))
end function
public static double code(double x, double y, double z, double t) {
return (((x * 0.5) - y) * Math.sqrt((z * 2.0))) * Math.pow(Math.exp(1.0), ((t * t) / 2.0));
}
def code(x, y, z, t): return (((x * 0.5) - y) * math.sqrt((z * 2.0))) * math.pow(math.exp(1.0), ((t * t) / 2.0))
function code(x, y, z, t) return Float64(Float64(Float64(Float64(x * 0.5) - y) * sqrt(Float64(z * 2.0))) * (exp(1.0) ^ Float64(Float64(t * t) / 2.0))) end
function tmp = code(x, y, z, t) tmp = (((x * 0.5) - y) * sqrt((z * 2.0))) * (exp(1.0) ^ ((t * t) / 2.0)); end
code[x_, y_, z_, t_] := N[(N[(N[(N[(x * 0.5), $MachinePrecision] - y), $MachinePrecision] * N[Sqrt[N[(z * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Power[N[Exp[1.0], $MachinePrecision], N[(N[(t * t), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\left(x \cdot 0.5 - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot {\left(e^{1}\right)}^{\left(\frac{t \cdot t}{2}\right)}
\end{array}
herbie shell --seed 2024199
(FPCore (x y z t)
:name "Data.Number.Erf:$cinvnormcdf from erf-2.0.0.0, A"
:precision binary64
:alt
(! :herbie-platform default (* (* (- (* x 1/2) y) (sqrt (* z 2))) (pow (exp 1) (/ (* t t) 2))))
(* (* (- (* x 0.5) y) (sqrt (* z 2.0))) (exp (/ (* t t) 2.0))))