\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\sqrt{\left(\left(\cosh c\right) \bmod \left(\left(\sqrt[3]{\mathsf{log1p}\left(a\right)} \cdot \sqrt[3]{\mathsf{log1p}\left(a\right)}\right) \cdot \left(\sqrt[3]{\sqrt[3]{\mathsf{log1p}\left(a\right)} \cdot \sqrt[3]{\mathsf{log1p}\left(a\right)}} \cdot \sqrt[3]{\sqrt[3]{\mathsf{log1p}\left(a\right)}}\right)\right)\right)} \cdot \sqrt{\left(\left(\cosh c\right) \bmod \left(\left(\sqrt[3]{\mathsf{log1p}\left(a\right)} \cdot \sqrt[3]{\mathsf{log1p}\left(a\right)}\right) \cdot \left(\sqrt[3]{\sqrt[3]{\mathsf{log1p}\left(a\right)} \cdot \sqrt[3]{\mathsf{log1p}\left(a\right)}} \cdot \sqrt[3]{\sqrt[3]{\mathsf{log1p}\left(a\right)}}\right)\right)\right)}double f(double a, double c) {
double r13724 = c;
double r13725 = cosh(r13724);
double r13726 = a;
double r13727 = log1p(r13726);
double r13728 = fmod(r13725, r13727);
return r13728;
}
double f(double a, double c) {
double r13729 = c;
double r13730 = cosh(r13729);
double r13731 = a;
double r13732 = log1p(r13731);
double r13733 = cbrt(r13732);
double r13734 = r13733 * r13733;
double r13735 = cbrt(r13734);
double r13736 = cbrt(r13733);
double r13737 = r13735 * r13736;
double r13738 = r13734 * r13737;
double r13739 = fmod(r13730, r13738);
double r13740 = sqrt(r13739);
double r13741 = r13740 * r13740;
return r13741;
}



Bits error versus a



Bits error versus c
Initial program 34.8
rmApplied add-cube-cbrt34.5
rmApplied add-cube-cbrt34.5
Applied cbrt-prod34.5
rmApplied add-sqr-sqrt34.5
Final simplification34.5
herbie shell --seed 2020034 +o rules:numerics
(FPCore (a c)
:name "Random Jason Timeout Test 004"
:precision binary64
(fmod (cosh c) (log1p a)))