Random Jason Timeout Test 004

Average Error: 34.3 → 34.3

Time: 13.2s

Precision: 64

• could not determine a ground truth for program body

  1. a = 1.611838088146848e+293
  2. c = -1.5548261699289447e+154

Math

\[\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\]

↓

\[e^{\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]{\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)}}}\]

C

double code(double a, double c) {
	return ((double) fmod(((double) cosh(c)), ((double) log1p(a))));
}

↓

double code(double a, double c) {
	return ((double) exp(((double) (((double) (((double) cbrt(((double) log(((double) fmod(((double) cosh(c)), ((double) log1p(a)))))))) * ((double) cbrt(((double) log(((double) fmod(((double) cosh(c)), ((double) log1p(a)))))))))) * ((double) cbrt(((double) (((double) (((double) cbrt(((double) log(((double) fmod(((double) cosh(c)), ((double) log1p(a)))))))) * ((double) cbrt(((double) log(((double) fmod(((double) cosh(c)), ((double) log1p(a)))))))))) * ((double) cbrt(((double) log(((double) fmod(((double) cosh(c)), ((double) log1p(a))))))))))))))));
}

Error

Bits error versus a

Bits error versus c

Derivation

1. Initial program 34.3

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

3. Applied add-exp-log 34.3

   \[\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 add-cube-cbrt 34.3

   \[\leadsto e^{\color{blue}{\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)}}}\]
6. Using strategy rm

7. Applied add-cube-cbrt 34.3

   \[\leadsto e^{\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]{\color{blue}{\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)}}}}\]

8. Final simplification 34.3

   \[\leadsto e^{\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]{\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)}}}\]

Reproduce

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