\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\left(\left(\sqrt{e^{e^{\log \left(\log \left(\cosh c\right)\right)}}} \cdot \sqrt{\cosh c}\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)double f(double a, double c) {
double r20698 = c;
double r20699 = cosh(r20698);
double r20700 = a;
double r20701 = log1p(r20700);
double r20702 = fmod(r20699, r20701);
return r20702;
}
double f(double a, double c) {
double r20703 = c;
double r20704 = cosh(r20703);
double r20705 = log(r20704);
double r20706 = log(r20705);
double r20707 = exp(r20706);
double r20708 = exp(r20707);
double r20709 = sqrt(r20708);
double r20710 = sqrt(r20704);
double r20711 = r20709 * r20710;
double r20712 = a;
double r20713 = log1p(r20712);
double r20714 = fmod(r20711, r20713);
return r20714;
}



Bits error versus a



Bits error versus c
Initial program 33.8
rmApplied add-sqr-sqrt33.8
rmApplied add-exp-log33.8
rmApplied add-exp-log33.8
Final simplification33.8
herbie shell --seed 2019208
(FPCore (a c)
:name "Random Jason Timeout Test 004"
:precision binary64
(fmod (cosh c) (log1p a)))