\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right){\left({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)}\right)}^{\left(\sqrt[3]{\sqrt[3]{{\left(\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\right)}^{3}}}\right)}double f(double a, double c) {
double r10324 = c;
double r10325 = cosh(r10324);
double r10326 = a;
double r10327 = log1p(r10326);
double r10328 = fmod(r10325, r10327);
return r10328;
}
double f(double a, double c) {
double r10329 = exp(1.0);
double r10330 = c;
double r10331 = cosh(r10330);
double r10332 = a;
double r10333 = log1p(r10332);
double r10334 = fmod(r10331, r10333);
double r10335 = log(r10334);
double r10336 = cbrt(r10335);
double r10337 = r10336 * r10336;
double r10338 = pow(r10329, r10337);
double r10339 = 3.0;
double r10340 = pow(r10335, r10339);
double r10341 = cbrt(r10340);
double r10342 = cbrt(r10341);
double r10343 = pow(r10338, r10342);
return r10343;
}



Bits error versus a



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