\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]{2 \cdot \log \left(\sqrt[3]{\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}\right) + \log \left(\sqrt[3]{\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}\right)}\right)}double f(double a, double c) {
double r15377 = c;
double r15378 = cosh(r15377);
double r15379 = a;
double r15380 = log1p(r15379);
double r15381 = fmod(r15378, r15380);
return r15381;
}
double f(double a, double c) {
double r15382 = c;
double r15383 = cosh(r15382);
double r15384 = a;
double r15385 = log1p(r15384);
double r15386 = fmod(r15383, r15385);
double r15387 = log(r15386);
double r15388 = cbrt(r15387);
double r15389 = r15388 * r15388;
double r15390 = exp(r15389);
double r15391 = 2.0;
double r15392 = cbrt(r15386);
double r15393 = log(r15392);
double r15394 = r15391 * r15393;
double r15395 = r15394 + r15393;
double r15396 = cbrt(r15395);
double r15397 = pow(r15390, r15396);
return r15397;
}



Bits error versus a



Bits error versus c
Initial program 33.4
rmApplied add-exp-log33.4
rmApplied add-cube-cbrt33.4
Applied exp-prod33.4
rmApplied add-cube-cbrt33.4
Applied log-prod33.4
Simplified33.4
Final simplification33.4
herbie shell --seed 2019212
(FPCore (a c)
:name "Random Jason Timeout Test 004"
:precision binary64
(fmod (cosh c) (log1p a)))