\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 \log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}}\right)}^{\left(\sqrt[3]{\sqrt[3]{{\left(\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)}^{3}}}\right)}double f(double a, double c) {
double r13527 = c;
double r13528 = cosh(r13527);
double r13529 = a;
double r13530 = log1p(r13529);
double r13531 = fmod(r13528, r13530);
return r13531;
}
double f(double a, double c) {
double r13532 = c;
double r13533 = cosh(r13532);
double r13534 = a;
double r13535 = log1p(r13534);
double r13536 = fmod(r13533, r13535);
double r13537 = log(r13536);
double r13538 = r13537 * r13537;
double r13539 = cbrt(r13538);
double r13540 = exp(r13539);
double r13541 = cbrt(r13537);
double r13542 = r13541 * r13541;
double r13543 = r13542 * r13541;
double r13544 = 3.0;
double r13545 = pow(r13543, r13544);
double r13546 = cbrt(r13545);
double r13547 = cbrt(r13546);
double r13548 = pow(r13540, r13547);
return r13548;
}



Bits error versus a



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