\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right){\left(e^{\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)}^{\left(\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)}double f(double a, double c) {
double r11971 = c;
double r11972 = cosh(r11971);
double r11973 = a;
double r11974 = log1p(r11973);
double r11975 = fmod(r11972, r11974);
return r11975;
}
double f(double a, double c) {
double r11976 = c;
double r11977 = cosh(r11976);
double r11978 = a;
double r11979 = log1p(r11978);
double r11980 = fmod(r11977, r11979);
double r11981 = log(r11980);
double r11982 = cbrt(r11981);
double r11983 = r11982 * r11982;
double r11984 = exp(r11983);
double r11985 = r11983 * r11982;
double r11986 = cbrt(r11985);
double r11987 = pow(r11984, r11986);
return r11987;
}



Bits error versus a



Bits error versus c
Initial program 33.7
rmApplied add-exp-log33.7
rmApplied add-cube-cbrt33.7
Applied exp-prod33.7
rmApplied add-cube-cbrt33.7
Final simplification33.7
herbie shell --seed 2020042
(FPCore (a c)
:name "Random Jason Timeout Test 004"
:precision binary64
(fmod (cosh c) (log1p a)))