\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\left(\sqrt{\sqrt{\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}} \cdot \sqrt{\sqrt{\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}}\right) \cdot \left(\sqrt{\sqrt{\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}} \cdot \sqrt{\sqrt{\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}}\right)double f(double a, double c) {
double r939599 = c;
double r939600 = cosh(r939599);
double r939601 = a;
double r939602 = log1p(r939601);
double r939603 = fmod(r939600, r939602);
return r939603;
}
double f(double a, double c) {
double r939604 = c;
double r939605 = cosh(r939604);
double r939606 = a;
double r939607 = log1p(r939606);
double r939608 = fmod(r939605, r939607);
double r939609 = sqrt(r939608);
double r939610 = sqrt(r939609);
double r939611 = r939610 * r939610;
double r939612 = r939611 * r939611;
return r939612;
}



Bits error versus a



Bits error versus c
Initial program 34.3
rmApplied add-sqr-sqrt34.3
rmApplied add-sqr-sqrt34.3
Applied sqrt-prod34.3
Applied add-sqr-sqrt34.3
Applied unswap-sqr34.3
Final simplification34.3
herbie shell --seed 2019151 +o rules:numerics
(FPCore (a c)
:name "Random Jason Timeout Test 004"
(fmod (cosh c) (log1p a)))