\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 r9800 = c;
double r9801 = cosh(r9800);
double r9802 = a;
double r9803 = log1p(r9802);
double r9804 = fmod(r9801, r9803);
return r9804;
}
double f(double a, double c) {
double r9805 = c;
double r9806 = cosh(r9805);
double r9807 = a;
double r9808 = log1p(r9807);
double r9809 = fmod(r9806, r9808);
double r9810 = log(r9809);
double r9811 = cbrt(r9810);
double r9812 = r9811 * r9811;
double r9813 = exp(r9812);
double r9814 = r9812 * r9811;
double r9815 = cbrt(r9814);
double r9816 = pow(r9813, r9815);
return r9816;
}



Bits error versus a



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