Random Jason Timeout Test 004

Average Error: 34.3 → 34.3

Time: 13.3s

Precision: 64

• could not determine a ground truth for program body

  1. a = -1.693185571362151e-83
  2. c = 6.49265952778414e+132

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 f(double a, double c) {
        double r8442 = c;
        double r8443 = cosh(r8442);
        double r8444 = a;
        double r8445 = log1p(r8444);
        double r8446 = fmod(r8443, r8445);
        return r8446;
}

↓

double f(double a, double c) {
        double r8447 = c;
        double r8448 = cosh(r8447);
        double r8449 = a;
        double r8450 = log1p(r8449);
        double r8451 = fmod(r8448, r8450);
        double r8452 = log(r8451);
        double r8453 = cbrt(r8452);
        double r8454 = r8453 * r8453;
        double r8455 = r8454 * r8453;
        double r8456 = cbrt(r8455);
        double r8457 = r8454 * r8456;
        double r8458 = exp(r8457);
        return r8458;
}

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 2020064 
(FPCore (a c)
  :name "Random Jason Timeout Test 004"
  :precision binary64
  (fmod (cosh c) (log1p a)))