\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right){\left({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)}\right)}^{\left(\sqrt[3]{\sqrt[3]{{\left(\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\right)}^{3}}}\right)}double f(double a, double c) {
double r11010 = c;
double r11011 = cosh(r11010);
double r11012 = a;
double r11013 = log1p(r11012);
double r11014 = fmod(r11011, r11013);
return r11014;
}
double f(double a, double c) {
double r11015 = exp(1.0);
double r11016 = c;
double r11017 = cosh(r11016);
double r11018 = a;
double r11019 = log1p(r11018);
double r11020 = fmod(r11017, r11019);
double r11021 = log(r11020);
double r11022 = cbrt(r11021);
double r11023 = r11022 * r11022;
double r11024 = pow(r11015, r11023);
double r11025 = 3.0;
double r11026 = pow(r11021, r11025);
double r11027 = cbrt(r11026);
double r11028 = cbrt(r11027);
double r11029 = pow(r11024, r11028);
return r11029;
}



Bits error versus a



Bits error versus c
Initial program 34.0
rmApplied add-exp-log34.0
rmApplied pow134.0
Applied log-pow34.0
Applied exp-prod34.0
Simplified34.0
rmApplied add-cube-cbrt34.0
Applied pow-unpow34.0
rmApplied add-cbrt-cube34.0
Simplified34.0
Final simplification34.0
herbie shell --seed 2019346 +o rules:numerics
(FPCore (a c)
:name "Random Jason Timeout Test 004"
:precision binary64
(fmod (cosh c) (log1p a)))