Average Error: 5.6 → 0
Time: 5.4s
Precision: 64
\[e^{\log a + \log b}\]
↓
\[a \cdot b\]
e^{\log a + \log b}
↓
a \cdot b
double f(double a, double b) {
        double r7696842 = a;
        double r7696843 = log(r7696842);
        double r7696844 = b;
        double r7696845 = log(r7696844);
        double r7696846 = r7696843 + r7696845;
        double r7696847 = exp(r7696846);
        return r7696847;
}
↓
double f(double a, double b) {
        double r7696848 = a;
        double r7696849 = b;
        double r7696850 = r7696848 * r7696849;
        return r7696850;
}

Error

Bits error versus a

Bits error versus b

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original5.6
Target0
Herbie0
\[a \cdot b\]

Derivation

  1. Initial program 5.6

    \[e^{\log a + \log b}\]

  2. Simplified0

    \[\leadsto \color{blue}{b \cdot a}\]

  3. Final simplification0

    \[\leadsto a \cdot b\]

Reproduce

herbie shell --seed 2019200 
(FPCore (a b)
  :name "Exp of sum of logs"

  :herbie-target
  (* a b)

  (exp (+ (log a) (log b))))