\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 r16349 = c;
double r16350 = cosh(r16349);
double r16351 = a;
double r16352 = log1p(r16351);
double r16353 = fmod(r16350, r16352);
return r16353;
}
double f(double a, double c) {
double r16354 = c;
double r16355 = cosh(r16354);
double r16356 = a;
double r16357 = log1p(r16356);
double r16358 = fmod(r16355, r16357);
double r16359 = log(r16358);
double r16360 = cbrt(r16359);
double r16361 = r16360 * r16360;
double r16362 = exp(r16361);
double r16363 = r16361 * r16360;
double r16364 = cbrt(r16363);
double r16365 = pow(r16362, r16364);
return r16365;
}



Bits error versus a



Bits error versus c
Initial program 33.9
rmApplied add-exp-log33.9
rmApplied add-cube-cbrt33.9
Applied exp-prod33.9
rmApplied add-cube-cbrt33.9
Final simplification33.9
herbie shell --seed 2020046 +o rules:numerics
(FPCore (a c)
:name "Random Jason Timeout Test 004"
:precision binary64
(fmod (cosh c) (log1p a)))