\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 r365149 = c;
double r365150 = cosh(r365149);
double r365151 = a;
double r365152 = log1p(r365151);
double r365153 = fmod(r365150, r365152);
return r365153;
}
double f(double a, double c) {
double r365154 = c;
double r365155 = cosh(r365154);
double r365156 = a;
double r365157 = log1p(r365156);
double r365158 = fmod(r365155, r365157);
double r365159 = log(r365158);
double r365160 = cbrt(r365159);
double r365161 = r365160 * r365160;
double r365162 = exp(r365161);
double r365163 = r365161 * r365160;
double r365164 = cbrt(r365163);
double r365165 = pow(r365162, r365164);
return r365165;
}



Bits error versus a



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