\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 r13707 = c;
double r13708 = cosh(r13707);
double r13709 = a;
double r13710 = log1p(r13709);
double r13711 = fmod(r13708, r13710);
return r13711;
}
double f(double a, double c) {
double r13712 = c;
double r13713 = cosh(r13712);
double r13714 = a;
double r13715 = log1p(r13714);
double r13716 = fmod(r13713, r13715);
double r13717 = log(r13716);
double r13718 = cbrt(r13717);
double r13719 = r13718 * r13718;
double r13720 = exp(r13719);
double r13721 = r13719 * r13718;
double r13722 = cbrt(r13721);
double r13723 = pow(r13720, r13722);
return r13723;
}



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 +o rules:numerics
(FPCore (a c)
:name "Random Jason Timeout Test 004"
:precision binary64
(fmod (cosh c) (log1p a)))