\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 \sqrt[3]{\mathsf{log1p}\left(a\right)}\right) \cdot \left(\left(\sqrt[3]{\sqrt[3]{\sqrt[3]{\sqrt[3]{\mathsf{log1p}\left(a\right)}}} \cdot \sqrt[3]{\sqrt[3]{\sqrt[3]{\mathsf{log1p}\left(a\right)}} \cdot \sqrt[3]{\sqrt[3]{\mathsf{log1p}\left(a\right)}}}} \cdot \sqrt[3]{\sqrt[3]{\sqrt[3]{\mathsf{log1p}\left(a\right)}} \cdot \sqrt[3]{\sqrt[3]{\mathsf{log1p}\left(a\right)}}}\right) \cdot \left(\sqrt[3]{\sqrt[3]{\mathsf{log1p}\left(a\right)}} \cdot \sqrt[3]{\sqrt[3]{\mathsf{log1p}\left(a\right)}}\right)\right)\right)\right)double f(double a, double c) {
double r1053643 = c;
double r1053644 = cosh(r1053643);
double r1053645 = a;
double r1053646 = log1p(r1053645);
double r1053647 = fmod(r1053644, r1053646);
return r1053647;
}
double f(double a, double c) {
double r1053648 = c;
double r1053649 = cosh(r1053648);
double r1053650 = a;
double r1053651 = log1p(r1053650);
double r1053652 = cbrt(r1053651);
double r1053653 = r1053652 * r1053652;
double r1053654 = cbrt(r1053652);
double r1053655 = cbrt(r1053654);
double r1053656 = r1053654 * r1053654;
double r1053657 = cbrt(r1053656);
double r1053658 = r1053655 * r1053657;
double r1053659 = cbrt(r1053658);
double r1053660 = r1053659 * r1053657;
double r1053661 = r1053660 * r1053656;
double r1053662 = r1053653 * r1053661;
double r1053663 = fmod(r1053649, r1053662);
return r1053663;
}



Bits error versus a



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