\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)e^{\left(\sqrt[3]{\log \left(\left(\mathsf{expm1}\left(\sqrt{\mathsf{log1p}\left(\cosh c\right)} \cdot \sqrt{\mathsf{log1p}\left(\cosh c\right)}\right)\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)} \cdot \sqrt[3]{\log \left(\left(\mathsf{expm1}\left(\sqrt{\mathsf{log1p}\left(\cosh c\right)} \cdot \sqrt{\mathsf{log1p}\left(\cosh c\right)}\right)\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}\right) \cdot \sqrt[3]{\log \left(\left(\mathsf{expm1}\left(\sqrt{\mathsf{log1p}\left(\cosh c\right)} \cdot \sqrt{\mathsf{log1p}\left(\cosh c\right)}\right)\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}}double f(double a, double c) {
double r20540 = c;
double r20541 = cosh(r20540);
double r20542 = a;
double r20543 = log1p(r20542);
double r20544 = fmod(r20541, r20543);
return r20544;
}
double f(double a, double c) {
double r20545 = c;
double r20546 = cosh(r20545);
double r20547 = log1p(r20546);
double r20548 = sqrt(r20547);
double r20549 = r20548 * r20548;
double r20550 = expm1(r20549);
double r20551 = a;
double r20552 = log1p(r20551);
double r20553 = fmod(r20550, r20552);
double r20554 = log(r20553);
double r20555 = cbrt(r20554);
double r20556 = r20555 * r20555;
double r20557 = r20556 * r20555;
double r20558 = exp(r20557);
return r20558;
}



Bits error versus a



Bits error versus c
Initial program 34.7
rmApplied expm1-log1p-u34.7
rmApplied add-sqr-sqrt34.8
rmApplied add-exp-log34.8
rmApplied add-cube-cbrt34.8
Final simplification34.8
herbie shell --seed 2019362 +o rules:numerics
(FPCore (a c)
:name "Random Jason Timeout Test 004"
:precision binary64
(fmod (cosh c) (log1p a)))