\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\left(\left(\cosh c\right) \bmod \left(\left(\sqrt[3]{\mathsf{log1p}\left(a\right)} \cdot \left(\sqrt[3]{\sqrt[3]{\mathsf{log1p}\left(a\right)} \cdot \sqrt[3]{\mathsf{log1p}\left(a\right)}} \cdot \left(\sqrt[3]{\sqrt[3]{\sqrt[3]{\mathsf{log1p}\left(a\right)} \cdot \sqrt[3]{\mathsf{log1p}\left(a\right)}}} \cdot \sqrt[3]{\sqrt[3]{\sqrt[3]{\mathsf{log1p}\left(a\right)}}}\right)\right)\right) \cdot \sqrt[3]{\mathsf{log1p}\left(a\right)}\right)\right)double f(double a, double c) {
double r19609 = c;
double r19610 = cosh(r19609);
double r19611 = a;
double r19612 = log1p(r19611);
double r19613 = fmod(r19610, r19612);
return r19613;
}
double f(double a, double c) {
double r19614 = c;
double r19615 = cosh(r19614);
double r19616 = a;
double r19617 = log1p(r19616);
double r19618 = cbrt(r19617);
double r19619 = r19618 * r19618;
double r19620 = cbrt(r19619);
double r19621 = cbrt(r19620);
double r19622 = cbrt(r19618);
double r19623 = cbrt(r19622);
double r19624 = r19621 * r19623;
double r19625 = r19620 * r19624;
double r19626 = r19618 * r19625;
double r19627 = r19626 * r19618;
double r19628 = fmod(r19615, r19627);
return r19628;
}



Bits error versus a



Bits error versus c
Initial program 34.3
rmApplied add-cube-cbrt34.0
rmApplied add-cube-cbrt34.0
Applied cbrt-prod34.0
rmApplied add-cube-cbrt34.0
Applied cbrt-prod34.0
Applied cbrt-prod33.9
Final simplification33.9
herbie shell --seed 2019323 +o rules:numerics
(FPCore (a c)
:name "Random Jason Timeout Test 004"
:precision binary64
(fmod (cosh c) (log1p a)))