\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right){\left(e^{\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)}^{\left(\sqrt[3]{\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]{\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}}\right)}double f(double a, double c) {
double r12385 = c;
double r12386 = cosh(r12385);
double r12387 = a;
double r12388 = log1p(r12387);
double r12389 = fmod(r12386, r12388);
return r12389;
}
double f(double a, double c) {
double r12390 = c;
double r12391 = cosh(r12390);
double r12392 = a;
double r12393 = log1p(r12392);
double r12394 = fmod(r12391, r12393);
double r12395 = log(r12394);
double r12396 = cbrt(r12395);
double r12397 = r12396 * r12396;
double r12398 = exp(r12397);
double r12399 = r12397 * r12396;
double r12400 = cbrt(r12399);
double r12401 = pow(r12398, r12400);
return r12401;
}



Bits error versus a



Bits error versus c
Initial program 34.0
rmApplied add-exp-log34.0
rmApplied add-cube-cbrt34.0
Applied exp-prod34.0
rmApplied add-cube-cbrt34.0
Final simplification34.0
herbie shell --seed 2020081
(FPCore (a c)
:name "Random Jason Timeout Test 004"
:precision binary64
(fmod (cosh c) (log1p a)))