\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]{2 \cdot \log \left(\sqrt[3]{\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}\right) + \log \left(\sqrt[3]{\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}\right)}\right)}double f(double a, double c) {
double r15709 = c;
double r15710 = cosh(r15709);
double r15711 = a;
double r15712 = log1p(r15711);
double r15713 = fmod(r15710, r15712);
return r15713;
}
double f(double a, double c) {
double r15714 = c;
double r15715 = cosh(r15714);
double r15716 = a;
double r15717 = log1p(r15716);
double r15718 = fmod(r15715, r15717);
double r15719 = log(r15718);
double r15720 = cbrt(r15719);
double r15721 = r15720 * r15720;
double r15722 = exp(r15721);
double r15723 = 2.0;
double r15724 = cbrt(r15718);
double r15725 = log(r15724);
double r15726 = r15723 * r15725;
double r15727 = r15726 + r15725;
double r15728 = cbrt(r15727);
double r15729 = pow(r15722, r15728);
return r15729;
}



Bits error versus a



Bits error versus c
Initial program 33.4
rmApplied add-exp-log33.4
rmApplied add-cube-cbrt33.4
Applied exp-prod33.4
rmApplied add-cube-cbrt33.4
Applied log-prod33.4
Simplified33.4
Final simplification33.4
herbie shell --seed 2019212 +o rules:numerics
(FPCore (a c)
:name "Random Jason Timeout Test 004"
:precision binary64
(fmod (cosh c) (log1p a)))