
(FPCore (x y z t a b c i) :precision binary64 (+ (+ (+ (+ (+ (* x (log y)) z) t) a) (* (- b 0.5) (log c))) (* y i)))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
return (((((x * log(y)) + z) + t) + a) + ((b - 0.5) * log(c))) + (y * i);
}
real(8) function code(x, y, z, t, a, b, c, i)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
code = (((((x * log(y)) + z) + t) + a) + ((b - 0.5d0) * log(c))) + (y * i)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
return (((((x * Math.log(y)) + z) + t) + a) + ((b - 0.5) * Math.log(c))) + (y * i);
}
def code(x, y, z, t, a, b, c, i): return (((((x * math.log(y)) + z) + t) + a) + ((b - 0.5) * math.log(c))) + (y * i)
function code(x, y, z, t, a, b, c, i) return Float64(Float64(Float64(Float64(Float64(Float64(x * log(y)) + z) + t) + a) + Float64(Float64(b - 0.5) * log(c))) + Float64(y * i)) end
function tmp = code(x, y, z, t, a, b, c, i) tmp = (((((x * log(y)) + z) + t) + a) + ((b - 0.5) * log(c))) + (y * i); end
code[x_, y_, z_, t_, a_, b_, c_, i_] := N[(N[(N[(N[(N[(N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision] + z), $MachinePrecision] + t), $MachinePrecision] + a), $MachinePrecision] + N[(N[(b - 0.5), $MachinePrecision] * N[Log[c], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(y * i), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\left(\left(\left(x \cdot \log y + z\right) + t\right) + a\right) + \left(b - 0.5\right) \cdot \log c\right) + y \cdot i
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 17 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a b c i) :precision binary64 (+ (+ (+ (+ (+ (* x (log y)) z) t) a) (* (- b 0.5) (log c))) (* y i)))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
return (((((x * log(y)) + z) + t) + a) + ((b - 0.5) * log(c))) + (y * i);
}
real(8) function code(x, y, z, t, a, b, c, i)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
code = (((((x * log(y)) + z) + t) + a) + ((b - 0.5d0) * log(c))) + (y * i)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
return (((((x * Math.log(y)) + z) + t) + a) + ((b - 0.5) * Math.log(c))) + (y * i);
}
def code(x, y, z, t, a, b, c, i): return (((((x * math.log(y)) + z) + t) + a) + ((b - 0.5) * math.log(c))) + (y * i)
function code(x, y, z, t, a, b, c, i) return Float64(Float64(Float64(Float64(Float64(Float64(x * log(y)) + z) + t) + a) + Float64(Float64(b - 0.5) * log(c))) + Float64(y * i)) end
function tmp = code(x, y, z, t, a, b, c, i) tmp = (((((x * log(y)) + z) + t) + a) + ((b - 0.5) * log(c))) + (y * i); end
code[x_, y_, z_, t_, a_, b_, c_, i_] := N[(N[(N[(N[(N[(N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision] + z), $MachinePrecision] + t), $MachinePrecision] + a), $MachinePrecision] + N[(N[(b - 0.5), $MachinePrecision] * N[Log[c], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(y * i), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\left(\left(\left(x \cdot \log y + z\right) + t\right) + a\right) + \left(b - 0.5\right) \cdot \log c\right) + y \cdot i
\end{array}
(FPCore (x y z t a b c i) :precision binary64 (+ (+ (+ (+ (+ (* x (log y)) z) t) a) (* (- b 0.5) (log c))) (* y i)))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
return (((((x * log(y)) + z) + t) + a) + ((b - 0.5) * log(c))) + (y * i);
}
real(8) function code(x, y, z, t, a, b, c, i)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
code = (((((x * log(y)) + z) + t) + a) + ((b - 0.5d0) * log(c))) + (y * i)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
return (((((x * Math.log(y)) + z) + t) + a) + ((b - 0.5) * Math.log(c))) + (y * i);
}
def code(x, y, z, t, a, b, c, i): return (((((x * math.log(y)) + z) + t) + a) + ((b - 0.5) * math.log(c))) + (y * i)
function code(x, y, z, t, a, b, c, i) return Float64(Float64(Float64(Float64(Float64(Float64(x * log(y)) + z) + t) + a) + Float64(Float64(b - 0.5) * log(c))) + Float64(y * i)) end
function tmp = code(x, y, z, t, a, b, c, i) tmp = (((((x * log(y)) + z) + t) + a) + ((b - 0.5) * log(c))) + (y * i); end
code[x_, y_, z_, t_, a_, b_, c_, i_] := N[(N[(N[(N[(N[(N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision] + z), $MachinePrecision] + t), $MachinePrecision] + a), $MachinePrecision] + N[(N[(b - 0.5), $MachinePrecision] * N[Log[c], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(y * i), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\left(\left(\left(x \cdot \log y + z\right) + t\right) + a\right) + \left(b - 0.5\right) \cdot \log c\right) + y \cdot i
\end{array}
Initial program 99.8%
(FPCore (x y z t a b c i)
:precision binary64
(let* ((t_1 (* x (log y)))
(t_2 (+ (+ (+ (+ (+ t_1 z) t) a) (* (- b 0.5) (log c))) (* y i))))
(if (<= t_2 -1e+300)
(fma i y t_1)
(if (<= t_2 -4e+82)
(fma x (log y) z)
(if (<= t_2 2e+226) (+ a (* b (log c))) (fma y i a))))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double t_1 = x * log(y);
double t_2 = ((((t_1 + z) + t) + a) + ((b - 0.5) * log(c))) + (y * i);
double tmp;
if (t_2 <= -1e+300) {
tmp = fma(i, y, t_1);
} else if (t_2 <= -4e+82) {
tmp = fma(x, log(y), z);
} else if (t_2 <= 2e+226) {
tmp = a + (b * log(c));
} else {
tmp = fma(y, i, a);
}
return tmp;
}
function code(x, y, z, t, a, b, c, i) t_1 = Float64(x * log(y)) t_2 = Float64(Float64(Float64(Float64(Float64(t_1 + z) + t) + a) + Float64(Float64(b - 0.5) * log(c))) + Float64(y * i)) tmp = 0.0 if (t_2 <= -1e+300) tmp = fma(i, y, t_1); elseif (t_2 <= -4e+82) tmp = fma(x, log(y), z); elseif (t_2 <= 2e+226) tmp = Float64(a + Float64(b * log(c))); else tmp = fma(y, i, a); end return tmp end
code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(N[(N[(t$95$1 + z), $MachinePrecision] + t), $MachinePrecision] + a), $MachinePrecision] + N[(N[(b - 0.5), $MachinePrecision] * N[Log[c], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(y * i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -1e+300], N[(i * y + t$95$1), $MachinePrecision], If[LessEqual[t$95$2, -4e+82], N[(x * N[Log[y], $MachinePrecision] + z), $MachinePrecision], If[LessEqual[t$95$2, 2e+226], N[(a + N[(b * N[Log[c], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(y * i + a), $MachinePrecision]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := x \cdot \log y\\
t_2 := \left(\left(\left(\left(t\_1 + z\right) + t\right) + a\right) + \left(b - 0.5\right) \cdot \log c\right) + y \cdot i\\
\mathbf{if}\;t\_2 \leq -1 \cdot 10^{+300}:\\
\;\;\;\;\mathsf{fma}\left(i, y, t\_1\right)\\
\mathbf{elif}\;t\_2 \leq -4 \cdot 10^{+82}:\\
\;\;\;\;\mathsf{fma}\left(x, \log y, z\right)\\
\mathbf{elif}\;t\_2 \leq 2 \cdot 10^{+226}:\\
\;\;\;\;a + b \cdot \log c\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(y, i, a\right)\\
\end{array}
\end{array}
if (+.f64 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 x (log.f64 y)) z) t) a) (*.f64 (-.f64 b #s(literal 1/2 binary64)) (log.f64 c))) (*.f64 y i)) < -1.0000000000000001e300Initial program 99.9%
Taylor expanded in t around 0
lower-+.f64N/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
associate-+r+N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f6499.9
Simplified99.9%
Taylor expanded in a around 0
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f6499.9
Simplified99.9%
Taylor expanded in x around inf
lower-*.f64N/A
lower-log.f6486.5
Simplified86.5%
if -1.0000000000000001e300 < (+.f64 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 x (log.f64 y)) z) t) a) (*.f64 (-.f64 b #s(literal 1/2 binary64)) (log.f64 c))) (*.f64 y i)) < -3.9999999999999999e82Initial program 99.9%
Taylor expanded in x around -inf
mul-1-negN/A
distribute-rgt-neg-inN/A
distribute-lft-outN/A
mul-1-negN/A
remove-double-negN/A
lower-*.f64N/A
lower-+.f64N/A
lower-log.f64N/A
lower-/.f64N/A
Simplified62.1%
Taylor expanded in z around inf
lower-/.f6431.8
Simplified31.8%
Taylor expanded in x around 0
+-commutativeN/A
lower-fma.f64N/A
lower-log.f6438.7
Simplified38.7%
if -3.9999999999999999e82 < (+.f64 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 x (log.f64 y)) z) t) a) (*.f64 (-.f64 b #s(literal 1/2 binary64)) (log.f64 c))) (*.f64 y i)) < 1.99999999999999992e226Initial program 99.7%
Taylor expanded in t around 0
lower-+.f64N/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
associate-+r+N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f6482.7
Simplified82.7%
Taylor expanded in b around inf
*-commutativeN/A
lower-*.f64N/A
lower-log.f6441.9
Simplified41.9%
if 1.99999999999999992e226 < (+.f64 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 x (log.f64 y)) z) t) a) (*.f64 (-.f64 b #s(literal 1/2 binary64)) (log.f64 c))) (*.f64 y i)) Initial program 99.9%
Taylor expanded in t around 0
lower-+.f64N/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
associate-+r+N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f6487.2
Simplified87.2%
Taylor expanded in i around inf
lower-*.f6456.1
Simplified56.1%
Taylor expanded in a around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f6456.1
Simplified56.1%
Final simplification49.0%
(FPCore (x y z t a b c i)
:precision binary64
(let* ((t_1
(+
(+ (+ (+ (+ (* x (log y)) z) t) a) (* (- b 0.5) (log c)))
(* y i))))
(if (<= t_1 -5e+303)
(* y (+ i (/ z y)))
(if (<= t_1 -4e+82)
(fma x (log y) z)
(if (<= t_1 2e+226) (+ a (* b (log c))) (fma y i a))))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double t_1 = (((((x * log(y)) + z) + t) + a) + ((b - 0.5) * log(c))) + (y * i);
double tmp;
if (t_1 <= -5e+303) {
tmp = y * (i + (z / y));
} else if (t_1 <= -4e+82) {
tmp = fma(x, log(y), z);
} else if (t_1 <= 2e+226) {
tmp = a + (b * log(c));
} else {
tmp = fma(y, i, a);
}
return tmp;
}
function code(x, y, z, t, a, b, c, i) t_1 = Float64(Float64(Float64(Float64(Float64(Float64(x * log(y)) + z) + t) + a) + Float64(Float64(b - 0.5) * log(c))) + Float64(y * i)) tmp = 0.0 if (t_1 <= -5e+303) tmp = Float64(y * Float64(i + Float64(z / y))); elseif (t_1 <= -4e+82) tmp = fma(x, log(y), z); elseif (t_1 <= 2e+226) tmp = Float64(a + Float64(b * log(c))); else tmp = fma(y, i, a); end return tmp end
code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(N[(N[(N[(N[(N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision] + z), $MachinePrecision] + t), $MachinePrecision] + a), $MachinePrecision] + N[(N[(b - 0.5), $MachinePrecision] * N[Log[c], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(y * i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+303], N[(y * N[(i + N[(z / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, -4e+82], N[(x * N[Log[y], $MachinePrecision] + z), $MachinePrecision], If[LessEqual[t$95$1, 2e+226], N[(a + N[(b * N[Log[c], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(y * i + a), $MachinePrecision]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \left(\left(\left(\left(x \cdot \log y + z\right) + t\right) + a\right) + \left(b - 0.5\right) \cdot \log c\right) + y \cdot i\\
\mathbf{if}\;t\_1 \leq -5 \cdot 10^{+303}:\\
\;\;\;\;y \cdot \left(i + \frac{z}{y}\right)\\
\mathbf{elif}\;t\_1 \leq -4 \cdot 10^{+82}:\\
\;\;\;\;\mathsf{fma}\left(x, \log y, z\right)\\
\mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+226}:\\
\;\;\;\;a + b \cdot \log c\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(y, i, a\right)\\
\end{array}
\end{array}
if (+.f64 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 x (log.f64 y)) z) t) a) (*.f64 (-.f64 b #s(literal 1/2 binary64)) (log.f64 c))) (*.f64 y i)) < -4.9999999999999997e303Initial program 100.0%
Taylor expanded in x around inf
lower-*.f64N/A
associate-+r+N/A
+-commutativeN/A
lower-+.f64N/A
lower-+.f64N/A
lower-/.f64N/A
+-commutativeN/A
associate-/l*N/A
lower-fma.f64N/A
lower-log.f64N/A
lower-/.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
lower-/.f64N/A
Simplified84.0%
Taylor expanded in z around inf
lower-/.f6483.6
Simplified83.6%
Taylor expanded in y around inf
lower-*.f64N/A
lower-+.f64N/A
lower-/.f6489.6
Simplified89.6%
if -4.9999999999999997e303 < (+.f64 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 x (log.f64 y)) z) t) a) (*.f64 (-.f64 b #s(literal 1/2 binary64)) (log.f64 c))) (*.f64 y i)) < -3.9999999999999999e82Initial program 99.9%
Taylor expanded in x around -inf
mul-1-negN/A
distribute-rgt-neg-inN/A
distribute-lft-outN/A
mul-1-negN/A
remove-double-negN/A
lower-*.f64N/A
lower-+.f64N/A
lower-log.f64N/A
lower-/.f64N/A
Simplified62.8%
Taylor expanded in z around inf
lower-/.f6432.6
Simplified32.6%
Taylor expanded in x around 0
+-commutativeN/A
lower-fma.f64N/A
lower-log.f6439.2
Simplified39.2%
if -3.9999999999999999e82 < (+.f64 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 x (log.f64 y)) z) t) a) (*.f64 (-.f64 b #s(literal 1/2 binary64)) (log.f64 c))) (*.f64 y i)) < 1.99999999999999992e226Initial program 99.7%
Taylor expanded in t around 0
lower-+.f64N/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
associate-+r+N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f6482.7
Simplified82.7%
Taylor expanded in b around inf
*-commutativeN/A
lower-*.f64N/A
lower-log.f6441.9
Simplified41.9%
if 1.99999999999999992e226 < (+.f64 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 x (log.f64 y)) z) t) a) (*.f64 (-.f64 b #s(literal 1/2 binary64)) (log.f64 c))) (*.f64 y i)) Initial program 99.9%
Taylor expanded in t around 0
lower-+.f64N/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
associate-+r+N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f6487.2
Simplified87.2%
Taylor expanded in i around inf
lower-*.f6456.1
Simplified56.1%
Taylor expanded in a around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f6456.1
Simplified56.1%
Final simplification48.7%
(FPCore (x y z t a b c i)
:precision binary64
(let* ((t_1
(+
(+ (+ (+ (+ (* x (log y)) z) t) a) (* (- b 0.5) (log c)))
(* y i))))
(if (<= t_1 -5e+303)
(* y (+ i (/ z y)))
(if (<= t_1 5e+85) (fma x (log y) z) (fma y i a)))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double t_1 = (((((x * log(y)) + z) + t) + a) + ((b - 0.5) * log(c))) + (y * i);
double tmp;
if (t_1 <= -5e+303) {
tmp = y * (i + (z / y));
} else if (t_1 <= 5e+85) {
tmp = fma(x, log(y), z);
} else {
tmp = fma(y, i, a);
}
return tmp;
}
function code(x, y, z, t, a, b, c, i) t_1 = Float64(Float64(Float64(Float64(Float64(Float64(x * log(y)) + z) + t) + a) + Float64(Float64(b - 0.5) * log(c))) + Float64(y * i)) tmp = 0.0 if (t_1 <= -5e+303) tmp = Float64(y * Float64(i + Float64(z / y))); elseif (t_1 <= 5e+85) tmp = fma(x, log(y), z); else tmp = fma(y, i, a); end return tmp end
code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(N[(N[(N[(N[(N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision] + z), $MachinePrecision] + t), $MachinePrecision] + a), $MachinePrecision] + N[(N[(b - 0.5), $MachinePrecision] * N[Log[c], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(y * i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+303], N[(y * N[(i + N[(z / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e+85], N[(x * N[Log[y], $MachinePrecision] + z), $MachinePrecision], N[(y * i + a), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \left(\left(\left(\left(x \cdot \log y + z\right) + t\right) + a\right) + \left(b - 0.5\right) \cdot \log c\right) + y \cdot i\\
\mathbf{if}\;t\_1 \leq -5 \cdot 10^{+303}:\\
\;\;\;\;y \cdot \left(i + \frac{z}{y}\right)\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+85}:\\
\;\;\;\;\mathsf{fma}\left(x, \log y, z\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(y, i, a\right)\\
\end{array}
\end{array}
if (+.f64 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 x (log.f64 y)) z) t) a) (*.f64 (-.f64 b #s(literal 1/2 binary64)) (log.f64 c))) (*.f64 y i)) < -4.9999999999999997e303Initial program 100.0%
Taylor expanded in x around inf
lower-*.f64N/A
associate-+r+N/A
+-commutativeN/A
lower-+.f64N/A
lower-+.f64N/A
lower-/.f64N/A
+-commutativeN/A
associate-/l*N/A
lower-fma.f64N/A
lower-log.f64N/A
lower-/.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
lower-/.f64N/A
Simplified84.0%
Taylor expanded in z around inf
lower-/.f6483.6
Simplified83.6%
Taylor expanded in y around inf
lower-*.f64N/A
lower-+.f64N/A
lower-/.f6489.6
Simplified89.6%
if -4.9999999999999997e303 < (+.f64 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 x (log.f64 y)) z) t) a) (*.f64 (-.f64 b #s(literal 1/2 binary64)) (log.f64 c))) (*.f64 y i)) < 5.0000000000000001e85Initial program 99.9%
Taylor expanded in x around -inf
mul-1-negN/A
distribute-rgt-neg-inN/A
distribute-lft-outN/A
mul-1-negN/A
remove-double-negN/A
lower-*.f64N/A
lower-+.f64N/A
lower-log.f64N/A
lower-/.f64N/A
Simplified66.1%
Taylor expanded in z around inf
lower-/.f6430.3
Simplified30.3%
Taylor expanded in x around 0
+-commutativeN/A
lower-fma.f64N/A
lower-log.f6436.2
Simplified36.2%
if 5.0000000000000001e85 < (+.f64 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 x (log.f64 y)) z) t) a) (*.f64 (-.f64 b #s(literal 1/2 binary64)) (log.f64 c))) (*.f64 y i)) Initial program 99.8%
Taylor expanded in t around 0
lower-+.f64N/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
associate-+r+N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f6485.3
Simplified85.3%
Taylor expanded in i around inf
lower-*.f6445.1
Simplified45.1%
Taylor expanded in a around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f6445.1
Simplified45.1%
(FPCore (x y z t a b c i)
:precision binary64
(if (<=
(+ (+ (+ (+ (+ (* x (log y)) z) t) a) (* (- b 0.5) (log c))) (* y i))
-1e+28)
(fma y i z)
(fma y i a)))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double tmp;
if (((((((x * log(y)) + z) + t) + a) + ((b - 0.5) * log(c))) + (y * i)) <= -1e+28) {
tmp = fma(y, i, z);
} else {
tmp = fma(y, i, a);
}
return tmp;
}
function code(x, y, z, t, a, b, c, i) tmp = 0.0 if (Float64(Float64(Float64(Float64(Float64(Float64(x * log(y)) + z) + t) + a) + Float64(Float64(b - 0.5) * log(c))) + Float64(y * i)) <= -1e+28) tmp = fma(y, i, z); else tmp = fma(y, i, a); end return tmp end
code[x_, y_, z_, t_, a_, b_, c_, i_] := If[LessEqual[N[(N[(N[(N[(N[(N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision] + z), $MachinePrecision] + t), $MachinePrecision] + a), $MachinePrecision] + N[(N[(b - 0.5), $MachinePrecision] * N[Log[c], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(y * i), $MachinePrecision]), $MachinePrecision], -1e+28], N[(y * i + z), $MachinePrecision], N[(y * i + a), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\left(\left(\left(\left(x \cdot \log y + z\right) + t\right) + a\right) + \left(b - 0.5\right) \cdot \log c\right) + y \cdot i \leq -1 \cdot 10^{+28}:\\
\;\;\;\;\mathsf{fma}\left(y, i, z\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(y, i, a\right)\\
\end{array}
\end{array}
if (+.f64 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 x (log.f64 y)) z) t) a) (*.f64 (-.f64 b #s(literal 1/2 binary64)) (log.f64 c))) (*.f64 y i)) < -9.99999999999999958e27Initial program 99.9%
Taylor expanded in x around inf
lower-*.f64N/A
associate-+r+N/A
+-commutativeN/A
lower-+.f64N/A
lower-+.f64N/A
lower-/.f64N/A
+-commutativeN/A
associate-/l*N/A
lower-fma.f64N/A
lower-log.f64N/A
lower-/.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
lower-/.f64N/A
Simplified68.8%
Taylor expanded in z around inf
lower-/.f6430.7
Simplified30.7%
Taylor expanded in x around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f6438.9
Simplified38.9%
if -9.99999999999999958e27 < (+.f64 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 x (log.f64 y)) z) t) a) (*.f64 (-.f64 b #s(literal 1/2 binary64)) (log.f64 c))) (*.f64 y i)) Initial program 99.8%
Taylor expanded in t around 0
lower-+.f64N/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
associate-+r+N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f6485.5
Simplified85.5%
Taylor expanded in i around inf
lower-*.f6442.4
Simplified42.4%
Taylor expanded in a around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f6442.4
Simplified42.4%
(FPCore (x y z t a b c i)
:precision binary64
(let* ((t_1 (fma i y (fma x (log y) (fma (log c) (+ b -0.5) z)))))
(if (<= x -2.6e+118)
t_1
(if (<= x 5.5e+189)
(+ a (+ (fma i y z) (fma (log c) (+ b -0.5) t)))
t_1))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double t_1 = fma(i, y, fma(x, log(y), fma(log(c), (b + -0.5), z)));
double tmp;
if (x <= -2.6e+118) {
tmp = t_1;
} else if (x <= 5.5e+189) {
tmp = a + (fma(i, y, z) + fma(log(c), (b + -0.5), t));
} else {
tmp = t_1;
}
return tmp;
}
function code(x, y, z, t, a, b, c, i) t_1 = fma(i, y, fma(x, log(y), fma(log(c), Float64(b + -0.5), z))) tmp = 0.0 if (x <= -2.6e+118) tmp = t_1; elseif (x <= 5.5e+189) tmp = Float64(a + Float64(fma(i, y, z) + fma(log(c), Float64(b + -0.5), t))); else tmp = t_1; end return tmp end
code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(i * y + N[(x * N[Log[y], $MachinePrecision] + N[(N[Log[c], $MachinePrecision] * N[(b + -0.5), $MachinePrecision] + z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -2.6e+118], t$95$1, If[LessEqual[x, 5.5e+189], N[(a + N[(N[(i * y + z), $MachinePrecision] + N[(N[Log[c], $MachinePrecision] * N[(b + -0.5), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \mathsf{fma}\left(i, y, \mathsf{fma}\left(x, \log y, \mathsf{fma}\left(\log c, b + -0.5, z\right)\right)\right)\\
\mathbf{if}\;x \leq -2.6 \cdot 10^{+118}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;x \leq 5.5 \cdot 10^{+189}:\\
\;\;\;\;a + \left(\mathsf{fma}\left(i, y, z\right) + \mathsf{fma}\left(\log c, b + -0.5, t\right)\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if x < -2.60000000000000016e118 or 5.5e189 < x Initial program 99.7%
Taylor expanded in t around 0
lower-+.f64N/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
associate-+r+N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f6492.9
Simplified92.9%
Taylor expanded in a around 0
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f6489.9
Simplified89.9%
if -2.60000000000000016e118 < x < 5.5e189Initial program 99.9%
Taylor expanded in x around 0
lower-+.f64N/A
+-commutativeN/A
associate-+r+N/A
associate-+l+N/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f6497.7
Simplified97.7%
(FPCore (x y z t a b c i)
:precision binary64
(let* ((t_1 (fma i y (fma x (log y) (* b (log c))))))
(if (<= x -2.9e+118)
t_1
(if (<= x 5.6e+191)
(+ a (+ (fma i y z) (fma (log c) (+ b -0.5) t)))
t_1))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double t_1 = fma(i, y, fma(x, log(y), (b * log(c))));
double tmp;
if (x <= -2.9e+118) {
tmp = t_1;
} else if (x <= 5.6e+191) {
tmp = a + (fma(i, y, z) + fma(log(c), (b + -0.5), t));
} else {
tmp = t_1;
}
return tmp;
}
function code(x, y, z, t, a, b, c, i) t_1 = fma(i, y, fma(x, log(y), Float64(b * log(c)))) tmp = 0.0 if (x <= -2.9e+118) tmp = t_1; elseif (x <= 5.6e+191) tmp = Float64(a + Float64(fma(i, y, z) + fma(log(c), Float64(b + -0.5), t))); else tmp = t_1; end return tmp end
code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(i * y + N[(x * N[Log[y], $MachinePrecision] + N[(b * N[Log[c], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -2.9e+118], t$95$1, If[LessEqual[x, 5.6e+191], N[(a + N[(N[(i * y + z), $MachinePrecision] + N[(N[Log[c], $MachinePrecision] * N[(b + -0.5), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \mathsf{fma}\left(i, y, \mathsf{fma}\left(x, \log y, b \cdot \log c\right)\right)\\
\mathbf{if}\;x \leq -2.9 \cdot 10^{+118}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;x \leq 5.6 \cdot 10^{+191}:\\
\;\;\;\;a + \left(\mathsf{fma}\left(i, y, z\right) + \mathsf{fma}\left(\log c, b + -0.5, t\right)\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if x < -2.90000000000000016e118 or 5.5999999999999998e191 < x Initial program 99.7%
Taylor expanded in t around 0
lower-+.f64N/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
associate-+r+N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f6492.9
Simplified92.9%
Taylor expanded in a around 0
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f6489.9
Simplified89.9%
Taylor expanded in b around inf
*-commutativeN/A
lower-*.f64N/A
lower-log.f6486.7
Simplified86.7%
if -2.90000000000000016e118 < x < 5.5999999999999998e191Initial program 99.9%
Taylor expanded in x around 0
lower-+.f64N/A
+-commutativeN/A
associate-+r+N/A
associate-+l+N/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f6497.7
Simplified97.7%
Final simplification95.0%
(FPCore (x y z t a b c i) :precision binary64 (+ a (fma i y (fma (log c) (+ b -0.5) (fma x (log y) z)))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
return a + fma(i, y, fma(log(c), (b + -0.5), fma(x, log(y), z)));
}
function code(x, y, z, t, a, b, c, i) return Float64(a + fma(i, y, fma(log(c), Float64(b + -0.5), fma(x, log(y), z)))) end
code[x_, y_, z_, t_, a_, b_, c_, i_] := N[(a + N[(i * y + N[(N[Log[c], $MachinePrecision] * N[(b + -0.5), $MachinePrecision] + N[(x * N[Log[y], $MachinePrecision] + z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
a + \mathsf{fma}\left(i, y, \mathsf{fma}\left(\log c, b + -0.5, \mathsf{fma}\left(x, \log y, z\right)\right)\right)
\end{array}
Initial program 99.8%
Taylor expanded in t around 0
lower-+.f64N/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
associate-+r+N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f6485.3
Simplified85.3%
(FPCore (x y z t a b c i)
:precision binary64
(if (<= x -2.9e+118)
(fma i y (* x (log y)))
(if (<= x 5.6e+191)
(+ a (+ (fma i y z) (fma (log c) (+ b -0.5) t)))
(* x (+ (log y) (/ (* y i) x))))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double tmp;
if (x <= -2.9e+118) {
tmp = fma(i, y, (x * log(y)));
} else if (x <= 5.6e+191) {
tmp = a + (fma(i, y, z) + fma(log(c), (b + -0.5), t));
} else {
tmp = x * (log(y) + ((y * i) / x));
}
return tmp;
}
function code(x, y, z, t, a, b, c, i) tmp = 0.0 if (x <= -2.9e+118) tmp = fma(i, y, Float64(x * log(y))); elseif (x <= 5.6e+191) tmp = Float64(a + Float64(fma(i, y, z) + fma(log(c), Float64(b + -0.5), t))); else tmp = Float64(x * Float64(log(y) + Float64(Float64(y * i) / x))); end return tmp end
code[x_, y_, z_, t_, a_, b_, c_, i_] := If[LessEqual[x, -2.9e+118], N[(i * y + N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 5.6e+191], N[(a + N[(N[(i * y + z), $MachinePrecision] + N[(N[Log[c], $MachinePrecision] * N[(b + -0.5), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x * N[(N[Log[y], $MachinePrecision] + N[(N[(y * i), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq -2.9 \cdot 10^{+118}:\\
\;\;\;\;\mathsf{fma}\left(i, y, x \cdot \log y\right)\\
\mathbf{elif}\;x \leq 5.6 \cdot 10^{+191}:\\
\;\;\;\;a + \left(\mathsf{fma}\left(i, y, z\right) + \mathsf{fma}\left(\log c, b + -0.5, t\right)\right)\\
\mathbf{else}:\\
\;\;\;\;x \cdot \left(\log y + \frac{y \cdot i}{x}\right)\\
\end{array}
\end{array}
if x < -2.90000000000000016e118Initial program 99.8%
Taylor expanded in t around 0
lower-+.f64N/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
associate-+r+N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f6490.9
Simplified90.9%
Taylor expanded in a around 0
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f6486.0
Simplified86.0%
Taylor expanded in x around inf
lower-*.f64N/A
lower-log.f6475.1
Simplified75.1%
if -2.90000000000000016e118 < x < 5.5999999999999998e191Initial program 99.9%
Taylor expanded in x around 0
lower-+.f64N/A
+-commutativeN/A
associate-+r+N/A
associate-+l+N/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f6497.7
Simplified97.7%
if 5.5999999999999998e191 < x Initial program 99.6%
Taylor expanded in x around -inf
mul-1-negN/A
distribute-rgt-neg-inN/A
distribute-lft-outN/A
mul-1-negN/A
remove-double-negN/A
lower-*.f64N/A
lower-+.f64N/A
lower-log.f64N/A
lower-/.f64N/A
Simplified99.4%
Taylor expanded in i around inf
lower-*.f6492.4
Simplified92.4%
Final simplification93.8%
(FPCore (x y z t a b c i)
:precision binary64
(let* ((t_1 (fma i y (* x (log y)))))
(if (<= x -2.6e+118)
t_1
(if (<= x -6.2e-61)
(fma i (* a (/ y a)) a)
(if (<= x 2.1e+191) (+ a (+ t (fma (log c) (+ b -0.5) z))) t_1)))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double t_1 = fma(i, y, (x * log(y)));
double tmp;
if (x <= -2.6e+118) {
tmp = t_1;
} else if (x <= -6.2e-61) {
tmp = fma(i, (a * (y / a)), a);
} else if (x <= 2.1e+191) {
tmp = a + (t + fma(log(c), (b + -0.5), z));
} else {
tmp = t_1;
}
return tmp;
}
function code(x, y, z, t, a, b, c, i) t_1 = fma(i, y, Float64(x * log(y))) tmp = 0.0 if (x <= -2.6e+118) tmp = t_1; elseif (x <= -6.2e-61) tmp = fma(i, Float64(a * Float64(y / a)), a); elseif (x <= 2.1e+191) tmp = Float64(a + Float64(t + fma(log(c), Float64(b + -0.5), z))); else tmp = t_1; end return tmp end
code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(i * y + N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -2.6e+118], t$95$1, If[LessEqual[x, -6.2e-61], N[(i * N[(a * N[(y / a), $MachinePrecision]), $MachinePrecision] + a), $MachinePrecision], If[LessEqual[x, 2.1e+191], N[(a + N[(t + N[(N[Log[c], $MachinePrecision] * N[(b + -0.5), $MachinePrecision] + z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \mathsf{fma}\left(i, y, x \cdot \log y\right)\\
\mathbf{if}\;x \leq -2.6 \cdot 10^{+118}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;x \leq -6.2 \cdot 10^{-61}:\\
\;\;\;\;\mathsf{fma}\left(i, a \cdot \frac{y}{a}, a\right)\\
\mathbf{elif}\;x \leq 2.1 \cdot 10^{+191}:\\
\;\;\;\;a + \left(t + \mathsf{fma}\left(\log c, b + -0.5, z\right)\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if x < -2.60000000000000016e118 or 2.1000000000000001e191 < x Initial program 99.7%
Taylor expanded in t around 0
lower-+.f64N/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
associate-+r+N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f6492.9
Simplified92.9%
Taylor expanded in a around 0
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f6489.9
Simplified89.9%
Taylor expanded in x around inf
lower-*.f64N/A
lower-log.f6481.9
Simplified81.9%
if -2.60000000000000016e118 < x < -6.1999999999999999e-61Initial program 99.9%
Taylor expanded in t around 0
lower-+.f64N/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
associate-+r+N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f6484.5
Simplified84.5%
Taylor expanded in i around inf
lower-*.f6465.2
Simplified65.2%
Taylor expanded in a around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f6465.2
Simplified65.2%
Taylor expanded in a around inf
+-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
associate-/l*N/A
associate-*l*N/A
lower-fma.f64N/A
lower-*.f64N/A
lower-/.f6462.8
Simplified62.8%
if -6.1999999999999999e-61 < x < 2.1000000000000001e191Initial program 99.9%
Taylor expanded in x around 0
lower-+.f64N/A
+-commutativeN/A
associate-+r+N/A
associate-+l+N/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f6497.9
Simplified97.9%
Taylor expanded in i around 0
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f6475.0
Simplified75.0%
Final simplification75.2%
(FPCore (x y z t a b c i)
:precision binary64
(let* ((t_1 (fma i y (* x (log y)))))
(if (<= x -2.9e+118)
t_1
(if (<= x 5.6e+191)
(+ a (+ (fma i y z) (fma (log c) (+ b -0.5) t)))
t_1))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double t_1 = fma(i, y, (x * log(y)));
double tmp;
if (x <= -2.9e+118) {
tmp = t_1;
} else if (x <= 5.6e+191) {
tmp = a + (fma(i, y, z) + fma(log(c), (b + -0.5), t));
} else {
tmp = t_1;
}
return tmp;
}
function code(x, y, z, t, a, b, c, i) t_1 = fma(i, y, Float64(x * log(y))) tmp = 0.0 if (x <= -2.9e+118) tmp = t_1; elseif (x <= 5.6e+191) tmp = Float64(a + Float64(fma(i, y, z) + fma(log(c), Float64(b + -0.5), t))); else tmp = t_1; end return tmp end
code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(i * y + N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -2.9e+118], t$95$1, If[LessEqual[x, 5.6e+191], N[(a + N[(N[(i * y + z), $MachinePrecision] + N[(N[Log[c], $MachinePrecision] * N[(b + -0.5), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \mathsf{fma}\left(i, y, x \cdot \log y\right)\\
\mathbf{if}\;x \leq -2.9 \cdot 10^{+118}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;x \leq 5.6 \cdot 10^{+191}:\\
\;\;\;\;a + \left(\mathsf{fma}\left(i, y, z\right) + \mathsf{fma}\left(\log c, b + -0.5, t\right)\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if x < -2.90000000000000016e118 or 5.5999999999999998e191 < x Initial program 99.7%
Taylor expanded in t around 0
lower-+.f64N/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
associate-+r+N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f6492.9
Simplified92.9%
Taylor expanded in a around 0
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f6489.9
Simplified89.9%
Taylor expanded in x around inf
lower-*.f64N/A
lower-log.f6481.9
Simplified81.9%
if -2.90000000000000016e118 < x < 5.5999999999999998e191Initial program 99.9%
Taylor expanded in x around 0
lower-+.f64N/A
+-commutativeN/A
associate-+r+N/A
associate-+l+N/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f6497.7
Simplified97.7%
(FPCore (x y z t a b c i)
:precision binary64
(let* ((t_1 (fma i y (* x (log y)))))
(if (<= x -2.6e+118)
t_1
(if (<= x -6.2e-61)
(fma i (* a (/ y a)) a)
(if (<= x 2.1e+191) (+ a (fma (log c) (+ b -0.5) z)) t_1)))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double t_1 = fma(i, y, (x * log(y)));
double tmp;
if (x <= -2.6e+118) {
tmp = t_1;
} else if (x <= -6.2e-61) {
tmp = fma(i, (a * (y / a)), a);
} else if (x <= 2.1e+191) {
tmp = a + fma(log(c), (b + -0.5), z);
} else {
tmp = t_1;
}
return tmp;
}
function code(x, y, z, t, a, b, c, i) t_1 = fma(i, y, Float64(x * log(y))) tmp = 0.0 if (x <= -2.6e+118) tmp = t_1; elseif (x <= -6.2e-61) tmp = fma(i, Float64(a * Float64(y / a)), a); elseif (x <= 2.1e+191) tmp = Float64(a + fma(log(c), Float64(b + -0.5), z)); else tmp = t_1; end return tmp end
code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(i * y + N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -2.6e+118], t$95$1, If[LessEqual[x, -6.2e-61], N[(i * N[(a * N[(y / a), $MachinePrecision]), $MachinePrecision] + a), $MachinePrecision], If[LessEqual[x, 2.1e+191], N[(a + N[(N[Log[c], $MachinePrecision] * N[(b + -0.5), $MachinePrecision] + z), $MachinePrecision]), $MachinePrecision], t$95$1]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \mathsf{fma}\left(i, y, x \cdot \log y\right)\\
\mathbf{if}\;x \leq -2.6 \cdot 10^{+118}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;x \leq -6.2 \cdot 10^{-61}:\\
\;\;\;\;\mathsf{fma}\left(i, a \cdot \frac{y}{a}, a\right)\\
\mathbf{elif}\;x \leq 2.1 \cdot 10^{+191}:\\
\;\;\;\;a + \mathsf{fma}\left(\log c, b + -0.5, z\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if x < -2.60000000000000016e118 or 2.1000000000000001e191 < x Initial program 99.7%
Taylor expanded in t around 0
lower-+.f64N/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
associate-+r+N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f6492.9
Simplified92.9%
Taylor expanded in a around 0
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f6489.9
Simplified89.9%
Taylor expanded in x around inf
lower-*.f64N/A
lower-log.f6481.9
Simplified81.9%
if -2.60000000000000016e118 < x < -6.1999999999999999e-61Initial program 99.9%
Taylor expanded in t around 0
lower-+.f64N/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
associate-+r+N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f6484.5
Simplified84.5%
Taylor expanded in i around inf
lower-*.f6465.2
Simplified65.2%
Taylor expanded in a around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f6465.2
Simplified65.2%
Taylor expanded in a around inf
+-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
associate-/l*N/A
associate-*l*N/A
lower-fma.f64N/A
lower-*.f64N/A
lower-/.f6462.8
Simplified62.8%
if -6.1999999999999999e-61 < x < 2.1000000000000001e191Initial program 99.9%
Taylor expanded in t around 0
lower-+.f64N/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
associate-+r+N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f6482.5
Simplified82.5%
Taylor expanded in z around -inf
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
sub-negN/A
associate-/l*N/A
associate-*r*N/A
metadata-evalN/A
lower-fma.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-log.f6478.8
Simplified78.8%
Taylor expanded in i around 0
+-commutativeN/A
associate-+l+N/A
mul-1-negN/A
distribute-rgt-neg-inN/A
sub-negN/A
mul-1-negN/A
distribute-neg-inN/A
associate-/l*N/A
rgt-mult-inverseN/A
distribute-lft-inN/A
+-commutativeN/A
remove-double-negN/A
Simplified57.5%
Taylor expanded in x around 0
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f6458.1
Simplified58.1%
Final simplification64.5%
(FPCore (x y z t a b c i)
:precision binary64
(let* ((t_1 (fma i y (* x (log y)))))
(if (<= x -2.9e+118)
t_1
(if (<= x 5.6e+191) (+ (fma y i z) (fma (log c) (+ b -0.5) a)) t_1))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double t_1 = fma(i, y, (x * log(y)));
double tmp;
if (x <= -2.9e+118) {
tmp = t_1;
} else if (x <= 5.6e+191) {
tmp = fma(y, i, z) + fma(log(c), (b + -0.5), a);
} else {
tmp = t_1;
}
return tmp;
}
function code(x, y, z, t, a, b, c, i) t_1 = fma(i, y, Float64(x * log(y))) tmp = 0.0 if (x <= -2.9e+118) tmp = t_1; elseif (x <= 5.6e+191) tmp = Float64(fma(y, i, z) + fma(log(c), Float64(b + -0.5), a)); else tmp = t_1; end return tmp end
code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(i * y + N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -2.9e+118], t$95$1, If[LessEqual[x, 5.6e+191], N[(N[(y * i + z), $MachinePrecision] + N[(N[Log[c], $MachinePrecision] * N[(b + -0.5), $MachinePrecision] + a), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \mathsf{fma}\left(i, y, x \cdot \log y\right)\\
\mathbf{if}\;x \leq -2.9 \cdot 10^{+118}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;x \leq 5.6 \cdot 10^{+191}:\\
\;\;\;\;\mathsf{fma}\left(y, i, z\right) + \mathsf{fma}\left(\log c, b + -0.5, a\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if x < -2.90000000000000016e118 or 5.5999999999999998e191 < x Initial program 99.7%
Taylor expanded in t around 0
lower-+.f64N/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
associate-+r+N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f6492.9
Simplified92.9%
Taylor expanded in a around 0
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f6489.9
Simplified89.9%
Taylor expanded in x around inf
lower-*.f64N/A
lower-log.f6481.9
Simplified81.9%
if -2.90000000000000016e118 < x < 5.5999999999999998e191Initial program 99.9%
Taylor expanded in t around 0
lower-+.f64N/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
associate-+r+N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f6482.8
Simplified82.8%
Taylor expanded in z around -inf
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
sub-negN/A
associate-/l*N/A
associate-*r*N/A
metadata-evalN/A
lower-fma.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-log.f6478.2
Simplified78.2%
Taylor expanded in x around 0
+-commutativeN/A
associate-+r+N/A
associate-+l+N/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f6480.6
Simplified80.6%
(FPCore (x y z t a b c i)
:precision binary64
(let* ((t_1 (fma i y (* x (log y)))))
(if (<= x -2.9e+118)
t_1
(if (<= x 5.6e+191) (+ a (+ (fma i y z) (* b (log c)))) t_1))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double t_1 = fma(i, y, (x * log(y)));
double tmp;
if (x <= -2.9e+118) {
tmp = t_1;
} else if (x <= 5.6e+191) {
tmp = a + (fma(i, y, z) + (b * log(c)));
} else {
tmp = t_1;
}
return tmp;
}
function code(x, y, z, t, a, b, c, i) t_1 = fma(i, y, Float64(x * log(y))) tmp = 0.0 if (x <= -2.9e+118) tmp = t_1; elseif (x <= 5.6e+191) tmp = Float64(a + Float64(fma(i, y, z) + Float64(b * log(c)))); else tmp = t_1; end return tmp end
code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(i * y + N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -2.9e+118], t$95$1, If[LessEqual[x, 5.6e+191], N[(a + N[(N[(i * y + z), $MachinePrecision] + N[(b * N[Log[c], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \mathsf{fma}\left(i, y, x \cdot \log y\right)\\
\mathbf{if}\;x \leq -2.9 \cdot 10^{+118}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;x \leq 5.6 \cdot 10^{+191}:\\
\;\;\;\;a + \left(\mathsf{fma}\left(i, y, z\right) + b \cdot \log c\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if x < -2.90000000000000016e118 or 5.5999999999999998e191 < x Initial program 99.7%
Taylor expanded in t around 0
lower-+.f64N/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
associate-+r+N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f6492.9
Simplified92.9%
Taylor expanded in a around 0
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f6489.9
Simplified89.9%
Taylor expanded in x around inf
lower-*.f64N/A
lower-log.f6481.9
Simplified81.9%
if -2.90000000000000016e118 < x < 5.5999999999999998e191Initial program 99.9%
Taylor expanded in x around 0
lower-+.f64N/A
+-commutativeN/A
associate-+r+N/A
associate-+l+N/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f6497.7
Simplified97.7%
Taylor expanded in b around inf
*-commutativeN/A
lower-*.f64N/A
lower-log.f6478.6
Simplified78.6%
Final simplification79.4%
(FPCore (x y z t a b c i) :precision binary64 (if (<= a 1.6e+154) (fma y i (fma (log c) (+ b -0.5) z)) (fma a (/ (* y i) a) a)))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double tmp;
if (a <= 1.6e+154) {
tmp = fma(y, i, fma(log(c), (b + -0.5), z));
} else {
tmp = fma(a, ((y * i) / a), a);
}
return tmp;
}
function code(x, y, z, t, a, b, c, i) tmp = 0.0 if (a <= 1.6e+154) tmp = fma(y, i, fma(log(c), Float64(b + -0.5), z)); else tmp = fma(a, Float64(Float64(y * i) / a), a); end return tmp end
code[x_, y_, z_, t_, a_, b_, c_, i_] := If[LessEqual[a, 1.6e+154], N[(y * i + N[(N[Log[c], $MachinePrecision] * N[(b + -0.5), $MachinePrecision] + z), $MachinePrecision]), $MachinePrecision], N[(a * N[(N[(y * i), $MachinePrecision] / a), $MachinePrecision] + a), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;a \leq 1.6 \cdot 10^{+154}:\\
\;\;\;\;\mathsf{fma}\left(y, i, \mathsf{fma}\left(\log c, b + -0.5, z\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(a, \frac{y \cdot i}{a}, a\right)\\
\end{array}
\end{array}
if a < 1.6e154Initial program 99.8%
Taylor expanded in t around 0
lower-+.f64N/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
associate-+r+N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f6484.8
Simplified84.8%
Taylor expanded in a around 0
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f6476.7
Simplified76.7%
Taylor expanded in x around 0
+-commutativeN/A
associate-+l+N/A
*-commutativeN/A
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f6457.5
Simplified57.5%
if 1.6e154 < a Initial program 99.9%
Taylor expanded in t around 0
lower-+.f64N/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
associate-+r+N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f6488.0
Simplified88.0%
Taylor expanded in i around inf
lower-*.f6475.5
Simplified75.5%
Taylor expanded in a around inf
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6475.5
Simplified75.5%
(FPCore (x y z t a b c i) :precision binary64 (fma y i a))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
return fma(y, i, a);
}
function code(x, y, z, t, a, b, c, i) return fma(y, i, a) end
code[x_, y_, z_, t_, a_, b_, c_, i_] := N[(y * i + a), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(y, i, a\right)
\end{array}
Initial program 99.8%
Taylor expanded in t around 0
lower-+.f64N/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
lower-fma.f64N/A
associate-+r+N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-log.f6485.3
Simplified85.3%
Taylor expanded in i around inf
lower-*.f6440.9
Simplified40.9%
Taylor expanded in a around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f6440.9
Simplified40.9%
(FPCore (x y z t a b c i) :precision binary64 (* y i))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
return y * i;
}
real(8) function code(x, y, z, t, a, b, c, i)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
code = y * i
end function
public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
return y * i;
}
def code(x, y, z, t, a, b, c, i): return y * i
function code(x, y, z, t, a, b, c, i) return Float64(y * i) end
function tmp = code(x, y, z, t, a, b, c, i) tmp = y * i; end
code[x_, y_, z_, t_, a_, b_, c_, i_] := N[(y * i), $MachinePrecision]
\begin{array}{l}
\\
y \cdot i
\end{array}
Initial program 99.8%
Taylor expanded in y around inf
lower-*.f6425.2
Simplified25.2%
Final simplification25.2%
herbie shell --seed 2024208
(FPCore (x y z t a b c i)
:name "Numeric.SpecFunctions:logBeta from math-functions-0.1.5.2, B"
:precision binary64
(+ (+ (+ (+ (+ (* x (log y)) z) t) a) (* (- b 0.5) (log c))) (* y i)))