\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)e^{\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]{\sqrt[3]{{\left(\sqrt[3]{{\left(\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\right)}^{3}}\right)}^{3}}}}double f(double a, double c) {
double r18018 = c;
double r18019 = cosh(r18018);
double r18020 = a;
double r18021 = log1p(r18020);
double r18022 = fmod(r18019, r18021);
return r18022;
}
double f(double a, double c) {
double r18023 = c;
double r18024 = cosh(r18023);
double r18025 = a;
double r18026 = log1p(r18025);
double r18027 = fmod(r18024, r18026);
double r18028 = log(r18027);
double r18029 = cbrt(r18028);
double r18030 = r18029 * r18029;
double r18031 = 3.0;
double r18032 = pow(r18028, r18031);
double r18033 = cbrt(r18032);
double r18034 = pow(r18033, r18031);
double r18035 = cbrt(r18034);
double r18036 = cbrt(r18035);
double r18037 = r18030 * r18036;
double r18038 = exp(r18037);
return r18038;
}



Bits error versus a



Bits error versus c
Initial program 34.0
rmApplied add-exp-log34.0
rmApplied add-cube-cbrt34.0
rmApplied add-cbrt-cube34.0
Simplified34.0
rmApplied add-cbrt-cube34.0
Simplified34.0
Final simplification34.0
herbie shell --seed 2020025
(FPCore (a c)
:name "Random Jason Timeout Test 004"
:precision binary64
(fmod (cosh c) (log1p a)))