Average Error: 34.4 → 34.4
Time: 13.6s
Precision: 64
\[\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\]
↓
\[{e}^{\left(\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\right)}\]
\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)
↓
{e}^{\left(\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\right)}
double code(double a, double c) {
	return fmod(cosh(c), log1p(a));
}
↓
double code(double a, double c) {
	return pow(((double) M_E), log(fmod(cosh(c), log1p(a))));
}

Error

Bits error versus a

Bits error versus c

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 34.4

    \[\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\]
  2. Using strategy rm

  3. Applied add-exp-log34.4

    \[\leadsto \color{blue}{e^{\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}}\]
  4. Using strategy rm

  5. Applied pow134.4

    \[\leadsto e^{\log \color{blue}{\left({\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}^{1}\right)}}\]

  6. Applied log-pow34.4

    \[\leadsto e^{\color{blue}{1 \cdot \log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}}\]

  7. Applied exp-prod34.4

    \[\leadsto \color{blue}{{\left(e^{1}\right)}^{\left(\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\right)}}\]

  8. Simplified34.4

    \[\leadsto {\color{blue}{e}}^{\left(\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\right)}\]

  9. Final simplification34.4

    \[\leadsto {e}^{\left(\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\right)}\]

Reproduce

herbie shell --seed 2020100 
(FPCore (a c)
  :name "Random Jason Timeout Test 004"
  :precision binary64
  (fmod (cosh c) (log1p a)))