\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)e^{\left(\sqrt[3]{\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)} \cdot \sqrt[3]{\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}\right) \cdot \sqrt[3]{\sqrt[3]{{\left(\sqrt[3]{{\left(\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\right)}^{3}}\right)}^{3}}}}double f(double a, double c) {
double r17384 = c;
double r17385 = cosh(r17384);
double r17386 = a;
double r17387 = log1p(r17386);
double r17388 = fmod(r17385, r17387);
return r17388;
}
double f(double a, double c) {
double r17389 = c;
double r17390 = cosh(r17389);
double r17391 = a;
double r17392 = log1p(r17391);
double r17393 = fmod(r17390, r17392);
double r17394 = log(r17393);
double r17395 = cbrt(r17394);
double r17396 = r17395 * r17395;
double r17397 = 3.0;
double r17398 = pow(r17394, r17397);
double r17399 = cbrt(r17398);
double r17400 = pow(r17399, r17397);
double r17401 = cbrt(r17400);
double r17402 = cbrt(r17401);
double r17403 = r17396 * r17402;
double r17404 = exp(r17403);
return r17404;
}



Bits error versus a



Bits error versus c
Initial program 34.0
rmApplied add-exp-log34.0
rmApplied add-cube-cbrt34.0
rmApplied add-cbrt-cube34.0
Simplified34.0
rmApplied add-cbrt-cube34.0
Simplified34.0
Final simplification34.0
herbie shell --seed 2020025 +o rules:numerics
(FPCore (a c)
:name "Random Jason Timeout Test 004"
:precision binary64
(fmod (cosh c) (log1p a)))