
(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 15 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 (* (sqrt (* z (* (pow (exp 0.5) (* (* t t) 2.0)) 2.0))) (- (* x 0.5) y)))
double code(double x, double y, double z, double t) {
return sqrt((z * (pow(exp(0.5), ((t * t) * 2.0)) * 2.0))) * ((x * 0.5) - y);
}
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 = sqrt((z * ((exp(0.5d0) ** ((t * t) * 2.0d0)) * 2.0d0))) * ((x * 0.5d0) - y)
end function
public static double code(double x, double y, double z, double t) {
return Math.sqrt((z * (Math.pow(Math.exp(0.5), ((t * t) * 2.0)) * 2.0))) * ((x * 0.5) - y);
}
def code(x, y, z, t): return math.sqrt((z * (math.pow(math.exp(0.5), ((t * t) * 2.0)) * 2.0))) * ((x * 0.5) - y)
function code(x, y, z, t) return Float64(sqrt(Float64(z * Float64((exp(0.5) ^ Float64(Float64(t * t) * 2.0)) * 2.0))) * Float64(Float64(x * 0.5) - y)) end
function tmp = code(x, y, z, t) tmp = sqrt((z * ((exp(0.5) ^ ((t * t) * 2.0)) * 2.0))) * ((x * 0.5) - y); end
code[x_, y_, z_, t_] := N[(N[Sqrt[N[(z * N[(N[Power[N[Exp[0.5], $MachinePrecision], N[(N[(t * t), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[(x * 0.5), $MachinePrecision] - y), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{z \cdot \left({\left(e^{0.5}\right)}^{\left(\left(t \cdot t\right) \cdot 2\right)} \cdot 2\right)} \cdot \left(x \cdot 0.5 - y\right)
\end{array}
Initial program 99.5%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
associate-*l*N/A
*-commutativeN/A
pow1/2N/A
lift-exp.f64N/A
lift-/.f64N/A
exp-sqrtN/A
sqrt-unprodN/A
pow1/2N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
Applied rewrites99.9%
rem-square-sqrtN/A
pow1/2N/A
lift-exp.f64N/A
exp-prodN/A
*-commutativeN/A
exp-prodN/A
pow1/2N/A
lift-exp.f64N/A
exp-prodN/A
*-commutativeN/A
exp-prodN/A
pow-sqrN/A
lower-pow.f64N/A
lower-exp.f64N/A
lower-*.f6499.9
Applied rewrites99.9%
Final simplification99.9%
(FPCore (x y z t) :precision binary64 (* (sqrt (* (* (pow (exp t) t) 2.0) z)) (- (* x 0.5) y)))
double code(double x, double y, double z, double t) {
return sqrt(((pow(exp(t), t) * 2.0) * z)) * ((x * 0.5) - y);
}
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 = sqrt((((exp(t) ** t) * 2.0d0) * z)) * ((x * 0.5d0) - y)
end function
public static double code(double x, double y, double z, double t) {
return Math.sqrt(((Math.pow(Math.exp(t), t) * 2.0) * z)) * ((x * 0.5) - y);
}
def code(x, y, z, t): return math.sqrt(((math.pow(math.exp(t), t) * 2.0) * z)) * ((x * 0.5) - y)
function code(x, y, z, t) return Float64(sqrt(Float64(Float64((exp(t) ^ t) * 2.0) * z)) * Float64(Float64(x * 0.5) - y)) end
function tmp = code(x, y, z, t) tmp = sqrt((((exp(t) ^ t) * 2.0) * z)) * ((x * 0.5) - y); end
code[x_, y_, z_, t_] := N[(N[Sqrt[N[(N[(N[Power[N[Exp[t], $MachinePrecision], t], $MachinePrecision] * 2.0), $MachinePrecision] * z), $MachinePrecision]], $MachinePrecision] * N[(N[(x * 0.5), $MachinePrecision] - y), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\left({\left(e^{t}\right)}^{t} \cdot 2\right) \cdot z} \cdot \left(x \cdot 0.5 - y\right)
\end{array}
Initial program 99.5%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
associate-*l*N/A
*-commutativeN/A
pow1/2N/A
lift-exp.f64N/A
lift-/.f64N/A
exp-sqrtN/A
sqrt-unprodN/A
pow1/2N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
Applied rewrites99.9%
lift-exp.f64N/A
lift-*.f64N/A
exp-prodN/A
lower-pow.f64N/A
lower-exp.f6499.9
Applied rewrites99.9%
Final simplification99.9%
(FPCore (x y z t)
:precision binary64
(let* ((t_1 (* (sqrt (* z 2.0)) (- (* x 0.5) y))))
(if (<= (* t t) 1e-20)
t_1
(if (<= (* t t) 1e+100)
(* (- y) (sqrt (* (* (exp (* t t)) 2.0) z)))
(*
(fma
(fma (fma 0.020833333333333332 (* t t) 0.125) (* t t) 0.5)
(* t t)
1.0)
t_1)))))
double code(double x, double y, double z, double t) {
double t_1 = sqrt((z * 2.0)) * ((x * 0.5) - y);
double tmp;
if ((t * t) <= 1e-20) {
tmp = t_1;
} else if ((t * t) <= 1e+100) {
tmp = -y * sqrt(((exp((t * t)) * 2.0) * z));
} else {
tmp = fma(fma(fma(0.020833333333333332, (t * t), 0.125), (t * t), 0.5), (t * t), 1.0) * t_1;
}
return tmp;
}
function code(x, y, z, t) t_1 = Float64(sqrt(Float64(z * 2.0)) * Float64(Float64(x * 0.5) - y)) tmp = 0.0 if (Float64(t * t) <= 1e-20) tmp = t_1; elseif (Float64(t * t) <= 1e+100) tmp = Float64(Float64(-y) * sqrt(Float64(Float64(exp(Float64(t * t)) * 2.0) * z))); else tmp = Float64(fma(fma(fma(0.020833333333333332, Float64(t * t), 0.125), Float64(t * t), 0.5), Float64(t * t), 1.0) * t_1); end return tmp end
code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[Sqrt[N[(z * 2.0), $MachinePrecision]], $MachinePrecision] * N[(N[(x * 0.5), $MachinePrecision] - y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(t * t), $MachinePrecision], 1e-20], t$95$1, If[LessEqual[N[(t * t), $MachinePrecision], 1e+100], N[((-y) * N[Sqrt[N[(N[(N[Exp[N[(t * t), $MachinePrecision]], $MachinePrecision] * 2.0), $MachinePrecision] * z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(0.020833333333333332 * N[(t * t), $MachinePrecision] + 0.125), $MachinePrecision] * N[(t * t), $MachinePrecision] + 0.5), $MachinePrecision] * N[(t * t), $MachinePrecision] + 1.0), $MachinePrecision] * t$95$1), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \sqrt{z \cdot 2} \cdot \left(x \cdot 0.5 - y\right)\\
\mathbf{if}\;t \cdot t \leq 10^{-20}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t \cdot t \leq 10^{+100}:\\
\;\;\;\;\left(-y\right) \cdot \sqrt{\left(e^{t \cdot t} \cdot 2\right) \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.020833333333333332, t \cdot t, 0.125\right), t \cdot t, 0.5\right), t \cdot t, 1\right) \cdot t\_1\\
\end{array}
\end{array}
if (*.f64 t t) < 9.99999999999999945e-21Initial program 99.8%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
associate-*l*N/A
*-commutativeN/A
pow1/2N/A
lift-exp.f64N/A
lift-/.f64N/A
exp-sqrtN/A
sqrt-unprodN/A
pow1/2N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
Applied rewrites99.8%
Taylor expanded in t around 0
lower-*.f6499.8
Applied rewrites99.8%
if 9.99999999999999945e-21 < (*.f64 t t) < 1.00000000000000002e100Initial program 99.7%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
associate-*l*N/A
*-commutativeN/A
pow1/2N/A
lift-exp.f64N/A
lift-/.f64N/A
exp-sqrtN/A
sqrt-unprodN/A
pow1/2N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
Applied rewrites99.7%
Taylor expanded in y around inf
mul-1-negN/A
lower-neg.f6488.8
Applied rewrites88.8%
if 1.00000000000000002e100 < (*.f64 t t) Initial program 99.1%
Taylor expanded in t around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6499.1
Applied rewrites99.1%
Final simplification98.3%
(FPCore (x y z t) :precision binary64 (* (sqrt (* (* (exp (* t t)) 2.0) z)) (- (* x 0.5) y)))
double code(double x, double y, double z, double t) {
return sqrt(((exp((t * t)) * 2.0) * z)) * ((x * 0.5) - y);
}
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 = sqrt(((exp((t * t)) * 2.0d0) * z)) * ((x * 0.5d0) - y)
end function
public static double code(double x, double y, double z, double t) {
return Math.sqrt(((Math.exp((t * t)) * 2.0) * z)) * ((x * 0.5) - y);
}
def code(x, y, z, t): return math.sqrt(((math.exp((t * t)) * 2.0) * z)) * ((x * 0.5) - y)
function code(x, y, z, t) return Float64(sqrt(Float64(Float64(exp(Float64(t * t)) * 2.0) * z)) * Float64(Float64(x * 0.5) - y)) end
function tmp = code(x, y, z, t) tmp = sqrt(((exp((t * t)) * 2.0) * z)) * ((x * 0.5) - y); end
code[x_, y_, z_, t_] := N[(N[Sqrt[N[(N[(N[Exp[N[(t * t), $MachinePrecision]], $MachinePrecision] * 2.0), $MachinePrecision] * z), $MachinePrecision]], $MachinePrecision] * N[(N[(x * 0.5), $MachinePrecision] - y), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\left(e^{t \cdot t} \cdot 2\right) \cdot z} \cdot \left(x \cdot 0.5 - y\right)
\end{array}
Initial program 99.5%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
associate-*l*N/A
*-commutativeN/A
pow1/2N/A
lift-exp.f64N/A
lift-/.f64N/A
exp-sqrtN/A
sqrt-unprodN/A
pow1/2N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
Applied rewrites99.9%
Final simplification99.9%
(FPCore (x y z t) :precision binary64 (* (fma (fma (fma 0.020833333333333332 (* t t) 0.125) (* t t) 0.5) (* t t) 1.0) (* (sqrt (* z 2.0)) (- (* x 0.5) y))))
double code(double x, double y, double z, double t) {
return fma(fma(fma(0.020833333333333332, (t * t), 0.125), (t * t), 0.5), (t * t), 1.0) * (sqrt((z * 2.0)) * ((x * 0.5) - y));
}
function code(x, y, z, t) return Float64(fma(fma(fma(0.020833333333333332, Float64(t * t), 0.125), Float64(t * t), 0.5), Float64(t * t), 1.0) * Float64(sqrt(Float64(z * 2.0)) * Float64(Float64(x * 0.5) - y))) end
code[x_, y_, z_, t_] := N[(N[(N[(N[(0.020833333333333332 * N[(t * t), $MachinePrecision] + 0.125), $MachinePrecision] * N[(t * t), $MachinePrecision] + 0.5), $MachinePrecision] * N[(t * t), $MachinePrecision] + 1.0), $MachinePrecision] * N[(N[Sqrt[N[(z * 2.0), $MachinePrecision]], $MachinePrecision] * N[(N[(x * 0.5), $MachinePrecision] - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.020833333333333332, t \cdot t, 0.125\right), t \cdot t, 0.5\right), t \cdot t, 1\right) \cdot \left(\sqrt{z \cdot 2} \cdot \left(x \cdot 0.5 - y\right)\right)
\end{array}
Initial program 99.5%
Taylor expanded in t around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6493.8
Applied rewrites93.8%
Final simplification93.8%
(FPCore (x y z t)
:precision binary64
(let* ((t_1 (* (* x 0.5) (sqrt (* (* (fma t t 1.0) 2.0) z))))
(t_2 (sqrt (* z 2.0))))
(if (<= t 490000.0)
(* t_2 (- (* x 0.5) y))
(if (<= t 1e+116)
t_1
(if (<= t 6e+225) (* (* (- y) (fma (* t t) 0.5 1.0)) t_2) t_1)))))
double code(double x, double y, double z, double t) {
double t_1 = (x * 0.5) * sqrt(((fma(t, t, 1.0) * 2.0) * z));
double t_2 = sqrt((z * 2.0));
double tmp;
if (t <= 490000.0) {
tmp = t_2 * ((x * 0.5) - y);
} else if (t <= 1e+116) {
tmp = t_1;
} else if (t <= 6e+225) {
tmp = (-y * fma((t * t), 0.5, 1.0)) * t_2;
} else {
tmp = t_1;
}
return tmp;
}
function code(x, y, z, t) t_1 = Float64(Float64(x * 0.5) * sqrt(Float64(Float64(fma(t, t, 1.0) * 2.0) * z))) t_2 = sqrt(Float64(z * 2.0)) tmp = 0.0 if (t <= 490000.0) tmp = Float64(t_2 * Float64(Float64(x * 0.5) - y)); elseif (t <= 1e+116) tmp = t_1; elseif (t <= 6e+225) tmp = Float64(Float64(Float64(-y) * fma(Float64(t * t), 0.5, 1.0)) * t_2); else tmp = t_1; end return tmp end
code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(x * 0.5), $MachinePrecision] * N[Sqrt[N[(N[(N[(t * t + 1.0), $MachinePrecision] * 2.0), $MachinePrecision] * z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(z * 2.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t, 490000.0], N[(t$95$2 * N[(N[(x * 0.5), $MachinePrecision] - y), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 1e+116], t$95$1, If[LessEqual[t, 6e+225], N[(N[((-y) * N[(N[(t * t), $MachinePrecision] * 0.5 + 1.0), $MachinePrecision]), $MachinePrecision] * t$95$2), $MachinePrecision], t$95$1]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \left(x \cdot 0.5\right) \cdot \sqrt{\left(\mathsf{fma}\left(t, t, 1\right) \cdot 2\right) \cdot z}\\
t_2 := \sqrt{z \cdot 2}\\
\mathbf{if}\;t \leq 490000:\\
\;\;\;\;t\_2 \cdot \left(x \cdot 0.5 - y\right)\\
\mathbf{elif}\;t \leq 10^{+116}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t \leq 6 \cdot 10^{+225}:\\
\;\;\;\;\left(\left(-y\right) \cdot \mathsf{fma}\left(t \cdot t, 0.5, 1\right)\right) \cdot t\_2\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if t < 4.9e5Initial program 99.3%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
associate-*l*N/A
*-commutativeN/A
pow1/2N/A
lift-exp.f64N/A
lift-/.f64N/A
exp-sqrtN/A
sqrt-unprodN/A
pow1/2N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
Applied rewrites99.8%
Taylor expanded in t around 0
lower-*.f6468.0
Applied rewrites68.0%
if 4.9e5 < t < 1.00000000000000002e116 or 6.000000000000001e225 < t Initial program 100.0%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
associate-*l*N/A
*-commutativeN/A
pow1/2N/A
lift-exp.f64N/A
lift-/.f64N/A
exp-sqrtN/A
sqrt-unprodN/A
pow1/2N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
Applied rewrites100.0%
Taylor expanded in t around 0
+-commutativeN/A
unpow2N/A
lower-fma.f6458.0
Applied rewrites58.0%
Taylor expanded in y around 0
*-commutativeN/A
lower-*.f6450.4
Applied rewrites50.4%
if 1.00000000000000002e116 < t < 6.000000000000001e225Initial program 100.0%
Taylor expanded in t around 0
+-commutativeN/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt-outN/A
*-commutativeN/A
lower-*.f64N/A
Applied rewrites96.3%
Taylor expanded in y around inf
Applied rewrites77.3%
Applied rewrites77.3%
Final simplification66.1%
(FPCore (x y z t) :precision binary64 (let* ((t_1 (sqrt (* z 2.0))) (t_2 (* t_1 (* x 0.5)))) (if (<= (* x 0.5) -8.0) t_2 (if (<= (* x 0.5) 3.4e+42) (* t_1 (- y)) t_2))))
double code(double x, double y, double z, double t) {
double t_1 = sqrt((z * 2.0));
double t_2 = t_1 * (x * 0.5);
double tmp;
if ((x * 0.5) <= -8.0) {
tmp = t_2;
} else if ((x * 0.5) <= 3.4e+42) {
tmp = t_1 * -y;
} else {
tmp = t_2;
}
return tmp;
}
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
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = sqrt((z * 2.0d0))
t_2 = t_1 * (x * 0.5d0)
if ((x * 0.5d0) <= (-8.0d0)) then
tmp = t_2
else if ((x * 0.5d0) <= 3.4d+42) then
tmp = t_1 * -y
else
tmp = t_2
end if
code = tmp
end function
public static double code(double x, double y, double z, double t) {
double t_1 = Math.sqrt((z * 2.0));
double t_2 = t_1 * (x * 0.5);
double tmp;
if ((x * 0.5) <= -8.0) {
tmp = t_2;
} else if ((x * 0.5) <= 3.4e+42) {
tmp = t_1 * -y;
} else {
tmp = t_2;
}
return tmp;
}
def code(x, y, z, t): t_1 = math.sqrt((z * 2.0)) t_2 = t_1 * (x * 0.5) tmp = 0 if (x * 0.5) <= -8.0: tmp = t_2 elif (x * 0.5) <= 3.4e+42: tmp = t_1 * -y else: tmp = t_2 return tmp
function code(x, y, z, t) t_1 = sqrt(Float64(z * 2.0)) t_2 = Float64(t_1 * Float64(x * 0.5)) tmp = 0.0 if (Float64(x * 0.5) <= -8.0) tmp = t_2; elseif (Float64(x * 0.5) <= 3.4e+42) tmp = Float64(t_1 * Float64(-y)); else tmp = t_2; end return tmp end
function tmp_2 = code(x, y, z, t) t_1 = sqrt((z * 2.0)); t_2 = t_1 * (x * 0.5); tmp = 0.0; if ((x * 0.5) <= -8.0) tmp = t_2; elseif ((x * 0.5) <= 3.4e+42) tmp = t_1 * -y; else tmp = t_2; end tmp_2 = tmp; end
code[x_, y_, z_, t_] := Block[{t$95$1 = N[Sqrt[N[(z * 2.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * N[(x * 0.5), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(x * 0.5), $MachinePrecision], -8.0], t$95$2, If[LessEqual[N[(x * 0.5), $MachinePrecision], 3.4e+42], N[(t$95$1 * (-y)), $MachinePrecision], t$95$2]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \sqrt{z \cdot 2}\\
t_2 := t\_1 \cdot \left(x \cdot 0.5\right)\\
\mathbf{if}\;x \cdot 0.5 \leq -8:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;x \cdot 0.5 \leq 3.4 \cdot 10^{+42}:\\
\;\;\;\;t\_1 \cdot \left(-y\right)\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if (*.f64 x #s(literal 1/2 binary64)) < -8 or 3.39999999999999975e42 < (*.f64 x #s(literal 1/2 binary64)) Initial program 99.9%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
associate-*l*N/A
*-commutativeN/A
pow1/2N/A
lift-exp.f64N/A
lift-/.f64N/A
exp-sqrtN/A
sqrt-unprodN/A
pow1/2N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
Applied rewrites99.9%
rem-square-sqrtN/A
pow1/2N/A
lift-exp.f64N/A
exp-prodN/A
*-commutativeN/A
exp-prodN/A
pow1/2N/A
lift-exp.f64N/A
exp-prodN/A
*-commutativeN/A
exp-prodN/A
pow-sqrN/A
lower-pow.f64N/A
lower-exp.f64N/A
lower-*.f6499.9
Applied rewrites99.9%
Taylor expanded in t around 0
lower-*.f6453.8
Applied rewrites53.8%
Taylor expanded in y around 0
*-commutativeN/A
lower-*.f6444.2
Applied rewrites44.2%
if -8 < (*.f64 x #s(literal 1/2 binary64)) < 3.39999999999999975e42Initial program 99.1%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
associate-*l*N/A
*-commutativeN/A
pow1/2N/A
lift-exp.f64N/A
lift-/.f64N/A
exp-sqrtN/A
sqrt-unprodN/A
pow1/2N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
Applied rewrites99.9%
rem-square-sqrtN/A
pow1/2N/A
lift-exp.f64N/A
exp-prodN/A
*-commutativeN/A
exp-prodN/A
pow1/2N/A
lift-exp.f64N/A
exp-prodN/A
*-commutativeN/A
exp-prodN/A
pow-sqrN/A
lower-pow.f64N/A
lower-exp.f64N/A
lower-*.f6499.9
Applied rewrites99.9%
Taylor expanded in t around 0
lower-*.f6454.2
Applied rewrites54.2%
Taylor expanded in y around inf
mul-1-negN/A
lower-neg.f6446.3
Applied rewrites46.3%
Final simplification45.2%
(FPCore (x y z t) :precision binary64 (* (sqrt (* (fma (fma t t 2.0) (* t t) 2.0) z)) (- (* x 0.5) y)))
double code(double x, double y, double z, double t) {
return sqrt((fma(fma(t, t, 2.0), (t * t), 2.0) * z)) * ((x * 0.5) - y);
}
function code(x, y, z, t) return Float64(sqrt(Float64(fma(fma(t, t, 2.0), Float64(t * t), 2.0) * z)) * Float64(Float64(x * 0.5) - y)) end
code[x_, y_, z_, t_] := N[(N[Sqrt[N[(N[(N[(t * t + 2.0), $MachinePrecision] * N[(t * t), $MachinePrecision] + 2.0), $MachinePrecision] * z), $MachinePrecision]], $MachinePrecision] * N[(N[(x * 0.5), $MachinePrecision] - y), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\mathsf{fma}\left(\mathsf{fma}\left(t, t, 2\right), t \cdot t, 2\right) \cdot z} \cdot \left(x \cdot 0.5 - y\right)
\end{array}
Initial program 99.5%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
associate-*l*N/A
*-commutativeN/A
pow1/2N/A
lift-exp.f64N/A
lift-/.f64N/A
exp-sqrtN/A
sqrt-unprodN/A
pow1/2N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
Applied rewrites99.9%
lift-exp.f64N/A
lift-*.f64N/A
exp-prodN/A
lower-pow.f64N/A
lower-exp.f6499.9
Applied rewrites99.9%
Taylor expanded in t around 0
+-commutativeN/A
*-commutativeN/A
distribute-rgt-outN/A
associate-*l*N/A
*-commutativeN/A
distribute-lft-outN/A
lower-*.f64N/A
lower-fma.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6492.6
Applied rewrites92.6%
Final simplification92.6%
(FPCore (x y z t) :precision binary64 (if (<= (* t t) 1e-20) (* (sqrt (* z 2.0)) (- (* x 0.5) y)) (* (sqrt (* (* (fma t t 1.0) 2.0) z)) (- y))))
double code(double x, double y, double z, double t) {
double tmp;
if ((t * t) <= 1e-20) {
tmp = sqrt((z * 2.0)) * ((x * 0.5) - y);
} else {
tmp = sqrt(((fma(t, t, 1.0) * 2.0) * z)) * -y;
}
return tmp;
}
function code(x, y, z, t) tmp = 0.0 if (Float64(t * t) <= 1e-20) tmp = Float64(sqrt(Float64(z * 2.0)) * Float64(Float64(x * 0.5) - y)); else tmp = Float64(sqrt(Float64(Float64(fma(t, t, 1.0) * 2.0) * z)) * Float64(-y)); end return tmp end
code[x_, y_, z_, t_] := If[LessEqual[N[(t * t), $MachinePrecision], 1e-20], N[(N[Sqrt[N[(z * 2.0), $MachinePrecision]], $MachinePrecision] * N[(N[(x * 0.5), $MachinePrecision] - y), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(t * t + 1.0), $MachinePrecision] * 2.0), $MachinePrecision] * z), $MachinePrecision]], $MachinePrecision] * (-y)), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;t \cdot t \leq 10^{-20}:\\
\;\;\;\;\sqrt{z \cdot 2} \cdot \left(x \cdot 0.5 - y\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(\mathsf{fma}\left(t, t, 1\right) \cdot 2\right) \cdot z} \cdot \left(-y\right)\\
\end{array}
\end{array}
if (*.f64 t t) < 9.99999999999999945e-21Initial program 99.8%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
associate-*l*N/A
*-commutativeN/A
pow1/2N/A
lift-exp.f64N/A
lift-/.f64N/A
exp-sqrtN/A
sqrt-unprodN/A
pow1/2N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
Applied rewrites99.8%
Taylor expanded in t around 0
lower-*.f6499.8
Applied rewrites99.8%
if 9.99999999999999945e-21 < (*.f64 t t) Initial program 99.2%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
associate-*l*N/A
*-commutativeN/A
pow1/2N/A
lift-exp.f64N/A
lift-/.f64N/A
exp-sqrtN/A
sqrt-unprodN/A
pow1/2N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
Applied rewrites100.0%
Taylor expanded in t around 0
+-commutativeN/A
unpow2N/A
lower-fma.f6474.4
Applied rewrites74.4%
Taylor expanded in y around inf
mul-1-negN/A
lower-neg.f6448.2
Applied rewrites48.2%
Final simplification71.0%
(FPCore (x y z t) :precision binary64 (* (* (fma (* t t) 0.5 1.0) (- (* x 0.5) y)) (sqrt (* z 2.0))))
double code(double x, double y, double z, double t) {
return (fma((t * t), 0.5, 1.0) * ((x * 0.5) - y)) * sqrt((z * 2.0));
}
function code(x, y, z, t) return Float64(Float64(fma(Float64(t * t), 0.5, 1.0) * Float64(Float64(x * 0.5) - y)) * sqrt(Float64(z * 2.0))) end
code[x_, y_, z_, t_] := N[(N[(N[(N[(t * t), $MachinePrecision] * 0.5 + 1.0), $MachinePrecision] * N[(N[(x * 0.5), $MachinePrecision] - y), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(z * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\mathsf{fma}\left(t \cdot t, 0.5, 1\right) \cdot \left(x \cdot 0.5 - y\right)\right) \cdot \sqrt{z \cdot 2}
\end{array}
Initial program 99.5%
Taylor expanded in t around 0
+-commutativeN/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt-outN/A
*-commutativeN/A
lower-*.f64N/A
Applied rewrites88.7%
Applied rewrites88.9%
(FPCore (x y z t) :precision binary64 (if (<= t 490000.0) (* (sqrt (* z 2.0)) (- (* x 0.5) y)) (* (* x 0.5) (sqrt (* (* (fma t t 1.0) 2.0) z)))))
double code(double x, double y, double z, double t) {
double tmp;
if (t <= 490000.0) {
tmp = sqrt((z * 2.0)) * ((x * 0.5) - y);
} else {
tmp = (x * 0.5) * sqrt(((fma(t, t, 1.0) * 2.0) * z));
}
return tmp;
}
function code(x, y, z, t) tmp = 0.0 if (t <= 490000.0) tmp = Float64(sqrt(Float64(z * 2.0)) * Float64(Float64(x * 0.5) - y)); else tmp = Float64(Float64(x * 0.5) * sqrt(Float64(Float64(fma(t, t, 1.0) * 2.0) * z))); end return tmp end
code[x_, y_, z_, t_] := If[LessEqual[t, 490000.0], N[(N[Sqrt[N[(z * 2.0), $MachinePrecision]], $MachinePrecision] * N[(N[(x * 0.5), $MachinePrecision] - y), $MachinePrecision]), $MachinePrecision], N[(N[(x * 0.5), $MachinePrecision] * N[Sqrt[N[(N[(N[(t * t + 1.0), $MachinePrecision] * 2.0), $MachinePrecision] * z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;t \leq 490000:\\
\;\;\;\;\sqrt{z \cdot 2} \cdot \left(x \cdot 0.5 - y\right)\\
\mathbf{else}:\\
\;\;\;\;\left(x \cdot 0.5\right) \cdot \sqrt{\left(\mathsf{fma}\left(t, t, 1\right) \cdot 2\right) \cdot z}\\
\end{array}
\end{array}
if t < 4.9e5Initial program 99.3%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
associate-*l*N/A
*-commutativeN/A
pow1/2N/A
lift-exp.f64N/A
lift-/.f64N/A
exp-sqrtN/A
sqrt-unprodN/A
pow1/2N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
Applied rewrites99.8%
Taylor expanded in t around 0
lower-*.f6468.0
Applied rewrites68.0%
if 4.9e5 < t Initial program 100.0%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
associate-*l*N/A
*-commutativeN/A
pow1/2N/A
lift-exp.f64N/A
lift-/.f64N/A
exp-sqrtN/A
sqrt-unprodN/A
pow1/2N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
Applied rewrites100.0%
Taylor expanded in t around 0
+-commutativeN/A
unpow2N/A
lower-fma.f6467.2
Applied rewrites67.2%
Taylor expanded in y around 0
*-commutativeN/A
lower-*.f6456.4
Applied rewrites56.4%
Final simplification65.0%
(FPCore (x y z t) :precision binary64 (* (sqrt (* (* (fma t t 1.0) 2.0) z)) (- (* x 0.5) y)))
double code(double x, double y, double z, double t) {
return sqrt(((fma(t, t, 1.0) * 2.0) * z)) * ((x * 0.5) - y);
}
function code(x, y, z, t) return Float64(sqrt(Float64(Float64(fma(t, t, 1.0) * 2.0) * z)) * Float64(Float64(x * 0.5) - y)) end
code[x_, y_, z_, t_] := N[(N[Sqrt[N[(N[(N[(t * t + 1.0), $MachinePrecision] * 2.0), $MachinePrecision] * z), $MachinePrecision]], $MachinePrecision] * N[(N[(x * 0.5), $MachinePrecision] - y), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\left(\mathsf{fma}\left(t, t, 1\right) \cdot 2\right) \cdot z} \cdot \left(x \cdot 0.5 - y\right)
\end{array}
Initial program 99.5%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
associate-*l*N/A
*-commutativeN/A
pow1/2N/A
lift-exp.f64N/A
lift-/.f64N/A
exp-sqrtN/A
sqrt-unprodN/A
pow1/2N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
Applied rewrites99.9%
Taylor expanded in t around 0
+-commutativeN/A
unpow2N/A
lower-fma.f6485.6
Applied rewrites85.6%
Final simplification85.6%
(FPCore (x y z t) :precision binary64 (* (sqrt (* (fma (* t t) z z) 2.0)) (- (* x 0.5) y)))
double code(double x, double y, double z, double t) {
return sqrt((fma((t * t), z, z) * 2.0)) * ((x * 0.5) - y);
}
function code(x, y, z, t) return Float64(sqrt(Float64(fma(Float64(t * t), z, z) * 2.0)) * Float64(Float64(x * 0.5) - y)) end
code[x_, y_, z_, t_] := N[(N[Sqrt[N[(N[(N[(t * t), $MachinePrecision] * z + z), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] * N[(N[(x * 0.5), $MachinePrecision] - y), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\mathsf{fma}\left(t \cdot t, z, z\right) \cdot 2} \cdot \left(x \cdot 0.5 - y\right)
\end{array}
Initial program 99.5%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
associate-*l*N/A
*-commutativeN/A
pow1/2N/A
lift-exp.f64N/A
lift-/.f64N/A
exp-sqrtN/A
sqrt-unprodN/A
pow1/2N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
Applied rewrites99.9%
Taylor expanded in t around 0
distribute-lft-outN/A
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6485.6
Applied rewrites85.6%
Final simplification85.6%
(FPCore (x y z t) :precision binary64 (* (sqrt (* z 2.0)) (- (* x 0.5) y)))
double code(double x, double y, double z, double t) {
return sqrt((z * 2.0)) * ((x * 0.5) - y);
}
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 = sqrt((z * 2.0d0)) * ((x * 0.5d0) - y)
end function
public static double code(double x, double y, double z, double t) {
return Math.sqrt((z * 2.0)) * ((x * 0.5) - y);
}
def code(x, y, z, t): return math.sqrt((z * 2.0)) * ((x * 0.5) - y)
function code(x, y, z, t) return Float64(sqrt(Float64(z * 2.0)) * Float64(Float64(x * 0.5) - y)) end
function tmp = code(x, y, z, t) tmp = sqrt((z * 2.0)) * ((x * 0.5) - y); end
code[x_, y_, z_, t_] := N[(N[Sqrt[N[(z * 2.0), $MachinePrecision]], $MachinePrecision] * N[(N[(x * 0.5), $MachinePrecision] - y), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{z \cdot 2} \cdot \left(x \cdot 0.5 - y\right)
\end{array}
Initial program 99.5%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
associate-*l*N/A
*-commutativeN/A
pow1/2N/A
lift-exp.f64N/A
lift-/.f64N/A
exp-sqrtN/A
sqrt-unprodN/A
pow1/2N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
Applied rewrites99.9%
Taylor expanded in t around 0
lower-*.f6454.0
Applied rewrites54.0%
Final simplification54.0%
(FPCore (x y z t) :precision binary64 (* (sqrt (* z 2.0)) (- y)))
double code(double x, double y, double z, double t) {
return sqrt((z * 2.0)) * -y;
}
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 = sqrt((z * 2.0d0)) * -y
end function
public static double code(double x, double y, double z, double t) {
return Math.sqrt((z * 2.0)) * -y;
}
def code(x, y, z, t): return math.sqrt((z * 2.0)) * -y
function code(x, y, z, t) return Float64(sqrt(Float64(z * 2.0)) * Float64(-y)) end
function tmp = code(x, y, z, t) tmp = sqrt((z * 2.0)) * -y; end
code[x_, y_, z_, t_] := N[(N[Sqrt[N[(z * 2.0), $MachinePrecision]], $MachinePrecision] * (-y)), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{z \cdot 2} \cdot \left(-y\right)
\end{array}
Initial program 99.5%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
associate-*l*N/A
*-commutativeN/A
pow1/2N/A
lift-exp.f64N/A
lift-/.f64N/A
exp-sqrtN/A
sqrt-unprodN/A
pow1/2N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
Applied rewrites99.9%
rem-square-sqrtN/A
pow1/2N/A
lift-exp.f64N/A
exp-prodN/A
*-commutativeN/A
exp-prodN/A
pow1/2N/A
lift-exp.f64N/A
exp-prodN/A
*-commutativeN/A
exp-prodN/A
pow-sqrN/A
lower-pow.f64N/A
lower-exp.f64N/A
lower-*.f6499.9
Applied rewrites99.9%
Taylor expanded in t around 0
lower-*.f6454.0
Applied rewrites54.0%
Taylor expanded in y around inf
mul-1-negN/A
lower-neg.f6430.0
Applied rewrites30.0%
Final simplification30.0%
(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 2024235
(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))))