
(FPCore (x y z t a) :precision binary64 (+ (- (+ (log (+ x y)) (log z)) t) (* (- a 0.5) (log t))))
double code(double x, double y, double z, double t, double a) {
return ((log((x + y)) + log(z)) - t) + ((a - 0.5) * log(t));
}
real(8) function code(x, y, z, t, a)
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
code = ((log((x + y)) + log(z)) - t) + ((a - 0.5d0) * log(t))
end function
public static double code(double x, double y, double z, double t, double a) {
return ((Math.log((x + y)) + Math.log(z)) - t) + ((a - 0.5) * Math.log(t));
}
def code(x, y, z, t, a): return ((math.log((x + y)) + math.log(z)) - t) + ((a - 0.5) * math.log(t))
function code(x, y, z, t, a) return Float64(Float64(Float64(log(Float64(x + y)) + log(z)) - t) + Float64(Float64(a - 0.5) * log(t))) end
function tmp = code(x, y, z, t, a) tmp = ((log((x + y)) + log(z)) - t) + ((a - 0.5) * log(t)); end
code[x_, y_, z_, t_, a_] := N[(N[(N[(N[Log[N[(x + y), $MachinePrecision]], $MachinePrecision] + N[Log[z], $MachinePrecision]), $MachinePrecision] - t), $MachinePrecision] + N[(N[(a - 0.5), $MachinePrecision] * N[Log[t], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\left(\log \left(x + y\right) + \log z\right) - t\right) + \left(a - 0.5\right) \cdot \log t
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 13 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a) :precision binary64 (+ (- (+ (log (+ x y)) (log z)) t) (* (- a 0.5) (log t))))
double code(double x, double y, double z, double t, double a) {
return ((log((x + y)) + log(z)) - t) + ((a - 0.5) * log(t));
}
real(8) function code(x, y, z, t, a)
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
code = ((log((x + y)) + log(z)) - t) + ((a - 0.5d0) * log(t))
end function
public static double code(double x, double y, double z, double t, double a) {
return ((Math.log((x + y)) + Math.log(z)) - t) + ((a - 0.5) * Math.log(t));
}
def code(x, y, z, t, a): return ((math.log((x + y)) + math.log(z)) - t) + ((a - 0.5) * math.log(t))
function code(x, y, z, t, a) return Float64(Float64(Float64(log(Float64(x + y)) + log(z)) - t) + Float64(Float64(a - 0.5) * log(t))) end
function tmp = code(x, y, z, t, a) tmp = ((log((x + y)) + log(z)) - t) + ((a - 0.5) * log(t)); end
code[x_, y_, z_, t_, a_] := N[(N[(N[(N[Log[N[(x + y), $MachinePrecision]], $MachinePrecision] + N[Log[z], $MachinePrecision]), $MachinePrecision] - t), $MachinePrecision] + N[(N[(a - 0.5), $MachinePrecision] * N[Log[t], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\left(\log \left(x + y\right) + \log z\right) - t\right) + \left(a - 0.5\right) \cdot \log t
\end{array}
(FPCore (x y z t a) :precision binary64 (+ (* (log t) (- a 0.5)) (- (+ (log (+ y x)) (log z)) t)))
double code(double x, double y, double z, double t, double a) {
return (log(t) * (a - 0.5)) + ((log((y + x)) + log(z)) - t);
}
real(8) function code(x, y, z, t, a)
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
code = (log(t) * (a - 0.5d0)) + ((log((y + x)) + log(z)) - t)
end function
public static double code(double x, double y, double z, double t, double a) {
return (Math.log(t) * (a - 0.5)) + ((Math.log((y + x)) + Math.log(z)) - t);
}
def code(x, y, z, t, a): return (math.log(t) * (a - 0.5)) + ((math.log((y + x)) + math.log(z)) - t)
function code(x, y, z, t, a) return Float64(Float64(log(t) * Float64(a - 0.5)) + Float64(Float64(log(Float64(y + x)) + log(z)) - t)) end
function tmp = code(x, y, z, t, a) tmp = (log(t) * (a - 0.5)) + ((log((y + x)) + log(z)) - t); end
code[x_, y_, z_, t_, a_] := N[(N[(N[Log[t], $MachinePrecision] * N[(a - 0.5), $MachinePrecision]), $MachinePrecision] + N[(N[(N[Log[N[(y + x), $MachinePrecision]], $MachinePrecision] + N[Log[z], $MachinePrecision]), $MachinePrecision] - t), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\log t \cdot \left(a - 0.5\right) + \left(\left(\log \left(y + x\right) + \log z\right) - t\right)
\end{array}
Initial program 99.6%
Final simplification99.6%
(FPCore (x y z t a)
:precision binary64
(let* ((t_1 (+ (* (log t) (- a 0.5)) (- (+ (log (+ y x)) (log z)) t)))
(t_2 (fma (- a 0.5) (log t) (- t))))
(if (<= t_1 -1000000.0)
t_2
(if (<= t_1 1007.0) (- (fma (log t) -0.5 (log (* (+ y x) z))) t) t_2))))
double code(double x, double y, double z, double t, double a) {
double t_1 = (log(t) * (a - 0.5)) + ((log((y + x)) + log(z)) - t);
double t_2 = fma((a - 0.5), log(t), -t);
double tmp;
if (t_1 <= -1000000.0) {
tmp = t_2;
} else if (t_1 <= 1007.0) {
tmp = fma(log(t), -0.5, log(((y + x) * z))) - t;
} else {
tmp = t_2;
}
return tmp;
}
function code(x, y, z, t, a) t_1 = Float64(Float64(log(t) * Float64(a - 0.5)) + Float64(Float64(log(Float64(y + x)) + log(z)) - t)) t_2 = fma(Float64(a - 0.5), log(t), Float64(-t)) tmp = 0.0 if (t_1 <= -1000000.0) tmp = t_2; elseif (t_1 <= 1007.0) tmp = Float64(fma(log(t), -0.5, log(Float64(Float64(y + x) * z))) - t); else tmp = t_2; end return tmp end
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(N[Log[t], $MachinePrecision] * N[(a - 0.5), $MachinePrecision]), $MachinePrecision] + N[(N[(N[Log[N[(y + x), $MachinePrecision]], $MachinePrecision] + N[Log[z], $MachinePrecision]), $MachinePrecision] - t), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(a - 0.5), $MachinePrecision] * N[Log[t], $MachinePrecision] + (-t)), $MachinePrecision]}, If[LessEqual[t$95$1, -1000000.0], t$95$2, If[LessEqual[t$95$1, 1007.0], N[(N[(N[Log[t], $MachinePrecision] * -0.5 + N[Log[N[(N[(y + x), $MachinePrecision] * z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - t), $MachinePrecision], t$95$2]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \log t \cdot \left(a - 0.5\right) + \left(\left(\log \left(y + x\right) + \log z\right) - t\right)\\
t_2 := \mathsf{fma}\left(a - 0.5, \log t, -t\right)\\
\mathbf{if}\;t\_1 \leq -1000000:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq 1007:\\
\;\;\;\;\mathsf{fma}\left(\log t, -0.5, \log \left(\left(y + x\right) \cdot z\right)\right) - t\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if (+.f64 (-.f64 (+.f64 (log.f64 (+.f64 x y)) (log.f64 z)) t) (*.f64 (-.f64 a #s(literal 1/2 binary64)) (log.f64 t))) < -1e6 or 1007 < (+.f64 (-.f64 (+.f64 (log.f64 (+.f64 x y)) (log.f64 z)) t) (*.f64 (-.f64 a #s(literal 1/2 binary64)) (log.f64 t))) Initial program 99.8%
lift-*.f64N/A
*-commutativeN/A
lift--.f64N/A
flip3--N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
clear-numN/A
flip3--N/A
lift--.f64N/A
lower-/.f6499.7
Applied rewrites99.7%
Taylor expanded in t around inf
mul-1-negN/A
lower-neg.f6495.3
Applied rewrites95.3%
lift-+.f64N/A
+-commutativeN/A
lift-/.f64N/A
lift-/.f64N/A
associate-/r/N/A
/-rgt-identityN/A
*-commutativeN/A
lower-fma.f6495.4
Applied rewrites95.4%
if -1e6 < (+.f64 (-.f64 (+.f64 (log.f64 (+.f64 x y)) (log.f64 z)) t) (*.f64 (-.f64 a #s(literal 1/2 binary64)) (log.f64 t))) < 1007Initial program 99.1%
lift-+.f64N/A
flip-+N/A
clear-numN/A
lower-/.f64N/A
clear-numN/A
Applied rewrites80.7%
Taylor expanded in a around 0
lower--.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-log.f64N/A
lower-log.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f6479.6
Applied rewrites79.6%
Final simplification92.2%
(FPCore (x y z t a)
:precision binary64
(let* ((t_1 (+ (log (+ y x)) (log z))))
(if (<= t_1 -750.0)
(+ (* (log t) a) (log z))
(if (<= t_1 690.0)
(fma (- a 0.5) (log t) (- (log (* (+ y x) z)) t))
(fma (- a 0.5) (log t) (- t))))))
double code(double x, double y, double z, double t, double a) {
double t_1 = log((y + x)) + log(z);
double tmp;
if (t_1 <= -750.0) {
tmp = (log(t) * a) + log(z);
} else if (t_1 <= 690.0) {
tmp = fma((a - 0.5), log(t), (log(((y + x) * z)) - t));
} else {
tmp = fma((a - 0.5), log(t), -t);
}
return tmp;
}
function code(x, y, z, t, a) t_1 = Float64(log(Float64(y + x)) + log(z)) tmp = 0.0 if (t_1 <= -750.0) tmp = Float64(Float64(log(t) * a) + log(z)); elseif (t_1 <= 690.0) tmp = fma(Float64(a - 0.5), log(t), Float64(log(Float64(Float64(y + x) * z)) - t)); else tmp = fma(Float64(a - 0.5), log(t), Float64(-t)); end return tmp end
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[Log[N[(y + x), $MachinePrecision]], $MachinePrecision] + N[Log[z], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -750.0], N[(N[(N[Log[t], $MachinePrecision] * a), $MachinePrecision] + N[Log[z], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 690.0], N[(N[(a - 0.5), $MachinePrecision] * N[Log[t], $MachinePrecision] + N[(N[Log[N[(N[(y + x), $MachinePrecision] * z), $MachinePrecision]], $MachinePrecision] - t), $MachinePrecision]), $MachinePrecision], N[(N[(a - 0.5), $MachinePrecision] * N[Log[t], $MachinePrecision] + (-t)), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \log \left(y + x\right) + \log z\\
\mathbf{if}\;t\_1 \leq -750:\\
\;\;\;\;\log t \cdot a + \log z\\
\mathbf{elif}\;t\_1 \leq 690:\\
\;\;\;\;\mathsf{fma}\left(a - 0.5, \log t, \log \left(\left(y + x\right) \cdot z\right) - t\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(a - 0.5, \log t, -t\right)\\
\end{array}
\end{array}
if (+.f64 (log.f64 (+.f64 x y)) (log.f64 z)) < -750Initial program 99.6%
lift-*.f64N/A
*-commutativeN/A
lift--.f64N/A
flip3--N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
clear-numN/A
flip3--N/A
lift--.f64N/A
lower-/.f6499.0
Applied rewrites99.0%
Taylor expanded in t around 0
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower--.f64N/A
lower-log.f64N/A
lower-log.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-log.f64100.0
Applied rewrites100.0%
Taylor expanded in a around inf
Applied rewrites64.3%
if -750 < (+.f64 (log.f64 (+.f64 x y)) (log.f64 z)) < 690Initial program 99.6%
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lower-fma.f6499.6
lift-+.f64N/A
lift-log.f64N/A
lift-log.f64N/A
sum-logN/A
lower-log.f64N/A
*-commutativeN/A
lower-*.f6499.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.7
Applied rewrites99.7%
if 690 < (+.f64 (log.f64 (+.f64 x y)) (log.f64 z)) Initial program 99.8%
lift-*.f64N/A
*-commutativeN/A
lift--.f64N/A
flip3--N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
clear-numN/A
flip3--N/A
lift--.f64N/A
lower-/.f6499.7
Applied rewrites99.7%
Taylor expanded in t around inf
mul-1-negN/A
lower-neg.f6479.5
Applied rewrites79.5%
lift-+.f64N/A
+-commutativeN/A
lift-/.f64N/A
lift-/.f64N/A
associate-/r/N/A
/-rgt-identityN/A
*-commutativeN/A
lower-fma.f6479.6
Applied rewrites79.6%
Final simplification93.8%
(FPCore (x y z t a)
:precision binary64
(let* ((t_1 (+ (log (+ y x)) (log z))))
(if (<= t_1 -750.0)
(+ (* (log t) a) (log z))
(if (<= t_1 690.0)
(- (fma (log t) (- a 0.5) (log (* (+ y x) z))) t)
(fma (- a 0.5) (log t) (- t))))))
double code(double x, double y, double z, double t, double a) {
double t_1 = log((y + x)) + log(z);
double tmp;
if (t_1 <= -750.0) {
tmp = (log(t) * a) + log(z);
} else if (t_1 <= 690.0) {
tmp = fma(log(t), (a - 0.5), log(((y + x) * z))) - t;
} else {
tmp = fma((a - 0.5), log(t), -t);
}
return tmp;
}
function code(x, y, z, t, a) t_1 = Float64(log(Float64(y + x)) + log(z)) tmp = 0.0 if (t_1 <= -750.0) tmp = Float64(Float64(log(t) * a) + log(z)); elseif (t_1 <= 690.0) tmp = Float64(fma(log(t), Float64(a - 0.5), log(Float64(Float64(y + x) * z))) - t); else tmp = fma(Float64(a - 0.5), log(t), Float64(-t)); end return tmp end
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[Log[N[(y + x), $MachinePrecision]], $MachinePrecision] + N[Log[z], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -750.0], N[(N[(N[Log[t], $MachinePrecision] * a), $MachinePrecision] + N[Log[z], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 690.0], N[(N[(N[Log[t], $MachinePrecision] * N[(a - 0.5), $MachinePrecision] + N[Log[N[(N[(y + x), $MachinePrecision] * z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - t), $MachinePrecision], N[(N[(a - 0.5), $MachinePrecision] * N[Log[t], $MachinePrecision] + (-t)), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \log \left(y + x\right) + \log z\\
\mathbf{if}\;t\_1 \leq -750:\\
\;\;\;\;\log t \cdot a + \log z\\
\mathbf{elif}\;t\_1 \leq 690:\\
\;\;\;\;\mathsf{fma}\left(\log t, a - 0.5, \log \left(\left(y + x\right) \cdot z\right)\right) - t\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(a - 0.5, \log t, -t\right)\\
\end{array}
\end{array}
if (+.f64 (log.f64 (+.f64 x y)) (log.f64 z)) < -750Initial program 99.6%
lift-*.f64N/A
*-commutativeN/A
lift--.f64N/A
flip3--N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
clear-numN/A
flip3--N/A
lift--.f64N/A
lower-/.f6499.0
Applied rewrites99.0%
Taylor expanded in t around 0
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower--.f64N/A
lower-log.f64N/A
lower-log.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-log.f64100.0
Applied rewrites100.0%
Taylor expanded in a around inf
Applied rewrites64.3%
if -750 < (+.f64 (log.f64 (+.f64 x y)) (log.f64 z)) < 690Initial program 99.6%
lift-+.f64N/A
+-commutativeN/A
lift--.f64N/A
associate-+r-N/A
lower--.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-fma.f6499.6
lift-+.f64N/A
lift-log.f64N/A
lift-log.f64N/A
sum-logN/A
lower-log.f64N/A
*-commutativeN/A
lower-*.f6499.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.7
Applied rewrites99.7%
if 690 < (+.f64 (log.f64 (+.f64 x y)) (log.f64 z)) Initial program 99.8%
lift-*.f64N/A
*-commutativeN/A
lift--.f64N/A
flip3--N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
clear-numN/A
flip3--N/A
lift--.f64N/A
lower-/.f6499.7
Applied rewrites99.7%
Taylor expanded in t around inf
mul-1-negN/A
lower-neg.f6479.5
Applied rewrites79.5%
lift-+.f64N/A
+-commutativeN/A
lift-/.f64N/A
lift-/.f64N/A
associate-/r/N/A
/-rgt-identityN/A
*-commutativeN/A
lower-fma.f6479.6
Applied rewrites79.6%
Final simplification93.7%
(FPCore (x y z t a)
:precision binary64
(let* ((t_1 (+ (log (+ y x)) (log z))))
(if (<= t_1 -750.0)
(+ (* (log t) a) (log z))
(if (<= t_1 690.0)
(- (fma (- a 0.5) (log t) (log (* z y))) t)
(fma (- a 0.5) (log t) (- t))))))
double code(double x, double y, double z, double t, double a) {
double t_1 = log((y + x)) + log(z);
double tmp;
if (t_1 <= -750.0) {
tmp = (log(t) * a) + log(z);
} else if (t_1 <= 690.0) {
tmp = fma((a - 0.5), log(t), log((z * y))) - t;
} else {
tmp = fma((a - 0.5), log(t), -t);
}
return tmp;
}
function code(x, y, z, t, a) t_1 = Float64(log(Float64(y + x)) + log(z)) tmp = 0.0 if (t_1 <= -750.0) tmp = Float64(Float64(log(t) * a) + log(z)); elseif (t_1 <= 690.0) tmp = Float64(fma(Float64(a - 0.5), log(t), log(Float64(z * y))) - t); else tmp = fma(Float64(a - 0.5), log(t), Float64(-t)); end return tmp end
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[Log[N[(y + x), $MachinePrecision]], $MachinePrecision] + N[Log[z], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -750.0], N[(N[(N[Log[t], $MachinePrecision] * a), $MachinePrecision] + N[Log[z], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 690.0], N[(N[(N[(a - 0.5), $MachinePrecision] * N[Log[t], $MachinePrecision] + N[Log[N[(z * y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - t), $MachinePrecision], N[(N[(a - 0.5), $MachinePrecision] * N[Log[t], $MachinePrecision] + (-t)), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \log \left(y + x\right) + \log z\\
\mathbf{if}\;t\_1 \leq -750:\\
\;\;\;\;\log t \cdot a + \log z\\
\mathbf{elif}\;t\_1 \leq 690:\\
\;\;\;\;\mathsf{fma}\left(a - 0.5, \log t, \log \left(z \cdot y\right)\right) - t\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(a - 0.5, \log t, -t\right)\\
\end{array}
\end{array}
if (+.f64 (log.f64 (+.f64 x y)) (log.f64 z)) < -750Initial program 99.6%
lift-*.f64N/A
*-commutativeN/A
lift--.f64N/A
flip3--N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
clear-numN/A
flip3--N/A
lift--.f64N/A
lower-/.f6499.0
Applied rewrites99.0%
Taylor expanded in t around 0
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower--.f64N/A
lower-log.f64N/A
lower-log.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-log.f64100.0
Applied rewrites100.0%
Taylor expanded in a around inf
Applied rewrites64.3%
if -750 < (+.f64 (log.f64 (+.f64 x y)) (log.f64 z)) < 690Initial program 99.6%
lift-+.f64N/A
flip-+N/A
clear-numN/A
lower-/.f64N/A
clear-numN/A
Applied rewrites99.4%
Taylor expanded in x around 0
lower--.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower--.f64N/A
lower-log.f64N/A
lower-log.f64N/A
lower-*.f6462.7
Applied rewrites62.7%
if 690 < (+.f64 (log.f64 (+.f64 x y)) (log.f64 z)) Initial program 99.8%
lift-*.f64N/A
*-commutativeN/A
lift--.f64N/A
flip3--N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
clear-numN/A
flip3--N/A
lift--.f64N/A
lower-/.f6499.7
Applied rewrites99.7%
Taylor expanded in t around inf
mul-1-negN/A
lower-neg.f6479.5
Applied rewrites79.5%
lift-+.f64N/A
+-commutativeN/A
lift-/.f64N/A
lift-/.f64N/A
associate-/r/N/A
/-rgt-identityN/A
*-commutativeN/A
lower-fma.f6479.6
Applied rewrites79.6%
Final simplification66.5%
(FPCore (x y z t a)
:precision binary64
(let* ((t_1 (log (+ y x))))
(if (<= t 180000000.0)
(+ (fma (- a 0.5) (log t) t_1) (log z))
(fma (+ (/ t_1 t) (* (/ (log t) t) a)) t (- t)))))
double code(double x, double y, double z, double t, double a) {
double t_1 = log((y + x));
double tmp;
if (t <= 180000000.0) {
tmp = fma((a - 0.5), log(t), t_1) + log(z);
} else {
tmp = fma(((t_1 / t) + ((log(t) / t) * a)), t, -t);
}
return tmp;
}
function code(x, y, z, t, a) t_1 = log(Float64(y + x)) tmp = 0.0 if (t <= 180000000.0) tmp = Float64(fma(Float64(a - 0.5), log(t), t_1) + log(z)); else tmp = fma(Float64(Float64(t_1 / t) + Float64(Float64(log(t) / t) * a)), t, Float64(-t)); end return tmp end
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[Log[N[(y + x), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t, 180000000.0], N[(N[(N[(a - 0.5), $MachinePrecision] * N[Log[t], $MachinePrecision] + t$95$1), $MachinePrecision] + N[Log[z], $MachinePrecision]), $MachinePrecision], N[(N[(N[(t$95$1 / t), $MachinePrecision] + N[(N[(N[Log[t], $MachinePrecision] / t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] * t + (-t)), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \log \left(y + x\right)\\
\mathbf{if}\;t \leq 180000000:\\
\;\;\;\;\mathsf{fma}\left(a - 0.5, \log t, t\_1\right) + \log z\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{t\_1}{t} + \frac{\log t}{t} \cdot a, t, -t\right)\\
\end{array}
\end{array}
if t < 1.8e8Initial program 99.4%
Taylor expanded in t around 0
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower--.f64N/A
lower-log.f64N/A
lower-log.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-log.f6498.5
Applied rewrites98.5%
if 1.8e8 < t Initial program 99.9%
lift-*.f64N/A
*-commutativeN/A
lift--.f64N/A
flip3--N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
clear-numN/A
flip3--N/A
lift--.f64N/A
lower-/.f6499.8
Applied rewrites99.8%
Taylor expanded in t around 0
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower--.f64N/A
lower-log.f64N/A
lower-log.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-log.f6427.8
Applied rewrites27.8%
Taylor expanded in t around inf
sub-negN/A
metadata-evalN/A
distribute-rgt-inN/A
mul-1-negN/A
lower-fma.f64N/A
Applied rewrites99.9%
Taylor expanded in a around inf
Applied rewrites99.4%
Final simplification98.9%
(FPCore (x y z t a) :precision binary64 (if (<= t 180000000.0) (+ (fma (- a 0.5) (log t) (log z)) (log y)) (fma (+ (/ (log (+ y x)) t) (* (/ (log t) t) a)) t (- t))))
double code(double x, double y, double z, double t, double a) {
double tmp;
if (t <= 180000000.0) {
tmp = fma((a - 0.5), log(t), log(z)) + log(y);
} else {
tmp = fma(((log((y + x)) / t) + ((log(t) / t) * a)), t, -t);
}
return tmp;
}
function code(x, y, z, t, a) tmp = 0.0 if (t <= 180000000.0) tmp = Float64(fma(Float64(a - 0.5), log(t), log(z)) + log(y)); else tmp = fma(Float64(Float64(log(Float64(y + x)) / t) + Float64(Float64(log(t) / t) * a)), t, Float64(-t)); end return tmp end
code[x_, y_, z_, t_, a_] := If[LessEqual[t, 180000000.0], N[(N[(N[(a - 0.5), $MachinePrecision] * N[Log[t], $MachinePrecision] + N[Log[z], $MachinePrecision]), $MachinePrecision] + N[Log[y], $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[Log[N[(y + x), $MachinePrecision]], $MachinePrecision] / t), $MachinePrecision] + N[(N[(N[Log[t], $MachinePrecision] / t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] * t + (-t)), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;t \leq 180000000:\\
\;\;\;\;\mathsf{fma}\left(a - 0.5, \log t, \log z\right) + \log y\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{\log \left(y + x\right)}{t} + \frac{\log t}{t} \cdot a, t, -t\right)\\
\end{array}
\end{array}
if t < 1.8e8Initial program 99.4%
lift-*.f64N/A
*-commutativeN/A
lift--.f64N/A
flip3--N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
clear-numN/A
flip3--N/A
lift--.f64N/A
lower-/.f6499.3
Applied rewrites99.3%
Taylor expanded in t around 0
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower--.f64N/A
lower-log.f64N/A
lower-log.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-log.f6498.5
Applied rewrites98.5%
Taylor expanded in y around inf
Applied rewrites59.1%
if 1.8e8 < t Initial program 99.9%
lift-*.f64N/A
*-commutativeN/A
lift--.f64N/A
flip3--N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
clear-numN/A
flip3--N/A
lift--.f64N/A
lower-/.f6499.8
Applied rewrites99.8%
Taylor expanded in t around 0
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower--.f64N/A
lower-log.f64N/A
lower-log.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-log.f6427.8
Applied rewrites27.8%
Taylor expanded in t around inf
sub-negN/A
metadata-evalN/A
distribute-rgt-inN/A
mul-1-negN/A
lower-fma.f64N/A
Applied rewrites99.9%
Taylor expanded in a around inf
Applied rewrites99.4%
Final simplification78.1%
(FPCore (x y z t a) :precision binary64 (- (+ (fma (- a 0.5) (log t) (log z)) (log y)) t))
double code(double x, double y, double z, double t, double a) {
return (fma((a - 0.5), log(t), log(z)) + log(y)) - t;
}
function code(x, y, z, t, a) return Float64(Float64(fma(Float64(a - 0.5), log(t), log(z)) + log(y)) - t) end
code[x_, y_, z_, t_, a_] := N[(N[(N[(N[(a - 0.5), $MachinePrecision] * N[Log[t], $MachinePrecision] + N[Log[z], $MachinePrecision]), $MachinePrecision] + N[Log[y], $MachinePrecision]), $MachinePrecision] - t), $MachinePrecision]
\begin{array}{l}
\\
\left(\mathsf{fma}\left(a - 0.5, \log t, \log z\right) + \log y\right) - t
\end{array}
Initial program 99.6%
Taylor expanded in y around inf
associate-+r+N/A
associate--l+N/A
+-commutativeN/A
mul-1-negN/A
log-recN/A
remove-double-negN/A
associate--l+N/A
associate-+r+N/A
lower--.f64N/A
Applied rewrites65.9%
Final simplification65.9%
(FPCore (x y z t a) :precision binary64 (if (<= t 3e+42) (* (log t) a) (- t)))
double code(double x, double y, double z, double t, double a) {
double tmp;
if (t <= 3e+42) {
tmp = log(t) * a;
} else {
tmp = -t;
}
return tmp;
}
real(8) function code(x, y, z, t, a)
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) :: tmp
if (t <= 3d+42) then
tmp = log(t) * a
else
tmp = -t
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (t <= 3e+42) {
tmp = Math.log(t) * a;
} else {
tmp = -t;
}
return tmp;
}
def code(x, y, z, t, a): tmp = 0 if t <= 3e+42: tmp = math.log(t) * a else: tmp = -t return tmp
function code(x, y, z, t, a) tmp = 0.0 if (t <= 3e+42) tmp = Float64(log(t) * a); else tmp = Float64(-t); end return tmp end
function tmp_2 = code(x, y, z, t, a) tmp = 0.0; if (t <= 3e+42) tmp = log(t) * a; else tmp = -t; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_] := If[LessEqual[t, 3e+42], N[(N[Log[t], $MachinePrecision] * a), $MachinePrecision], (-t)]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;t \leq 3 \cdot 10^{+42}:\\
\;\;\;\;\log t \cdot a\\
\mathbf{else}:\\
\;\;\;\;-t\\
\end{array}
\end{array}
if t < 3.00000000000000029e42Initial program 99.4%
Taylor expanded in a around inf
lower-*.f64N/A
lower-log.f6455.5
Applied rewrites55.5%
if 3.00000000000000029e42 < t Initial program 99.9%
Taylor expanded in t around inf
mul-1-negN/A
lower-neg.f6477.3
Applied rewrites77.3%
Final simplification64.6%
(FPCore (x y z t a) :precision binary64 (fma (- a 0.5) (log t) (- t)))
double code(double x, double y, double z, double t, double a) {
return fma((a - 0.5), log(t), -t);
}
function code(x, y, z, t, a) return fma(Float64(a - 0.5), log(t), Float64(-t)) end
code[x_, y_, z_, t_, a_] := N[(N[(a - 0.5), $MachinePrecision] * N[Log[t], $MachinePrecision] + (-t)), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(a - 0.5, \log t, -t\right)
\end{array}
Initial program 99.6%
lift-*.f64N/A
*-commutativeN/A
lift--.f64N/A
flip3--N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
clear-numN/A
flip3--N/A
lift--.f64N/A
lower-/.f6499.5
Applied rewrites99.5%
Taylor expanded in t around inf
mul-1-negN/A
lower-neg.f6478.6
Applied rewrites78.6%
lift-+.f64N/A
+-commutativeN/A
lift-/.f64N/A
lift-/.f64N/A
associate-/r/N/A
/-rgt-identityN/A
*-commutativeN/A
lower-fma.f6478.7
Applied rewrites78.7%
(FPCore (x y z t a) :precision binary64 (- (* (log t) a) t))
double code(double x, double y, double z, double t, double a) {
return (log(t) * a) - t;
}
real(8) function code(x, y, z, t, a)
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
code = (log(t) * a) - t
end function
public static double code(double x, double y, double z, double t, double a) {
return (Math.log(t) * a) - t;
}
def code(x, y, z, t, a): return (math.log(t) * a) - t
function code(x, y, z, t, a) return Float64(Float64(log(t) * a) - t) end
function tmp = code(x, y, z, t, a) tmp = (log(t) * a) - t; end
code[x_, y_, z_, t_, a_] := N[(N[(N[Log[t], $MachinePrecision] * a), $MachinePrecision] - t), $MachinePrecision]
\begin{array}{l}
\\
\log t \cdot a - t
\end{array}
Initial program 99.6%
lift-+.f64N/A
flip-+N/A
clear-numN/A
lower-/.f64N/A
clear-numN/A
Applied rewrites75.9%
Taylor expanded in y around 0
lower--.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower--.f64N/A
lower-log.f64N/A
lower-log.f64N/A
lower-*.f6454.5
Applied rewrites54.5%
Taylor expanded in a around inf
Applied rewrites76.4%
Final simplification76.4%
(FPCore (x y z t a) :precision binary64 (- t))
double code(double x, double y, double z, double t, double a) {
return -t;
}
real(8) function code(x, y, z, t, a)
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
code = -t
end function
public static double code(double x, double y, double z, double t, double a) {
return -t;
}
def code(x, y, z, t, a): return -t
function code(x, y, z, t, a) return Float64(-t) end
function tmp = code(x, y, z, t, a) tmp = -t; end
code[x_, y_, z_, t_, a_] := (-t)
\begin{array}{l}
\\
-t
\end{array}
Initial program 99.6%
Taylor expanded in t around inf
mul-1-negN/A
lower-neg.f6436.0
Applied rewrites36.0%
(FPCore (x y z t a) :precision binary64 t)
double code(double x, double y, double z, double t, double a) {
return t;
}
real(8) function code(x, y, z, t, a)
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
code = t
end function
public static double code(double x, double y, double z, double t, double a) {
return t;
}
def code(x, y, z, t, a): return t
function code(x, y, z, t, a) return t end
function tmp = code(x, y, z, t, a) tmp = t; end
code[x_, y_, z_, t_, a_] := t
\begin{array}{l}
\\
t
\end{array}
Initial program 99.6%
Taylor expanded in t around inf
mul-1-negN/A
lower-neg.f6436.0
Applied rewrites36.0%
Applied rewrites16.4%
Applied rewrites2.5%
(FPCore (x y z t a) :precision binary64 (+ (log (+ x y)) (+ (- (log z) t) (* (- a 0.5) (log t)))))
double code(double x, double y, double z, double t, double a) {
return log((x + y)) + ((log(z) - t) + ((a - 0.5) * log(t)));
}
real(8) function code(x, y, z, t, a)
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
code = log((x + y)) + ((log(z) - t) + ((a - 0.5d0) * log(t)))
end function
public static double code(double x, double y, double z, double t, double a) {
return Math.log((x + y)) + ((Math.log(z) - t) + ((a - 0.5) * Math.log(t)));
}
def code(x, y, z, t, a): return math.log((x + y)) + ((math.log(z) - t) + ((a - 0.5) * math.log(t)))
function code(x, y, z, t, a) return Float64(log(Float64(x + y)) + Float64(Float64(log(z) - t) + Float64(Float64(a - 0.5) * log(t)))) end
function tmp = code(x, y, z, t, a) tmp = log((x + y)) + ((log(z) - t) + ((a - 0.5) * log(t))); end
code[x_, y_, z_, t_, a_] := N[(N[Log[N[(x + y), $MachinePrecision]], $MachinePrecision] + N[(N[(N[Log[z], $MachinePrecision] - t), $MachinePrecision] + N[(N[(a - 0.5), $MachinePrecision] * N[Log[t], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\log \left(x + y\right) + \left(\left(\log z - t\right) + \left(a - 0.5\right) \cdot \log t\right)
\end{array}
herbie shell --seed 2024249
(FPCore (x y z t a)
:name "Numeric.SpecFunctions:logGammaL from math-functions-0.1.5.2"
:precision binary64
:alt
(! :herbie-platform default (+ (log (+ x y)) (+ (- (log z) t) (* (- a 1/2) (log t)))))
(+ (- (+ (log (+ x y)) (log z)) t) (* (- a 0.5) (log t))))