\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\left(\sqrt[3]{\sqrt{\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}} \cdot \sqrt[3]{\sqrt{\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}}\right) \cdot \left(\left(\sqrt[3]{\sqrt{\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}} \cdot \sqrt[3]{\sqrt{\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}}\right) \cdot \left(\sqrt[3]{\sqrt{\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}} \cdot \sqrt[3]{\sqrt{\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}}\right)\right)double f(double a, double c) {
double r727564 = c;
double r727565 = cosh(r727564);
double r727566 = a;
double r727567 = log1p(r727566);
double r727568 = fmod(r727565, r727567);
return r727568;
}
double f(double a, double c) {
double r727569 = c;
double r727570 = cosh(r727569);
double r727571 = a;
double r727572 = log1p(r727571);
double r727573 = fmod(r727570, r727572);
double r727574 = sqrt(r727573);
double r727575 = cbrt(r727574);
double r727576 = r727575 * r727575;
double r727577 = r727576 * r727576;
double r727578 = r727576 * r727577;
return r727578;
}



Bits error versus a



Bits error versus c
Initial program 34.0
rmApplied add-sqr-sqrt34.0
rmApplied add-cube-cbrt34.0
Applied add-cube-cbrt34.0
Applied swap-sqr34.0
Final simplification34.0
herbie shell --seed 2019171 +o rules:numerics
(FPCore (a c)
:name "Random Jason Timeout Test 004"
(fmod (cosh c) (log1p a)))