\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 r11979 = c;
double r11980 = cosh(r11979);
double r11981 = a;
double r11982 = log1p(r11981);
double r11983 = fmod(r11980, r11982);
return r11983;
}
double f(double a, double c) {
double r11984 = c;
double r11985 = cosh(r11984);
double r11986 = a;
double r11987 = log1p(r11986);
double r11988 = fmod(r11985, r11987);
double r11989 = log(r11988);
double r11990 = cbrt(r11989);
double r11991 = r11990 * r11990;
double r11992 = exp(r11991);
double r11993 = r11991 * r11990;
double r11994 = cbrt(r11993);
double r11995 = pow(r11992, r11994);
return r11995;
}



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)))