
(FPCore (x) :precision binary64 (* (fmod (exp x) (sqrt (cos x))) (exp (- x))))
double code(double x) {
return fmod(exp(x), sqrt(cos(x))) * exp(-x);
}
real(8) function code(x)
real(8), intent (in) :: x
code = mod(exp(x), sqrt(cos(x))) * exp(-x)
end function
def code(x): return math.fmod(math.exp(x), math.sqrt(math.cos(x))) * math.exp(-x)
function code(x) return Float64(rem(exp(x), sqrt(cos(x))) * exp(Float64(-x))) end
code[x_] := N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[Sqrt[N[Cos[x], $MachinePrecision]], $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * N[Exp[(-x)], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 6 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x) :precision binary64 (* (fmod (exp x) (sqrt (cos x))) (exp (- x))))
double code(double x) {
return fmod(exp(x), sqrt(cos(x))) * exp(-x);
}
real(8) function code(x)
real(8), intent (in) :: x
code = mod(exp(x), sqrt(cos(x))) * exp(-x)
end function
def code(x): return math.fmod(math.exp(x), math.sqrt(math.cos(x))) * math.exp(-x)
function code(x) return Float64(rem(exp(x), sqrt(cos(x))) * exp(Float64(-x))) end
code[x_] := N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[Sqrt[N[Cos[x], $MachinePrecision]], $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * N[Exp[(-x)], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x}
\end{array}
(FPCore (x)
:precision binary64
(let* ((t_0 (fmod (exp x) (sqrt (cos x))))
(t_1 (exp (- x)))
(t_2 (* t_0 t_1)))
(if (<= t_2 1e-13)
(* t_1 (fmod (fma x (* x 0.5) x) 1.0))
(if (<= t_2 2.0) (/ t_0 (exp x)) (/ (fmod 1.0 1.0) 1.0)))))
double code(double x) {
double t_0 = fmod(exp(x), sqrt(cos(x)));
double t_1 = exp(-x);
double t_2 = t_0 * t_1;
double tmp;
if (t_2 <= 1e-13) {
tmp = t_1 * fmod(fma(x, (x * 0.5), x), 1.0);
} else if (t_2 <= 2.0) {
tmp = t_0 / exp(x);
} else {
tmp = fmod(1.0, 1.0) / 1.0;
}
return tmp;
}
function code(x) t_0 = rem(exp(x), sqrt(cos(x))) t_1 = exp(Float64(-x)) t_2 = Float64(t_0 * t_1) tmp = 0.0 if (t_2 <= 1e-13) tmp = Float64(t_1 * rem(fma(x, Float64(x * 0.5), x), 1.0)); elseif (t_2 <= 2.0) tmp = Float64(t_0 / exp(x)); else tmp = Float64(rem(1.0, 1.0) / 1.0); end return tmp end
code[x_] := Block[{t$95$0 = N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[Sqrt[N[Cos[x], $MachinePrecision]], $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]}, Block[{t$95$1 = N[Exp[(-x)], $MachinePrecision]}, Block[{t$95$2 = N[(t$95$0 * t$95$1), $MachinePrecision]}, If[LessEqual[t$95$2, 1e-13], N[(t$95$1 * N[With[{TMP1 = N[(x * N[(x * 0.5), $MachinePrecision] + x), $MachinePrecision], TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 2.0], N[(t$95$0 / N[Exp[x], $MachinePrecision]), $MachinePrecision], N[(N[With[{TMP1 = 1.0, TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] / 1.0), $MachinePrecision]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right)\\
t_1 := e^{-x}\\
t_2 := t\_0 \cdot t\_1\\
\mathbf{if}\;t\_2 \leq 10^{-13}:\\
\;\;\;\;t\_1 \cdot \left(\left(\mathsf{fma}\left(x, x \cdot 0.5, x\right)\right) \bmod 1\right)\\
\mathbf{elif}\;t\_2 \leq 2:\\
\;\;\;\;\frac{t\_0}{e^{x}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(1 \bmod 1\right)}{1}\\
\end{array}
\end{array}
if (*.f64 (fmod.f64 (exp.f64 x) (sqrt.f64 (cos.f64 x))) (exp.f64 (neg.f64 x))) < 1e-13Initial program 4.7%
Taylor expanded in x around 0
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f644.7
Applied rewrites4.7%
Taylor expanded in x around 0
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f644.7
Applied rewrites4.7%
Taylor expanded in x around inf
Applied rewrites48.9%
Taylor expanded in x around 0
Applied rewrites48.9%
if 1e-13 < (*.f64 (fmod.f64 (exp.f64 x) (sqrt.f64 (cos.f64 x))) (exp.f64 (neg.f64 x))) < 2Initial program 91.0%
lift-*.f64N/A
lift-exp.f64N/A
lift-neg.f64N/A
exp-negN/A
lift-exp.f64N/A
un-div-invN/A
lower-/.f6491.4
Applied rewrites91.4%
if 2 < (*.f64 (fmod.f64 (exp.f64 x) (sqrt.f64 (cos.f64 x))) (exp.f64 (neg.f64 x))) Initial program 0.0%
Taylor expanded in x around 0
Applied rewrites0.0%
lift-*.f64N/A
lift-exp.f64N/A
lift-neg.f64N/A
exp-negN/A
lift-exp.f64N/A
un-div-invN/A
lower-/.f640.0
Applied rewrites0.0%
Taylor expanded in x around 0
Applied rewrites0.1%
Taylor expanded in x around 0
Applied rewrites96.2%
Final simplification60.0%
(FPCore (x)
:precision binary64
(let* ((t_0 (exp (- x))) (t_1 (* (fmod (exp x) (sqrt (cos x))) t_0)))
(if (<= t_1 1e-13)
(* t_0 (fmod (fma x (* x 0.5) x) 1.0))
(if (<= t_1 2.0)
(*
t_0
(fmod
(exp x)
(fma
(* x x)
(fma
x
(* x (fma (* x x) -0.003298611111111111 -0.010416666666666666))
-0.25)
1.0)))
(/ (fmod 1.0 1.0) 1.0)))))
double code(double x) {
double t_0 = exp(-x);
double t_1 = fmod(exp(x), sqrt(cos(x))) * t_0;
double tmp;
if (t_1 <= 1e-13) {
tmp = t_0 * fmod(fma(x, (x * 0.5), x), 1.0);
} else if (t_1 <= 2.0) {
tmp = t_0 * fmod(exp(x), fma((x * x), fma(x, (x * fma((x * x), -0.003298611111111111, -0.010416666666666666)), -0.25), 1.0));
} else {
tmp = fmod(1.0, 1.0) / 1.0;
}
return tmp;
}
function code(x) t_0 = exp(Float64(-x)) t_1 = Float64(rem(exp(x), sqrt(cos(x))) * t_0) tmp = 0.0 if (t_1 <= 1e-13) tmp = Float64(t_0 * rem(fma(x, Float64(x * 0.5), x), 1.0)); elseif (t_1 <= 2.0) tmp = Float64(t_0 * rem(exp(x), fma(Float64(x * x), fma(x, Float64(x * fma(Float64(x * x), -0.003298611111111111, -0.010416666666666666)), -0.25), 1.0))); else tmp = Float64(rem(1.0, 1.0) / 1.0); end return tmp end
code[x_] := Block[{t$95$0 = N[Exp[(-x)], $MachinePrecision]}, Block[{t$95$1 = N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[Sqrt[N[Cos[x], $MachinePrecision]], $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * t$95$0), $MachinePrecision]}, If[LessEqual[t$95$1, 1e-13], N[(t$95$0 * N[With[{TMP1 = N[(x * N[(x * 0.5), $MachinePrecision] + x), $MachinePrecision], TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2.0], N[(t$95$0 * N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[(N[(x * x), $MachinePrecision] * N[(x * N[(x * N[(N[(x * x), $MachinePrecision] * -0.003298611111111111 + -0.010416666666666666), $MachinePrecision]), $MachinePrecision] + -0.25), $MachinePrecision] + 1.0), $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]), $MachinePrecision], N[(N[With[{TMP1 = 1.0, TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] / 1.0), $MachinePrecision]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := e^{-x}\\
t_1 := \left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot t\_0\\
\mathbf{if}\;t\_1 \leq 10^{-13}:\\
\;\;\;\;t\_0 \cdot \left(\left(\mathsf{fma}\left(x, x \cdot 0.5, x\right)\right) \bmod 1\right)\\
\mathbf{elif}\;t\_1 \leq 2:\\
\;\;\;\;t\_0 \cdot \left(\left(e^{x}\right) \bmod \left(\mathsf{fma}\left(x \cdot x, \mathsf{fma}\left(x, x \cdot \mathsf{fma}\left(x \cdot x, -0.003298611111111111, -0.010416666666666666\right), -0.25\right), 1\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(1 \bmod 1\right)}{1}\\
\end{array}
\end{array}
if (*.f64 (fmod.f64 (exp.f64 x) (sqrt.f64 (cos.f64 x))) (exp.f64 (neg.f64 x))) < 1e-13Initial program 4.7%
Taylor expanded in x around 0
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f644.7
Applied rewrites4.7%
Taylor expanded in x around 0
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f644.7
Applied rewrites4.7%
Taylor expanded in x around inf
Applied rewrites48.9%
Taylor expanded in x around 0
Applied rewrites48.9%
if 1e-13 < (*.f64 (fmod.f64 (exp.f64 x) (sqrt.f64 (cos.f64 x))) (exp.f64 (neg.f64 x))) < 2Initial program 91.0%
Taylor expanded in x around 0
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
sub-negN/A
unpow2N/A
associate-*l*N/A
metadata-evalN/A
lower-fma.f64N/A
lower-*.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6491.0
Applied rewrites91.0%
if 2 < (*.f64 (fmod.f64 (exp.f64 x) (sqrt.f64 (cos.f64 x))) (exp.f64 (neg.f64 x))) Initial program 0.0%
Taylor expanded in x around 0
Applied rewrites0.0%
lift-*.f64N/A
lift-exp.f64N/A
lift-neg.f64N/A
exp-negN/A
lift-exp.f64N/A
un-div-invN/A
lower-/.f640.0
Applied rewrites0.0%
Taylor expanded in x around 0
Applied rewrites0.1%
Taylor expanded in x around 0
Applied rewrites96.2%
Final simplification60.0%
(FPCore (x)
:precision binary64
(let* ((t_0 (exp (- x))))
(if (<= (* (fmod (exp x) (sqrt (cos x))) t_0) 0.02)
(* t_0 (fmod (fma x (* x 0.5) x) 1.0))
(* t_0 (fmod (+ x 1.0) 1.0)))))
double code(double x) {
double t_0 = exp(-x);
double tmp;
if ((fmod(exp(x), sqrt(cos(x))) * t_0) <= 0.02) {
tmp = t_0 * fmod(fma(x, (x * 0.5), x), 1.0);
} else {
tmp = t_0 * fmod((x + 1.0), 1.0);
}
return tmp;
}
function code(x) t_0 = exp(Float64(-x)) tmp = 0.0 if (Float64(rem(exp(x), sqrt(cos(x))) * t_0) <= 0.02) tmp = Float64(t_0 * rem(fma(x, Float64(x * 0.5), x), 1.0)); else tmp = Float64(t_0 * rem(Float64(x + 1.0), 1.0)); end return tmp end
code[x_] := Block[{t$95$0 = N[Exp[(-x)], $MachinePrecision]}, If[LessEqual[N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[Sqrt[N[Cos[x], $MachinePrecision]], $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * t$95$0), $MachinePrecision], 0.02], N[(t$95$0 * N[With[{TMP1 = N[(x * N[(x * 0.5), $MachinePrecision] + x), $MachinePrecision], TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]), $MachinePrecision], N[(t$95$0 * N[With[{TMP1 = N[(x + 1.0), $MachinePrecision], TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := e^{-x}\\
\mathbf{if}\;\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot t\_0 \leq 0.02:\\
\;\;\;\;t\_0 \cdot \left(\left(\mathsf{fma}\left(x, x \cdot 0.5, x\right)\right) \bmod 1\right)\\
\mathbf{else}:\\
\;\;\;\;t\_0 \cdot \left(\left(x + 1\right) \bmod 1\right)\\
\end{array}
\end{array}
if (*.f64 (fmod.f64 (exp.f64 x) (sqrt.f64 (cos.f64 x))) (exp.f64 (neg.f64 x))) < 0.0200000000000000004Initial program 7.1%
Taylor expanded in x around 0
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f647.0
Applied rewrites7.0%
Taylor expanded in x around 0
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f646.1
Applied rewrites6.1%
Taylor expanded in x around inf
Applied rewrites48.6%
Taylor expanded in x around 0
Applied rewrites48.6%
if 0.0200000000000000004 < (*.f64 (fmod.f64 (exp.f64 x) (sqrt.f64 (cos.f64 x))) (exp.f64 (neg.f64 x))) Initial program 7.2%
Taylor expanded in x around 0
Applied rewrites7.2%
Taylor expanded in x around 0
+-commutativeN/A
lower-+.f6494.2
Applied rewrites94.2%
Final simplification58.4%
(FPCore (x) :precision binary64 (* (exp (- x)) (fmod (+ x 1.0) 1.0)))
double code(double x) {
return exp(-x) * fmod((x + 1.0), 1.0);
}
real(8) function code(x)
real(8), intent (in) :: x
code = exp(-x) * mod((x + 1.0d0), 1.0d0)
end function
def code(x): return math.exp(-x) * math.fmod((x + 1.0), 1.0)
function code(x) return Float64(exp(Float64(-x)) * rem(Float64(x + 1.0), 1.0)) end
code[x_] := N[(N[Exp[(-x)], $MachinePrecision] * N[With[{TMP1 = N[(x + 1.0), $MachinePrecision], TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
e^{-x} \cdot \left(\left(x + 1\right) \bmod 1\right)
\end{array}
Initial program 7.1%
Taylor expanded in x around 0
Applied rewrites6.0%
Taylor expanded in x around 0
+-commutativeN/A
lower-+.f6424.7
Applied rewrites24.7%
Final simplification24.7%
(FPCore (x) :precision binary64 (/ (fmod (+ x 1.0) 1.0) 1.0))
double code(double x) {
return fmod((x + 1.0), 1.0) / 1.0;
}
real(8) function code(x)
real(8), intent (in) :: x
code = mod((x + 1.0d0), 1.0d0) / 1.0d0
end function
def code(x): return math.fmod((x + 1.0), 1.0) / 1.0
function code(x) return Float64(rem(Float64(x + 1.0), 1.0) / 1.0) end
code[x_] := N[(N[With[{TMP1 = N[(x + 1.0), $MachinePrecision], TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] / 1.0), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(\left(x + 1\right) \bmod 1\right)}{1}
\end{array}
Initial program 7.1%
Taylor expanded in x around 0
Applied rewrites6.0%
lift-*.f64N/A
lift-exp.f64N/A
lift-neg.f64N/A
exp-negN/A
lift-exp.f64N/A
un-div-invN/A
lower-/.f646.0
Applied rewrites6.0%
Taylor expanded in x around 0
Applied rewrites5.2%
Taylor expanded in x around 0
+-commutativeN/A
lower-+.f6423.9
Applied rewrites23.9%
(FPCore (x) :precision binary64 (/ (fmod 1.0 1.0) 1.0))
double code(double x) {
return fmod(1.0, 1.0) / 1.0;
}
real(8) function code(x)
real(8), intent (in) :: x
code = mod(1.0d0, 1.0d0) / 1.0d0
end function
def code(x): return math.fmod(1.0, 1.0) / 1.0
function code(x) return Float64(rem(1.0, 1.0) / 1.0) end
code[x_] := N[(N[With[{TMP1 = 1.0, TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] / 1.0), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(1 \bmod 1\right)}{1}
\end{array}
Initial program 7.1%
Taylor expanded in x around 0
Applied rewrites6.0%
lift-*.f64N/A
lift-exp.f64N/A
lift-neg.f64N/A
exp-negN/A
lift-exp.f64N/A
un-div-invN/A
lower-/.f646.0
Applied rewrites6.0%
Taylor expanded in x around 0
Applied rewrites5.2%
Taylor expanded in x around 0
Applied rewrites22.5%
herbie shell --seed 2024220
(FPCore (x)
:name "expfmod (used to be hard to sample)"
:precision binary64
(* (fmod (exp x) (sqrt (cos x))) (exp (- x))))