\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 \log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}}\right)}^{\left(\sqrt[3]{\sqrt[3]{{\left(\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)}^{3}}}\right)}double f(double a, double c) {
double r13550 = c;
double r13551 = cosh(r13550);
double r13552 = a;
double r13553 = log1p(r13552);
double r13554 = fmod(r13551, r13553);
return r13554;
}
double f(double a, double c) {
double r13555 = c;
double r13556 = cosh(r13555);
double r13557 = a;
double r13558 = log1p(r13557);
double r13559 = fmod(r13556, r13558);
double r13560 = log(r13559);
double r13561 = r13560 * r13560;
double r13562 = cbrt(r13561);
double r13563 = exp(r13562);
double r13564 = cbrt(r13560);
double r13565 = r13564 * r13564;
double r13566 = r13565 * r13564;
double r13567 = 3.0;
double r13568 = pow(r13566, r13567);
double r13569 = cbrt(r13568);
double r13570 = cbrt(r13569);
double r13571 = pow(r13563, r13570);
return r13571;
}



Bits error versus a



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