\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 r360773 = c;
double r360774 = cosh(r360773);
double r360775 = a;
double r360776 = log1p(r360775);
double r360777 = fmod(r360774, r360776);
return r360777;
}
double f(double a, double c) {
double r360778 = c;
double r360779 = cosh(r360778);
double r360780 = a;
double r360781 = log1p(r360780);
double r360782 = fmod(r360779, r360781);
double r360783 = log(r360782);
double r360784 = cbrt(r360783);
double r360785 = r360784 * r360784;
double r360786 = exp(r360785);
double r360787 = r360785 * r360784;
double r360788 = cbrt(r360787);
double r360789 = pow(r360786, r360788);
return r360789;
}



Bits error versus a



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