\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)e^{\sqrt[3]{{\left(\sqrt[3]{{\left(\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\right)}^{2}} \cdot \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)}^{3}}}double f(double a, double c) {
double r16482 = c;
double r16483 = cosh(r16482);
double r16484 = a;
double r16485 = log1p(r16484);
double r16486 = fmod(r16483, r16485);
return r16486;
}
double f(double a, double c) {
double r16487 = c;
double r16488 = cosh(r16487);
double r16489 = a;
double r16490 = log1p(r16489);
double r16491 = fmod(r16488, r16490);
double r16492 = log(r16491);
double r16493 = 2.0;
double r16494 = pow(r16492, r16493);
double r16495 = cbrt(r16494);
double r16496 = cbrt(r16492);
double r16497 = r16496 * r16496;
double r16498 = r16497 * r16496;
double r16499 = cbrt(r16498);
double r16500 = r16495 * r16499;
double r16501 = 3.0;
double r16502 = pow(r16500, r16501);
double r16503 = cbrt(r16502);
double r16504 = exp(r16503);
return r16504;
}



Bits error versus a



Bits error versus c
Initial program 34.8
rmApplied add-exp-log34.8
rmApplied add-cbrt-cube34.8
Simplified34.8
rmApplied add-cube-cbrt34.8
Simplified34.8
rmApplied add-cube-cbrt34.8
Final simplification34.8
herbie shell --seed 2019198 +o rules:numerics
(FPCore (a c)
:name "Random Jason Timeout Test 004"
(fmod (cosh c) (log1p a)))